A block active set algorithm for large-scale quadratic programming with box constraints

DOI10.1023/A:1018990014974zbMath0906.90138OpenAlexW136084548MaRDI QIDQ1265874

João Oliveira Soares, Cristina Requejo, Luís M. Fernandes, Joaquim Joao Júdice, Andreas Fischer

Publication date: 27 September 1998

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018990014974

zbMATH Keywords

global convergencebox constraintssparse matricesstationary pointquadratic program

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20)

Related Items (10)

Optimal iterative QP and QPQC algorithms ⋮ Computing upper and lower bounds in interval decision trees ⋮ Convex programming with single separable constraint and bounded variables ⋮ Merging of Bézier curves with box constraints ⋮ Data-driven decision model based on local two-stage weighted ensemble learning ⋮ A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem ⋮ Simple solution methods for separable mixed linear and quadratic knapsack problem ⋮ Nonmonotone strategy for minimization of quadratics with simple constraints. ⋮ A block principal pivoting algorithm for vertical generalized LCP with a vertical block P-matrix ⋮ Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems

This page was built for publication: A block active set algorithm for large-scale quadratic programming with box constraints