A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization
From MaRDI portal
Publication:378264
DOI10.1007/s10957-013-0278-8zbMath1274.90496OpenAlexW2022488470MaRDI QIDQ378264
Publication date: 11 November 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-013-0278-8
polynomial complexityJordan algebrainfeasible interior-point methodfeasible interior-point methodsecond-order conic optimization
Related Items
An infeasible interior-point algorithm for linear optimization over Cartesian symmetric cones, 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, A Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs, A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming, A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization, Two wide neighborhood interior-point methods for symmetric cone optimization, An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization, A class of new search directions for full-NT step feasible interior point method in semidefinite optimization, A primal-dual interior-point method for optimal grasping manipulation of multi-fingered hand-arm robots, A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones, Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization, A full Nesterov–Todd step infeasible-interior-point algorithm for CartesianP*(κ) horizontal linear complementarity problems over symmetric cones, A New Infeasible Interior-Point Method Based on a Non-Coercive Kernel Function with Improved Centering Steps for Second-Order Cone Optimization, A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function, New complexity analysis of full Nesterov-Todd step infeasible interior point method for second-order cone optimization, A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity, Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization, Primal-dual interior-point algorithms for convex quadratic circular cone optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
- Applications of second-order cone programming
- The Minnesota notes on Jordan algebras and their applications. Edited and annotated by Aloys Krieg and Sebastian Walcher
- A primal-dual infeasible-interior-point algorithm for linear programming
- Polynomiality of infeasible-interior-point algorithms for linear programming
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Second-order cone programming
- A taste of Jordan algebras
- Similarity and other spectral relations for symmetric cones
- Geometric means on symmetric cones
- On a general class of interior-point algorithms for semidefinite programming with polynomial complexity and superlinear convergence
- Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
- A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
- Self-regular functions and new search directions for linear and semidefinite optimization
- An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
- Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
- 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
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- On homogeneous interrior-point algorithms for semidefinite programming
- A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming
- An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
- An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization
- On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
- SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- Handbook of semidefinite programming. Theory, algorithms, and applications
