A decomposition algorithm for solving large-scale quadratic programming problems

DOI10.1016/j.amc.2005.04.076zbMath1090.65074OpenAlexW2042797700MaRDI QIDQ2489180

Ke-Cun Zhang, Hui-Min Li

Publication date: 16 May 2006

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2005.04.076

zbMATH Keywords

quadratic programmingnumerical examplesdecomposition algorithmsubproblemslarge-scale programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20)

Related Items

An accelerating algorithm for globally solving nonconvex quadratic programming, Fast algorithms for sparse portfolio selection considering industries and investment styles, Global optimization algorithm for a generalized linear multiplicative programming, An out space accelerating algorithm for generalized affine multiplicative programs problem

Cites Work

• Solution of symmetric linear complementarity problems by iterative methods
• A dual-active-set algorithm for positive semi-definite quadratic programming
• A new SQP method of feasible directions for nonlinear programming.
• Constraint exploration method for quadratic programming problem.
• Unnamed Item