A primal-dual interior-point algorithm for symmetric cone convex quadratic programming based on the commutative class directions
DOI10.1007/s10255-018-0789-zzbMath1418.90260OpenAlexW2945112352WikidataQ127879286 ScholiaQ127879286MaRDI QIDQ2316302
Publication date: 26 July 2019
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-018-0789-z
interior-point methodcomplexity boundwide neighborhoodcommutative class directionssymmetric cone convex quadratic programming
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Cites Work
- Unnamed Item
- Unnamed Item
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
- 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 new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
- Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
- An inexact primal-dual path following algorithm for convex quadratic SDP
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization
- Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization
- Barrier Functions in Interior Point Methods
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- 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
This page was built for publication: A primal-dual interior-point algorithm for symmetric cone convex quadratic programming based on the commutative class directions