Feedback Stabilization Methods for the Solution of Nonlinear Programming Problems
Iasson Karafyllis

TL;DR
This paper introduces a family of feedback stabilization dynamical systems for nonlinear programming problems, ensuring convergence to critical points using control Lyapunov functions without prior knowledge of these points.
Contribution
It presents a novel method to construct dynamical systems that guarantee global convergence to critical points in nonlinear programming, based on control Lyapunov functions.
Findings
Dynamical systems with equilibrium points at critical points
Lyapunov functions equal to the objective function
Algorithms guaranteeing global convergence
Abstract
In this work we show that given a nonlinear programming problem, it is possible to construct a family of dynamical systems defined on the feasible set of the given problem, so that: (a) the equilibrium points are the unknown critical points of the problem, (b) each dynamical system admits the objective function of the problem as a Lyapunov function, and (c) explicit formulae are available without involving the unknown critical points of the problem. The construction of the family of dynamical systems is based on the Control Lyapunov Function methodology, which is used in mathematical control theory for the construction of stabilizing feedback. The knowledge of a dynamical system with the previously mentioned properties allows the construction of algorithms which guarantee global convergence to the set of the critical points.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsExtremum Seeking Control Systems · Advanced Control Systems Optimization · Advanced Optimization Algorithms Research
