Optimization : Nonlinear programming [ LINMA2460 ]
5.0 crédits ECTS
30.0 h + 22.5 h
2q
| Teacher(s) |
Nesterov Yurii ;
|
| Language |
English
|
Place
of the course |
Louvain-la-Neuve
|
| Main themes |
General nonlinear optimization. Smooth and non-smooth convex optimization. Interior-point methods. Prerequisites: standard undergraduate level in Linear Algebra and Calculus.
|
| Aims |
Introduce a modern theory of optimization and general principles of complexity analysis of algorithms for solving nonlinear problems. Present the most efficient algorithmic schemes.
|
| Content |
-General problem of nonlinear optimization. Black-box concept. Iterative methods and analytical complexity. Gradient method and Newton method. Local complexity analysis.
-Convex optimization: convex sets and functions; minimization of differentiable and non-differentiable convex functions; lower complexity bounds; optimal methods.
-Interior-point methods: notion of self-concordant functions and barriers; path-following methods; structural optimization.
|
| Other information |
- copy of transparencies and of the text of the lectures.
- Yu.Nesterov. "Introductory lectures on convex optimization. Basic course." Kluwer 2003
- P. Polyak, « Introduction in optimization », J. Willey & Sons, 1989
- Yu. Nesterov, A. Nemirovsky, « Interior-point polynomial algorithms in nonlinear optimization », SIAM, Philadelphia, 1994.
The course is given in English.
Evaluation: a written exam (in French or in English).
|
Cycle et année
d'étude |
> Master [120] in Mathematical Engineering
|
Faculty or entity
in charge |
> MAP
|
<<< Page précédente
