Avoiding a Constraint Qualification

DOI10.1080/02331939708844342zbMATH Open0914.90245OpenAlexW2085674600MaRDI QIDQ4356418FDOQ4356418

Authors: B. D. Craven 

Publication date: 2 June 1999

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939708844342

Recommendations

• Constraint qualifications in the invex case
• A practical optimality condition without constraint qualifications for nonlinear programming
• scientific article; zbMATH DE number 3934789
• On optimality conditions in nonsmooth inequality constrained minimization
• scientific article; zbMATH DE number 1263981

zbMATH Keywords

necessary conditionsconstraint qualificationconstrained local minimuminvexity assumption

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions (49K99)

Cites Work

• Nondifferentiable optimization by smooth approximations
• Optimization and nonsmooth analysis
• On sufficiency of the Kuhn-Tucker conditions
• Title not available (Why is that?)
• Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
• A generalization of the Kuhn-Tucker sufficiency conditions
• An approach to vector subdifferentials

This page was built for publication: Avoiding a Constraint Qualification

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