Home - Search by Faculty - By teacher - By course


MATH0041-1

Optimisation algorithms


Duration :30h Th, 30h Pr
Credits/ECTS :
2nd year of a Bachelor's degree in computers sciences6
2nd "candidature" in computer6
Holder(s) :François‑Xavier Litt
Course contents : Linear programming, simplex algorithm, duality.
Fundamental notions: convexity, global convergence, asymptotic convergence.
One-dimensionnal optimisation, exact and approximate.
Unconstrained n-dimensionnal optimisation: first and second order conditions, gradient, conjugate gradient, Newton and quasi-Newton methods.
Constrained n-dimensionnal optimisation: first and second order conditions, generalised reduced gradient, augmented Lagrangian and quadratic recursive methods.
Course objective : To introduce students to basic optimisation problems.
Prerequisites : Knowledge of mathematical analysis and linear algebra.

Particular link with another course:
  • Downstream: MATH0020-1 Numerical methods of optimisation.
Workshops : Practical lessons every monday from 16:00 to 18:00
Organization : This course is taught at the first semester.
Lectures: every monday from 14:00 to 16:00.
Practical lessons: as indicated above.
Written notes :
  • Working book:
    Algorithmes d'optimisation, F.X. Litt; on sale at AEES.
  • Recommended readings:
    see list in the working book.
Assessment : 1st session: open book written exam in january, no oral exam.
2nd session (september): open book written exam, no oral exam.
Contacts : Teacher: F.X.Litt, Institut Montefiore, B28, Sart Tilman, 4000 Liège ; Tél. 04/366.26.92 ; Fax 04/366.28.74 ; e-mail FX.Litt@ulg.ac.be
Secretary : M.T.Ratz, Tél 04/366.26.81; e-mail MT.Ratz@ulg.ac.be
Assistant : D. Detry, V. Leroy, C. Thiernesse.
NB: Modifications of this list can occur during the academic year.
Remarks : Every attributed grade can be maintained.




ULg : Students and Studies Administration - Academic Affairs
Contact : Monique Marcourt, direction A.E.E.
Date of data : 27/02/2006
Developed by SEGI