This repository contains the code to reproduce the examples in the paper Motion Planning around Obstacles with Convex Optimization by Tobia Marcucci, Mark Petersen, David von Wrangel, and Russ Tedrake ...
Primal-dual methods in online optimization give several of the state-of-the art results in both of the most common models: adversarial and stochastic/random order. Here we try to provide a more ...
Online Set Cover and Load Balancing are central problems in online optimization, and there is a long line of work on developing algorithms for these problems with convex objectives. Although we know ...
Abstract: Convex hull pricing (CHP) is a pivotal approach to enhance market transparency by minimizing uplift costs. This pa per revisits the mathematical foundation of CHP and provides an explicit ...
Abstract: Distribution network optimization is represented by non-convex power flow equations, where traditional convex relaxation methods may lead to inaccurate or infeasible solutions. To ...
A C++ toolkit for Convex Optimization (Logistic Loss, SVM, SVR, Least Squares etc.), Convex Optimization algorithms (LBFGS, TRON, SGD, AdsGrad, CG, Nesterov etc.) and ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback