On the Maximization of a Concave Quadratic Function with Box Constraints

Ana Friedlander

SIAM Journal on Optimization · 1994 · 96 citations · 12 references

DOIFull text

Open access

Concepts

TL;DR

The new algorithm combines conjugate gradients with gradient projection techniques, as the algorithm of Moré and Toraldo [SIAM J. Optimization, 1 (1991), pp. 93–113] and other well‑known methods do. The paper introduces a new method for maximizing a concave quadratic function with bounds, and a strategy for leaving the current face that enables finite convergence even with singular Hessian and dual degeneracy. The method combines conjugate gradients with gradient projection techniques and introduces a face‑leaving strategy to achieve finite convergence.

Abstract

A new method for maximizing a concave quadratic function with bounds on the variables is introduced. The new algorithm combines conjugate gradients with gradient projection techniques, as the algorithm of Moré and Toraldo [SIAM J. Optimization, 1 (1991), pp. 93–113] and other well-known methods do. A new strategy for the decision of leaving the current face is introduced that makes it possible to obtain finite convergence even for a singular Hessian and in the presence of dual degeneracy. Numerical experiments are presented.

References

12