Skip to content

handsomeboy/Convex-Optimization-1

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

23 Commits
 
 
 
 
 
 

Repository files navigation

Convex optimization

The material here is from the ETH lecture Advanced topics in Control. In 2020 spring, the topic is about large scale convex optimization.

Heads up

Large scale in the sense 100k - 1B variables, constraints. Not ideal for robotics application. Some solvers: YALMIP, CVX (MATLAB), CVXPY (Python), MOSEK (for smaller medium problem)

Lectures include following topics: ( I also added a non-exhaustive introduction under each topic, need to summarize a better one in the future)

Introduction

Convex Sets

Convex Functions

Convex Optimization Problems

Feasibility problem

Indicator function can be introduced to translate the constrained problem into an unconstrained problem.

QCQP: (quadratically constrained quadratic programming)

In robotics, we are often faced with such convex optimization problems.

SOCP: (second oprder cone programming)

A general form, the cost function is a linear programming. The inequality function requires the affine function to lie in the second-order cone.

Conic Programming

A more general form than SOCP, where the inequality constraints are simply a k-second order cone.

Semidefinite Programming

Here inequality constraint becomes linear matrix inequality.

Duality

Weak duality

Strong duality

One reason we use duality is that we can then turn the optimization into another potentially-easy-to-solve optimization problem.

Dual functions

Fermat's rule

$x\in \min f$ $\leftrightarrow$ $0\in\partial f(x)$

Definition of partial gradient

Composite Minimization

In the objective, we have two separable items, which is often the case, for example, regularization. To optimize the composite minimization problem, we can use Fermat's rule and turn to operator splitting methods.

Gradient Descent Methods

Coordinate Descent Methods

Operator Splitting Methods

Alternating Direction Method of Multipliers

Distributed Optimization Methods

global consensus problem

sharing problem

resource allocation problem

Signal Denoising and Regression Models

Classification Models

Applications

About

ETH Course: Advanced Topics in Control

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published