MA61033: Optimization By Vector Space Methods
Jump to navigation
Jump to search
| MA61033 | |
|---|---|
| Course name | Optimization by Vector Space Methods |
| Offered by | Mathematics |
| Credits | 4 |
| L-T-P | 3-1-0 |
| Previous Year Grade Distribution | |
| {{{grades}}} | |
| Semester | {{{semester}}} |
Syllabus
Syllabus mentioned in ERP
Prerequisite: Functional AnalysisGeometric form of Hahn-Banach theorem, convex sets and cones, convex functionals in normed linear spaces, optimization by convex functional, conjugate convex functionals, sub-differentiable convex functionals, monotone operator and its relation with convex functional, dual optimization problem, Fenchel duality theorem, minimax theorem of game theory, Lagranges multiplier, sufficiency, sensitivity, Lagrange duality, Kuhn-Tucker theorem, complementarity problem.