# QPAL -- A solver of convex quadratic optimization problems, using an augmented Lagrangian approach

Abstract : QPAL is a piece of software that aims at solving a convex quadratic optimization problem with linear equality and inequality constraints. The implemented algorithm uses an augmented Lagrangian approach, which relaxes the equality constraints and deals explicitely with the bound constraints on the original and slack variables. The generated quadratic functions are minimized on the activated faces by a truncated conjugate gradient algorithm, interspersed with gradient projection steps. When the optimal value is finite, convergence occurs at a linear speed that can be prescribed by the user. Matrices can be strored in dense or sparse structures; in addition, the Hessian of the quadratic objective function may have a direct of inverse $\ell$-BFGS form. QPAL is written in Fortran-2003.
Keywords :
Type de document :
Rapport
[Technical Report] RT-0377, INRIA. 2009, pp.22
Domaine :

Littérature citée [6 références]

https://hal.inria.fr/inria-00442295
Contributeur : Jean Charles Gilbert <>
Soumis le : samedi 19 décembre 2009 - 15:08:48
Dernière modification le : vendredi 25 mai 2018 - 12:02:03
Document(s) archivé(s) le : jeudi 17 juin 2010 - 23:57:07

### Fichier

RT-0377.pdf
Fichiers produits par l'(les) auteur(s)

### Identifiants

• HAL Id : inria-00442295, version 1

### Citation

Jean Charles Gilbert. QPAL -- A solver of convex quadratic optimization problems, using an augmented Lagrangian approach. [Technical Report] RT-0377, INRIA. 2009, pp.22. 〈inria-00442295〉

### Métriques

Consultations de la notice

## 231

Téléchargements de fichiers