Note on Mangasarian–Fromovitz-Like Constraint QualificationsWe consider
constraint qualifications in nonlinear programming which can be reduced
К условиям регулярности в математическом программировании оптимизации и является достаточно общим условием регулярности (
constraint
qualification) в задачах
On implicit function theorems at abnormal points neighborhood of a given solution (x*, σ*), where Robinson's
constraint qualification may be violated. We
CQ-free optimality conditions for copositive programming problems with isolated immobile indices of immobile indices and their immobility orders and do not require the Slater
constraint qualification On optimality conditions for linear copositive programming to linear
constraints
defined in a conic (infinite) index set. Using the equivalent
formulation
Directional stability theorem and directional metric regularityWe develop a new regularity concept, unifying metric regularity, Robinson's
constraint On strong and weak second-order necessary optimality conditions for nonlinear programming. These conditions are closely related to second-order
constraint qualifications, which guarantee