A generalized karush-kuhn-tucki optimality condition without constraint qualification using tl approximate subdifferential

DOI10.1080/01630569308816525zbMath0808.90117OpenAlexW2060163684MaRDI QIDQ4293262

B. M. Glover, Sjur Didrik Flåm, Bruce D.Craven

Publication date: 26 May 1994

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

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

zbMATH Keywords

nonsmooth analysisEkeland's variational principlenondifferentiable programmingapproximate subdifferentialsinfinitely constrained concave minimizationKarush-Kuhn-Tucker first order optimality condition

Mathematics Subject Classification ID

Nonlinear programming (90C30) Nonsmooth analysis (49J52) Stochastic programming (90C15) Programming in abstract spaces (90C48) Calculus of functions taking values in infinite-dimensional spaces (26E20)

Related Items

Projection and discretization methods in stochastic programming, Topological properties of the approximate subdifferential, Topological characterization of the approximate subdifferential in the finite-dimensional case

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate subdifferential and metric regularity: The finite-dimensional case
• A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
• On the regularity condition for the extremal problem under locally Lipschitz inclusion constraints
• Subdifferentials of nonconvex vector-valued functions
• On solving a d.c. programming problem by a sequence of linear programs
• Geometry of Banach spaces. Selected topics
• Continuous versus measurable recourse in N-stage stochastic programming
• Characterization of optimality in convex programming without a constraint qualification
• Measures as Lagrange multipliers in multistage stochastic programming
• On the variational principle
• Approximate subdifferentials and applications 3: the metric theory
• On minimization subject to cone constraints
• Generalized convexity in nondifferentiable programming
• Characterization of nonsmooth functions through their generalized gradients
• Optimization and nonsmooth analysis
• Approximate subdifferentials and applications II
• Complete characterization of optimality for convex programming in banach spaces^†
• Continuity and Differentiability Properties of Convex Operators
• The Dual of a Gateaux Smooth Banach Space is Weak Star Fragmentable
• Lagrange Multipliers in Stochastic Programming
• The use of metric graphical regularity in approximate subdifferential calculus rules in finite dimensions