ODE versus SQP methods for constrained optimization
We review some methods which are designed to solve equality constrained minimization problems by following the trajectory defined by a system of ordinary differential equations. The numerical performance of a number of these methods is compared with that of some popular sequential quadratic programming (SQP) algorithms. On a set of eighteen ``difficult test problems, we observe that several of the ODE methods are more successful than any of the SQP techniques. We suggest that these experimental results indicate the need for research both to analyze and develop new ODE techniques and also to strengthen the currently available SQP algorithms.
- A dynamical systems approach to constrained minimization
- scientific article; zbMATH DE number 37929
- scientific article; zbMATH DE number 1069183
- An ODE method of solving nonlinear programming
- Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
- A Newton-type curvilinear search method for constrained optimization
- A relaxation method for solving problems of non-linear programming
- Conjugate gradient method for computing the Moore-Penrose inverse and rank of a matrix
- Constrained optimization along geodesics
- scientific article; zbMATH DE number 4170174 (Why is no real title available?)
- scientific article; zbMATH DE number 3696839 (Why is no real title available?)
- scientific article; zbMATH DE number 3492464 (Why is no real title available?)
- scientific article; zbMATH DE number 3583207 (Why is no real title available?)
- scientific article; zbMATH DE number 3801319 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- ODE versus SQP methods for constrained optimization
- Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
- Test examples for nonlinear programming codes
- Variational methods for the solution of problems of equilibrium and vibrations
- Constrained optimization: Projected gradient flows
- Direct transcription solution of optimal control problems with higher-order state constraints: theory vs practice
- Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
- ODE versus SQP methods for constrained optimization
- K-K-T multiplier estimates and objective function lower bounds from projective SUMT
- A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set
- Algorithms for unconstrained optimization problems via control theory
- Identification of flexural rigidity in a Kirchhoff plates model using a convex objective and continuous Newton method
- Continuation methods with the trusty time-stepping scheme for linearly constrained optimization with noisy data
- The regularization continuation method with an adaptive time step control for linearly constrained optimization problems
- Optimal homotopy asymptotic method-least square for solving nonlinear fractional-order gradient-based dynamic system from an optimization problem
- Two differential equation systems for equality-constrained optimization
- A curvilinear search algorithm for unconstrained optimization by automatic differentiation
- Feedback stabilization methods for the solution of nonlinear programming problems
- scientific article; zbMATH DE number 37918 (Why is no real title available?)
- A dynamical systems approach to constrained minimization
- scientific article; zbMATH DE number 954686 (Why is no real title available?)
- Global dynamical solvers for nonlinear programming problems
- ODE methods for optimization with equality constraints
- On the mathematics of the natural physics of optimization
- Finite-time attractor optimization based on differential lagrange multipliers
This page was built for publication: ODE versus SQP methods for constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1109530)
