On a notion of subdifferentiability for non-convex functions†

DOI10.1080/02331939508844059zbMath0831.49017MaRDI QIDQ4836752

Fabián Flores-Bazan

Publication date: 21 June 1995

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

lower semicontinuity; conjugate function; optimal value function; Lagrangian function; coupling function; subdifferentiability; non-convex functions; primal- dual problem

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

49J52: Nonsmooth analysis

49J45: Methods involving semicontinuity and convergence; relaxation

Related Items

Approximate minima via the ekeland variational principle¹, What is quasiconvex analysis?, Multipliers and general Lagrangians, Are dualities appropriate for duality theories in optimization?, On minima of the difference of functions, Critical duality, On the representation of approximate subdifferentials for a class of generalized convex functions, Image space approach and subdifferentials of integral functionals, Fenchel–Moreau conjugation for lower semi-continuous functions

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item