A derivative-free trust-region algorithm for composite nonsmooth optimization
type: Item
instance of: scholarly article
title: A derivative-free trust-region algorithm for composite nonsmooth optimization
zbMATH Open document ID: 1371.49014
author: Geovani Nunes Grapiglia
author: Jinyun Yuan
author: Yaxiang Yuan
published in: Computational and Applied Mathematics
publication date: 2017-08-08T00:00:00Z
Mathematics Subject Classification ID: 49J53
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 58C15
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 90C56
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 49J52
zbMATH DE Number: 6758778
zbMATH Keywords: nonsmooth optimization
zbMATH Keywords: nonlinear programming
zbMATH Keywords: trust-region methods
zbMATH Keywords: derivative-free optimization
zbMATH Keywords: global convergence
zbMATH Keywords: worst-case complexity
cites work: NOMAD
cites work: Mesh Adaptive Direct Search Algorithms for Constrained Optimization
cites work: A trust region algorithm for nonsmooth optimization
cites work: Q5657612
cites work: Inexact restoration method for derivative-free optimization with smooth constraints
cites work: Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
cites work: On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming
cites work: On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization
cites work: On the evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization
cites work: On the complexity of finding first-order critical points in constrained nonlinear optimization
cites work: Introduction to Derivative-Free Optimization
cites work: Global Convergence of General Derivative-Free Trust-Region Algorithms to First- and Second-Order Critical Points
cites work: Global convergence of trust-region algorithms for convex constrained minimization without derivatives
cites work: A trust-region derivative-free algorithm for constrained optimization
cites work: A smooth method for the finite minimax problem
cites work: Derivative-free methods for nonlinear programming with general lower-level constraints
cites work: A model algorithm for composite nondifferentiable optimization problems
cites work: Q3932225
cites work: Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
cites work: On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization
cites work: A Quasi-Newton Method with No Derivatives
cites work: `` Direct Search'' Solution of Numerical and Statistical Problems
cites work: The Cutting-Plane Method for Solving Convex Programs
cites work: Algorithm 909
cites work: Q4182270
cites work: Q4139982
cites work: Constrained derivative-free optimization on thin domains
cites work: A superlinearly convergent algorithm for minimization without evaluating derivatives
cites work: Benchmarking Derivative-Free Optimization Algorithms
cites work: A Simplex Method for Function Minimization
cites work: Random gradient-free minimization of convex functions
cites work: Q3334896
cites work: On the global convergence of trust region algorithms for unconstrained minimization
cites work: Q5493584
cites work: A trust region algorithm for minimization of locally Lipschitzian functions
cites work: Self-Correcting Geometry in Model-Based Algorithms for Derivative-Free Unconstrained Optimization
cites work: Q4194749
cites work: A Modification of Davidon's Minimization Method to Accept Difference Approximations of Derivatives
cites work: Optimization theory and methods. Nonlinear programming
cites work: Function Minimization by Interpolation in a Data Table
cites work: Conditions for convergence of trust region algorithms for nonsmooth optimization
cites work: On the superlinear convergence of a trust region algorithm for nonsmooth optimization
describes a project that uses: NOMAD
describes a project that uses: NEWUOA
describes a project that uses: BRENT
MaRDI profile type: Publication
full work available at URL: s40314-014-0201-4
OpenAlex ID: W2088650175
DOI: 10.1007/S40314-014-0201-4
description: scientific article; zbMATH DE number 6758778