Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization
From MaRDI portal
Publication:493059
DOI10.1007/s10957-014-0696-2zbMath1336.90059OpenAlexW2079197798MaRDI QIDQ493059
Lingchen Kong, Jiyuan Tao, Guo-Qiang Wang, Goran Lešaja
Publication date: 11 September 2015
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-014-0696-2
Euclidean Jordan algebrasinterior-point methodspolynomial complexityfull Nesterov-Todd steplinear optimization over symmetric cones
Related Items (12)
A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization ⋮ An infeasible full NT-step interior point method for circular optimization ⋮ A note on an inequality involving Jordan product in Euclidean Jordan algebras ⋮ A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP ⋮ A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming ⋮ A New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization ⋮ Erratum to: ``Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization ⋮ A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy ⋮ Corrector-predictor interior-point method with new search direction for semidefinite optimization ⋮ Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions ⋮ Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence ⋮ Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- A full-Newton step interior-point algorithm based on modified Newton direction
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- Handbook on semidefinite, conic and polynomial optimization
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- Improved full-Newton step \(O(nL)\) infeasible interior-point method for linear optimization
- Some inertia theorems in Euclidean Jordan algebras
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Second-order cone programming
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- On a commutative class of search directions for linear programming over symmetric cones
- Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization
- Interior-point methods based on kernel functions for symmetric optimization
- A predictor-corrector path-following algorithm for symmetric optimization based on Darvay's technique
- A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
- Barrier Functions in Interior Point Methods
- 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
- Conic convex programming and self-dual embedding
- Full Nesterov–Todd step feasible interior-point method for the CartesianP*(κ)-SCLCP
- 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
This page was built for publication: Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization
