Name
Abstract | ||
|---|---|---|
We propose new algorithms for (i) the local optimization of bound constrained quadratic programs, (ii) the solution of general definite quadratic programs, and (iii) finding either a point satisfying given linear equations and inequalities or a certificate of infeasibility. The algorithms are implemented in and tested against state-of-the-art quadratic programming software. |
Year | DOI | Venue |
|---|---|---|
2018 | https://doi.org/10.1007/s10589-017-9949-y | Comp. Opt. and Appl. |
Keywords | Field | DocType |
Definite quadratic programming,Bound constrained indefinite quadratic programming,Dual program,Certificate of infeasibility | Second-order cone programming,Mathematical optimization,Quadratically constrained quadratic program,Quadratic equation,Quadratic residuosity problem,Local search (optimization),Quadratic programming,Sequential quadratic programming,Definite quadratic form,Mathematics | Journal |
Volume | Issue | ISSN |
69 | 2 | 0926-6003 |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Waltraud Huyer | 1 | 206 | 20.10 |
| arnold neumaier | 2 | 1019 | 161.61 |