On the central paths in symmetric cone programming
From MaRDI portal
Publication:2359786
Recommendations
- THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS
- On the central paths and Cauchy trajectories in semidefinite programming
- On the existence and convergence of the central path for convex programming and some duality results
- Welldefinedness and limiting behavior of the central path
- On the central path for nonlinear semidefinite programming
Cites work
- A new barrier for a class of semidefinite problems
- A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming
- Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
- Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds
- Commutation principle for variational problems on Euclidean Jordan algebras
- Convex Analysis
- Convex Analysis of Spectrally Defined Matrix Functions
- Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras
- Convexity of symmetric cone trace functions in Euclidean Jordan algebras
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- scientific article; zbMATH DE number 1182578 (Why is no real title available?)
- scientific article; zbMATH DE number 1821400 (Why is no real title available?)
- Limiting behavior of the central path in semidefinite optimization
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- On the central paths and Cauchy trajectories in semidefinite programming
- On the Convergence of the Central Path in Semidefinite Optimization
- On the identification of the optimal partition of second order cone optimization problems
- Perturbation analysis of second-order cone programming problems
- Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Variational inequalities over the cone of semidefinite positive symmetric matrices and over the Lorentz cone
Cited in
(9)- On the existence and convergence of the central path for convex programming and some duality results
- Welldefinedness and limiting behavior of the central path
- Asymptotic behavior of the central path for a special class of degenerate SDP problems
- On the Convergence of the Central Path in Semidefinite Optimization
- Solving conic optimization problems via self-dual embedding and facial reduction: A unified approach
- Existence, uniqueness, and convergence of the regularized primal-dual central path
- On the volumetric path
- Strong global convergence properties of algorithms for nonlinear symmetric cone programming
- On a special class of regularized central paths for semidefinite programs
This page was built for publication: On the central paths in symmetric cone programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2359786)