A corrector-predictor path-following method for convex quadratic symmetric cone optimization
From MaRDI portal
Publication:2260663
DOI10.1007/s10957-014-0554-2zbMath1307.90131MaRDI QIDQ2260663
Publication date: 11 March 2015
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-014-0554-2
interior-point method; polynomial complexity; convex quadratic symmetric cone optimization; corrector-predictor method
Related Items
Corrector-predictor interior-point method with new search direction for semidefinite optimization, A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function, Derivatives of eigenvalues and Jordan frames, An infeasible full-NT step interior point algorithm for CQSCO, A corrector-predictor interior-point method with new search direction for linear optimization, A new corrector-predictor interior-point method for symmetric cone optimization, A corrector–predictor path-following method for second-order cone optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Corrector-predictor methods for sufficient linear complementarity problems
- A full-Newton step interior-point algorithm for symmetric cone convex quadratic optimization
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Similarity and other spectral relations for symmetric cones
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem
- Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
- Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
