Subgradient method for nonconvex nonsmooth optimization

DOI10.1007/s10957-012-0167-6zbMath1282.90133OpenAlexW1990626142WikidataQ109595688 ScholiaQ109595688MaRDI QIDQ353174

Mohammad Hasan, M. Dambrine

Publication date: 12 July 2013

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-012-0167-6

zbMATH Keywords

nonsmooth optimizationsubgradient methodnonconvex optimizationbundle methodquasisecants

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical methods based on nonlinear programming (49M37)

Related Items

A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions, Solving quadratic multi-leader-follower games by smoothing the follower's best response, On constraint qualifications and sensitivity analysis for general optimization problems via pseudo-Jacobians, Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems, A new trust region method for nonsmooth nonconvex optimization, Non-convex multiobjective optimization under uncertainty: a descent algorithm. Application to sandwich plate design and reliability, Unnamed Item, A globally convergent algorithm for nonconvex optimization based on block coordinate update, New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information, Stochastic perturbation of subgradient algorithm for nonconvex deep neural networks, A Nonsmooth Trust-Region Method for Locally Lipschitz Functions with Application to Optimization Problems Constrained by Variational Inequalities, A variance-based method to rank input variables of the mesh adaptive direct search algorithm, GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression, Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions, Aggregate subgradient method for nonsmooth DC optimization, A quasisecant method for solving a system of nonsmooth equations, A filter proximal bundle method for nonsmooth nonconvex constrained optimization, Aggregate codifferential method for nonsmooth DC optimization

Uses Software

• NDA
• PNEW
• DGM
• QSM
• LDGB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Primal-dual subgradient methods for convex problems
• Globally convergent limited memory bundle method for large-scale nonsmooth optimization
• Discrete gradient method: Derivative-free method for nonsmooth optimization
• Two ``well-known properties of subgradient optimization
• Subgradient methods for saddle-point problems
• A bundle-Newton method for nonsmooth unconstrained minimization
• An effective line search for the subgradient method
• Methods of descent for nondifferentiable optimization
• An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
• A Redistributed Proximal Bundle Method for Nonconvex Optimization
• A quasisecant method for minimizing nonsmooth functions
• Robust Stochastic Approximation Approach to Stochastic Programming
• Optimization and nonsmooth analysis
• Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization
• Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
• A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
• New limited memory bundle method for large-scale nonsmooth optimization
• Algorithm 811: NDA
• Benchmarking optimization software with performance profiles.