ISSN:
1573-2878
Keywords:
Convex programming
;
semidefinite programming
;
linear matrix inequalities
;
linear programming
;
constraint-aggregation method
;
minimum-penalty path
;
exterior path-following methods
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract A semidefinite programming problem is a mathematical program in which the objective function is linear in the unknowns and the constraint set is defined by a linear matrix inequality. This problem is nonlinear, nondifferentiable but convex. It covers several standard problems, such as linear and quadratic programming, and has many applications in engineering. In this paper, we introduce the notion of minimal-penalty path, which is defined as the collection of minimizers for a family of convex optimization problems, and propose two methods for solving the problem by following the minimal-penalty path from the exterior of the feasible set. Our first method, which is also a constraint-aggregation method, achieves the solution by solving a sequence of linear programs, but exhibits a zigzagging behavior around the minimal-penalty path. Our second method eliminates the above drawback by following efficiently the minimum-penalty path through the centering and ascending steps. The global convergence of the methods is proved and their performance is illustrated by means of an example.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1021782202975
Permalink
