Semidefinite and Second-Order Cone Programming
Semidefinite programming (SDP) is a branch of convex programming (CP) that has been a subject of intensive research since the early 1990’s –. The continued interest in SDP has been motivated mainly by two reasons. First, many important classes of optimization problems such as linear-programming (LP) and convex quadratic-programming (QP) problems can be viewed as SDP problems, and many CP problems of practical usefulness that are neither LP nor QP problems can also be formulated as SDP problems. Second, several interior-point methods that have proven efficient for LP and convex QP problems have been extended to SDP in recent years.
KeywordsLinear Matrix Inequality Convex Cone Central Path Convex Programming Problem SOCP Problem
Unable to display preview. Download preview PDF.
- 1.F. Alizadeh, Combinational Optimization with Interior Point Methods and Semidefinite Matrices, Ph.D. thesis, University of Minnesota, Oct. 1991.Google Scholar
- 4.A. Nemirovski and P. Gahinet, “The projective method for solving linear matrix inequalities,” in Proc. American Control Conference, pp. 840–844, Baltimore, MD., June 1994.Google Scholar