A constraint qualification in quasidifferentiable programming

DOI10.1080/02331939108843709zbMath0741.90069OpenAlexW2056515504MaRDI QIDQ3979519

No author found.

Publication date: 26 June 1992

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

constraint qualificationrecession functionquasidifferentiable optimizationgeneral position hypothesis

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Convexity of real functions of several variables, generalizations (26B25)

Related Items (18)

Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder) ⋮ On minty variational principle for quasidifferentiable vector optimization problems ⋮ Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems ⋮ A nonsmooth variant of the Mangasarian-Fromovitz constraint qualification ⋮ On necessary minimum conditions in quasidifferential calculus: independence of the specific choice of quasidifferentials ⋮ Quasi-Multiplier Rules for Quasidifferentiable Extremum Problems ⋮ Optimality conditions in quasidifferentiable vector optimization ⋮ On optimality conditions and duality results in a class of nonconvex quasidifferentiable optimization problems ⋮ Theorem on an implicit function in quasidifferential calculus ⋮ Fixed point theorem in nonsmooth analysis and its applications ⋮ On Quasidifferentiable Functions and Non-Differentiable Programming ⋮ On constraint qualifications in nonlinear programming ⋮ Constraint qualifications in quasidifferentiable optimization ⋮ On constraint qualifications in nonsmooth optimization. ⋮ A New Constraint Qualification and Sharp Optimality Conditions for Nonsmooth Mathematical Programming Problems in Terms of Quasidifferentials ⋮ Small convex-valued subdifferentials in mathematical programming ⋮ Necessary minimum conditions and steepest descent directions in quasi-differential calculus: independence of the specific forms of quasidifferentials ⋮ A Farkas lemma for difference sublinear systems and quasidifferentiable programming

Cites Work

• On Shapiro's results in quasidifferential calculus
• Nondifferentiable optimization: motivations and applications. Proceedings of an IIASA (International Institute for Applied Systems Analysis) Workshop on Nondifferentiable Optimization Held at Sopron, Hungary, September 17-22, 1984
• The differentiability of real functions on normed linear space using generalized subgradients
• Finite-dimensional optimality conditions: B-gradients
• Upper DSL approximates and nonsmooth optimization
• Necessary Conditions for the Bolza Problem
• Quasidifferential calculus and first-order optimality conditions in nonsmooth optimization
• The quasidifferential of an optimal value function in nonsmooth programming
• Convex Analysis
• Unnamed Item
• Unnamed Item

This page was built for publication: A constraint qualification in quasidifferentiable programming