An inexact restoration derivative-free filter method for nonlinear programming
نویسندگان
چکیده
منابع مشابه
Global convergence of a derivative-free inexact restoration filter algorithm for nonlinear programming
In this work we present an algorithm for solving constrained optimization problems that does not make explicit use of the objective function derivatives. The algorithm mixes an inexact restoration framework with filter techniques, where the forbidden regions can be given by the flat or slanting filter rule. Each iteration is decomposed in two independent phases: a feasibility phase which reduce...
متن کاملAn inexact-restoration method for nonlinear bilevel programming problems
We present a new algorithm for solving bilevel programming problems without reformulating them as single-level nonlinear programming problems. This strategy allows one to take profit of the structure of the lower level optimization problems without using non-differentiable methods. The algorithm is based on the inexact-restoration technique. Under some assumptions on the problem we prove global...
متن کاملInexact Restoration Method for Derivative-Free Optimization with Smooth Constraints
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...
متن کاملA derivative-free algorithm for nonlinear programming
In this paper we consider nonlinear constrained optimization problems in case where the first order derivatives of the objective function and the constraints can not be used. Up to date only a few approaches have been proposed for tackling such a class of problems. In this work we propose a new algorithm. The starting point of the proposed approach is the possibility to transform the original c...
متن کاملInexact-Restoration Method with Lagrangian Tangent Decrease and New Merit Function for Nonlinear Programming
A new Inexact-Restoration method for Nonlinear Programming is introduced. The iteration of the main algorithm has two phases. In Phase 1, feasibility is explicitly improved and in Phase 2 optimality is improved on a tangent approximation of the constraints. Trust regions are used for reducing the step when the trial point is not good enough. The trust region is not centered in the current point...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational and Applied Mathematics
سال: 2015
ISSN: 0101-8205,1807-0302
DOI: 10.1007/s40314-015-0253-0