Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones
From MaRDI portal
Publication:1937004
DOI10.1007/s10957-012-0018-5zbMath1268.90128OpenAlexW1989801777MaRDI QIDQ1937004
Xinze Liu, Hong-Wei Liu, Chang-He Liu
Publication date: 11 February 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0018-5
interior-point methodspolynomial complexitysymmetric conesecond-order methodsEuclidean Jordan algebraMehrotra-type algorithm
Related Items
An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path, An O(r(cond(G))1/4log¼ϵ−1) iteration predictor–corrector interior-point method with a new one-norm neighbourhood for symmetric cone optimization, A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming, A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones, A primal–dual predictor–corrector interior-point method for symmetric cone programming with O(√r log ϵ−1) iteration complexity, Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions, A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization, A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming, A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming, A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy, Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions, A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming, Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization, A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization, A Predictor–Corrector Algorithm for Monotone Linear Complementarity Problems in a Wide Neighborhood, A new second-order Mehrotra-type predictor-corrector algorithm for SDO, A corrector-predictor arc search interior-point algorithm for symmetric optimization, Polynomial convergence of Mehrotra-type predictor–corrector algorithm for the CartesianP∗(κ)-LCP over symmetric cones
Cites Work
- Unnamed Item
- Unnamed Item
- Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- The \(Q\) method for symmetric cone programming
- Polynomial time second order mehrotra-type predictor--corrector algorithms
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- On Mehrotra-Type Predictor-Corrector Algorithms
- On the complexity analysis of a Mehrotra-type primal–dual feasible algorithm for semidefinite optimization
- On the Implementation of a Primal-Dual Interior Point Method
- Barrier Functions in Interior Point Methods
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
- An Interior-Point Method for Semidefinite Programming
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- An Infeasible Interior Point Method for Linear Complementarity Problems over Symmetric Cones
