On a notion of subdifferentiability for non-convex functions†
From MaRDI portal
Publication:4836752
DOI10.1080/02331939508844059zbMath0831.49017OpenAlexW2049138554MaRDI QIDQ4836752
Publication date: 21 June 1995
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939508844059
lower semicontinuityconjugate functionoptimal value functionLagrangian functioncoupling functionsubdifferentiabilitynon-convex functionsprimal- dual problem
Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52) Methods involving semicontinuity and convergence; relaxation (49J45)
Related Items (15)
Regularly abstract convex functions with respect to the set of Lipschitz continuous concave functions ⋮ On minima of the difference of functions ⋮ Multipliers and general Lagrangians ⋮ Level sets regularization with application to optimization problems ⋮ Image space approach and subdifferentials of integral functionals ⋮ Approximate minima via the ekeland variational principle1 ⋮ Critical duality ⋮ On the representation of approximate subdifferentials for a class of generalized convex functions ⋮ Are dualities appropriate for duality theories in optimization? ⋮ What is quasiconvex analysis? ⋮ Semi-continuous quadratic optimization: existence conditions and duality scheme ⋮ Representation of generalized monotone multimaps ⋮ Conjugacies adapted to lower semicontinuous functions ⋮ Fenchel–Moreau conjugation for lower semi-continuous functions ⋮ Projective dualities for quasiconvex problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The multiplier method of Hestenes and Powell applied to convex programming
- An Extension of Duality-Stability Relations to Nonconvex Optimization Problems
- On $\Phi $-Convexity in Extremal Problems
- Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
This page was built for publication: On a notion of subdifferentiability for non-convex functions†
