Limiting behavior of the central path in semidefinite optimization
From MaRDI portal
Publication:5312757
DOI10.1080/10556780410001727718zbMath1087.90057OpenAlexW2094584490MaRDI QIDQ5312757
Margaréta Halická, Etienne de Klerk, Cornelis Roos
Publication date: 25 August 2005
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://research.tilburguniversity.edu/en/publications/82985463-0467-4c61-8be1-1f259035c0f3
Related Items
On the central paths in symmetric cone programming, $LDL^T$ Direction Interior Point Method for Semidefinite Programming, An alternative polynomial-sized formulation and an optimization based heuristic for the reviewer assignment problem, Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming, Interior proximal methods and central paths for convex second-order cone programming, An inexact primal-dual path following algorithm for convex quadratic SDP, 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 Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate
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
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding
- On the existence and convergence of the central path for convex programming and some duality results
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Analyticity of the central path at the boundary point in semidefinite programming
- THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS
- Semidefinite Programming
- Logarithmic SUMT limits in convex programming
