2000 character limit reached
On-line Non-Convex Constrained Optimization
Published 16 Sep 2019 in math.OC, cs.LG, cs.SY, and eess.SY | (1909.07492v1)
Abstract: Time-varying non-convex continuous-valued non-linear constrained optimization is a fundamental problem. We study conditions wherein a momentum-like regularising term allow for the tracking of local optima by considering an ordinary differential equation (ODE). We then derive an efficient algorithm based on a predictor-corrector method, to track the ODE solution.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.