A long-step primal-dual path-following method for semidefinite programming

DOI10.1016/S0167-6377(98)00018-2zbMath0957.90103MaRDI QIDQ1306474

Jian-Min Jiang

Publication date: 4 October 1999

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

semidefinite programminglogarithmic barrier functionproximity measureprimal-dual interior point methods

Mathematics Subject Classification ID

Semidefinite programming (90C22) Interior-point methods (90C51)

Related Items

Corrector-predictor interior-point method with new search direction for semidefinite optimization, Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions

Cites Work

• A long-step barrier method for convex quadratic programming
• A polynomial method of approximate centers for linear programming
• Symmetric primal-dual path-following algorithms for semidefinite programming
• Primal-dual algorithms for linear programming based on the logarithmic barrier method
• Complementarity and nondegeneracy in semidefinite programming
• A primal-dual potential reduction method for problems involving matrix inequalities
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
• Method of approximate centers for semi-definite programming
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• On a Matrix Generalization of Affine-Scaling Vector Fields
• Semidefinite Programming
• An Interior-Point Method for Semidefinite Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item