New complexity analysis of full Nesterov-Todd step infeasible interior point method for second-order cone optimization
From MaRDI portal
Publication:4987772
Recommendations
- A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization
- scientific article; zbMATH DE number 6285133
- Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- Simplified analysis of a full Nesterov-Todd step infeasible interior-point method for symmetric optimization
Cites work
- A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem
- A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization
- A full NT-step infeasible interior-point algorithm for semidefinite optimization based on a self-regular proximity
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- A primal-dual infeasible-interior-point algorithm for linear programming
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- Extension of primal-dual interior point algorithms to symmetric cones
- Feasibility issues in a primal-dual interior-point method for linear programming
- Full-NT step infeasible interior-point method for SOCO based on a specific kernel function
- Geometric means on symmetric cones
- scientific article; zbMATH DE number 1017028 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (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 the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- Polynomiality of infeasible-interior-point algorithms for linear programming
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step
- SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
Cited in
(8)- A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization
- An infeasible full NT-step interior point method for circular optimization
- A new infeasible interior-point method based on a non-coercive kernel function with improved centering steps for second-order cone optimization
- Simplified analysis of a full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization
- Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization
- scientific article; zbMATH DE number 6285133 (Why is no real title available?)
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
This page was built for publication: New complexity analysis of full Nesterov-Todd step infeasible interior point method for second-order cone optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4987772)
