General constraint qualifications in nondifferentiable programming
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1263981
- Constraint qualification in a general class of nondifferentiable mathematical programming problems
- Constraint qualification in a general class of Lipschitzian mathematical programming problems
- Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
- Constraint qualifications for nonsmooth programming
Cites work
- scientific article; zbMATH DE number 3964819 (Why is no real title available?)
- scientific article; zbMATH DE number 3724209 (Why is no real title available?)
- scientific article; zbMATH DE number 3760850 (Why is no real title available?)
- Calcul sous-différentiel et optimisation
- Convex Subcones of the Contingent Cone in Nonsmooth Calculus and Optimization
- Cores of Tangent Cones and Clarke's Tangent Cone
- Directional Derivative Calculus and Optimality Conditions in Nonsmooth Mathematical Programming
- Directionally Lipschitzian Functions and Subdifferential Calculus
- Generalized Directional Derivatives and Subgradients of Nonconvex Functions
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- Isotone tangent cones and nonsmooth optimization
- Kuhn-tucker multipliers and nonsmooth programs
- Necessary Conditions for the Bolza Problem
- Necessary and Sufficient Conditions for a Local Minimum. 1: A Reduction Theorem and First Order Conditions
- Nonsmooth Calculus in Finite Dimensions
- On conditions to have bounded multipliers in locally lipschitz programming
- On optimality conditions in nondifferentiable programming
- On optimality conditions in nonsmooth inequality constrained minimization
- On the cones of tangents with applications to mathematical programming
- Optimization and nonsmooth analysis
- Solvability results for sublinear functions and operators
- Tangency and differentiation: Some applications of convergence theory
- Tangent Cones, Generalized Gradients and Mathematical Programming in Banach Spaces
- Tangent Sets’ Calculus and Necessary Conditions for Extremality
- The Quantificational Tangent Cones
- Upper DSL approximates and nonsmooth optimization
Cited in
(27)- On constraint qualifications in nonlinear programming
- Constraint qualifications in nonsmooth multiobjective optimization
- On Frèchet normal cone for nonsmooth mathematical programming problems with switching constraints
- On Quasidifferentiable Functions and Non-Differentiable Programming
- Asymptotic behavior of solutions: an application to stochastic NLP
- Which subgradients have sum formulas?
- Theorem on an implicit function in quasidifferential calculus
- Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints
- Constraint qualification in a general class of Lipschitzian mathematical programming problems
- On constraint qualifications in nonsmooth optimization.
- Constraint qualifications in nonsmooth optimization: Classification and inter-relations
- Fixed point theorem in nonsmooth analysis and its applications
- scientific article; zbMATH DE number 2196501 (Why is no real title available?)
- Directional Derivative Calculus and Optimality Conditions in Nonsmooth Mathematical Programming
- Optimality Conditions for Nonconvex Constrained Optimization Problems
- On generalized constraints and certificates
- Differential stability in non-Lipschitzian optimization
- Small convex-valued subdifferentials in mathematical programming
- Necessary optimality conditions in terms of convexificators in Lipschitz optimization
- Constraint qualification in a general class of nondifferentiable mathematical programming problems
- Nonlinear programming and grossone: quadratic programing and the role of constraint qualifications
- Convex composite multi-objective nonsmooth programming
- Isotone tangent cones and nonsmooth optimization
- Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
- Nonsmooth constraint qualifications for nonconvex inequality systems
- Constraint qualifications for nonsmooth programming
- Optimality criteria and duality in multiobjective programming involving nonsmooth invex functions
This page was built for publication: General constraint qualifications in nondifferentiable programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q920847)
