ODE versus SQP methods for constrained optimization
From MaRDI portal
Recommendations
- 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
Cites work
- 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?)
- 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
- 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
Cited in
(19)- Feedback stabilization methods for the solution of nonlinear programming problems
- ODE methods for optimization with equality constraints
- A curvilinear search algorithm for unconstrained optimization by automatic differentiation
- scientific article; zbMATH DE number 37918 (Why is no real title available?)
- ODE versus SQP methods for constrained optimization
- Algorithms for unconstrained optimization problems via control theory
- A dynamical systems approach to constrained minimization
- Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
- The regularization continuation method with an adaptive time step control for linearly constrained optimization problems
- A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set
- K-K-T multiplier estimates and objective function lower bounds from projective SUMT
- Constrained optimization: Projected gradient flows
- Identification of flexural rigidity in a Kirchhoff plates model using a convex objective and continuous Newton method
- 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
- scientific article; zbMATH DE number 954686 (Why is no real title available?)
- Continuation methods with the trusty time-stepping scheme for linearly constrained optimization with noisy data
- Global dynamical solvers for nonlinear programming problems
- Direct transcription solution of optimal control problems with higher-order state constraints: theory vs practice
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)
