A tensor trust-region model for nonlinear system
From MaRDI portal
Publication:2061487
DOI10.1186/s13660-018-1935-0zbMath1498.65099OpenAlexW2904387106WikidataQ60302483 ScholiaQ60302483MaRDI QIDQ2061487
Publication date: 15 December 2021
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-018-1935-0
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Methods of quasi-Newton type (90C53)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- An active set limited memory BFGS algorithm for bound constrained optimization
- A BFGS trust-region method for nonlinear equations
- Limited memory BFGS method with backtracking for symmetric nonlinear equations
- Convergence analysis of a modified BFGS method on convex minimizations
- BFGS trust-region method for symmetric nonlinear equations
- A new backtracking inexact BFGS method for symmetric nonlinear equations
- Representations of quasi-Newton matrices and their use in limited memory methods
- A new trust region method for nonlinear equations
- A new adaptive trust region algorithm for optimization problems
- An adaptive trust region algorithm for large-residual nonsmooth least squares problems
- A conjugate gradient algorithm under Yuan-Wei-Lu line search technique for large-scale minimization optimization models
- Nonmonotone backtracking inexact quasi-Newton algorithms for solving smooth nonlinear equations
- An effective adaptive trust region algorithm for nonsmooth minimization
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
- The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions
- A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations
- The global convergence of a modified BFGS method for nonconvex functions
- A new trust-region method with line search for solving symmetric nonlinear equations
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- MODIFIED LIMITED MEMORY BFGS METHOD WITH NONMONOTONE LINE SEARCH FOR UNCONSTRAINED OPTIMIZATION
- The “global” convergence of Broyden-like methods with suitable line search
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- Testing Unconstrained Optimization Software
- Comparing Algorithms for Solving Sparse Nonlinear Systems of Equations
- Numerical Optimization
- Algorithm 738: a software package for unconstrained optimization using tensor methods
- Trust Region Methods
- A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations
- Descent Directions of Quasi-Newton Methods for Symmetric Nonlinear Equations
- A BFGS algorithm for solving symmetric nonlinear equations
- A method for the solution of certain non-linear problems in least squares
- Benchmarking optimization software with performance profiles.
