Strong Duality for Generalized Convex Optimization Problems

R. I. Boţ, G. Kassay and G. Wanka
Additional contact information
R. I. Boţ: Chemnitz University of Technology
G. Kassay: Babeş – Bolyai University
G. Wanka: Chemnitz University of Technology

Journal of Optimization Theory and Applications, 2005, vol. 127, issue 1, No 3, 45-70

Abstract: Abstract In this paper, strong duality for nearly-convex optimization problems is established. Three kinds of conjugate dual problems are associated to the primal optimization problem: the Lagrange dual, Fenchel dual, and Fenchel-Lagrange dual problems. The main result shows that, under suitable conditions, the optimal objective values of these four problems coincide.

Keywords: Nearly convex sets; nearly convex functions; strong duality (search for similar items in EconPapers)
Date: 2005
References: View complete reference list from CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://link.springer.com/10.1007/s10957-005-6392-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:127:y:2005:i:1:d:10.1007_s10957-005-6392-5

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-005-6392-5

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().