Constrained derivative‐free optimization on thin domains

Constrained derivative‐free optimization on thin domains

0.00 Avg rating0 Votes
Article ID: iaor20134160
Volume: 56
Issue: 3
Start Page Number: 1217
End Page Number: 1232
Publication Date: Jul 2013
Journal: Journal of Global Optimization
Authors: ,
Keywords: iterative methods, penalty functions
Abstract:

Many derivative‐free methods for constrained problems are not efficient for minimizing functions on ‘thin’ domains. Other algorithms, like those based on Augmented Lagrangians, deal with thin constraints using penalty‐like strategies. When the constraints are computationally inexpensive but highly nonlinear, these methods spend many potentially expensive objective function evaluations motivated by the difficulties in improving feasibility. An algorithm that handles this case efficiently is proposed in this paper. The main iteration is split into two steps: restoration and minimization. In the restoration step, the aim is to decrease infeasibility without evaluating the objective function. In the minimization step, the objective function f is minimized on a relaxed feasible set. A global minimization result will be proved and computational experiments showing the advantages of this approach will be presented.

Reviews

Required fields are marked *. Your email address will not be published.