Jump to content

MTL704: Difference between revisions

From IITD Wiki
[checked revision][checked revision]
Creating course page via bot
 
Bot: wrap bare course codes in wikilinks
 
Line 4: Line 4:
| credits = 3
| credits = 3
| credit_structure = 3-0-0
| credit_structure = 3-0-0
| pre_requisites = MTL103/MTL508
| pre_requisites = [[MTL103]]/[[MTL508]]
| overlaps =  
| overlaps =  
}}
}}

Latest revision as of 16:42, 14 April 2026

MTL704
Numerical Optimization
Credits 3
Structure 3-0-0
Pre-requisites MTL103/MTL508
Overlaps

MTL704 : Numerical Optimization

Unconstrained optimization techniques - one dimensional methods like Fibonacci method, Golden section method; higher dimension methods: pattern search method, Nelder and Meed method; gradient based methods: Steepest descent method, Newton method, Conjugate direction and gradient method, Quasi-Newton methods. Constrained optimization techniques - penalty method, barrier method, cutting plane method, projection gradient method. Heuristic technique: like Genetic programming method to solve non-convex programs.