A trajectory-followed method for unconstrained optimization

DOI10.1007/BF00939739zbMath0687.90075OpenAlexW2079074019MaRDI QIDQ1263529

H. Warsitz, Stefan Schäffler

Publication date: 1990

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

system of ordinary differential equationsunconstrained nonlinear programmingtrajectory-following method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Paths to constrained Nash equilibria ⋮ Level-constrained programming ⋮ Dynamic search trajectory methods for global optimization ⋮ Trajectory-following algorithms for min-max optimization problems

Cites Work

• A multi-start global minimization algorithm with dynamic search trajectories
• Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
• Unnamed Item