Fenchel and Lagrange Duality are Equivalent
A basic result in ordinary (Lagrange) convex programming is the saddlepoint duality theorem concerning optimization problems with convex inequalities and linear-affine equalities satisfying a Slater condition. This note shows that this result is equivalent to the duality theorem of Fenchel.
| Váldodahkki: | |
|---|---|
| Materiálatiipa: | Working Paper |
| Giella: | en_US |
| Almmustuhtton: |
Massachusetts Institute of Technology, Operations Research Center
2004
|
| Liŋkkat: | http://hdl.handle.net/1721.1/5352 |