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

DOI10.1080/01630569308816525zbMATH Open0808.90117OpenAlexW2060163684MaRDI QIDQ4293262FDOQ4293262

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

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

Recommendations

• Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
• Approximate Karush-Kuhn-Tucker condition in multiobjective optimization
• On approximate Karush-Kuhn-Tucker conditions for multiobjective optimization problems
• scientific article
• scientific article
• A generalization of the Kuhn-Tucker sufficiency conditions
• scientific article; zbMATH DE number 3887448
• Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming via tangential subdifferentials
• The Karush--Kuhn--Tucker optimality conditions in an optimization problem with interval-valued objective function
• Kuhn-Tucker and Fritz John type sufficient optimality conditions for generalized semilocally convex programs

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) Stochastic programming (90C15) Nonsmooth analysis (49J52) Calculus of functions taking values in infinite-dimensional spaces (26E20) Programming in abstract spaces (90C48)

Cites Work

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

Cited In (10)

• Abstract Kuhn-Tucker theorems
• On minimization subject to cone constraints
• Modified Kuhn-Tucker conditions when a minimum is not attained
• Topological characterization of the approximate subdifferential in the finite-dimensional case
• Projection and discretization methods in stochastic programming
• On the Topology of the Karush–Kuhn–Tucker Set under Mangasarian–Fromovitz Constraint Qualification
• The behaviour of the objective function on the Kuhn-Tucker set
• Topological properties of the approximate subdifferential
• Title not available (Why is that?)
• A new sequential optimality condition for constrained optimization and algorithmic consequences

This page was built for publication: A generalized karush-kuhn-tucki optimality condition without constraint qualification using tl approximate subdifferential

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