Constraint Qualifications Revisited

Cited in

(20)

A new constraint qualification condition
Quasi-convex programming revisited
The Fritz John and Kuhn-Tucker optimality conditions in continuous-time nonlinear programming
Second-order necessary conditions of the Kuhn-Tucker type under new constraint qualifications
Characterization of optimality in convex programming without a constraint qualification
Implied constraints and an alternate unified development of nonlinear programming theory
Constraint qualifications in nonsmooth multiobjective optimization
Subvexormal functions and subvex functions
Why (some) abnormal problems are ``normal
Necessary optimality conditions in terms of convexificators in Lipschitz optimization
On the cones of tangents with applications to mathematical programming
Necessary optimality criteria in mathematical programming in the presence of differentiability
Geometry of optimality conditions and constraint qualifications: The convex case
Nonlinear programming without differentiability in banach spaces: necessary and sufficient constraint qualification
A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
Optimality condition: Constraint regularization
Constraint qualifications in the invex case
On the notion of tangent cone in mathematical programming
Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
Existence and boundedness of the Kuhn-Tucker multipliers in nonsmooth multiobjective optimization

This page was built for publication: Constraint Qualifications Revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5672470)