Feedback stabilization methods for the solution of nonlinear programming problems
From MaRDI portal
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.
Recommendations
- Global dynamical solvers for nonlinear programming problems
- Convergence analysis of a differential equation approach for solving nonlinear programming problems
- A feasible SQP method for nonlinear programming
- An optimal control theory for nonlinear optimization
- scientific article; zbMATH DE number 124136
Cites work
- scientific article; zbMATH DE number 37929 (Why is no real title available?)
- scientific article; zbMATH DE number 3480387 (Why is no real title available?)
- scientific article; zbMATH DE number 1269194 (Why is no real title available?)
- scientific article; zbMATH DE number 2046035 (Why is no real title available?)
- scientific article; zbMATH DE number 917233 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- A Recurrent Neural Network for Nonlinear Convex Optimization Subject to Nonlinear Inequality Constraints
- A `universal' construction of Artstein's theorem on nonlinear stabilization
- A differential equation approach to nonlinear programming
- A review of Hopfield neural networks for solving mathematical programming problems
- Algorithms for unconstrained optimization problems via control theory
- Barrier-projective methods for nonlinear programming
- Constant-rank condition and second-order constraint qualification
- Convergence analysis of a differential equation approach for solving nonlinear programming problems
- Feedback stabilization methods for the numerical solution of ordinary differential equations
- Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
- How Stringent is the Linear Independence Assumption for Mathematical Programs with Complementarity Constraints?
- Multivariable Newton-based extremum seeking
- ODE versus SQP methods for constrained optimization
- Optimization and dynamical systems
- Robust nonlinear control design. State-space and Lyapunov techniques
- Solving Ordinary Differential Equations I
- Solving ordinary differential equations. II: Stiff and differential-algebraic problems.
- Stability and stabilization of nonlinear systems.
- Stabilization with relaxed controls
- Stochastic averaging and stochastic extremum seeking
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- The steepest descent dynamical system with control. Applications to constrained minimization
- Viability theory
Cited in
(5)- A proportional-derivative control strategy for restarting the GMRES(\(m\)) algorithm
- Algorithm for Finding Feedback in a Problem with Constraints for One Class of Nonlinear Control Systems
- Time-varying continuous-time optimisation with pre-defined finite-time stability
- Global dynamical solvers for nonlinear programming problems
- Using feedback functions in linear programming problems
This page was built for publication: Feedback stabilization methods for the solution of nonlinear programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q398644)
