A new trust region algorithm for nonsmooth convex minimization
type: Item
instance of: scholarly article
title: A new trust region algorithm for nonsmooth convex minimization
zbMATH Open document ID: 1193.90171
published in: Applied Mathematics and Computation
publication date: 2010-09-01T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C56
zbMATH DE Number: 5777053
zbMATH Keywords: trust region method
zbMATH Keywords: convex minimization
zbMATH Keywords: convergence
zbMATH Keywords: semismoothness
author: Liping Zhang
MaRDI profile type: Publication
full work available at URL: j.amc.2007.03.059
OpenAlex ID: W1979203564
cites work: Optimization and nonsmooth analysis
cites work: Convergence of some algorithms for convex minimization
cites work: A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
cites work: Q4273942
cites work: Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
cites work: A globally convergent Newton method for convex \(SC^ 1\) minimization problems
cites work: Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
cites work: A nonsmooth version of Newton's method
cites work: An SQP algorithm for extended linear-quadratic problems in stochastic programming
cites work: Maximal monotone relations and the second derivatives of nonsmooth functions
DOI: 10.1016/J.AMC.2007.03.059
description: scientific article; zbMATH DE number 5777053