A note on minimization problems and multistep methods

DOI10.1007/S002110050305zbMATH Open0884.34021OpenAlexW2068622693MaRDI QIDQ1374754FDOQ1374754

Authors: 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

Recommendations

• One-step and multistep procedures for constrained minimization problems
• Using dynamical systems methods to solve minimization problems
• Runge-Kutta discretizations of singularly perturbed gradient equations

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) Multiple scale methods for ordinary differential equations (34E13) Numerical methods for initial value problems involving ordinary differential equations (65L05) Numerical analysis in abstract spaces (65J99) Dynamical systems and ergodic theory (37-XX)

Cited In (16)

• One- and multistep discretizations of index 2 differential algebraic systems and their use in optimization
• One-step and multistep procedures for constrained minimization problems
• A new super-memory gradient method with curve search rule
• Convergence analysis of a modified BFGS method on convex minimizations
• New line search methods for unconstrained optimization
• A new descent algorithm with curve search rule
• Using dynamical systems methods to solve minimization problems
• Applying Stabilization Techniques to Orthogonal Gradient Flows
• Descent property and global convergence of a new search direction method for unconstrained optimization
• Global convergence of a modified Broyden family method for nonconvex functions
• A new conjugate gradient method for acceleration of gradient descent algorithms
• A dynamical system method for solving nonlinear ill-posed problems
• Non monotone backtracking inexact BFGS method for regression analysis
• On memory gradient method with trust region for unconstrained optimization
• A modified nonmonotone BFGS algorithm for unconstrained optimization
• On a three step method for minimization of functions

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)