Optimization Online


Inexact Restoration method for Derivative-Free Optimization with smooth constraints

L. F. Bueno (lfelipebueno***at***gmail.com)
A. Friedlander (friedlan***at***ime.unicamp.br)
J. M. Martínez (martinez***at***ime.unicamp.br)
F. N. C. Sobral (fsobral***at***ime.unicamp.br)

Abstract: A new method is introduced for solving constrained optimization problems in which the derivatives of the constraints are available but the derivatives of the objective function are not. The method is based on the Inexact Restoration framework, by means of which each iteration is divided in two phases. In the first phase one considers only the constraints, in order to improve feasibility. In the second phase one minimizes a suitable objective function subject to a linear approximation of the constraints. The second phase must be solved using derivative-free methods. An algorithm introduced recently by Kolda, Lewis, and Torczon for linearly constrained derivative-free optimization is employed for this purpose. Under usual assumptions, convergence to stationary points is proved. A computer implementation is described and numerical experiments are presented.

Keywords: Inexact Restoration, Derivative-Free Optimization, Global Convergence, Numerical Experiments

Category 1: Nonlinear Optimization (Constrained Nonlinear Optimization )

Category 2: Nonlinear Optimization (Other )

Category 3: Optimization Software and Modeling Systems (Other )

Citation: Submitted (2011).

Download: [PDF]

Entry Submitted: 11/21/2011
Entry Accepted: 11/21/2011
Entry Last Modified: 11/21/2011

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