A dual-active-set algorithm for positive semi-definite quadratic programming
From MaRDI portal
Publication:1373722
DOI10.1016/S0025-5610(96)00069-XzbMath0893.90139OpenAlexW4239349808MaRDI QIDQ1373722
Publication date: 25 November 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0025-5610(96)00069-x
Related Items (9)
Primal and dual active-set methods for convex quadratic programming ⋮ Computing upper and lower bounds in interval decision trees ⋮ Convex optimization techniques in compliant assembly simulation ⋮ A derivative algorithm for inexact quadratic program -- application to environmental decision-making under uncertainty ⋮ A decomposition algorithm for solving large-scale quadratic programming problems ⋮ A dual gradient-projection method for large-scale strictly convex quadratic problems ⋮ A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming ⋮ Dual support method for solving convex quadratic programs ⋮ An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set
This page was built for publication: A dual-active-set algorithm for positive semi-definite quadratic programming
