Composite Convex Minimization

Related lectures (30)

Explores gradient descent, loss functions, and optimization techniques in neural network training.

Explores VC dimension, gradient descent, convex sets, and Lipschitz functions in convex optimization.

Explores convex constrained optimization through Projected Gradient Descent, focusing on tangent space and iterative minimization.

Covers polynomial regression, gradient descent, overfitting, underfitting, regularization, and feature scaling in optimization algorithms.

Explores derivatives, local extrema, and convexity in functions, including Taylor's formula and function compositions.

Discusses Brenier's theorem in optimal transport and the uniqueness of the optimizer.

Covers Doignon's theorem in integer programming, stating that a set is minimally infeasible if the removal of any constraint makes it feasible.

Introduces elementary concepts of convex functions, including hulls, transformations, conditions, and examples.

Covers limits and derivatives in multivariable functions, focusing on continuity, partial derivatives, and the gradient.

Explores quantile regression for electricity price prediction using time series data, regularization, and the kernel trick.

Page 2 of 2