An effective adaptive trust region algorithm for nonsmooth minimization
type: Item
instance of: scholarly article
title: An effective adaptive trust region algorithm for nonsmooth minimization
zbMATH Open document ID: 1406.90099
author: Zhou Sheng
author: Gonglin Yuan
published in: Computational Optimization and Applications
publication date: 2018-10-02T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 6946584
zbMATH Keywords: nonsmooth problems
zbMATH Keywords: Moreau-Yosida regularization
zbMATH Keywords: trust region algorithm
zbMATH Keywords: global convergence
zbMATH Keywords: superlinear convergence
describes a project that uses: PNEW
MaRDI profile type: Publication
full work available at URL: s10589-018-9999-9
OpenAlex ID: W2794690305
cites work: Q4004158
cites work: Introduction to Nonsmooth Optimization
cites work: A bundle-Newton method for nonsmooth unconstrained minimization
cites work: Survey of Bundle Methods for Nonsmooth Optimization
cites work: Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
cites work: A derivative-free trust-region algorithm for composite nonsmooth optimization
cites work: A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
cites work: A trust region method for nonsmooth convex optimization
cites work: A new trust region algorithm for nonsmooth convex minimization
cites work: The Barzilai and Borwein gradient method with nonmonotone line search for nonsmooth convex optimization problems
cites work: Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
cites work: A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
cites work: A trust region algorithm for minimization of locally Lipschitzian functions
cites work: A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
cites work: A New Algorithm for Unconstrained Optimization
cites work: An adaptive trust region method and its convergence
cites work: A new modified nonmonotone adaptive trust region method for unconstrained optimization
cites work: Q5425090
cites work: A new trust region method for unconstrained optimization
cites work: Nonmonotone adaptive trust region method
cites work: A new trust region method with adaptive radius for unconstrained optimization
cites work: Nonmonotone adaptive trust region method with line search based on new diagonal updating
cites work: An improved adaptive trust-region algorithm
cites work: A new adaptive trust-region method for system of nonlinear equations
cites work: A trust-region approach with novel filter adaptive radius for system of nonlinear equations
cites work: A nonsmooth version of Newton's method
cites work: Optimization and nonsmooth analysis
cites work: A globally convergent Newton method for convex \(SC^ 1\) minimization problems
cites work: Q4273942
cites work: Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
cites work: A descent algorithm for nonsmooth convex optimization
cites work: Numerical methods for nondifferentiable convex optimization
cites work: Convergence of some algorithms for convex minimization
cites work: Globally convergent BFGS method for nonsmooth convex optimization
cites work: New quasi-Newton methods for unconstrained optimization problems
cites work: A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
cites work: A BFGS trust-region method for nonlinear equations
cites work: Q4083217
cites work: Trust Region Methods
cites work: The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
cites work: A smooth method for the finite minimax problem
cites work: A Method for Minimization of Quasidifferentiable Functions
cites work: Benchmarking optimization software with performance profiles.
DOI: 10.1007/S10589-018-9999-9
description: scientific article; zbMATH DE number 6946584