| R.J. Dun. Innite programs. In H.W. Kuhn and A.W. Tucker, editors, Annals of Mathematical Studies 38, pages 157-170, Princeton, N.J., 1956. Princeton University Press. |
....2 C; and its dual: D : v : supremum y;s b T y s.t. A T y s = c s 2 C ; where C X is a closed convex cone in the ( nite) n dimensional linear vector space X, and b lies in the ( nite) m dimensional vector space Y . This format for convex optimization dates back at least to Dun [2]. Strong duality results can be found in [2] as well as in Ben Israel et al. 1] For 0 and 0, we de ne the and level sets for the primal and dual problems as follows: P : n x j Ax = b; x 2 C; c T x z o and D : n s j A T y s = c; s 2 C for some y 2 Y ....
....y;s b T y s.t. A T y s = c s 2 C ; where C X is a closed convex cone in the ( nite) n dimensional linear vector space X, and b lies in the ( nite) m dimensional vector space Y . This format for convex optimization dates back at least to Dun [2] Strong duality results can be found in [2] as well as in Ben Israel et al. 1] For 0 and 0, we de ne the and level sets for the primal and dual problems as follows: P : n x j Ax = b; x 2 C; c T x z o and D : n s j A T y s = c; s 2 C for some y 2 Y satisfying b T y v o : We make the ....
R.J. Dun. Innite programs. In H.W. Kuhn and A.W. Tucker, editors, Annals of Mathematical Studies 38, pages 157-170, Princeton, N.J., 1956. Princeton University Press.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC