Show simple item record

6.253 Convex Analysis and Optimization, Spring 2004

dc.contributor.authorBertsekas, Dimitrien_US
dc.coverage.temporalSpring 2004en_US
dc.date.issued2004-06
dc.identifier6.253-Spring2004
dc.identifierlocal: 6.253
dc.identifierlocal: IMSCP-MD5-69ba2e33bd2e74035f531c2e1380f111
dc.identifier.urihttp://hdl.handle.net/1721.1/70523
dc.description.abstract6.253 develops the core analytical issues of continuous optimization, duality, and saddle point theory, using a handful of unifying principles that can be easily visualized and readily understood. The mathematical theory of convex sets and functions is discussed in detail, and is the basis for an intuitive, highly visual, geometrical approach to the subject.en_US
dc.languageen-USen_US
dc.rights.uriUsage Restrictions: This site (c) Massachusetts Institute of Technology 2012. Content within individual courses is (c) by the individual authors unless otherwise noted. The Massachusetts Institute of Technology is providing this Work (as defined below) under the terms of this Creative Commons public license ("CCPL" or "license") unless otherwise noted. The Work is protected by copyright and/or other applicable law. Any use of the work other than as authorized under this license is prohibited. By exercising any of the rights to the Work provided here, You (as defined below) accept and agree to be bound by the terms of this license. The Licensor, the Massachusetts Institute of Technology, grants You the rights contained here in consideration of Your acceptance of such terms and conditions.en_US
dc.subjectaffine hullsen_US
dc.subjectrecession conesen_US
dc.subjectglobal minimaen_US
dc.subjectlocal minimaen_US
dc.subjectoptimal solutionsen_US
dc.subjecthyper planesen_US
dc.subjectminimax theoryen_US
dc.subjectpolyhedral convexityen_US
dc.subjectpolyhedral conesen_US
dc.subjectpolyhedral setsen_US
dc.subjectconvex analysisen_US
dc.subjectoptimizationen_US
dc.subjectconvexityen_US
dc.subjectLagrange multipliersen_US
dc.subjectdualityen_US
dc.subjectcontinuous optimizationen_US
dc.subjectsaddle point theoryen_US
dc.subjectlinear algebraen_US
dc.subjectreal analysisen_US
dc.subjectconvex setsen_US
dc.subjectconvex functionsen_US
dc.subjectextreme pointsen_US
dc.subjectsubgradientsen_US
dc.subjectconstrained optimizationen_US
dc.subjectdirectional derivativesen_US
dc.subjectsubdifferentialsen_US
dc.subjectconical approximationsen_US
dc.subjectLagrange multipliersen_US
dc.subjectFritz John optimalityen_US
dc.subjectExact penalty functionsen_US
dc.subjectconjugate dualityen_US
dc.subjectconjugate functionsen_US
dc.subjectFenchel dualityen_US
dc.subjectexact penalty functionsen_US
dc.subjectdual computational methodsen_US
dc.title6.253 Convex Analysis and Optimization, Spring 2004en_US
dc.title.alternativeConvex Analysis and Optimizationen_US


Files in this item

Thumbnail
Name:
6-253-spring-2004/contents/ind ...
Size:
15.70Kb
Format:
HTML
View/Open

This item appears in the following Collection(s)

Show simple item record