Lecture

Quadratic Penalty Methods: Sound Problems

Related lectures (28)

Projected Gradient Descent and Quadratic Penalty

Covers Projected Gradient Descent and Quadratic Penalty methods for optimization problems.

Approximation Algorithms

Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.

Semi-Definite Programming

Covers semi-definite programming and optimization over positive semidefinite cones.

Optimization Methods: Theory Discussion

Explores optimization methods, including unconstrained problems, linear programming, and heuristic approaches.

Linear Programming: Weighted Bipartite Matching

Covers linear programming, weighted bipartite matching, and vertex cover problems in optimization.

Optimization with Constraints: KKT Conditions

Covers the KKT conditions for optimization with constraints, essential for solving constrained optimization problems efficiently.

Variational Problems: Convexity and Coercivity

Explores variational problems, emphasizing convexity and coercivity conditions in functionals with integral side constraints.

Optimisation in Energy Systems

Explores optimization in energy system modeling, covering decision variables, objective functions, and different strategies with their pros and cons.

Convex Optimization Tutorial: KKT Conditions

Explores KKT conditions in convex optimization, covering dual problems, logarithmic constraints, least squares, matrix functions, and suboptimality of covering ellipsoids.

Faster Gradient Descent: Projected Optimization Techniques

Covers faster gradient descent methods and projected gradient descent for constrained optimization in machine learning.

KKT and Convex Optimization

Covers the KKT conditions and convex optimization, discussing constraint qualifications and tangent cones of convex sets.

Quasi-newton optimization

Covers gradient line search methods and optimization techniques with an emphasis on Wolfe conditions and positive definiteness.

Introduction to Optimization

Covers the basics of optimization, including historical perspectives, mathematical formulations, and practical applications in decision-making problems.

Optimization with Constraints: Theory and Applications

Covers the theory and applications of optimization with constraints, including key concepts and numerical methods.

Trade-offs in Data and Time

Explores trade-offs between data and time in computational problems, emphasizing diminishing returns and continuous trade-offs.

Convexity of Lovász Extension

Explores the convexity of Lovász extension and submodular function maximization, focusing on extending functions to convex sets and proving their convexity.

Optimization Techniques: Stochastic Gradient Descent and Beyond

Discusses optimization techniques in machine learning, focusing on stochastic gradient descent and its applications in constrained and non-convex problems.

Primal-dual optimization: Theory and Computation

Explores primal-dual optimization, conjugation of functions, strong duality, and quadratic penalty methods in data mathematics.

Optimal Control: KKT Conditions

Explores optimal control and KKT conditions for non-linear optimization with constraints.

Optimization Methods

Covers unconstrained and constrained optimization, optimal control, neural networks, and global optimization methods.