Results 211 to 220 of about 2,261 (257)

Notes on Some Constraint Qualifications for Mathematical Programs with Equilibrium Constraints

Journal of Optimization Theory and Applications, 2012
From the introduction: ``Mathematical program with equilibrium constraints (MPEC) plays an important role in many fields such as engineering design, economic equilibria, transportation science, multilevel game, and mathematical programming itself. However, this kind of problems is generally difficult to deal with because their constraints fail to ...
Guo, Lei, Lin, Gui-Hua
openaire   +2 more sources

On Constraint Qualifications in Nonsmooth Optimization

Journal of Optimization Theory and Applications, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Constraint Qualifications in Nonsmooth Multiobjective Optimization

Journal of Optimization Theory and Applications, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Nonsmooth multiobjective programming and constraint qualifications

Optimization, 2013
We consider a nonsmooth multiobjective programming problem with inequality and set constraints. By using the notion of convexificator, we extend the Abadie constraint qualification, and derive the strong Kuhn-Tucker necessary optimality conditions. Some other constraint qualifications have been generalized and their interrelations are investigated.
M. Golestani, S. Nobakhtian
openaire   +1 more source

A new constraint qualification condition

Journal of Optimization Theory and Applications, 1986
We introduce a new constraint qualification condition in mathematical programming which encompasses the Mangasarian-Fromovitz's condition and the constant rank condition of Janin. Contrarily to the Mangasarian- Fromovitz's condition, our condition is still satisfied when one translates equalities as double inequalities.
openaire   +1 more source

Weaker Constraint Qualifications in Maximal Monotonicity

Numerical Functional Analysis and Optimization, 2007
We give a sufficient condition, weaker than the others known so far, that guarantees that the sum of two maximal monotone operators on a reflexive Banach space is maximal monotone.
Radu Ioan Boţ, Sorin-Mihai Grad, Gert Wanka   +2 more
openaire   +1 more source

General constraint qualifications in nondifferentiable programming

Mathematical Programming, 1990
A general inequality-constrained minimization program is considered on a real normed space E. The constraints are given by a finite number of inequalities and an explicit set C. The paper deals with necessary conditions of Kuhn-Tucker type for a local minimum.
Merkovsky, R. R., Ward, D. E.
openaire   +1 more source

A Cone-Continuity Constraint Qualification and Algorithmic Consequences

SIAM Journal on Optimization, 2016
Summary: Every local minimizer of a smooth constrained optimization problem satisfies the sequential approximate Karush-Kuhn-Tucker (AKKT) condition. This optimality condition is used to define the stopping criteria of many practical nonlinear programming algorithms.
Andreani, Roberto, Martínez, José Mário, Ramos, Alberto, Silva, Paulo J. S.   +3 more
openaire   +2 more sources

Infinite Alternative Theorems and Nonsmooth Constraint Qualification Conditions

Set-Valued and Variational Analysis, 2012
In this paper, the authors obtain some infinite alternative theorems in locally convex spaces. Using Clarke's generalized subdifferential and Mordukhovich's limiting subdifferential, they introduce nonsmooth versions of some constraint qualification conditions in optimization theory, in the absence of differentiability, in Banach and Asplund spaces and
Asadi, Mohammad B., Soleimani-damaneh, Majid   +1 more
openaire   +2 more sources

Note on Mangasarian–Fromovitz-Like Constraint Qualifications

Journal of Optimization Theory and Applications, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources