Anytime-Feasible First-Order Optimization via Safe Sequential QCQP
The Safe Sequential QCQP algorithm is a first-order method for solving inequality-constrained nonconvex problems that guarantees feasibility at every step. It uses continuous dynamics derived from a convex QCQP to ensure monotonic objective descent and maintains an O(1/t) convergence rate to first-order stationary points.