A note on minimization problems and multistep methods
From MaRDI portal
asymptotic featuresnumerical and the exact solutionsstiff minimization problemsstrictly stable linear multistep method
Multiple scale methods for ordinary differential equations (34E13) Dynamical systems and ergodic theory (37-XX) Numerical analysis in abstract spaces (65J99) Numerical methods for initial value problems involving ordinary differential equations (65L05) Stability and convergence of numerical methods for ordinary differential equations (65L20)
Recommendations
Cited in
(16)- A new descent algorithm with curve search rule
- One- and multistep discretizations of index 2 differential algebraic systems and their use in optimization
- Using dynamical systems methods to solve minimization problems
- Global convergence of a modified Broyden family method for nonconvex functions
- A modified nonmonotone BFGS algorithm for unconstrained optimization
- On a three step method for minimization of functions
- A dynamical system method for solving nonlinear ill-posed problems
- On memory gradient method with trust region for unconstrained optimization
- New line search methods for unconstrained optimization
- A new super-memory gradient method with curve search rule
- Applying Stabilization Techniques to Orthogonal Gradient Flows
- One-step and multistep procedures for constrained minimization problems
- Descent property and global convergence of a new search direction method for unconstrained optimization
- Non monotone backtracking inexact BFGS method for regression analysis
- A new conjugate gradient method for acceleration of gradient descent algorithms
- Convergence analysis of a modified BFGS method on convex minimizations
This page was built for publication: A note on minimization problems and multistep methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1374754)
