arXiv Robotics — research abstracts· Jiarui Wang, Mahyar Fazlyab·· 3 days agoEditorial score22
Safe Sequential QCQP for Feasible Nonconvex Optimization
Anytime-Feasible First-Order Optimization via Safe Sequential QCQP
Summary
SS-QCQP ensures feasibility in nonconvex optimization with O(1/t) convergence. It maintains descent and feasibility via adaptive discretization. Experiments show comparable performance to second-order solvers.
Source: arXiv Robotics — research abstracts · Read original article ↗
Loading article text…
Source：arXiv Robotics — research abstracts · arxiv.org