A corrector-predictor path-following method for convex quadratic symmetric cone optimization
From MaRDI portal
Publication:2260663
Recommendations
- A predictor-corrector path-following algorithm for symmetric optimization based on Darvay's technique
- A corrector-predictor arc search interior-point algorithm for symmetric optimization
- A corrector-predictor path-following method for second-order cone optimization
- A new corrector-predictor algorithm for convex quadratic semidefinite optimization
- A primal-dual predictor-corrector interior-point method for symmetric cone programming with \(O (\sqrt{r} \log \epsilon^{-1})\) iteration complexity
Cites work
- A full-Newton step interior-point algorithm for symmetric cone convex quadratic optimization
- 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
- A new predictor-collector algorithm for linear programming
- A polynomial-time inexact interior-point method for convex quadratic symmetric cone programming
- A predictor-corrector algorithm for linearly constrained convex optimization
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones.
- Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
- Corrector-predictor methods for sufficient linear complementarity problems
- Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
- Extension of primal-dual interior point algorithms to symmetric cones
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- New interior point algorithms in linear programming
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Similarity and other spectral relations for symmetric cones
Cited in
(10)- A corrector-predictor interior-point method with new search direction for linear optimization
- A corrector-predictor arc search interior-point algorithm for symmetric optimization
- A new corrector-predictor interior-point method for symmetric cone optimization
- A corrector-predictor path-following method for second-order cone optimization
- A predictor-corrector path-following algorithm for symmetric optimization based on Darvay's technique
- Derivatives of eigenvalues and Jordan frames
- An infeasible full-NT step interior point algorithm for CQSCO
- A Predictor-Corrector Path-Following Algorithm for Dual-Degenerate Parametric Optimization Problems
- A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function
- Corrector-predictor interior-point method with new search direction for semidefinite optimization
This page was built for publication: A corrector-predictor path-following method for convex quadratic symmetric cone optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2260663)
