Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
From MaRDI portal
We review briefly some methods for minimizing a function F(x), which proceed by following the solution curve of a system of ordinary differential equations. Such methods have often been tought to be unacceptably expensive; but we show, by means of extensive numerical tests, using a variety of algorithms, that the ODE approach can in fact be implemented in such a way as to be more than competitive with currently available conventional techniques.
Recommendations
Cites work
- A class of methods for unconstrained minimization based on stable numerical integration techniques
- A curvilinear optimization method based upon iterative estimation of the eigensystem of the Hessian matrix
- A differential-equations algorithm for nonlinear equations
- A new and dynamic method for unconstrained minimization
- A New Method for Solving Nonlinear Simultaneous Equations
- A Newton-type curvilinear search method for optimization
- Algorithms Supplement
- An Algorithm, Based on Singular Perturbation Theory, for Ill-Conditioned Minimization Problems
- Differential gradient methods
- scientific article; zbMATH DE number 3700118 (Why is no real title available?)
- Maximization by Quadratic Hill-Climbing
- Minimization Algorithms Making Use of Non-quadratic Properties of the Objective Function
- Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
- Test examples for nonlinear programming codes
Cited in
(74)- Combining trust-region techniques and Rosenbrock methods to compute stationary points
- Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
- ODE versus SQP methods for constrained optimization
- A trajectory-followed method for unconstrained optimization
- K-K-T multiplier estimates and objective function lower bounds from projective SUMT
- Trajectory-following algorithms for min-max optimization problems
- High-frequency projection method for plane problems of wave diffraction on dielectric bodies
- Applied aspects of the theory of continuation of solutions of wave-scattering boundary-value problems
- Inverse sounding problem using stabilization of the magnetic field of a loop
- High-frequency approximation of the Green's function for the Helmholtz equation in an axial nonhomogeneous medium
- Numerical experiments with hemodynamics of the arterial part of the myocardium
- Approximate collocation method for an integral equation with a logarithmic kernel
- Development of integro-differential methods of parameter determination for a sum of exponential functions
- A method for approximate construction of the basic component in the class of functions of bounded variation
- Identification of flexural rigidity in a Kirchhoff plates model using a convex objective and continuous Newton method
- A new supermemory gradient method for unconstrained optimization problems
- An optimization framework of biological dynamical systems
- Note on global convergence of ODE methods for unconstrained optimization
- Differential-algebraic approach to linear programming
- Parallel asynchronous label-correcting methods for shortest paths
- On a variational approach for the analysis and numerical simulation of ODEs
- Explicit pseudo-transient continuation and the trust-region updating strategy for unconstrained optimization
- Generating Nesterov's accelerated gradient algorithm by using optimal control theory for optimization
- A note on solving nonlinear optimization problems in variable precision
- A comparison of methods for traversing regions of non-convexity in optimization problems
- A modified ODE-based algorithm for unconstrained optimization problems
- A method based on Rayleigh quotient gradient flow for extreme and interior eigenvalue problems
- A class on nonmonotone stabilization methods in unconstrained optimization
- Newton-based extremum seeking: a second-order Lie bracket approximation approach
- Paths to constrained Nash equilibria
- An optimal control theory for nonlinear optimization
- A novel three-phase trajectory informed search methodology for global optimization
- An ODE-based nonmonotone method for unconstrained optimization problems
- Proximal gradient flow and Douglas-Rachford splitting dynamics: global exponential stability via integral quadratic constraints
- Quasi-Newton methods based on ordinary differential equation approach for unconstrained nonlinear optimization
- A curvilinear search algorithm for unconstrained optimization by automatic differentiation
- A nonmonotone ODE-based method for unconstrained optimization
- An ODE-Based Trust Region Filter Algorithm for Unconstrained Optimization
- An ODE-like nonmonotone method for nonsmooth convex optimization
- Applying Stabilization Techniques to Orthogonal Gradient Flows
- scientific article; zbMATH DE number 4020862 (Why is no real title available?)
- Dynamical systems and topology optimization
- A dynamical systems approach to constrained minimization
- scientific article; zbMATH DE number 1552397 (Why is no real title available?)
- Optimisation and asymptotic stability
- scientific article; zbMATH DE number 2162935 (Why is no real title available?)
- One-step and multistep procedures for constrained minimization problems
- High-order Langevin diffusion yields an accelerated MCMC algorithm
- Deriving efficient optimization methods based on stable explicit numerical methods
- A hybrid trust region algorithm for unconstrained optimization
- Newton Method and Trajectory-Based Method for Solving Power Flow Problems: Nonlinear Studies
- A hybrid BB-type method for solving large scale unconstrained optimization
- Existence results on Lagrange multiplier approach for gradient flows and application to optimization
- A hybrid Sobolev gradient method for learning NODEs
- The application of Goeken-Johnson's Runge-Kutta methods in unconstrained convex optimization
- A hybrid ODE-based method for unconstrained optimization problems
- An LQR-Lagrange algorithm generated by interdisciplinary integration with optimal control and optimization
- Application of the modified Runge-Kutta method to the construction of the descent method for solving boundary value problems
- A relaxed vector auxiliary variable algorithm for unconstrained optimization problems
- Local convergence of the steepest descent method in Hilbert spaces
- Accelerating continuous-time optimization with fixed-time time-varying second-order dynamics
- On the mathematics of the natural physics of optimization
- Application of Runge-Kutta method with non-standard finite difference for the construction of preconditioned gradient methods
- Gradient methods based on non-standard Lagrange-Burmann Runge-Kutta method
- A trajectory-based method for constrained nonlinear optimization problems
- Optimisation by predefined upper bound of settling time convergent projected gradient flows
- On the application of explicit Runge-Kutta methods to the construction of stochastic gradient descent methods for convex optimization
- Prediction-correction dynamical systems for time-varying minimax problems with applications
- Application of stochastic gradient method with momentum inspired by explicit stabilized Runge-Kutta method in unconstrained convex optimization
- Differential optimization techniques
- An ODE-based trust region method for unconstrained optimization problems
- A superlinearly convergent ODE-type trust region algorithm for nonsmooth nonlinear equations
- Some remarks on conjugate gradient methods without line search
- A second-order pseudo-transient method for steady-state problems
This page was built for publication: Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1106732)