On constraint qualifications in nonlinear programming

DOI10.1016/j.na.2007.09.014zbMath1190.90138OpenAlexW2062468720MaRDI QIDQ955633

Marco Castellani

Publication date: 20 November 2008

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.na.2007.09.014

zbMATH Keywords

constraint qualificationpositively homogeneous functioninequality constrained extremum probleminequality system

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items (1)

Local cone approximations in mathematical programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constraint qualifications in quasidifferentiable optimization
• A Farkas lemma for difference sublinear systems and quasidifferentiable programming
• A dual representation for proper positively homogeneous functions
• Upper DSL approximates and nonsmooth optimization
• Nonsmooth Calculus in Finite Dimensions
• Isotone tangent cones and nonsmooth optimization
• Generalized Directional Derivatives and Subgradients of Nonconvex Functions
• A constraint qualification in quasidifferentiable programming
• On optimality conditions in nondifferentiable programming
• First–order cone apporximations and necessary optimality conditions
• Complete Characterizations of Global Optimality for Problems Involving the Pointwise Minimum of Sublinear Functions
• Sufficient conditions for extremum, penalty functions and regularity

This page was built for publication: On constraint qualifications in nonlinear programming