MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  On extending primal-dual interior-point algorithms from linear programming to semidefinite programming (1995) [52 citations — 0 self]

Download:
Download as a PDF | Download as a PS
by Yin Zhang
ftp://math.umbc.edu/pub/technical/tr95-20.ps
Add To MetaCart

Abstract:

This work concerns primal-dual interior-point methods for semidefinite programming (SDP) that use a linearized complementarity equation originally proposed by Kojima, Shindoh and Hara [11], and recently rediscovered by Monteiro [15] in a more explicit form. In analyzing these methods, a number of basic equalities and inequalities were developed in [11] and also in [15] through different means and in different forms. In this paper, we give a very short derivation of the key equalities and inequalities along the exact line used in linear programming (LP), producing basic relationships that have highly compact forms almost identical to their counterparts in LP. We also introduce a new definition of the central path and variable-metric measures of centrality. These results provide convenient tools for extending existing polynomiality results for many, if not most, algorithms from LP to SDP with little complication. We present examples of such extensions, including the long-step infeasible-interior-point algorithm of Zhang [23] extended to SDP for the first time. Keywords: Semidefinite programming, Primal-Dual methods, basic equalities and inequalities

Citations

1889 Matrix Analysis – Horn, Johnson - 1985
405 Interior point methods in semidefinite programming with applications to combinatorial optimization – Alizadeh - 1995
177 An interior-point method for semidefinite programming – HELMBERG, RENDL, et al. - 1996
175 On the implementation of a (primal-dual) interior point method – Mehrotra - 1992
150 Primal-dual interior-point methods for self-scaled cones – NESTEROV, TODD - 1998
86 A primal-dual potential reduction method for problems involving matrix inequalities – Vandenberghe, Boyd - 1995
78 Complementarity and nondegeneracy in semidefinite programming – Alizadeh, Haeberly, et al. - 1997
68 Linear Matrix Inequalities in System and Control Theory – Boyd, Ghaoui, et al. - 1994
60 On minimizing the maximum eigenvalue of a symmetric matrix – Overton - 1988
60 Large-scale optimization of eigenvalues – Overton - 1992
55 Interior-point methods for the monotone linear complementarityproblem in symmetric matrices – Kom, SHINDOH, et al. - 1994
47 An interior-point method for minimizing the maximum eigenvalue of a linear combination of matrices – JARRE - 1993
47 On the convergence of a class of infeasible interior-point methods for the horizontal linear complementarity problem – Zhang - 1994
43 A primal-dual infeasible-interiorpoint algorithm for linear programming – Kojima, Megiddo, et al. - 1993
37 On adaptive step primal--dual interior--point algorithms for linear programming – Mizuno, Todd, et al. - 1993
30 A primal-dual interior point method for linear programming – Kojima, Mizuno, et al. - 1989
23 Interior point methods for max-min eigenvalue problems – Rendl, Vanderbei, et al. - 1993
21 On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms – Zhang, Zhang - 1995
16 Positive Definite Programming – Vandenberghe, Boyd - 1994
9 Reduction of monotone linear complementarity problems over cones to linear programs over cones – Kojima, Shida, et al. - 1995
9 Primal-dual algorithms for semidefinite programming – Monteiro - 1995
4 Private communication – Kojima - 1996
View or Download | Add to My Collection | Correct Errors