DQP

𝖦𝖠𝖫𝖠𝖧𝖠𝖣 DQP: solves strictly-convex quadratic programs using a dual gradient-projection method. The simplicity of the dual feasible region allows for fast iterative solution.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element

References in zbMATH (referenced in 2 articles , 1 standard article )

Showing results 1 to 2 of 2.
Sorted by year (citations)

  1. Furini, Fabio; Traversi, Emiliano; Belotti, Pietro; Frangioni, Antonio; Gleixner, Ambros; Gould, Nick; Liberti, Leo; Lodi, Andrea; Misener, Ruth; Mittelmann, Hans; Sahinidis, Nikolaos V.; Vigerske, Stefan; Wiegele, Angelika: QPLIB: a library of quadratic programming instances (2019)
  2. Gould, Nicholas I. M.; Robinson, Daniel P.: A dual gradient-projection method for large-scale strictly convex quadratic problems (2017)