Sequential Convex Programming Methods For

Sequential Convex Programming Methods for Real-time Optimal Trajectory Planning in Autonomous Racing

This video visualizes the work presented in "

Lecture 11 | Convex Optimization II (Stanford)

Professor Boyd lectures on

What Is Mathematical Optimization?

A gentle and visual introduction to the topic of

The Effectiveness of Convex Programming in the Information and Physical Sciences

Emmanuel Candès, Stanford University Simons Institute Open Lectures ...

The Karush–Kuhn–Tucker (KKT) Conditions and the Interior Point Method for Convex Optimization

A gentle and visual introduction to the topic of

GuSTO: Guaranteed Sequential Trajectory Optimization via Sequential Convex Programming

This work presents gusto a framework for guaranteed

sequential convex programming for real-time powered descent guidance

github: https://github.com/carlosmgnc/scp_descent_guidance original paper: https://arxiv.org/pdf/1802.03827.

Lecture 14 | Convex Optimization II (Stanford)

Lecture by Professor Stephen Boyd for

Ana Radovanovic - Sequential Convex Programming for OPF

... operating point point in the next iteration so you see this is a

Algebraic Methods in Convex Optimization (Kevin Shu, 02.13.2025 at UCLA)

Title: Algebraic

Lecture 15 | Convex Optimization II (Stanford)

Lecture by Professor Stephen Boyd for

Stanford EE364A Convex Optimization I Stephen Boyd I 2023 I Lecture 1

To follow along with the course, visit the course website: https://web.stanford.edu/class/ee364a/ Stephen Boyd...

Convex Optimization in a Nonconvex World: Applications for Aerospace Systems

Ph.D. thesis defense, June 9 2021.