Diagonal bundle method for nonsmooth sparse optimization
From MaRDI portal
Publication:495735
DOI10.1007/S10957-014-0666-8zbMATH Open1323.65069OpenAlexW1985700739WikidataQ109595645 ScholiaQ109595645MaRDI QIDQ495735FDOQ495735
Authors: N. Karmitsa 
Publication date: 15 September 2015
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-014-0666-8
Recommendations
- Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization
- Diagonal discrete gradient bundle method for derivative free nonsmooth optimization
- New limited memory bundle method for large-scale nonsmooth optimization
- Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
convergencenonconvex optimizationnumerical experimentbundle methodslarge-scale problemsnondifferentiable optimizationdiagonal variable metric methodssparse problems
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26)
Cites Work
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Globally convergent cutting plane method for nonconvex nonsmooth minimization
- New limited memory bundle method for large-scale nonsmooth optimization
- Updating Quasi-Newton Matrices with Limited Storage
- Title not available (Why is that?)
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Title not available (Why is that?)
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Representations of quasi-Newton matrices and their use in limited memory methods
- Methods of descent for nondifferentiable optimization
- Comparing different nonsmooth minimization methods and software
- A redistributed proximal bundle method for nonconvex optimization
- A quasisecant method for minimizing nonsmooth functions
- A proximity control algorithm to minimize nonsmooth and nonconvex functions
- Optimization and nonsmooth analysis
- Title not available (Why is that?)
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Title not available (Why is that?)
- Title not available (Why is that?)
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Non-Euclidean restricted memory level method for large-scale convex optimization
- Globally convergent variable metric method for convex nonsmooth unconstrained minimization
- Supervised classification and mathematical optimization
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- Survey of Bundle Methods for Nonsmooth Optimization
- Title not available (Why is that?)
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
- A Trust Region Spectral Bundle Method for Nonconvex Eigenvalue Optimization
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- Non-smoothness in classification problems
- Mathematical Programming for Data Mining: Formulations and Challenges
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
- Title not available (Why is that?)
- Synchronous approach in interactive multiobjective optimization
- On Sparse and Symmetric Matrix Updating Subject to a Linear Equation
- Title not available (Why is that?)
- An Optimal Positive Definite Update for Sparse Hessian Matrices
- Nonconvex optimization in mechanics. Algorithms, heuristics and engineering applications by the F. E. M
- New variable-metric algorithms for nondifferentiable optimization problems
- A method of truncated codifferential with application to some problems of cluster analysis
- Limited memory interior point bundle method for large inequality constrained nonsmooth minimization
- Introduction to nonsmooth optimization. Theory, practice and software
- Title not available (Why is that?)
- Variants to the cutting plane approach for convex nondifferentiable optimization
- Title not available (Why is that?)
- Robust Formulations for Training Multilayer Perceptrons
- A splitting bundle approach for non-smooth non-convex minimization
- Optimization of upper semidifferentiable functions
Cited In (9)
- Numerical infinitesimals in a variable metric method for convex nonsmooth optimization
- Non-smooth optimization based on resilient backpropagation search for unconstrained and simply bounded problems
- Essentials of numerical nonsmooth optimization
- Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization
- New active set identification for general constrained optimization and minimax problems
- Diagonal discrete gradient bundle method for derivative free nonsmooth optimization
- Minimization of marginal functions in mathematical programming based on continuous outer subdifferentials
- New diagonal bundle method for clustering problems in large data sets
- Essentials of numerical nonsmooth optimization
Uses Software
This page was built for publication: Diagonal bundle method for nonsmooth sparse optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q495735)
