Conjugate gradient type methods for the nondifferentiable convex minimization
type: Item
instance of: scholarly article
title: Conjugate gradient type methods for the nondifferentiable convex minimization
zbMATH Open document ID: 1287.90049
author: Qiong Li
published in: Optimization Letters
publication date: 2013-03-12T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C52
zbMATH DE Number: 6143316
zbMATH Keywords: nondifferentiable convex minimization
zbMATH Keywords: conjugate gradient type methods
zbMATH Keywords: global convergence
describes a project that uses: PNEW
describes a project that uses: SolvOpt
describes a project that uses: QSM
MaRDI profile type: Publication
full work available at URL: s11590-011-0437-5
OpenAlex ID: W2009182781
cites work: Numerical methods for nondifferentiable convex optimization
cites work: A quasisecant method for minimizing nonsmooth functions
cites work: An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
cites work: Discrete gradient method: Derivative-free method for nonsmooth optimization
cites work: A family of variable metric proximal methods
cites work: On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating
cites work: The Speed of Shor's R-algorithm
cites work: A Two-Term PRP-Based Descent Method
cites work: Proximal quasi-Newton methods for nondifferentiable convex optimization
cites work: Convergence of some algorithms for convex minimization
cites work: Global convergence of some modified PRP nonlinear conjugate gradient methods
cites work: Encyclopedia of Optimization
cites work: A descent algorithm for nonsmooth convex optimization
cites work: A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
cites work: A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
cites work: Q5479892
cites work: Globally convergent limited memory bundle method for large-scale nonsmooth optimization
cites work: An implementation of Shor's \(r\)-algorithm
cites work: Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
cites work: A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization
cites work: A bundle-Newton method for nonsmooth unconstrained minimization
cites work: A quasi-second-order proximal bundle algorithm
cites work: Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization
cites work: Q4004158
cites work: Q4040046
cites work: Excessive Gap Technique in Nonsmooth Convex Minimization
cites work: Smooth minimization of non-smooth functions
cites work: Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
cites work: Nonlinear analysis and variational problems. In Honor of George Isac
cites work: A preconditioning proximal Newton method for nondifferentiable convex optimization
cites work: Globally convergent BFGS method for nonsmooth convex optimization
cites work: A trust region method for nonsmooth convex optimization
cites work: Q5187067
cites work: A quasi-Newton approach to nonsmooth convex optimization problems in machine learning
cites work: A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
cites work: A new trust region algorithm for nonsmooth convex minimization
DOI: 10.1007/S11590-011-0437-5
description: scientific article; zbMATH DE number 6143316