Abstract
The closedness type regularity conditions have proven during the last decade to be viable alternatives to their more restrictive interiority type counterparts, in both convex optimization and different areas where it was successfully applied. In this review article we de- and reconstruct some closedness type regularity conditions formulated by means of epigraphs and subdifferentials, respectively, for general optimization problems in order to stress that they arise naturally when dealing with such problems. The results are then specialized for constrained and unconstrained convex optimization problems. We also hint toward other classes of optimization problems where closedness type regularity conditions were successfully employed and discuss other possible applications of them.
| Original language | English |
|---|---|
| Article number | 14 |
| Journal | Frontiers in Applied Mathematics and Statistics |
| Volume | 2 |
| DOIs | |
| Publication status | Published - 16 Sept 2016 |
| Externally published | Yes |
Keywords
- 26A51
- 90C25
- 90C46
- closedness type regularity conditions
- conjugate functions
- convex optimization
- duality
- epigraphs
- subdifferentials
Fingerprint
Dive into the research topics of 'Closedness Type Regularity Conditions in Convex Optimization and Beyond'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver