# Interior Point Trajectories in Semidefinite Programming

@article{Goldfarb1998InteriorPT,
title={Interior Point Trajectories in Semidefinite Programming},
author={Donald Goldfarb and Katya Scheinberg},
journal={SIAM J. Optim.},
year={1998},
volume={8},
pages={871-886}
}
• Published 1 April 1998
• Mathematics
• SIAM J. Optim.
In this paper we study interior point trajectories in semidefinite programming (SDP) including the central path of an SDP. This work was inspired by the seminal work of Megiddo on linear programming trajectories [ Progress in Math. Programming: Interior-Point Algorithms and Related Methods, N. Megiddo, ed., Springer-Verlag, Berlin, 1989, pp. 131--158]. Under an assumption of primal and dual strict feasibility, we show that the primal and dual central paths exist and converge to the analytic…
89 Citations
THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS
• Mathematics
• 2002
Abstract In this paper we study the welldefinedness of the central path associated to a nonlinear convex semidefinite programming problem with smooth objective and constraint functions. Under
On primal-dual path-following algorithms in semidefinite programming.
• Mathematics, Computer Science
• 1998
A weaker condition for a feasible full Newton step is established, and quadratic convergence to target points on the central path is shown, and it is shown how to compute large dynamic target updates which still allow full Newton steps.
Continuous methods for convex programming and convex semidefinite programming
The optimality and convergence of both interior point continuous trajectories are obtained for any interior feasible point under some mild conditions, and the convergence does not require the strict complementarity or the analyticity of the objective function.
On Two Interior-Point Mappings for Nonlinear Semidefinite Complementarity Problems
• Mathematics
Math. Oper. Res.
• 1998
Extending our previous work Monteiro and Pang 1996, this paper studies properties of two fundamental mappings associated with the family of interior-point methods for solving monotone nonlinear
Primal-Dual Affine-Scaling Algorithms Fail for Semidefinite Programming
• Mathematics
Math. Oper. Res.
• 1999
It is shown that the primal-dual affine-scaling algorithm using the NT direction for the same semidefinite programming problem always generates a sequence converging to the optimal solution.
On the central path for nonlinear semidefinite programming
• Mathematics
RAIRO Oper. Res.
• 2000
The well definedness of the central path associated to a given nonlinear (convex) semidefinite programming problem is studied and the existence and optimality of cluster points are established.
Primal-Dual Path-Following Algorithms for Semidefinite Programming
Two search directions within their family are characterized as being (unique) solutions of systems of linear equations in symmetric variables 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.
An Interior-Point Perspective on Sensitivity Analysis in Semidefinite Programming
We study the asymptotic behavior of the interior-point bounds arising from the work of Yildirim and Todd on sensitivity analysis in semidefinite programming in comparison with the optimal partition
On sensitivity of central solutions in semidefinite programming
• Mathematics
Math. Program.
• 2001
The properties of the analytic central path of a semidefinite programming problem under perturbation of the right hand side of the constraints, including the limiting behavior when the central optimal solution, namely the analytic center of the optimal set, is approached are studied.
On Polynomial-time Path-following Interior-point Methods with Local Superlinear Convergence
Interior-point methods provide one of the most popular ways of solving convex optimization problems. Two advantages of modern interior-point methods over other approaches are: (i) robust global

## References

SHOWING 1-10 OF 34 REFERENCES
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
It is argued that many known interior point methods for linear programs can be transformed in a mechanical way to algorithms for SDP with proofs of convergence and polynomial time complexity carrying over in a similar fashion.
Primal-Dual Path-Following Algorithms for Semidefinite Programming
Two search directions within their family are characterized as being (unique) solutions of systems of linear equations in symmetric variables 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.
Superlinear Convergence of Interior-Point Algorithms for Semidefinite Programming
• Mathematics
• 1998
We prove the superlinear convergence of the primal-dual infeasible interior-point path-following algorithm proposed recently by Kojima, Shida, and Shindoh and by the present authors, under two
Primal-Dual Interior-Point Methods for Self-Scaled Cones
• Mathematics
SIAM J. Optim.
• 1998
This paper presents efficiency estimates for several symmetric primal-dual methods that can loosely be classified as path-following methods for convex programming problems expressed in conic form when the cone and its associated barrier are self-scaled.
On Extending Some Primal-Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
A concise derivation of the key equalities and inequalities for complexity analysis along the exact line used in linear programming (LP) is given, producing basic relationships that have compact forms almost identical to their counterparts in LP.
Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
• Mathematics
SIAM J. Optim.
• 1998
This paper establishes the superlinear convergence of a symmetric primal-dual path following algorithm for semidefinite programming (SDP) under the assumptions that the semidefinite program has a
Local convergence of predictor—corrector infeasible-interior-point algorithms for SDPs and SDLCPs
• Mathematics
Math. Program.
• 1998
An example of an SDP exhibits a substantial difficulty in proving the superlinear convergence of a direct extension of the Mizuno—Todd—Ye type predictor—corrector primal-dual interior-point method, and suggests that the authors need to force the generated sequence to converge to a solution tangentially to the central path (or trajectory).
Existence of Interior Points and Interior Paths in Nonlinear Monotone Complementarity Problems
The interior paths are bounded, continuous, and all the limit points of the paths are solutions to the complementarity problem, and it is proved that certain sets, including the solution set to the complementary problem, form a compact convex set.
Limiting behavior of the affine scaling continuous trajectories for linear programming problems
• Mathematics
Math. Program.
• 1991
This work considers the continuous trajectories of the vector field induced by the primal affine scaling algorithm as applied to linear programming problems in standard form and shows that these trajectories tend to an optimal solution which in general depends on the starting point.
Self-Scaled Cones and Interior-Point Methods in Nonlinear Programming
• Mathematics
• 1994
This paper provides a theoretical foundation for efficient interior-point algorithms for nonlinear programming problems expressed in conic form, when the cone and its associated barrier are