A new primal-dual interior-point algorithm for convex quadratic optimization

DOI10.1007/s11741-008-0301-3zbMath1174.65422OpenAlexW75577628MaRDI QIDQ5320227

Min Zhang, Yong Liu, Guo-Qiang Wang, Yan-Qin Bai

Publication date: 22 July 2009

Published in: Journal of Shanghai University (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11741-008-0301-3

zbMATH Keywords

interior-point methodspolynomial complexitylarge-update methodconvex quadratic optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Quadratic programming (90C20) Interior-point methods (90C51) Complexity and performance of numerical algorithms (65Y20)

Related Items

A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints ⋮ Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier ⋮ A new parameterized kernel function for LO yielding the best known iteration bound for a large-update interior point algorithm ⋮ Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term ⋮ Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions ⋮ Reduction of truss topology optimization ⋮ A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization ⋮ A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• Interior point techniques in optimization. Complementarity, sensitivity and algorithms
• On the existence and convergence of the central path for convex programming and some duality results
• On a homogeneous algorithm for the monotone complementarity problem
• A polynomial predictor-corrector interior-point algorithm for convex quadratic programming
• A class of polynomial primal-dual interior-point algorithms for semidefinite optimization
• A primal‐dual interior-point method for linear optimization based on a new proximity function
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization