A trajectory-based method for constrained nonlinear optimization problems
From MaRDI portal
Publication:725880
DOI10.1007/s10957-018-1274-9zbMath1433.90120OpenAlexW2794607820WikidataQ130047503 ScholiaQ130047503MaRDI QIDQ725880
Terry-Leigh Oliphant, M. Montaz Ali
Publication date: 2 August 2018
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-018-1274-9
convergencenumerical integrationsystem of ordinary differential equationsconstrained nonlinear optimizationtrajectory-based method
Uses Software
Cites Work
- Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
- Steepest descent with curvature dynamical system
- An improved version of the original leap-frog dynamic method for unconstrained minimization: LFOP1(b)
- Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
- More test examples for nonlinear programming codes
- Test examples for nonlinear programming codes
- A new and dynamic method for unconstrained minimization
- A curvilinear optimization method based upon iterative estimation of the eigensystem of the Hessian matrix
- Differential gradient methods
- Combining search directions using gradient flows
- Using dynamical systems methods to solve minimization problems
- The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems
- A differential-equations algorithm for nonlinear equations
- A new arc algorithm for unconstrained optimization
- Unconstrained Optimization by Approximation of the Gradient Path
- Numerical Optimization
- CUTE
- Optimal Order and Stepsize Sequences
- Benchmarking optimization software with performance profiles.
- Unnamed Item
This page was built for publication: A trajectory-based method for constrained nonlinear optimization problems
