Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier
From MaRDI portal
Publication:1935397
DOI10.1007/s11075-012-9581-yzbMath1260.65053MaRDI QIDQ1935397
Xin-Zhong Cai, Zi Hou Zhang, Guo-Qiang Wang
Publication date: 15 February 2013
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-012-9581-y
algorithms; numerical examples; iteration bound; primal-dual interior-point methods; Kernel function; convex quadratic optimization; large- and small-update methods
65K05: Numerical mathematical programming methods
90C25: Convex programming
90C20: Quadratic programming
90C51: Interior-point methods
Related Items
A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function, Continuous and discrete Zhang dynamics for real-time varying nonlinear optimization, A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization, A full-Newton step interior-point algorithm for linear optimization based on a finite barrier, Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term, Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem, An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function, A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints, An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term, Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone, Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization
Cites Work
- Unnamed Item
- Unnamed Item
- A new primal-dual path-following method for convex quadratic programming
- 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
- Steplengths in interior-point algorithms of quadratic programming
- Self-regular functions and new search directions for linear and semidefinite optimization
- A polynomial predictor-corrector interior-point algorithm for convex quadratic programming
- 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
- A new primal-dual interior-point algorithm for convex quadratic optimization
- An Iterative Solver-Based Infeasible Primal-Dual Path-Following Algorithm for Convex Quadratic Programming
