Skip to Main content Skip to Navigation

Selected Topics on Continuous Optimization

Abstract : This course starts with the presentation of the optimality conditions of an optimization problem described in a rather abstract manner, so that these can be useful for dealing with a large variety of problems. Next, the course describes and analyzes various advanced algorithms to solve optimization problems (nonsmooth methods, linearization methods, proximal and augmented Lagrangian methods, interior point methods) and shows how they can be used to solve a few classical optimization problems (linear optimization, convex quadratic optimization, semidefinite optimization (SDO), nonlinear optimization). Along the way, various tools from convex and nonsmooth analysis will be presented. Everything is conceptualized in finite dimension. The goal of the lectures is therefore to consolidate basic knowledge in optimization, on both theoretical and algorithmic aspects.
Document type :
Complete list of metadatas

Cited literature [5 references]  Display  Hide  Download
Contributor : Jean Charles Gilbert <>
Submitted on : Monday, January 4, 2016 - 7:37:55 PM
Last modification on : Thursday, March 5, 2020 - 3:30:25 PM
Document(s) archivé(s) le : Thursday, April 7, 2016 - 4:50:14 PM


  • HAL Id : cel-01249369, version 1


Jean Charles Gilbert. Selected Topics on Continuous Optimization. Master. Palaiseau, France. 2019, pp.148. ⟨cel-01249369v1⟩



Record views


Files downloads