Explicit pseudo-transient continuation and the trust-region updating strategy for unconstrained optimization
From MaRDI portal
Publication:2029126
DOI10.1016/j.apnum.2021.02.019zbMath1468.65073arXiv2012.14808OpenAlexW3133740622MaRDI QIDQ2029126
Jia-hui Lv, Hang Xiao, Sen Zhang, Xin-long Luo
Publication date: 3 June 2021
Published in: Applied Numerical Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.14808
unconstrained optimizationcontinuation methodquasi-Newton methodtrust-region methodpreconditioning techniquegeneralized gradient flowline search method
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)
Related Items
The regularization continuation method with an adaptive time step control for linearly constrained optimization problems ⋮ A hybrid BB-type method for solving large scale unconstrained optimization ⋮ The regularization continuation method for optimization problems with nonlinear equality constraints ⋮ Generalized continuation Newton methods and the trust-region updating strategy for the underdetermined system ⋮ Continuation Newton methods with the residual trust-region time-stepping scheme for nonlinear equations ⋮ Design and convergence analysis of some implicit inertial methods for quasi-variational inequalities via the Wiener-Hopf equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A function to test methods applied to global minimization of potential energy of molecules
- Convergence of algorithms in optimization and solutions of nonlinear equations
- Combining trust-region techniques and Rosenbrock methods to compute stationary points
- Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
- A geometric method in nonlinear programming
- A class of methods for unconstrained minimization based on stable numerical integration techniques
- Construction of high order diagonally implicit multistage integration methods for ordinary differential equations
- On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
- The BFGS method with exact line searches fails for non-convex objective functions
- Neurodynamical optimization
- Using dynamical systems methods to solve minimization problems
- Recent advances in trust region algorithms
- Optimization theory and methods. Nonlinear programming
- Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- Continuous Newton-Raphson method for solving and underdetermined system of nonlinear equations
- A differential equation approach to nonlinear programming
- Variable Metric Method for Minimization
- Numerical Optimization
- Convergence Analysis of Pseudo-Transient Continuation
- Introduction to Numerical Continuation Methods
- Trust Region Methods
- Trust Region Algorithms and Timestep Selection
- Solving ODEs with MATLAB
- A General Class of Two-Step Runge–Kutta Methods for Ordinary Differential Equations
- An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
- A Rapidly Convergent Descent Method for Minimization
- Convergence analysis of the Levenberg–Marquardt method
- A Family of Variable-Metric Methods Derived by Variational Means
- A new approach to variable metric algorithms
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- Conditioning of Quasi-Newton Methods for Function Minimization
