Optimal algorithms for large sparse quadratic programming problems with uniformly bounded spectrum
From MaRDI portal
Publication:5493574
zbMATH Open1108.90032MaRDI QIDQ5493574FDOQ5493574
Authors: Z. Dostál
Publication date: 23 October 2006
Recommendations
- An optimal algorithm for bound and equality constrained quadratic programming problems with bounded spectrum
- An optimal algorithm for a class of equality constrained quadratic programming problems with bounded spectrum
- An Optimal Algorithm for Minimization of Quadratic Functions with Bounded Spectrum Subject to Separable Convex Inequality and Linear Equality Constraints
- A proportioning based algorithm with rate of convergence for bound constrained quadratic programming
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
Cited In (5)
- Quadratic programming and scalable algorithms for variational inequalities
- An optimal algorithm for a class of equality constrained quadratic programming problems with bounded spectrum
- Optimal iterative QP and QPQC algorithms
- New Analysis on Sparse Solutions to Random Standard Quadratic Optimization Problems and Extensions
- Title not available (Why is that?)
Uses Software
This page was built for publication: Optimal algorithms for large sparse quadratic programming problems with uniformly bounded spectrum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5493574)