Closedness type regularity conditions in convex optimization and beyond
Abstrak
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 towards other classes of optimization problems where closedness type regularity conditions were successfully employed and discuss other possible applications of them.
Topik & Kata Kunci
Penulis (1)
Sorin-Mihai Grad
Akses Cepat
- Tahun Terbit
- 2016
- Sumber Database
- DOAJ
- DOI
- 10.3389/fams.2016.00014
- Akses
- Open Access ✓