New quasi-Newton methods for unconstrained optimization problems
From MaRDI portal
Publication:2493696
DOI10.1016/j.amc.2005.08.027zbMath1100.65054OpenAlexW2015856668WikidataQ59241598 ScholiaQ59241598MaRDI QIDQ2493696
Liqun Qi, Guoyin Li, Zeng-xin Wei
Publication date: 16 June 2006
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2005.08.027
unconstrained optimizationglobal convergencenumerical examplessuperlinear convergencequasi-Newton methodquasi-Newton equationBroyden-Fletcher-Goldfarb-Shanno type algorithms
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)
Related Items (89)
On Hager and Zhang's conjugate gradient method with guaranteed descent ⋮ A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem ⋮ A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems ⋮ A modified scaling parameter for the memoryless BFGS updating formula ⋮ A class of descent four-term extension of the Dai-Liao conjugate gradient method based on the scaled memoryless BFGS update ⋮ A new adaptive trust region algorithm for optimization problems ⋮ A modified Dai-Liao conjugate gradient method for solving unconstrained optimization and image restoration problems ⋮ On \(q\)-BFGS algorithm for unconstrained optimization problems ⋮ New nonlinear conjugate gradient methods based on optimal Dai-Liao parameters ⋮ Unnamed Item ⋮ A new adaptive Barzilai and Borwein method for unconstrained optimization ⋮ Nonmonotone diagonally scaled limited-memory BFGS methods with application to compressive sensing based on a penalty model ⋮ Modified nonlinear conjugate gradient method with sufficient descent condition for unconstrained optimization ⋮ A hybrid quasi-Newton method with application in sparse recovery ⋮ Global convergence of a nonmonotone Broyden family method for nonconvex unconstrained minimization ⋮ A modified nonmonotone BFGS algorithm for unconstrained optimization ⋮ Global convergence of a modified Broyden family method for nonconvex functions ⋮ Global convergence properties of two modified BFGS-type methods ⋮ Scaling on the spectral gradient method ⋮ A modified quasi-Newton method for nonlinear equations ⋮ An adaptive three-term conjugate gradient method based on self-scaling memoryless BFGS matrix ⋮ Global convergence of a modified limited memory BFGS method for non-convex minimization ⋮ Two modified scaled nonlinear conjugate gradient methods ⋮ On optimality of the parameters of self-scaling memoryless quasi-Newton updating formulae ⋮ An accelerated descent CG algorithm with clustering the eigenvalues for large-scale nonconvex unconstrained optimization and its application in image restoration problems ⋮ A class of spectral three-term descent Hestenes-Stiefel conjugate gradient algorithms for large-scale unconstrained optimization and image restoration problems ⋮ 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 ⋮ Regularization of limited memory quasi-Newton methods for large-scale nonconvex minimization ⋮ A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems ⋮ A hybrid BB-type method for solving large scale unconstrained optimization ⋮ A NONMONOTONE ADMM-BASED DIAGONAL QUASI-NEWTON UPDATE WITH APPLICATION TO THE COMPRESSIVE SENSING PROBLEM ⋮ A class of new three-term descent conjugate gradient algorithms for large-scale unconstrained optimization and applications to image restoration problems ⋮ New quasi-Newton methods via higher order tensor models ⋮ Improved Hessian approximation with modified secant equations for symmetric rank-one method ⋮ Competitive secant (BFGS) methods based on modified secant relations for unconstrained optimization ⋮ A new conjugate gradient algorithm for training neural networks based on a modified secant equation ⋮ 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 ⋮ A Riemannian BFGS Method Without Differentiated Retraction for Nonconvex Optimization Problems ⋮ Some modified Yabe–Takano conjugate gradient methods with sufficient descent condition ⋮ Descent Perry conjugate gradient methods for systems of monotone nonlinear equations ⋮ An active set limited memory BFGS algorithm for bound constrained optimization ⋮ A modified secant equation quasi-Newton method for unconstrained optimization ⋮ A new modified scaled conjugate gradient method for large-scale unconstrained optimization with non-convex objective function ⋮ Unnamed Item ⋮ A survey of gradient methods for solving nonlinear optimization ⋮ Nonmonotone adaptive Barzilai-Borwein gradient algorithm for compressed sensing ⋮ The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions ⋮ An improved nonlinear conjugate gradient method with an optimal property ⋮ Higher order curvature information and its application in a modified diagonal Secant method ⋮ A new modified BFGS method for unconstrained optimization problems ⋮ New BFGS method for unconstrained optimization problem based on modified Armijo line search ⋮ A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs ⋮ 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 ⋮ Nonmonotone adaptive trust region method with line search based on new diagonal updating ⋮ Two new conjugate gradient methods based on modified secant equations ⋮ Some nonlinear conjugate gradient methods based on spectral scaling secant equations ⋮ A descent family of Dai–Liao conjugate gradient methods ⋮ Convergence analysis of a modified BFGS method on convex minimizations ⋮ Notes on the Dai-Yuan-Yuan modified spectral gradient method ⋮ Using nonlinear functions to approximate a new quasi-Newton method for unconstrained optimization problems ⋮ An effective adaptive trust region algorithm for nonsmooth minimization ⋮ New line search methods for unconstrained optimization ⋮ An augmented memoryless BFGS method based on a modified secant equation with application to compressed sensing ⋮ The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices ⋮ A limited memory BFGS-type method for large-scale unconstrained optimization ⋮ A Conjugate Gradient Method Based on a Modified Secant Relation for Unconstrained Optimization ⋮ An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization ⋮ A conjugate gradient method with sufficient descent property ⋮ Enhanced Dai-Liao conjugate gradient methods for systems of monotone nonlinear equations ⋮ A modified BFGS algorithm based on a hybrid secant equation ⋮ A conjugate gradient algorithm and its application in large-scale optimization problems and image restoration ⋮ A new backtracking inexact BFGS method for symmetric nonlinear equations ⋮ Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization ⋮ Scaled nonlinear conjugate gradient methods for nonlinear least squares problems ⋮ Rapidly convergent Steffensen-based methods for unconstrained optimization ⋮ A new type of quasi-Newton updating formulas based on the new quasi-Newton equation ⋮ A new hybrid conjugate gradient method for large-scale unconstrained optimization problem with non-convex objective function ⋮ Diagonally scaled memoryless quasi-Newton methods with application to compressed sensing ⋮ Unnamed Item ⋮ A Modified Hestenes-Stiefel Conjugate Gradient Algorithm for Large-Scale Optimization ⋮ A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization ⋮ A CLASS OF MODIFIED BFGS METHODS WITH FUNCTION VALUE INFORMATION FOR UNCONSTRAINED OPTIMIZATION ⋮ A nonmonotone scaled conjugate gradient algorithm for large-scale unconstrained optimization ⋮ An adaptive sizing BFGS method for unconstrained optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An SQP-type method and its application in stochastic programs
- Local convergence analysis for partitioned quasi-Newton updates
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- Testing Unconstrained Optimization Software
- Variable Metric Method for Minimization
- On the Convergence of a New Conjugate Gradient Algorithm
- A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations
- On the Local and Superlinear Convergence of Quasi-Newton Methods
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A New Algorithm for Unconstrained Optimization
- A modified BFGS method and its global convergence in nonconvex minimization
This page was built for publication: New quasi-Newton methods for unconstrained optimization problems
