A note on minimization problems and multistep methods

DOI10.1007/s002110050305zbMath0884.34021OpenAlexW2068622693MaRDI QIDQ1374754

Johannes Schropp

Publication date: 10 December 1997

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002110050305

zbMATH Keywords

asymptotic featuresnumerical and the exact solutionsstiff minimization problemsstrictly stable linear multistep method

Mathematics Subject Classification ID

Stability and convergence of numerical methods for ordinary differential equations (65L20) Numerical methods for initial value problems involving ordinary differential equations (65L05) Multiple scale methods for ordinary differential equations (34E13) Dynamical systems and ergodic theory (37-XX) Numerical analysis in abstract spaces (65J99)

Related Items (11)

Non Monotone Backtracking Inexact BFGS Method for Regression Analysis ⋮ A modified nonmonotone BFGS algorithm for unconstrained optimization ⋮ Global convergence of a modified Broyden family method for nonconvex functions ⋮ A dynamical system method for solving nonlinear ill-posed problems ⋮ A new descent algorithm with curve search rule ⋮ On memory gradient method with trust region for unconstrained optimization ⋮ Convergence analysis of a modified BFGS method on convex minimizations ⋮ New line search methods for unconstrained optimization ⋮ A new super-memory gradient method with curve search rule ⋮ Descent Property and Global Convergence of a New Search Direction Method for Unconstrained Optimization ⋮ One- and multistep discretizations of index 2 differential algebraic systems and their use in optimization

This page was built for publication: A note on minimization problems and multistep methods