Small convex-valued subdifferentials in mathematical programming
From MaRDI portal
Publication:4764586
DOI10.1080/02331939508844032zbMath0816.49007OpenAlexW2009260579MaRDI QIDQ4764586
No author found.
Publication date: 2 July 1995
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939508844032
nonsmooth analysislocally Lipschitz functionsMichel-Penot subdifferentialDini derivativesnonsmooth programming problemsFritz- John optimality condition
Related Items (16)
A finite dimensional extension of Lyusternik theorem with applications to multiobjective optimization ⋮ Optimality conditions for pessimistic bilevel problems using convexificator ⋮ From quasidifferentiable to directed subdifferentiable functions: exact calculus rules ⋮ On nonsmooth robust multiobjective optimization under generalized convexity with applications to portfolio optimization ⋮ Equivalence among various derivatives and subdifferentials of the distance function. ⋮ Necessary and sufficient optimality conditions for fractional multi-objective problems ⋮ KKT conditions for weak\(^\ast\) compact convex sets, theorems of the alternative, and optimality conditions ⋮ Optimality conditions in terms of convexificators for a bilevel multiobjective optimization problem ⋮ Vector subdifferentials via recession mappings∗∗this research was supported by grants from M.U.R.S.T (Itall) and the australian research council.$ef: ⋮ Necessary optimality conditions for bilevel set optimization problems ⋮ Convexifactors, generalized convexity, and optimality conditions ⋮ Necessary optimality conditions for bilevel optimization problems using convexificators ⋮ Tangent cone and contingent cone to the intersection of two closed sets ⋮ Directional upper derivatives and the chain rule formula for locally Lipschitz functions on Banach spaces ⋮ What is quasiconvex analysis? ⋮ Nonsmooth calculus, minimality, and monotonicity of convexificators
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- General constraint qualifications in nondifferentiable programming
- Inequality systems and minimax theorems
- The differentiability of real functions on normed linear space using generalized subgradients
- Subdifferentials of nonconvex vector-valued functions
- Weak directional closedness and generalized subdifferentials
- Maximum principle in the problem of time optimal response with nonsmooth constraints
- Differential stability in non-Lipschitzian optimization
- A Lagrange multiplier rule with small convex-valued subdifferentials for nonsmooth problems of mathematical programming involving equality and nonfunctional constraints
- Which subgradients have sum formulas?
- Locally compactly Lipschitzian mappings in infinite dimensional programming
- Characterization of nonsmooth functions through their generalized gradients
- Upper DSL approximates and nonsmooth optimization
- Optimization and nonsmooth analysis
- Shrinking generalized gradients
- On generalized differentials and subdifferentials of Lipschitz vector-valued functions
- Characterizations of optimality without constraint qualification for the abstract convex program
- A note on the existence of subgradients
- A constraint qualification in quasidifferentiable programming
- Composite Nonsmooth Programming with Gâteaux Differentiability
- A New Approach to Lagrange Multipliers
- First order approximations to nonsmooth mappings with application to metric regularity
- A generalized mean-value theorem and optimality conditions in composite nonsmooth minimization
- Approximations and Metric Regularity in Mathematical Programming in Banach Space
- State Constraints in Convex Control Problems of Bolza
- Sufficient conditions for extremum, penalty functions and regularity
This page was built for publication: Small convex-valued subdifferentials in mathematical programming
