Diagonal discrete gradient bundle method for derivative free nonsmooth optimization
From MaRDI portal
Recommendations
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- A derivative-free method for linearly constrained nonsmooth optimization
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis
Cites work
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 888764 (Why is no real title available?)
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- 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
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- An aggregate subgradient method for nonsmooth convex minimization
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
- An implementation of Shor's \(r\)-algorithm
- Analysis of Generalized Pattern Searches
- Diagonal bundle method for nonsmooth sparse optimization
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- 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
- Introduction to nonsmooth optimization. Theory, practice and software
- Mathematical Programming for Data Mining: Formulations and Challenges
- Methods of descent for nondifferentiable optimization
- New limited memory bundle method for large-scale nonsmooth optimization
- Non-smoothness in classification problems
- Optimization of lipschitz continuous functions
- Representations of quasi-Newton matrices and their use in limited memory methods
- Robust Formulations for Training Multilayer Perceptrons
- Supervised classification and mathematical optimization
- Survey of Bundle Methods for Nonsmooth Optimization
- Trust Region Methods
- Using simplex gradients of nonsmooth functions in direct search methods
- Variants to the cutting plane approach for convex nondifferentiable optimization
Cited in
(8)- A new trust region method for nonsmooth nonconvex optimization
- A derivative-free method for linearly constrained nonsmooth optimization
- Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization
- Implementation of an oracle-structured bundle method for distributed optimization
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- Diagonal bundle method for nonsmooth sparse optimization
- Minimization of marginal functions in mathematical programming based on continuous outer subdifferentials
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
This page was built for publication: Diagonal discrete gradient bundle method for derivative free nonsmooth optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817235)
