New quasi-Newton methods for unconstrained optimization problems
From MaRDI portal
Some new quasi-Newton methods for unconstrained minimization based on a new quasi-Newton equation are proposed. Quasi-Newton methods use only first derivatives to build an approximate Hessian over a number of iterations. This approximation is updated in each iteration by a matrix of low rank. The authors give two choices of matrices which are included in the quasi-Newton equation. Three corresponding Broyden-Fletcher-Goldfarb-Shanno type algorithms are proved to possess the global convergence property. The superlinear convergence of the one algorithm is proved. The convergence results and the computational experiment show that the approach given in this paper is very successful.
Recommendations
- New quasi-Newton equation and related methods for unconstrained optimization
- Quasi-newton methods for monlinear equations and unconstrained optimization problems
- Variational quasi-Newton methods for unconstrained optimization
- A family of quasi-Newton methods for unconstrained optimization problems
- A new quasi-Newton algorithm
Cites work
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations
- A modified BFGS method and its global convergence in nonconvex minimization
- A New Algorithm for Unconstrained Optimization
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- An SQP-type method and its application in stochastic programs
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- scientific article; zbMATH DE number 2063453 (Why is no real title available?)
- scientific article; zbMATH DE number 1821102 (Why is no real title available?)
- Local convergence analysis for partitioned quasi-Newton updates
- On the Convergence of a New Conjugate Gradient Algorithm
- On the Local and Superlinear Convergence of Quasi-Newton Methods
- Testing Unconstrained Optimization Software
- Variable Metric Method for Minimization
Cited in
(only showing first 100 items - show all)- A limited memory BFGS-type method for large-scale unconstrained optimization
- A new backtracking inexact BFGS method for symmetric nonlinear equations
- Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
- A new quasi-Newton algorithm
- On the construction of minimization methods of quasi-Newton type
- A pointwise quasi-Newton method for unconstrained optimal control problems
- New quasi-Newton equation and related methods for unconstrained optimization
- Pointwise quasi-Newton method for unconstrained optimal control problems. II
- Variational quasi-Newton methods for unconstrained optimization
- Quasi-Newton method by Hermite interpolation
- Matrix algebras in quasi-Newton methods for unconstrained minimization
- From quasi-Newton methods to non-quasi-Newton methods
- A new adaptive trust region algorithm for optimization problems
- A new adaptive Barzilai and Borwein method for unconstrained optimization
- An adaptive three-term conjugate gradient method based on self-scaling memoryless BFGS matrix
- Nonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensing
- An effective adaptive trust region algorithm for nonsmooth minimization
- New implicit updates in multi-step quasi-Newton methods for unconstrained optimisation
- A new modified BFGS method for unconstrained optimization problems
- A modified Dai-Liao conjugate gradient method with a new parameter for solving image restoration problems
- Convergence analysis of an improved BFGS method and its application in the Muskingum model
- Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization
- Some nonlinear conjugate gradient methods based on spectral scaling secant equations
- Using nonlinear functions to approximate a new quasi-Newton method for unconstrained optimization problems
- An augmented memoryless BFGS method based on a modified secant equation with application to compressed sensing
- Enhanced Dai-Liao conjugate gradient methods for systems of monotone nonlinear equations
- A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration
- Diagonally scaled memoryless quasi-Newton methods with application to compressed sensing
- A modified Dai-Liao conjugate gradient method for solving unconstrained optimization and image restoration problems
- On \(q\)-BFGS algorithm for unconstrained optimization problems
- Nonmonotone diagonally scaled limited-memory BFGS methods with application to compressive sensing based on a penalty model
- A hybrid quasi-Newton method with application in sparse recovery
- Global convergence of a nonmonotone Broyden family method for nonconvex unconstrained minimization
- Global convergence of a modified Broyden family method for nonconvex functions
- A Dai-Liao conjugate gradient method via modified secant equation for system of nonlinear equations
- Global convergence of a family of modified BFGS methods under a modified weak-Wolfe-Powell line search for nonconvex functions
- A modified Newton-like method for nonlinear equations
- Two-step conjugate gradient method for unconstrained optimization
- A new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimization
- Descent Perry conjugate gradient methods for systems of monotone nonlinear equations
- A survey of gradient methods for solving nonlinear optimization
- Diagonal quasi-Newton methods via least change updating principle with weighted Frobenius norm
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
- Adaptive matrix algebras in unconstrained minimization
- Nonmonotone adaptive trust region method with line search based on new diagonal updating
- An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization
- Two-phase quasi-Newton method for unconstrained optimization problem
- Scaled nonlinear conjugate gradient methods for nonlinear least squares problems
- A new hybrid conjugate gradient method for large-scale unconstrained optimization problem with non-convex objective function
- A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization
- An adaptive sizing BFGS method for unconstrained optimization
- A modified nonmonotone BFGS algorithm for unconstrained optimization
- A modified quasi-Newton method for nonlinear equations
- New line search methods for unconstrained optimization
- The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices
- A class of descent four-term extension of the Dai-Liao conjugate gradient method based on the scaled memoryless BFGS update
- A modified secant equation quasi-Newton method for unconstrained optimization
- Convergence of quasi-Newton matrices with modified symmetric rank 1 updates
- Quasi-Newton methods based on ordinary differential equation approach for unconstrained nonlinear optimization
- On Hager and Zhang's conjugate gradient method with guaranteed descent
- Quasi-Newton methods based on dispersed methods of recovery of the Hessian
- A new quasi-Newton's method for unconstrained multiobjective optimization
- A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem
- A modified Hestenes-Stiefel conjugate gradient algorithm for large-scale optimization
- A class of modified BFGS methods with function value information for unconstrained optimization
- Broyden's quasi-Newton methods for a nonlinear system of equations and unconstrained optimization: a review and open problems
- A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems
- Some modified Yabe–Takano conjugate gradient methods with sufficient descent condition
- A modified scaling parameter for the memoryless BFGS updating formula
- Structure of quasi-Newton minimization methods
- Approximate invariant subspaces and quasi-Newton optimization methods
- A new non-linear least square algorithm based on quasi-Newton type equations
- scientific article; zbMATH DE number 4205888 (Why is no real title available?)
- Quasi-newton methods for monlinear equations and unconstrained optimization problems
- scientific article; zbMATH DE number 4213340 (Why is no real title available?)
- A new class of quasi-Newton updating formulas
- Modified nonlinear conjugate gradient method with sufficient descent condition for unconstrained optimization
- Low‐complexity minimization algorithms
- scientific article; zbMATH DE number 3903875 (Why is no real title available?)
- Scaling on the spectral gradient method
- scientific article; zbMATH DE number 4024658 (Why is no real title available?)
- scientific article; zbMATH DE number 4025179 (Why is no real title available?)
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- Global convergence of a modified limited memory BFGS method for non-convex minimization
- Two modified scaled nonlinear conjugate gradient methods
- Using approximate secant equations in limited memory methods for multilevel unconstrained optimization
- scientific article; zbMATH DE number 721770 (Why is no real title available?)
- scientific article; zbMATH DE number 1066213 (Why is no real title available?)
- scientific article; zbMATH DE number 1131713 (Why is no real title available?)
- On constrained optimization by adjoint based quasi-Newton methods
- scientific article; zbMATH DE number 1461863 (Why is no real title available?)
- scientific article; zbMATH DE number 1500901 (Why is no real title available?)
- A combined class of self-scaling and modified quasi-Newton methods
- A Riemannian BFGS method without differentiated retraction for nonconvex optimization problems
- A structured quasi-Newton algorithm for optimizing with incomplete Hessian information
- A family of quasi-Newton methods for unconstrained optimization problems
- Higher order curvature information and its application in a modified diagonal Secant method
- scientific article; zbMATH DE number 2166157 (Why is no real title available?)
- scientific article; zbMATH DE number 6961995 (Why is no real title available?)
- Computational experience with bank-one positive definite quasi-newton algorithms
This page was built for publication: New quasi-Newton methods for unconstrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2493696)
