Results 241 to 250 of about 495,604 (291)

On constraint qualifications in nonlinear programming

Nonlinear Analysis: Theory, Methods & Applications, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
CASTELLANI, MARCO
openaire   +2 more sources

Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization

Mathematics of Operations Research, 2018
Sequential optimality conditions for constrained optimization are necessarily satisfied by local minimizers, independently of the fulfillment of constraint qualifications.
Jose Alberto Ramos Flor, Paulo J. S. Silva, Roberto Andreani   +2 more
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

On constraint qualifications

Journal of Optimization Theory and Applications, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wolfgang Achtziger, Christian Kanzow
openaire   +5 more sources

Constraint qualifications in the invex case

Journal of Information and Optimization Sciences, 1998
Abstract The purposes of the present paper are: (1) to weaken certain constraint qualifications (CQ’s) for a nonlinear programming problem by means of invexity; (2) to study the relationships among the various CQ’s in the case of a closed set constraint; (3) to give a sufficient condition for the equivalence between the Kuhn-Tucker CQ and the Abadie CQ.
GIORGI G., GUERRAGGIO, ANGELO
openaire   +2 more sources

Constraint qualifications in quasidifferentiable optimization

Mathematical Programming, 1993
The paper is devoted to inequality-constrained optimization problems with quasi-differentiable data, for which a qualification is said to hold if the null vector is a solution of the ``quasilinearized'' problem. The main result is that five qualification conditions can be ordered in such a way that each of them implies the one that follows.
Ludwig Kuntz, Stefan Scholtes
openaire   +2 more sources

Constraint qualifications in maximization problems

Naval Research Logistics Quarterly, 1961
AbstractMany problems arising in logistics and in the application of mathematics to industrial planning are in the form of constrained maximizations with nonlinear maximands or constraint functions or both. Thus a depot facing random demands for several items may wish to place orders for each in such a way as to maximize the expected number of demands ...
Arrow, K. J., Hurwicz, L., Uzawa, Hirofumi   +2 more
openaire   +2 more sources

Constraint Qualifications for Nonsmooth Mathematical Programs with Equilibrium Constraints

Set-Valued and Variational Analysis, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Movahedian, N., Nobakhtian, S.
openaire   +2 more sources

A class of constraint qualifications in nonsmooth optimization

Annals of Operations Research, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guohui Tian, Xiaofeng Li, Tianxia Zhao
openaire   +2 more sources

Geometry of optimality conditions and constraint qualifications

Mathematical Programming, 1972
Certain types of necessary optimality conditions for mathematical programming problems are equivalent to corresponding regularity conditions on the constraint set. For any problem, a certain natural optimality condition, dependent upon the particular constraint set, is always satisfied.
Floyd J. Gould, Jon W. Tolle
openaire   +2 more sources

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.
R. R. Merkovsky, D. E. Ward
openaire   +2 more sources