THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS

DOI10.1080/02331930290019396zbMATH Open1024.90061OpenAlexW1969707050MaRDI QIDQ4548041FDOQ4548041

Authors: L. M. Graña Drummond, Ya'acov 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

Recommendations

• On the central path for nonlinear semidefinite programming
• On the central paths and Cauchy trajectories in semidefinite programming
• On well definedness of the central path
• Welldefinedness and limiting behavior of the central path
• Analyticity of the central path at the boundary point in semidefinite programming

zbMATH Keywords

convergenceconvex programmingcentral pathlogarithmic barrier functioncluster pointsprimal-dual trajectorynonlinear convex semidefinite programming

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (20)

• Asymptotic behavior of the central path for a special class of degenerate SDP problems
• On a special class of regularized central paths for semidefinite programs
• Condition-measure bounds on the behavior of the central trajectory of a semidefinite program
• Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds
• Interior proximal methods and central paths for convex second-order cone programming
• On the central paths and Cauchy trajectories in 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 the central path of semidefinite optimization: degree and worst-case convergence rate
• Penalty and barrier methods for convex semidefinite programming
• On the central paths in symmetric cone programming
• Welldefinedness and limiting behavior of the central path
• Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming
• On the Convergence of the Central Path in Semidefinite Optimization
• On the existence and convergence of the central path for convex programming and some duality results
• On some properties and an application of the logarithmic barrier method
• Improved effective Łojasiewicz inequality and applications
• Convergence analysis of four interior point continuous trajectories for convex semidefinite programming
• Limiting behavior of the central path in semidefinite optimization
• On the central path for nonlinear semidefinite programming
• Dynamical system characterization of the central path and its variants -- a revisit

This page was built for publication: THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4548041)