General constraint qualifications in nondifferentiable programming
From MaRDI portal
Publication:920847
DOI10.1007/BF01580871zbMath0708.90078OpenAlexW1973201553MaRDI QIDQ920847
Publication date: 1990
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01580871
nonsmooth optimizationdirectional derivativessubgradientsgradientsreal normed spaceclosed tangent conesconstraints qualificationsinequality-constrained minimizationlocally Lipschitzian conditionsnecessary conditions of Kuhn-Tucker type
Related Items (16)
Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems ⋮ Necessary optimality conditions in terms of convexificators in Lipschitz optimization ⋮ Theorem on an implicit function in quasidifferential calculus ⋮ Constraint qualifications in nonsmooth optimization: Classification and inter-relations ⋮ Fixed point theorem in nonsmooth analysis and its applications ⋮ On Quasidifferentiable Functions and Non-Differentiable Programming ⋮ Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints ⋮ Optimality criteria and duality in multiobjective programming involving nonsmooth invex functions ⋮ Convex composite multi-objective nonsmooth programming ⋮ Which subgradients have sum formulas? ⋮ On constraint qualifications in nonsmooth optimization. ⋮ Directional Derivative Calculus and Optimality Conditions in Nonsmooth Mathematical Programming ⋮ Constraint qualifications in nonsmooth multiobjective optimization ⋮ Small convex-valued subdifferentials in mathematical programming ⋮ Differential stability in non-Lipschitzian optimization ⋮ Asymptotic behavior of solutions: an application to stochastic NLP
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tangency and differentiation: Some applications of convergence theory
- Calcul sous-différentiel et optimisation
- On the cones of tangents with applications to mathematical programming
- Necessary and Sufficient Conditions for a Local Minimum. 1: A Reduction Theorem and First Order Conditions
- Solvability results for sublinear functions and operators
- Upper DSL approximates and nonsmooth optimization
- Optimization and nonsmooth analysis
- Cores of Tangent Cones and Clarke's Tangent Cone
- Necessary Conditions for the Bolza Problem
- On optimality conditions in nonsmooth inequality constrained minimization
- Convex Subcones of the Contingent Cone in Nonsmooth Calculus and Optimization
- Nonsmooth Calculus in Finite Dimensions
- Isotone tangent cones and nonsmooth optimization
- The Quantificational Tangent Cones
- On conditions to have bounded multipliers in locally lipschitz programming
- Generalized Directional Derivatives and Subgradients of Nonconvex Functions
- Tangent Sets’ Calculus and Necessary Conditions for Extremality
- Kuhn-tucker multipliers and nonsmooth programs
- On optimality conditions in nondifferentiable programming
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Directionally Lipschitzian Functions and Subdifferential Calculus
- Directional Derivative Calculus and Optimality Conditions in Nonsmooth Mathematical Programming
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
This page was built for publication: General constraint qualifications in nondifferentiable programming
