Skip to main content
Graph
Search
fr
|
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Concept
Ellipsoid method
Formal sciences
Theoretical computer science
Algorithms and data structures
Combinatorial optimization
Graph Chatbot
Related lectures (25)
Login to filter by course
Login to filter by course
Reset
Previous
Page 1 of 3
Next
Cutting Plane Methods
Explores cutting plane methods, ellipsoid algorithm, and competitive algorithms for optimization.
Dual Transformation: Relaxed Formulation
Covers dual transformation, relaxed formulation, and solving using separation oracle and subgradient methods.
Integer Programming: John's Theorem
Explores integer programming, John's Theorem, and the reduction to shortest vector computations in convex bodies.
Nonlinear Programming: Part I
Covers the fundamentals of Nonlinear Programming and its applications in Optimal Control, exploring techniques, examples, optimality definitions, and necessary conditions.
Trajectory Optimization with CALIPSO
Introduces CALIPSO, a solver for trajectory optimization with constraints in robotics, showcasing methods and examples.
Optimisation with Constraints: Interior Point Algorithm
Explores optimization with constraints using KKT conditions and interior point algorithm on two examples of quadratic programming.
Interpolation Spaces
Explores interpolation spaces in Banach spaces, emphasizing real continuous interpolation spaces and the K-method.
Convex Optimization
Covers an overview of convex optimization, affine sets, polyhedra, ellipsoids, and convex functions.
Proximal Operators: Optimization Methods
Explores proximal operators, subgradient methods, and composite minimization in optimization.
Primal-dual Optimization: Lagrangian Methods
Explores primal-dual optimization with a focus on Lagrangian methods and their convergence, drawbacks, and enhancements.
