Results 251 to 260 of about 495,604 (291)

A simple constraint qualification in convex programming

Mathematical Programming, 1993
The authors introduce a rather large class of differentiable convex functions for which the constraint qualifications is always satisfied. Hence, for programs with the constraints belonging to this class, consistency of the Karush-Kuhn-Tucker condition (as a system) is both necessary and sufficient for optimality.
X. Zhou, Faranak Sharifi Mokhtarian, Sanjo Zlobec   +2 more
openaire   +3 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

Avoiding a Constraint Qualification

Optimization, 1997
Necessary conditions are given for a constrained minimum, which do not assume any constraint qualification. The conditions relate to a cone, depending on constraint gradients at points near the minimum. They generalize a sufficient condition due to Hanson Under an invexity hypothesis.
openaire   +1 more source

Necessary and Sufficient Constraint Qualification for Surrogate Duality

Journal of Optimization Theory and Applications, 2011
The authors investigate necessary and sufficient constraint qualifications for surrogate duality closely related with ones for Lagrange-type dualities, in comparison with such as these conditions in the usual mathematical programming. Reviewer's remark: This paper is also important for proper numerical studies.
Satoshi Suzuki, Daishi Kuroiwa
openaire   +3 more sources

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.
Roberto Andreani, José Mario Martínez, Alberto Ramos 0001, Paulo J. S. Silva   +3 more
openaire   +2 more sources

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