Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization
From MaRDI portal
Publication:2841915
DOI10.1080/01630563.2012.740545zbMath1332.90190OpenAlexW2034618192MaRDI QIDQ2841915
Zi Hou Zhang, Guo-Qiang Wang, De-Tong Zhu
Publication date: 30 July 2013
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2012.740545
kernel functioninterior-point methodsEuclidean Jordan algebraconvex quadratic symmetric cone optimizationlarge- and small-update methods
Related Items
A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints ⋮ Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone ⋮ A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization ⋮ An accelerated smoothing Newton method with cubic convergence for weighted complementarity problems ⋮ An infeasible full-NT step interior point algorithm for CQSCO ⋮ 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
Cites Work
- Unnamed Item
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- A full-Newton step interior-point algorithm for symmetric cone convex quadratic optimization
- Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
- Monotone functions on formally real Jordan algebras
- Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras
- Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
- An inexact primal-dual path following algorithm for convex quadratic SDP
- A polynomial-time algorithm for linear optimization based on a new class of kernel functions
- 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
- On a commutative class of search directions for linear programming over symmetric cones
- Self-regular functions and new search directions for linear and semidefinite optimization
- 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
- Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
- A generic primal–dual interior-point method for semidefinite optimization based on a new class of kernel functions
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
- Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
- Interior Point Methods for Linear Optimization
- A Jordan-algebraic approach to potential-reduction algorithms
- A predictor--corrector algorithm for QSDP combining Dikin-type and Newton centering steps
