AIL711: Difference between revisions
| [checked revision] | [checked revision] |
Prashantt492 (talk | contribs) 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 = AIL701 | | pre_requisites = [[AIL701]] | ||
| overlaps = MTL704, CLL782 | | overlaps = [[MTL704]], [[CLL782]] | ||
}} | }} | ||
== AIL711 : Numerical Optimization == | == AIL711 : Numerical Optimization == | ||
General properties of algorithm, global convergence, rate of convergence, unconstrained optimization techniques - one dimensional methods: Fibonacci method, Golden section method, interpolation. Multi-dimensional methods: pattern search method, Nelder and Meed method, gradient based methods: steepest descent method and its variants recall, conjugate direction and gradient method, quasi-Newton method. Constrained optimization techniques - penalty method, barrier method, projection gradient method, sequential quadratic programming approach. Semidefinite and cone programmingYardi School of Artificial Intelligence | General properties of algorithm, global convergence, rate of convergence, unconstrained optimization techniques - one dimensional methods: Fibonacci method, Golden section method, interpolation. Multi-dimensional methods: pattern search method, Nelder and Meed method, gradient based methods: steepest descent method and its variants recall, conjugate direction and gradient method, quasi-Newton method. Constrained optimization techniques - penalty method, barrier method, projection gradient method, sequential quadratic programming approach. Semidefinite and cone programmingYardi School of Artificial Intelligence | ||
Latest revision as of 16:21, 14 April 2026
| AIL711 | |
|---|---|
| Numerical Optimization | |
| Credits | 3 |
| Structure | 3-0-0 |
| Pre-requisites | AIL701 |
| Overlaps | MTL704, CLL782 |
AIL711 : Numerical Optimization
General properties of algorithm, global convergence, rate of convergence, unconstrained optimization techniques - one dimensional methods: Fibonacci method, Golden section method, interpolation. Multi-dimensional methods: pattern search method, Nelder and Meed method, gradient based methods: steepest descent method and its variants recall, conjugate direction and gradient method, quasi-Newton method. Constrained optimization techniques - penalty method, barrier method, projection gradient method, sequential quadratic programming approach. Semidefinite and cone programmingYardi School of Artificial Intelligence