 Full-Text PDF
DOI:10.19101/IJATEE.2018.542013
|
| Paper Title |
: |
Optimization of convex functions with fenchel biconjugation and duality |
| Author Name |
: |
Vinod Kumar Bhardwaj |
| Abstract |
: |
Analysis of conjugation operations to induce a bijection between proper closed convex functions and to discuss the problems of boundedness of closed convex proper functions using continuity of conjugates. Present study shows a great contribution of biconjugation of convex functions in optimization. Fenchel biconjugation describes the relation of duality in optimization. Problems of finite dimensional Lagrangian convex duality theory and problems on duality gap are comparative of primal and dual solutions in convex optimization. |
| Keywords |
: |
Convex functions, Fenchel biconjugation, Lagrangian duality, Optimization. |
| Cite this article |
: |
Vinod Kumar Bhardwaj, " Optimization of convex functions with fenchel biconjugation and duality " ,
International Journal of Advanced Technology and Engineering Exploration (IJATEE), Volume-5, Issue-42, May-2018 ,pp.83-88.DOI:10.19101/IJATEE.2018.542013 |
| References |
: |
|
[1]Rockafellar RT. Convex analysis. Princeton University Press Princeton. New Jersey. 1997.
|
| [Google Scholar] |
|
[2]Rockafellar RT, Wets RJ. Variational analysis. Springer Science & Business Media; 2009.
|
| [Google Scholar] |
|
[3]Ekeland I, Temam R. Convex analysis and variational problems. SIAM; 1999.
|
| [Google Scholar] |
|
[4]Dem yanov VF, Malozemov VN. Introduction to minimax. Courier Corporation; 1990.
|
| [Google Scholar] |
|
[5]Borwein JM, Lewis AS, Noll D. Maximum entropy spectral analysis using first order information. Part I: fisher information and convex duality. Mathematics of Operations Research. 1996; 21:442-68.
|
| [Google Scholar] |
|
[6]Nesterov Y, Nemirovskii A. Interior-point polynomial algorithms in convex programming. SIAM; 1994.
|
| [Google Scholar] |
|
[7]Phelps RR. Convex functions, monotone operators and differentiability. Lecture Notes in Mathematics. 1989; 1364:425-30.
|
| [Google Scholar] |
|
[8]Peressini AL, Sullivan FE, Uhl JJ. The mathematics of nonlinear programming. New York: Springer-Verlag; 1988.
|
| [Google Scholar] |
|
[9]Holmes RB. Geometric functional analysis and its applications. Springer Science & Business Media; 1975.
|
| [Google Scholar] |
|
[11]Yang XQ. On the gap functions of prevariational inequalities. Journal of Optimization Theory and Applications. 2003; 116(2):437-52.
|
| [Crossref] |
[Google Scholar] |
|
[12]Zhang J, Wan C, Xiu N. The dual gap function for variational inequalities. Applied Mathematics and Optimization. 2003; 48(2):129-48.
|
| [Crossref] |
[Google Scholar] |
|
[13]Bertsekas DP. Nonlinear programming. Belmont: Athena Scientific; 1999.
|
| [Google Scholar] |
|
[14]Li C, Fang D, López G, López MA. Stable and total fenchel duality for convex optimization problems in locally convex spaces. SIAM Journal on Optimization. 2009; 20(2):1032-51.
|
| [Crossref] |
[Google Scholar] |
|
[15]Jeyakumar V, Li GY. Strong duality in robust convex programming: complete characterizations. SIAM Journal on Optimization. 2010; 20(6):3384-407.
|
| [Crossref] |
[Google Scholar] |
|
[16]Wang M, Fang D, Chen Z. Strong and total Fenchel dualities for robust convex optimization problems. Journal of Inequalities and Applications. 2015; 2015:70.
|
| [Crossref] |
[Google Scholar] |
|
[17]Fajardo MD, Vidal J. Stable strong Fenchel and Lagrange duality for evenly convex optimization problems. Optimization. 2016; 65(9):1675-91.
|
| [Crossref] |
[Google Scholar] |
|
