A splitting bundle approach for non-smooth non-convex minimization
From MaRDI portal
Publication:5248228
DOI10.1080/02331934.2013.840625zbMath1311.90108OpenAlexW2032305870MaRDI QIDQ5248228
No author found.
Publication date: 28 April 2015
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2013.840625
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Related Items (11)
A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes ⋮ A new global optimization technique by auxiliary function method in a directional search ⋮ A simple version of bundle method with linear programming ⋮ The semiproximal SVM approach for multiple instance learning: a kernel-based computational study ⋮ A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems ⋮ Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization ⋮ Diagonal bundle method for nonsmooth sparse optimization ⋮ An adaptive competitive penalty method for nonsmooth constrained optimization ⋮ A convergence analysis of the method of codifferential descent ⋮ Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming ⋮ Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems
Cites Work
- Nonsmooth optimization via quasi-Newton methods
- DC models for spherical separation
- Cutting plane oracles to minimize non-smooth non-convex functions
- On solving the Lagrangian dual of integer programs via an incremental approach
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- A bundle modification strategy for convex minimization
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- Computing proximal points of nonconvex functions
- A bundle-filter method for nonsmooth convex constrained optimization
- An inexact bundle variant suited to column generation
- Newton's method for convex programming and Tschebyscheff approximation
- Separating plane algorithms for convex optimization
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
- Margin maximization in spherical separation
- The effect of deterministic noise in subgradient methods
- Tuning strategy for the proximity parameter in convex minimization
- Piecewise linear approximations in nonconvex nonsmooth optimization
- Binary classification via spherical separator by DC programming and DCA
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization
- A Nonmonotone Proximal Bundle Method with (Potentially) Continuous Step Decisions
- Comparing different nonsmooth minimization methods and software
- An aggregate subgradient method for nonsmooth convex minimization
- A Nonderivative Version of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- A Redistributed Proximal Bundle Method for Nonconvex Optimization
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
- Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis
- Piecewise-quadratic Approximations in Convex Numerical Optimization
- The Cutting-Plane Method for Solving Convex Programs
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- On the global convergence of a nonmonotone proximal bundle method for convex nonsmooth minimization
- Identifying Structure of Nonsmooth Convex Functions by the Bundle Technique
- Non-smoothness in classification problems
- A Trust Region Spectral Bundle Method for Nonconvex Eigenvalue Optimization
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- Generalized Bundle Methods
- Survey of Bundle Methods for Nonsmooth Optimization
- 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
- An Incremental Method for Solving Convex Finite Min-Max Problems
- A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
- Approximating Subdifferentials by Random Sampling of Gradients
This page was built for publication: A splitting bundle approach for non-smooth non-convex minimization
