Feedback stabilization methods for the solution of nonlinear programming problems
\noindent The goal of the paper is to show the construction of a well-defined dynamical system on the feasible set of a nonlinear programming problem (NLP) with the following properties:\newline P 1: The conditions of Nagumo's theorem, given on p. 27 of \textit{J.-P. Aubin} [Viability theory. Boston, MA etc.: Birkhäuser (1991; Zbl 0755.93003)] must be satisfied.\newline P 2: The vector field appearing in the right-hand side of the dynamical system is a locally Lipschitz vector field.\newline P 3: The equilibrium points of the dynamical system are exactly the points for which the necessary Karush-Kuhn-Tucker conditions of the NLP hold.\newline P 4: The objective function of the NLP is a (strict) Lyapunov function for the dynamical system.\newline P 5: The vector field appearing in the right-hand side of the dynamical system must be explicitly known.\newline P 6: The vector field appearing in the right-hand side of the dynamical system must have free parameters, which can be selected in an appropriate way so that the convergence properties of the corresponding numerical schemes to the global attractor of the dynamical system are optimal.\newline The author claims that the theory used for the construction of the algorithm is different from other existing algorithms, although other algorithms have much better characteristics than the algorithms proposed in this paper. So, no claim is made about the effectiveness of the proposed algorithms. Moreover, no claim is made about the generality of the results: the linear independence constraint qualification assumed in this work is a restrictive assumption. The paper provides some examples, which show the performance of the algorithms.
- 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
- A `universal' construction of Artstein's theorem on nonlinear stabilization
- A differential equation approach to nonlinear programming
- A Recurrent Neural Network for Nonlinear Convex Optimization Subject to Nonlinear Inequality Constraints
- 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?
- 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?)
- 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
- A proportional-derivative control strategy for restarting the GMRES(\(m\)) algorithm
- Using feedback functions in linear programming problems
- Time-varying continuous-time optimisation with pre-defined finite-time stability
- Global dynamical solvers for nonlinear programming problems
- Algorithm for Finding Feedback in a Problem with Constraints for One Class of Nonlinear Control Systems
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)
