OQLA/QPALM – Convex quadratic optimization solvers using the augmented Lagrangian approach, with an appropriate behavior on infeasible or unbounded problems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2015

OQLA/QPALM – Convex quadratic optimization solvers using the augmented Lagrangian approach, with an appropriate behavior on infeasible or unbounded problems

Abstract

When a solver of convex quadratic optimization problem (QP) is used within a nonlin-ear optimization code, implementing the SQP algorithm, it is important that it deals appropriately with the special QPs that can be generated by the nonlinear solver, those that are infeasible or unbounded. The goal of this paper is to highlight the po-tential of the augmented Lagrangian (AL) algorithm in that respect and to give an account on the efficiency of the implementation of this algorithm in the C++/Matlab codes Oqla/Qpalm. We show how these pieces of software compare with some fre-quently used QP solvers, which use active-set or interior-point methods, and demon-strate that they provide an appropriate response when they deal with the special QPs quoted above.
Fichier principal
Vignette du fichier
p.pdf (370.48 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01110362 , version 1 (28-01-2015)

Licence

Attribution

Identifiers

  • HAL Id : hal-01110362 , version 1

Cite

Jean Charles Gilbert, Émilie Joannopoulos. OQLA/QPALM – Convex quadratic optimization solvers using the augmented Lagrangian approach, with an appropriate behavior on infeasible or unbounded problems. Inria de Paris, France; Université de Sherbrooke, Canada. 2015. ⟨hal-01110362⟩
396 View
745 Download

Share

Gmail Facebook X LinkedIn More