Optimization Online


Efficient solution of quadratically constrained quadratic subproblems within the MADS algorithm

Nadir Amaioua (nadir.amaioua***at***gerad.ca)
Charles Audet (Charles Audet gerad.ca>)
Andrew R Conn (arconn***at***us.ibm.com)
Sébastien Le Digabel (Sebastien.Le.Digabel***at***gerad.ca)

Abstract: The Mesh Adaptive Direct Search algorithm (MADS) is an iterative method for constrained blackbox optimization problems. One of the optional MADS features is a versatile search step in which quadratic models are built leading to a series of quadratically constrained quadratic subproblems. This work explores different algorithms that exploit the structure of the quadratic models: the first one applies an l1 exact penalty function, the second uses an augmented Lagrangian and the third one combines the former two, resulting in a new algorithm. These methods are implemented within the NOMAD software package and their impact are assessed through computational experiments on 65 analytical test problems and 4 simulation-based engineering applications.

Keywords: Derivative-free optimization; Quadratic programming; Trust-region subproblem; Mesh Adaptive Direct Search.

Category 1: Nonlinear Optimization (Constrained Nonlinear Optimization )

Category 2: Convex and Nonsmooth Optimization (Nonsmooth Optimization )

Citation: Cahier du Gerad, G-2016-45, 2016.

Download: [PDF]

Entry Submitted: 11/17/2016
Entry Accepted: 11/17/2016
Entry Last Modified: 11/22/2016

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society