A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
From MaRDI portal
Publication:905304
DOI10.1016/j.amc.2013.06.064zbMath1329.90169OpenAlexW2170172991MaRDI QIDQ905304
Kok Lay Teo, Chang Jun Yu, Guo-Qiang Wang
Publication date: 19 January 2016
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2013.06.064
Euclidean Jordan algebrasinterior-point methodspolynomial complexityconvex quadratic optimizationsmall-update method
Related Items
An infeasible full NT-step interior point method for circular optimization, Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function, 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 method for weighted projections to the positive definite cone, Derivatives of eigenvalues and Jordan frames, A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints, A New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization, Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone, A wide neighborhood interior-point algorithm for convex quadratic semidefinite optimization, A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy, An adaptive infeasible interior-point algorithm with full Nesterov-Todd step 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, An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones, A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization, Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones, A new projected Barzilai-Borwein method for the symmetric cone complementarity problem, An infeasible full-NT step interior point algorithm for CQSCO, A long-step interior-point algorithm for symmetric cone Cartesian P*(κ)-HLCP, An extension for identifying search directions for interior-point methods in linear optimization, A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization, Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming, A primal-dual interior-point algorithm for symmetric cone convex quadratic programming based on the commutative class directions, Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new primal-dual path-following method for convex quadratic programming
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- Handbook on semidefinite, conic and polynomial optimization
- A full-Newton step interior-point algorithm for symmetric cone convex quadratic optimization
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
- An inexact primal-dual path following algorithm for convex quadratic SDP
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Second-order cone programming
- Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
- Similarity and other spectral relations for symmetric cones
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- On a commutative class of search directions for linear programming over symmetric cones
- Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- Generalization of primal-dual interior-point methods to convex optimization problems in conic form
- A Jordan-algebraic approach to potential-reduction algorithms
- A predictor--corrector algorithm for QSDP combining Dikin-type and Newton centering steps
