THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS

DOI10.1080/02331930290019396zbMath1024.90061OpenAlexW1969707050MaRDI QIDQ4548041

L. M. Graña Drummond, Yaa'cov Peterzil

Publication date: 4 November 2002

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930290019396

zbMATH Keywords

convergenceconvex programminglogarithmic barrier functioncentral pathcluster pointsprimal-dual trajectorynonlinear convex semidefinite programming

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Methods of successive quadratic programming type (90C55)

Related Items

Limiting behavior of the central path in semidefinite optimization ⋮ Unnamed Item ⋮ Penalty and barrier methods for convex semidefinite programming ⋮ Complexity of the primal–dual path-following algorithms for the weighted determinant maximization problems with linear matrix inequalities in the narrow neighbourhood ⋮ On some properties and an application of the logarithmic barrier method ⋮ Asymptotic behavior of the central path for a special class of degenerate SDP problems ⋮ Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming ⋮ Interior proximal methods and central paths for convex second-order cone programming ⋮ Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds ⋮ On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate

Cites Work

• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Interior path following primal-dual algorithms. I: Linear programming
• A unified approach to interior point algorithms for linear complementary problems
• On the real exponential field with restricted analytic functions
• The elementary theory of restricted analytic fields with exponentiation
• On the existence and convergence of the central path for convex programming and some duality results
• Geometric categories and o-minimal structures
• Welldefinedness and limiting behavior of the central path
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• Boundary Behavior of Interior Point Algorithms in Linear Programming
• Interior Point Trajectories in Semidefinite Programming
• Central Paths, Generalized Proximal Point Methods, and Cauchy Trajectories in Riemannian Manifolds
• On the central path for nonlinear semidefinite programming
• Second Derivatives for Optimizing Eigenvalues of Symmetric Matrices
• On Eigenvalue Optimization
• Convex Analysis
• Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems