On constraint qualifications in nonlinear programming
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3964819 (Why is no real title available?)
- scientific article; zbMATH DE number 50640 (Why is no real title available?)
- scientific article; zbMATH DE number 872150 (Why is no real title available?)
- A Farkas lemma for difference sublinear systems and quasidifferentiable programming
- A constraint qualification in quasidifferentiable programming
- A dual representation for proper positively homogeneous functions
- Complete Characterizations of Global Optimality for Problems Involving the Pointwise Minimum of Sublinear Functions
- Constraint qualifications in quasidifferentiable optimization
- First–order cone apporximations and necessary optimality conditions
- Generalized Directional Derivatives and Subgradients of Nonconvex Functions
- Isotone tangent cones and nonsmooth optimization
- Nonsmooth Calculus in Finite Dimensions
- On optimality conditions in nondifferentiable programming
- Sufficient conditions for extremum, penalty functions and regularity
- Upper DSL approximates and nonsmooth optimization
Cited in
(7)- scientific article; zbMATH DE number 6453520 (Why is no real title available?)
- Constraint qualification in a general class of Lipschitzian mathematical programming problems
- Local cone approximations in mathematical programming
- A note on the weak Arrow-Hurwicz-Uzawa constraint qualification
- Nonlinear programming and grossone: quadratic programing and the role of constraint qualifications
- scientific article; zbMATH DE number 3936398 (Why is no real title available?)
- On constraint qualifications: motivation, design and inter-relations
This page was built for publication: On constraint qualifications in nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q955633)