On optimality conditions in nonsmooth inequality constrained minimization

DOI10.1080/01630568708816246zbMath0611.90081OpenAlexW2010215636MaRDI QIDQ3751381

Vaithilingam Jeyakumar

Publication date: 1987

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

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

zbMATH Keywords

inequality constrained minimizationfirst order necessary optimality conditionsnonsmooth programapproximate quasidifferentialsinvex conditionsemi-infinite Gordan type alternative theorem

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Related Items (22)

Necessary optimality conditions in terms of convexificators in Lipschitz optimization ⋮ Convex composite minimization with \(C^{1,1}\) functions ⋮ A generalized mean-value theorem and optimality conditions in composite nonsmooth minimization ⋮ Optimality conditions for a class of composite multiobjective nonsmooth optimization problems ⋮ A theorem of the alternative with an arbitrary number of inequalities and quadratic programming ⋮ Upper DSL approximates and nonsmooth optimization ⋮ On Quasidifferentiable Functions and Non-Differentiable Programming ⋮ Nonsmooth multiobjective programming ⋮ General constraint qualifications in nondifferentiable programming ⋮ Duality without constraint qualification in nonsmooth optimization ⋮ Convex composite multi-objective nonsmooth programming ⋮ Nonconvex composite multiobjective nonsmooth fractional programming ⋮ Nonsmooth invex functions and sufficient optimality conditions ⋮ Exact penalty functions and Lagrange multipliers ⋮ Convex Subcones of the Contingent Cone in Nonsmooth Calculus and Optimization ⋮ (Φ, ρ)-Invexity in Nonsmooth Optimization ⋮ Nonsmooth Optimization Method for H∞ Output Feedback Control ⋮ Various types of nonsmooth invex functions ⋮ Directional Derivative Calculus and Optimality Conditions in Nonsmooth Mathematical Programming ⋮ Nonsmooth calculus, minimality, and monotonicity of convexificators ⋮ A Farkas lemma for difference sublinear systems and quasidifferentiable programming ⋮ Approximate generalized Hessians and Taylor’s expansions for continuously Gâteaux differentiable functions

Cites Work

• On sufficiency of the Kuhn-Tucker conditions
• Refinements of necessary optimality conditions in nondifferentiable programming. I
• On optimality conditions in nondifferentiable programming
• A New Approach to Lagrange Multipliers
• Unnamed Item
• Unnamed Item

This page was built for publication: On optimality conditions in nonsmooth inequality constrained minimization