Abstract
In this paper, we present some zero duality gap properties for convex composite optimization problems with conic constraints. By using the infimal convolution of conjugate functions and approximate subdifferential of convex functions, we give some new constraint qualifications which completely characterize the zero duality gap properties for composite conical programming problems in real locally convex Hausdorff topological vector spaces.
| Original language | English |
|---|---|
| Pages (from-to) | 53-69 |
| Number of pages | 17 |
| Journal | Journal of Nonlinear and Convex Analysis |
| Volume | 19 |
| Issue number | 1 |
| State | Published - 2018 |
Bibliographical note
Publisher Copyright:© 2018.
Keywords
- Composite functions
- Conical programming
- Constraint qualificartions
- Zero duality gap properties
ASJC Scopus subject areas
- Analysis
- Geometry and Topology
- Control and Optimization
- Applied Mathematics
Fingerprint
Dive into the research topics of 'Constraint qualifications and zero duality gap properties in conical programming involving composite functions'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver