Our paper considers a classic problem in the field of Truss Topology Design, the goal of which is to determine the stiffest truss, under a given load, with a bound on the total volume and discrete requirements in the cross-sectional areas of the bars. To solve this problem we propose a new...

We propose a new gradient method for quadratic programming, named SDC, which alternates some steepest descent (SD) iterates with some gradient iterates that use a constant steplength computed through the Yuan formula. The SDC method exploits the asymptotic spectral behaviour of the Yuan...

A variant of the inexact augmented Lagrangian algorithm called SMALE (Dostál in Comput. Optim. Appl. 38:47–59, <CitationRef CitationID="CR10">2007</CitationRef>) for the solution of saddle point problems with a positive definite left upper block is studied. The algorithm SMALE-M presented here uses a fixed regularization parameter and...</citationref>

We address the exact solution of general integer quadratic programs with linear constraints. These programs constitute a particular case of mixed-integer quadratic programs for which we introduce in Billionnet et al. (Math. Program., <CitationRef CitationID="CR3">2010</CitationRef>) a general solution method based on quadratic convex...</citationref>