Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
From MaRDI portal
Publication:3145057
DOI10.1080/02331934.2012.687736zbMath1259.90164OpenAlexW2132970145WikidataQ109595690 ScholiaQ109595690MaRDI QIDQ3145057
Napsu Karmitsa, Adil M. Bagirov
Publication date: 13 December 2012
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2012.687736
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56) Nonsmooth analysis (49J52)
Related Items (6)
An extension of the quasi-Newton method for minimizing locally Lipschitz functions ⋮ A new nonmonotone line search method for nonsmooth nonconvex optimization ⋮ Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions ⋮ Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems ⋮ A splitting bundle approach for non-smooth non-convex minimization ⋮ A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Globally convergent cutting plane method for nonconvex nonsmooth minimization
- Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
- Optimization of upper semidifferentiable functions
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- New variable-metric algorithms for nondifferentiable optimization problems
- 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
- Non-Euclidean restricted memory level method for large-scale convex optimization
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Methods of descent for nondifferentiable optimization
- Limited memory interior point bundle method for large inequality constrained nonsmooth minimization
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
- Comparing different nonsmooth minimization methods and software
- An aggregate subgradient method for nonsmooth convex minimization
- A Redistributed Proximal Bundle Method for Nonconvex Optimization
- Using simplex gradients of nonsmooth functions in direct search methods
- Non-smoothness in classification problems
- A Trust Region Spectral Bundle Method for Nonconvex Eigenvalue Optimization
- 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
- Semismooth and Semiconvex Functions in Constrained Optimization
- Optimization of lipschitz continuous functions
- Variants to the cutting plane approach for convex nondifferentiable optimization
- Analysis of Generalized Pattern Searches
- Survey of Bundle Methods for Nonsmooth Optimization
- Robust Formulations for Training Multilayer Perceptrons
- Mathematical Programming for Data Mining: Formulations and Challenges
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- 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
This page was built for publication: Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
