Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Ellipsoid method

Related lectures (25)

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.

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.

Gradient Descent Methods

Covers gradient descent methods for convex and nonconvex problems, including smooth unconstrained convex minimization, maximum likelihood estimation, and examples like ridge regression and image classification.

Optimization Methods: Convexity and Gradient Descent

Explores optimization methods, including convexity, gradient descent, and non-convex minimization, with examples like maximum likelihood estimation and ridge regression.

Role of Computation in Optimization

Explores the role of computation in optimization, focusing on gradient descent for convex and nonconvex problems.

Implementation of Lists: SAbstractList.java

Covers the implementation of lists using SAbstractList.java and discusses the use of StringJoiner and iterators in Java programming.

Optimization with Constraints: KKT Conditions

Covers optimization with constraints using KKT conditions and matrix invertibility in numerical analysis.

Unweighted Bipartite Matching

Introduces unweighted bipartite matching and its solution using linear programming and the simplex method.

Optimal Power Flow Solvers: Next Generation Advancements

Explores advancements in optimal power flow solvers, focusing on multiperiod and security-constrained optimization.

Proximal and Subgradient Descent: Optimization Techniques

Discusses proximal and subgradient descent methods for optimization in machine learning.

Linked Lists: Implementation and Iteration

Covers the implementation of linked lists in Java, focusing on operations and testing.

The Local Hamiltonian Problem

Covers the Local Hamiltonian Problem, focusing on QMA-Complete problems and the complexity of verifying quantum computations.

Cutting Plane Methods Log in to Mediaspace to watch this video

Explores cutting plane methods, ellipsoid algorithm, and competitive algorithms for optimization.

Dual Transformation: Relaxed Formulation Log in to Mediaspace to watch this video

Covers dual transformation, relaxed formulation, and solving using separation oracle and subgradient methods.

Integer Programming: John's Theorem Log in to Mediaspace to watch this video

Explores integer programming, John's Theorem, and the reduction to shortest vector computations in convex bodies.

Nonlinear Programming: Part I Log in to Mediaspace to watch this video

Covers the fundamentals of Nonlinear Programming and its applications in Optimal Control, exploring techniques, examples, optimality definitions, and necessary conditions.

Interpolation Spaces Log in to Mediaspace to watch this video

Explores interpolation spaces in Banach spaces, emphasizing real continuous interpolation spaces and the K-method.

Convex Optimization Log in to Mediaspace to watch this video

Covers an overview of convex optimization, affine sets, polyhedra, ellipsoids, and convex functions.