Diagonal discrete gradient bundle method for derivative free nonsmooth optimization
From MaRDI portal
Publication:2817235
DOI10.1080/02331934.2016.1171865zbMath1397.90309OpenAlexW2329337627WikidataQ109595623 ScholiaQ109595623MaRDI QIDQ2817235
No author found.
Publication date: 29 August 2016
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2016.1171865
nondifferentiable optimizationderivative-free optimizationbundle methodsdiscrete gradientdiagonal variable metric updates
Related Items
A new trust region method for nonsmooth nonconvex optimization ⋮ Minimization of marginal functions in mathematical programming based on continuous outer subdifferentials
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Supervised classification and mathematical optimization
- Diagonal bundle method for nonsmooth sparse optimization
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- Representations of quasi-Newton matrices and their use in limited memory methods
- An implementation of Shor's \(r\)-algorithm
- A method of truncated codifferential with application to some problems of cluster analysis
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- Methods of descent for nondifferentiable optimization
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
- Introduction to Nonsmooth Optimization
- An aggregate subgradient method for nonsmooth convex minimization
- Using simplex gradients of nonsmooth functions in direct search methods
- Non-smoothness in classification problems
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Optimization of lipschitz continuous functions
- Variants to the cutting plane approach for convex nondifferentiable optimization
- Analysis of Generalized Pattern Searches
- Trust Region Methods
- Survey of Bundle Methods for Nonsmooth Optimization
- Robust Formulations for Training Multilayer Perceptrons
- Mathematical Programming for Data Mining: Formulations and Challenges
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- New limited memory bundle method for large-scale nonsmooth optimization
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
