A diagonal-sparse quasi-Newton method for unconstrained optimization problem

MaRDI QIDQ5474945zbMATH OpenFDO

Authors Guo Sun, Zhenjun Shi

Publication date 15 June 2006

zbMATH Keywords

convergence rateglobal convergenceinexact line search

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53)

Recommendations

• Scaling on diagonal quasi-Newton update for large-scale unconstrained optimization
• Nonmonotone generalized diagonal quasi-Newton algorithm
• A new diagonal-sparse quasi-Newton method with a modified non-monotone step size rule
• A diagonal quasi-Newton updating method for unconstrained optimization
• A non-monotone super-memory gradient method based on the diagonal-sparse quasi-Newton direction

Cited in

(17)

• ``Diagonal shadow -- A quasi-Newton iteration in spectral domain
• A structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squares
• Diagonally scaled memoryless quasi-Newton methods with application to compressed sensing
• A nonmonotone trust region method based on simple quadratic models
• Nonmonotone adaptive trust region method with line search based on new diagonal updating
• A new nonmonotone adaptive trust region method based on simple quadratic models
• Globally proper saddle point in ic-cone-convexlike set-valued optimization problems
• Nonmonotone generalized diagonal quasi-Newton algorithm
• A new diagonal-sparse quasi-Newton method with a modified non-monotone step size rule
• A nonmonotone trust region method with new inexact line search for unconstrained optimization
• scientific article; zbMATH DE number 1014688 (Why is no real title available?)
• An efficient method for unconstrained optimization problems of nonlinear large mesh-interconnected systems
• A class of diagonal quasi-Newton methods for large-scale convex minimization
• scientific article; zbMATH DE number 6796365 (Why is no real title available?)
• A nonmonotone line search method for constrained multiobjective optimization problems
• A quasi-Newton method with sparse triple factorization for unconstrained minimization
• A self-adaptive trust region method with line search based on a simple subproblem model

This page was built for publication: A diagonal-sparse quasi-Newton method for unconstrained optimization problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5474945)