Aggregate subgradient method for nonsmooth DC optimization
From MaRDI portal
Publication:1996741
DOI10.1007/S11590-020-01586-ZzbMATH Open1460.90140OpenAlexW3025582638WikidataQ109595508 ScholiaQ109595508MaRDI QIDQ1996741FDOQ1996741
Authors: Sona Taheri, Kaisa Joki, N. Karmitsa, Marko M. Mäkelä, A. M. Bagirov 
Publication date: 26 February 2021
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-020-01586-z
Recommendations
- An aggregate subgradient method for nonsmooth and nonconvex minimization
- Aggregate codifferential method for nonsmooth DC optimization
- An aggregate subgradient methods for nonsmooth constrained minimization
- Aggregate subgradient smoothing methods for large scale nonsmooth nonconvex optimisation and applications
- An augmented subgradient method for minimizing nonsmooth DC functions
- scientific article; zbMATH DE number 3887449
- A subgradient-based convex approximations method for DC programming and its applications
- Subgradient method for nonconvex nonsmooth optimization
- A subgradient method for unconstrained nonconvex nonsmooth optimization
- scientific article; zbMATH DE number 727769
Cites Work
- An implementation of Shor's \(r\)-algorithm
- New limited memory bundle method for large-scale nonsmooth optimization
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- Benchmarking optimization software with performance profiles.
- Two ``well-known properties of subgradient optimization
- Primal-dual subgradient methods for convex problems
- Robust Stochastic Approximation Approach to Stochastic Programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- A bundle-Newton method for nonsmooth unconstrained minimization
- Methods of descent for nondifferentiable optimization
- A redistributed proximal bundle method for nonconvex optimization
- Title not available (Why is that?)
- A quasisecant method for minimizing nonsmooth functions
- Title not available (Why is that?)
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Global optimality conditions for nonconvex optimization
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- Convex analysis and global optimization
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Global convergence of a proximal linearized algorithm for difference of convex functions
- An effective line search for the subgradient method
- Subgradient method for nonconvex nonsmooth optimization
- Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems
- Introduction to nonsmooth optimization. Theory, practice and software
- Codifferential method for minimizing nonsmooth DC functions
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- Double bundle method for finding Clarke stationary points in nonsmooth DC programming
- An approximate ADMM for solving linearly constrained nonsmooth optimization problems with two blocks of variables
Cited In (10)
- Aggregate subgradient smoothing methods for large scale nonsmooth nonconvex optimisation and applications
- An augmented subgradient method for minimizing nonsmooth DC functions
- Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems
- An aggregate subgradient methods for nonsmooth constrained minimization
- Aggregate codifferential method for nonsmooth DC optimization
- DC optimization for constructing discrete Sugeno integrals and learning nonadditive measures
- A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions
- New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information
- Robust piecewise linear L1-regression via nonsmooth DC optimization
- Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints
Uses Software
This page was built for publication: Aggregate subgradient method for nonsmooth DC optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1996741)
