A class of line search-type methods for nonsmooth convex regularized minimization
type: Item
instance of: scholarly article
title: A class of line search-type methods for nonsmooth convex regularized minimization
zbMATH Open document ID: 1498.90161
author: Weijun Zhou
published in: Soft Computing
publication date: 2022-11-18T00:00:00Z
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 7619716
zbMATH Keywords: line search
zbMATH Keywords: conjugate gradient
zbMATH Keywords: nonsmooth
zbMATH Keywords: convergence
MaRDI profile type: Publication
full work available at URL: s00500-021-05672-x
OpenAlex ID: W3133537711
cites work: A modified descent Polak-Ribiére-Polyak conjugate gradient method with global convergence property for nonconvex functions
cites work: Two-Point Step Size Gradient Methods
cites work: Smoothing Nonlinear Conjugate Gradient Method for Image Restoration Using Nonsmooth Nonconvex Minimization
cites work: CUTE
cites work: A modified Perry's conjugate gradient method-based derivative-free method for solving large-scale nonlinear monotone equations
cites work: A three-term conjugate gradient algorithm for large-scale unconstrained optimization problems
cites work: Compressed sensing
cites work: Global Convergence Properties of Conjugate Gradient Methods for Optimization
cites work: A globally convergent version of the Polak-Ribière conjugate gradient method
cites work: A Nonmonotone Line Search Technique for Newton’s Method
cites work: Some three-term conjugate gradient methods with the inexact line search condition
cites work: A three-term derivative-free projection method for nonlinear monotone system of equations
cites work: Q5563083
cites work: The conjugate gradient method in extremal problems
cites work: On the Barzilai and Borwein choice of steplength for the gradient method
cites work: The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
cites work: Norm descent conjugate gradient methods for solving symmetric nonlinear equations
cites work: Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing
cites work: Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
cites work: The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions
cites work: A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations
cites work: A derivative-free conjugate residual method using secant condition for general large-scale nonlinear equations
cites work: Q4990876
cites work: A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
cites work: A modified BFGS type quasi-Newton method with line search for symmetric nonlinear equations problems
cites work: A short note on the global convergence of the unmodified PRP method
cites work: On the convergence properties of the unmodified PRP method with a non-descent line search
cites work: Q4990878
cites work: Convergence properties of an iterative method for solving symmetric non-linear equations
DOI: 10.1007/S00500-021-05672-X
description: scientific article; zbMATH DE number 7619716