Abstract: Decentralized optimization strategies are helpful for various applications, from networked estimation to distributed machine learning. This paper studies finite-sum minimization problems ...

Abstract: This article addresses the distributed prescribed-time convex optimization (DPTCO) problem for high-order nonlinear multiagent systems (MASs) under undirected connected graphs. A cascade ...

Let C be a closed convex subset of the Banach space X. A subset F of C is called a nonexpansive retract of C if either F = ⊘ or there exists a retraction of C onto F which is a nonexpansive mapping.

This is the official project repository for Adaptive Dual Uncertainty Optimization: Boosting Monocular 3D Object Detection under Test-Time Shifts 🔗 by Zixuan Hu, Dongxiao Li, Xinzhu Ma, Shixiang Tang ...

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 ...