Transcription of Convex Optimization Theory - Athena Scientific
{{id}} {{{paragraph}}}
Convex Optimization Theory A SUMMARY. BY. DIMITRI P. BERTSEKAS. We provide a summary of theoretical concepts and results relating to Convex analysis, Convex Optimization , and duality Theory . In particular, we list the relevant definitions and propositions (without proofs) of the author's book Convex Optimization Theory , Athena Scientific , 2009. For ease of use, the chapter, section, definition, and proposition numbers of the latter book are identical to the ones of this appendix. CHAPTER 1: Basic Concepts of Convex Analysis Section Convex Sets and Functions Definition : A subset C of n is called Convex if x + (1 )y C, x, y C, [0, 1].
Convex Optimization Theory A SUMMARY BY DIMITRI P. BERTSEKAS We provideasummaryoftheoreticalconceptsandresultsrelatingto convex analysis, convex optimization, and ...
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}