Limiting behavior of the central path in semidefinite optimization

DOI10.1080/10556780410001727718MaRDI QIDQ5312757zbMATH OpenOpenAlexFDO

Authors Margaréta Halická, E. de Klerk, C. Roos

Publication date 25 August 2005

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://research.tilburguniversity.edu/en/publications/82985463-0467-4c61-8be1-1f259035c0f3

zbMATH Keywords

analytic centercentral pathinterior-point methodlinear optimizationsemidefinite optimization

Mathematics Subject Classification ID

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

Recommendations

• On the Convergence of the Central Path in Semidefinite Optimization
• Analyticity of the central path at the boundary point in semidefinite programming
• Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming
• On sensitivity of central solutions in semidefinite programming
• THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS

Cites work

• A simple characterization of solutions sets of convex programs
• An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
• Analyticity of the central path at the boundary point in semidefinite programming
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• Initialization in semidefinite programming via a self-dual skew-symmetric embedding
• Logarithmic SUMT limits in convex programming
• On the existence and convergence of the central path for convex programming and some duality results
• Semidefinite Programming
• THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS

Cited in

(16)

• Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds
• On the convergence of the entropy-exponential penalty trajectories and generalized proximal point methods in semidefinite optimization
• On the central paths in symmetric cone programming
• Asymptotic behavior of the central path for a special class of degenerate SDP problems
• On the central paths and Cauchy trajectories in semidefinite programming
• \(LDL^T\) direction interior point method for semidefinite programming
• On the Convergence of the Central Path in Semidefinite Optimization
• Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming
• On the central path of semidefinite optimization: degree and worst-case convergence rate
• On the complexity of analyticity in semi-definite optimization
• Second-order cone programming for frictional contact mechanics using interior point algorithm
• An alternative polynomial-sized formulation and an optimization based heuristic for the reviewer assignment problem
• Path-based DEA models in multiplier form and returns-to-scale analysis
• On a special class of regularized central paths for semidefinite programs
• Interior proximal methods and central paths for convex second-order cone programming
• An inexact primal-dual path following algorithm for convex quadratic SDP

This page was built for publication: Limiting behavior of the central path in semidefinite optimization

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