Using dynamical systems methods to solve minimization problems
DOI10.1016/0168-9274(95)00065-3zbMath0837.65065OpenAlexW2020926303MaRDI QIDQ1902083
Publication date: 14 November 1995
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-9274(95)00065-3
convergenceminimization problemsnumerical examplesdynamical systemomega-limit setone-step methodsgradient differential equationMichaelis-Menten kinetics model
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Kinetics in biochemical problems (pharmacokinetics, enzyme kinetics, etc.) (92C45) Numerical methods for initial value problems involving ordinary differential equations (65L05) Dynamical systems and ergodic theory (37-XX)
Related Items (14)
Cites Work
- Discrete evolutions: Convergence and applications
- On invariant closed curves for one-step methods
- Invariant curves for numerical methods
- On the Numerical Approximation of Phase Portraits Near Stationary Points
- Spurious solutions of numerical methods for initial value problems
- Runge–Kutta Methods for Dissipative and Gradient Dynamical Systems
- A Reduction Principle for ω‐Limit Sets
- Stable Attracting Sets in Dynamical Systems and in Their One-Step Discretizations
- An exact sequence in differential topology
- Implicit Runge-Kutta Processes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Using dynamical systems methods to solve minimization problems