Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
From MaRDI portal
Recommendations
- Diagonal discrete gradient bundle method for derivative free nonsmooth optimization
- New limited memory bundle method for large-scale nonsmooth optimization
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization
- Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis
Cites work
- A method of truncated codifferential with application to some problems of cluster analysis
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- A redistributed proximal bundle method for nonconvex optimization
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A Trust Region Spectral Bundle Method for Nonconvex Eigenvalue Optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
- An aggregate subgradient method for nonsmooth convex minimization
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
- An implementation of Shor's \(r\)-algorithm
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- Analysis of Generalized Pattern Searches
- Comparing different nonsmooth minimization methods and software
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- Globally convergent cutting plane method for nonconvex nonsmooth minimization
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- scientific article; zbMATH DE number 53965 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 888764 (Why is no real title available?)
- Limited memory interior point bundle method for large inequality constrained nonsmooth minimization
- Mathematical Programming for Data Mining: Formulations and Challenges
- Methods of descent for nondifferentiable optimization
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- New limited memory bundle method for large-scale nonsmooth optimization
- New variable-metric algorithms for nondifferentiable optimization problems
- Non-Euclidean restricted memory level method for large-scale convex optimization
- Non-smoothness in classification problems
- Optimization of lipschitz continuous functions
- Optimization of upper semidifferentiable functions
- Representations of quasi-Newton matrices and their use in limited memory methods
- Robust Formulations for Training Multilayer Perceptrons
- Semismooth and Semiconvex Functions in Constrained Optimization
- Survey of Bundle Methods for Nonsmooth Optimization
- Using simplex gradients of nonsmooth functions in direct search methods
- Variants to the cutting plane approach for convex nondifferentiable optimization
Cited in
(17)- A geometric integration approach to nonsmooth, nonconvex optimisation
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
- A derivative-free method for linearly constrained nonsmooth optimization
- Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization
- Diagonal discrete gradient bundle method for derivative free nonsmooth optimization
- Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis
- An extension of the quasi-Newton method for minimizing locally Lipschitz functions
- Manifold sampling for optimizing nonsmooth nonconvex compositions
- A splitting bundle approach for non-smooth non-convex minimization
- Application of derivative free methods for production optimization
- New limited memory bundle method for large-scale nonsmooth optimization
- A clustering heuristic to improve a derivative-free algorithm for nonsmooth optimization
- A new nonmonotone line search method for nonsmooth nonconvex optimization
- Structure-Aware Methods for Expensive Derivative-Free Nonsmooth Composite Optimization
- Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Discrete gradient method: Derivative-free method for nonsmooth optimization
This page was built for publication: Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3145057)
