Bibliographic Details
| Title: |
Fenchel-Lagrange Duality Versus Geometric Duality in Convex Optimization. |
| Authors: |
BOT, R. I.1, GRAD, S. M.2, WANKA, G.3 |
| Source: |
Journal of Optimization Theory & Applications. Apr2006, Vol. 129 Issue 1, p33-54. 22p. |
| Subjects: |
Duality theory (Mathematics), Geometric function theory, Complex variables, Convex geometry, Convex functions, Mathematical analysis, Variational inequalities (Mathematics), Calculus of variations, Differential inequalities |
| Abstract: |
We present a new duality theory to treat convex optimization problems and we prove that the geometric duality used by Scott and Jefferson in different papers during the last quarter of century is a special case of it. Moreover, weaker sufficient conditions to achieve strong duality are considered and optimality conditions are derived. Next, we apply our approach to some problems considered by Scott and Jefferson, determining their duals. We give weaker sufficient conditions to achieve strong duality and the corresponding optimality conditions. Finally, posynomial geometric programming is viewed also as a particular case of the duality approach that we present. [ABSTRACT FROM AUTHOR] |
|
Copyright of Journal of Optimization Theory & Applications is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
