Subgradient method for nonconvex nonsmooth optimization
From MaRDI portal
Recommendations
- A generalized subgradient method with piecewise linear subproblem
- A subgradient method for unconstrained nonconvex nonsmooth optimization
- A quasisecant method for minimizing nonsmooth functions
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
- Weak subgradient method for solving nonsmooth nonconvex optimization problems
Cites work
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 53965 (Why is no real title available?)
- scientific article; zbMATH DE number 872150 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- A bundle-Newton method for nonsmooth unconstrained minimization
- A generalized subgradient method with piecewise linear subproblem
- A quasisecant method for minimizing nonsmooth functions
- A redistributed proximal bundle method for nonconvex optimization
- Algorithm 811: NDA
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
- An effective line search for the subgradient method
- Benchmarking optimization software with performance profiles.
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization
- Methods of descent for nondifferentiable optimization
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- New limited memory bundle method for large-scale nonsmooth optimization
- Optimization and nonsmooth analysis
- Primal-dual subgradient methods for convex problems
- Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization
- Robust Stochastic Approximation Approach to Stochastic Programming
- Subgradient methods for saddle-point problems
- Two ``well-known properties of subgradient optimization
Cited in
(34)- Manifold sampling for optimizing nonsmooth nonconvex compositions
- Quasi-monotone subgradient methods for nonsmooth convex minimization
- RSG: Beating Subgradient Method without Smoothness and Strong Convexity
- An interior-point based subgradient method for nondifferentiable convex optimization
- New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information
- Convergence of the proximal bundle algorithm for nonsmooth nonconvex optimization problems
- Solving quadratic multi-leader-follower games by smoothing the follower's best response
- An improved subgradient method for constrained nondifferentiable optimization
- Unique sharp local minimum in \(\ell_1\)-minimization complete dictionary learning
- Weak subgradient method for solving nonsmooth nonconvex optimization problems
- An inexact modified subgradient algorithm for nonconvex optimization
- scientific article; zbMATH DE number 3995464 (Why is no real title available?)
- A subgradient method for unconstrained nonconvex nonsmooth optimization
- Aggregate codifferential method for nonsmooth DC optimization
- Non-convex multiobjective optimization under uncertainty: a descent algorithm. Application to sandwich plate design and reliability
- A filter proximal bundle method for nonsmooth nonconvex constrained optimization
- On constraint qualifications and sensitivity analysis for general optimization problems via pseudo-Jacobians
- Subgradient ellipsoid method for nonsmooth convex problems
- A variance-based method to rank input variables of the mesh adaptive direct search algorithm
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
- A quasisecant method for minimizing nonsmooth functions
- A new trust region method for nonsmooth nonconvex optimization
- GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression
- A nonsmooth trust-region method for locally Lipschitz functions with application to optimization problems constrained by variational inequalities
- A generalized subgradient method with piecewise linear subproblem
- The subdifferential descent method in a nonsmooth variational problem
- A quasisecant method for solving a system of nonsmooth equations
- A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions
- An aggregate subgradient methods for nonsmooth constrained minimization
- Aggregate subgradient smoothing methods for large scale nonsmooth nonconvex optimisation and applications
- Generalized-Hukuhara subdifferential analysis and its application in nonconvex composite interval optimization problems
- Stochastic perturbation of subgradient algorithm for nonconvex deep neural networks
- Aggregate subgradient method for nonsmooth DC optimization
This page was built for publication: Subgradient method for nonconvex nonsmooth optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q353174)
