Computational Optimization and Applications
A Note on the Calculation of Step-Lengths in Interior-Point Methods for Semidefinite Programming
Computational Optimization and Applications
On a commutative class of search directions for linear programming over symmetric cones
Journal of Optimization Theory and Applications
On Copositive Programming and Standard Quadratic Optimization Problems
Journal of Global Optimization
Applied Numerical Mathematics - Developments and trends in iterative methods for large systems of equations—in memoriam Rüdiger Weiss
Computational Experience with Ill-Posed Problems in Semidefinite Programming
Computational Optimization and Applications
Semidefinite programming for discrete optimization and matrix completion problems
Discrete Applied Mathematics
SDPARA: semiDefinite programming algorithm paRAllel version
Parallel Computing
Convergence Analysis of an Inexact Infeasible Interior Point Method for Semidefinite Programming
Computational Optimization and Applications
Solving semidefinite programming problems via alternating direction methods
Journal of Computational and Applied Mathematics
A conversion of an SDP having free variables into the standard form SDP
Computational Optimization and Applications
Optimization Methods & Software
Limiting behavior of the Alizadeh-Haeberly-Overton weighted paths in semidefinite programming
Optimization Methods & Software
On the long-step path-following method for semidefinite programming
Operations Research Letters
ACM Transactions on Mathematical Software (TOMS)
High-performance general solver for extremely large-scale semidefinite programming problems
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
A trust region method for solving semidefinite programs
Computational Optimization and Applications
A homotopy method for nonlinear semidefinite programming
Computational Optimization and Applications
Journal of Computational and Applied Mathematics
Hi-index | 0.03 |
This paper deals with a class of primal--dual interior-point algorithms for semidefinite programming (SDP) which was recently introduced by Kojima, Shindoh, and Hara [SIAM J. Optim., 7 (1997), pp. 86--125]. These authors proposed a family of primal-dual search directions that generalizes the one used in algorithms for linear programming based on the scaling matrix X1/2S-1/2. They study three primal--dual algorithms based on this family of search directions: a short-step path-following method, a feasible potential-reduction method, and an infeasible potential-reduction method. However, they were not able to provide an algorithm which generalizes the long-step path-following algorithm introduced by Kojima, Mizuno, and Yoshise [Progress in Mathematical Programming: Interior Point and Related Methods, N. Megiddor, ed., Springer-Verlag, Berlin, New York, 1989, pp. 29--47]. In this paper, we characterize two search directions within their family as being (unique) solutions of systems of linear equations in symmetric variables. Based on this characterization, we present a simplified polynomial convergence proof for one of their short-step path-following algorithms and, for the first time, a polynomially convergent long-step path-following algorithm for SDP which requires an extra $\sqrt{n}$ factor in its iteration-complexity order as compared to its linear programming counterpart, where n is the number of rows (or columns) of the matrices involved.