An Algorithm for Large-Scale Quadratic Programming
DOI10.1093/IMANUM/11.3.299zbMATH Open0727.65055OpenAlexW2060753484MaRDI QIDQ3349883FDOQ3349883
Authors: Nicholas I. M. Gould
Publication date: 1991
Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/imanum/11.3.299
Recommendations
active set methodNumerical resultssparse LU factorizationlarge-scale quadratic programmingHarwell Subroutine Library
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Large-scale problems in mathematical programming (90C06)
Cited In (30)
- Spectral gradient methods for linearly constrained optimization
- Title not available (Why is that?)
- On the quadratic programming algorithm of Goldfarb and Idnani
- A null-space method for computing the search direction in the general inertia-controlling method for dense quadratic programming
- Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems
- Systematic construction of examples for cycling in the simplex method
- PAL-Hom method for QP and an application to LP
- A feasible descent decomposition algorithm for large-scale quadratic programming
- Algorithm for cardinality-constrained quadratic optimization
- A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint
- A decomposition algorithm for solving large-scale quadratic programming problems
- Primal and dual active-set methods for convex quadratic programming
- Quadratic approximation of penalty functions for solving large-scale linear programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A quadratic simplex algorithm for primal optimization over zero-one polytopes
- Efficient implementation of an active set algorithm for large-scale portfolio selection
- Efficient Algorithms for Large-Scale Quadratic Matrix Equations
- Title not available (Why is that?)
- Title not available (Why is that?)
- A direct active set algorithm for large sparse quadratic programs with simple bounds
- Solving quadratic programs to high precision using scaled iterative refinement
- qpOASES: a parametric active-set algorithm for~quadratic programming
- A new technique for inconsistent QP problems in the SQP method
- An iterative working-set method for large-scale nonconvex quadratic programming
- Methods for convex and general quadratic programming
- A semi-Lagrangian mixed finite element method for advection-diffusion variational inequalities
- Large-scale MV efficient frontier computation via a procedure of parametric quadratic programming
- Title not available (Why is that?)
- An interior point potential reduction method for constrained equations
This page was built for publication: An Algorithm for Large-Scale Quadratic Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3349883)