Results 251 to 260 of about 564,271 (287)

On a constraint qualification in a nondifferentiable programming problem

Naval Research Logistics Quarterly, 1976
AbstractA mathematical programming problem with an objective function containing the square root of a positive semidefinite quadratic form has been considered by Mond. In order to use a transposition theorem of Eisenberg, Mond introduces a complicated constraint qualification.
Mond, Bertram, Schechter, Murray
openaire   +1 more source

Constraint qualifications for nonsmooth programming

Optimization, 2018
ABSTRACTBy using an implicit function theorem and a result of error bound, we provide new constraint qualifications ensuring the Karush–Kuhn–Tuker necessary optimality conditions for both smooth and nonsmooth optimization problems in normed spaces or Banach spaces.
Liren Huang, Lulin Tan, Chunguang Liu
openaire   +1 more source

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

Implications of the constant rank constraint qualification

Mathematical Programming, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

A parametric view on the Mangasarian-Fromovitz constraint qualification

Mathematical Programming, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 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   +3 more sources

Constraint qualifications and optimality conditions for optimization problems with cardinality constraints

Mathematical Programming, 2016
Optimization problems with cardinality constraints are problems with inequality and equality constraints where additionally the number of nonzero components of the solution is bounded. These problems can equivalently be formulated as mixed-integer optimization problems.
Michal Cervinka, Christian Kanzow, Alexandra Schwartz   +2 more
openaire   +3 more sources

On constraint qualifications in nonlinear programming

Naval Research Logistics Quarterly, 1970
In this paper we examine the relationship between two constraint qualifications developed by Abadie and Arrow, Hurwicz, and Uzawa. A third constraint qualification is discussed and shown to be weaker than either of those mentioned above.
openaire   +1 more source

On constraint qualifications in nonlinear programming

Nonlinear Analysis: Theory, Methods & Applications, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

A constraint qualification for convex programming

Acta Mathematicae Applicatae Sinica, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source