A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization
From MaRDI portal
Publication:1660297
DOI10.1007/s40305-017-0168-0zbMath1413.90203OpenAlexW2618653739MaRDI QIDQ1660297
Publication date: 15 August 2018
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-017-0168-0
primal-dual methodpolynomial complexityinfeasible interior-point methodsecond-order cone optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization
- A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- Feasibility issues in a primal-dual interior-point method for linear programming
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
- A primal-dual infeasible-interior-point algorithm for linear programming
- Polynomiality of infeasible-interior-point algorithms for linear programming
- Extension of primal-dual interior point algorithms to symmetric cones
- Second-order cone programming
- Similarity and other spectral relations for symmetric cones
- Geometric means on symmetric cones
- An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
- A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming
- An Improved and Simplified Full-Newton Step $O(n)$ Infeasible Interior-Point Method for Linear Optimization
- A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- A Jordan-algebraic approach to potential-reduction algorithms
