نتایج جستجو برای: constraint qualifications

تعداد نتایج: 82666  

2006
Adriano Pascoletti Paolo Serafini

We deal with differential conditions for local optimality. The conditions we derive for inequality constrained problems do not require constraint qualifications and are the broadest conditions based only on first and second order derivatives. A similar result is proved for equality constrained problems, although necessary conditions require regularity of the equality constraints.

Journal: :SIAM J. Control and Optimization 2000
Jane J. Ye

In this paper we study nonlinear programming problems with equality, inequality, and abstract constraints where some of the functions are Fréchet differentiable at the optimal solution, some of the functions are Lipschitz near the optimal solution, and the abstract constraint set may be nonconvex. We derive Fritz John type and Karush–Kuhn–Tucker (KKT) type first order necessary optimality condi...

Journal: :SIAM Journal on Optimization 1999
Jane J. Ye

Optimization problems with complementarity constraints are closely related to optimization problems with variational inequality constraints and bilevel programming problems. In this paper, under mild constraint qualifications, we derive some necessary and sufficient optimality conditions involving the proximal coderivatives. As an illustration of applications, the result is applied to the bilev...

Journal: :RAIRO - Operations Research 2008
A. El Afia Abdelhamid Benchakroun Jean-Pierre Dussault K. El Yassini

In this paper, we study the differentiability of the trajectories of the logarithmic barrier algorithm for a nonlinear program when the set Λ∗ of the Karush-Kuhn-Tucker multiplier vectors is empty owing to the fact that the constraint qualifications are not satisfied.

Journal: :SIAM Journal on Optimization 2004
Jane J. Ye

In this paper we study optimization problems with equality and inequality constraints on a Banach space where the objective function and the binding constraints are either differentiable at the optimal solution or Lipschitz near the optimal solution. Necessary and sufficient optimality conditions and constraint qualifications in terms of the Michel–Penot subdifferential are given, and the resul...

Journal: :Math. Program. 2012
Roberto Andreani Gabriel Haeser María Laura Schuverdt Paulo J. S. Silva

In this work we introduce a relaxed version of the constant positive linear dependence constraint qualification (CPLD) that we call RCPLD. This development is inspired by a recent generalization of the constant rank constraint qualification from Minchenko and Stakhovski that was called RCR. We show that RCPLD is enough to ensure the convergence of an augmented Lagrangian algorithm and asserts t...

Journal: :SIAM Journal on Optimization 2012
D. Fernández Mikhail V. Solodov

We establish local convergence and rate of convergence of the classical augmented Lagrangian algorithm under the sole assumption that the dual starting point is close to a multiplier satisfying the second-order sufficient optimality condition. In particular, no constraint qualifications of any kind are needed. Previous literature on the subject required, in addition, the linear independence con...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید