Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization
From MaRDI portal
(Redirected from Publication:4622889)
Recommendations
- Diagonal bundle method for nonsmooth sparse optimization
- Diagonal discrete gradient bundle method for derivative free nonsmooth optimization
- A class of diagonal quasi-Newton methods for large-scale convex minimization
- An implementable bundle method for nonsmooth convex optimization
- Bundle method for nonconvex nonsmooth constrained optimization
- scientific article; zbMATH DE number 16626
- Scaled diagonal gradient-type method with extra update for large-scale unconstrained optimization
- A proximal bundle method for nonsmooth and nonconvex constrained optimization
- Iterative bundle-based decomposition for large-scale nonseparable convex optimization
- A doubly stabilized bundle method for nonsmooth convex optimization
Cites work
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- 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 partially inexact bundle method for convex semi-infinite minmax problems
- A proximity control algorithm to minimize nonsmooth and nonconvex functions
- A redistributed proximal bundle method for nonconvex optimization
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A splitting bundle approach for non-smooth non-convex minimization
- A Trust Region Spectral Bundle Method for Nonconvex Eigenvalue Optimization
- Benchmarking optimization software with performance profiles.
- Comparing different nonsmooth minimization methods and software
- Diagonal bundle method for nonsmooth sparse 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
- Gradient set splitting in nonconvex nonsmooth numerical optimization
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3846333 (Why is no real title available?)
- scientific article; zbMATH DE number 53965 (Why is no real title available?)
- scientific article; zbMATH DE number 193188 (Why is no real title available?)
- scientific article; zbMATH DE number 1113627 (Why is no real title available?)
- scientific article; zbMATH DE number 888764 (Why is no real title available?)
- Introduction to nonsmooth optimization. Theory, practice and software
- Mathematical Programming for Data Mining: Formulations and Challenges
- Methods of descent for nondifferentiable optimization
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- New diagonal bundle method for clustering problems in large data sets
- New limited memory bundle method for large-scale nonsmooth optimization
- Non-smoothness in classification problems
- Nonconvex optimization in mechanics. Algorithms, heuristics and engineering applications by the F. E. M
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- Optimization and nonsmooth analysis
- Optimization of upper semidifferentiable functions
- Representations of quasi-Newton matrices and their use in limited memory methods
- Robust Formulations for Training Multilayer Perceptrons
- Supervised classification and mathematical optimization
Cited in
(2)
This page was built for publication: Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4622889)
