Abstract: This article studies a class of distributed nonsmooth convex optimization problems subject to local set constraints and coupled nonlinear inequality constraints. In particular, each local ...
Abstract: Nonconvexity is a usually overlooked factor in economic dispatch (ED). Enhancing the nonconvexity of the objective function leads traditional convex optimization algorithms easily to fall ...
Although computers are overwhelmingly digital today, there’s a good point to be made that analog computers are the more ...
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 ...
CRISP is a C++ library developed to efficiently solve contact-implicit motion planning problems, using a customized trust region Sequential Convex Programming (SCP) algorithm. CRISP computes entirely ...
1 Institute of Data Science and Engineering, Xuzhou University of Technology, Xuzhou, China 2 School of Mathematics and Statistics, Huaibei Normal University, Huaibei, China The ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback