Avoiding a Constraint Qualification

DOI10.1080/02331939708844342MaRDI QIDQ4356418zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

constrained local minimumconstraint qualificationinvexity assumptionnecessary conditions

Mathematics Subject Classification ID

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

Review text

Without assuming any constraint qualification the author gives necessary conditions for a constrained local minimum by generalizing a sufficient condition due to \textit{M. A. Hanson} [J. Math. Anal. Appl. 80, 545-550 (1981; Zbl 0463.90080)]. The conditions become necessary and sufficient under an invexity assumption.

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

Cites work

• A generalization of the Kuhn-Tucker sufficiency conditions
• An approach to vector subdifferentials
• scientific article; zbMATH DE number 3672000 (Why is no real title available?)
• Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
• Nondifferentiable optimization by smooth approximations
• On sufficiency of the Kuhn-Tucker conditions
• Optimization and nonsmooth analysis

Cited in

(1)

• Constraint qualifications in the invex case

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)