A subgradient method based on gradient sampling for solving convex optimization problems
From MaRDI portal
Recommendations
- Convergence of a generalized subgradient method for nondifferentiable convex optimization
- ``Efficient subgradient methods for general convex optimization
- An interior-point based subgradient method for nondifferentiable convex optimization
- Two-direction subgradient method for non-differentiable optimization problems
- scientific article; zbMATH DE number 4041643
Cites work
- scientific article; zbMATH DE number 3830713 (Why is no real title available?)
- scientific article; zbMATH DE number 4164577 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A merit function approach to the subgradient method with averaging
- An aggregate subgradient method for nonsmooth convex minimization
- Approximate Primal Solutions and Rate Analysis for Dual Subgradient Methods
- Approximating Subdifferentials by Random Sampling of Gradients
- Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Convergence of a generalized subgradient method for nondifferentiable convex optimization
- Convergence of a simple subgradient level method
- Ergodic convergence in subgradient optimization
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Incremental subgradient methods for nondifferentiable optimization
- Inexact subgradient methods for quasi-convex optimization problems
- Information Relaxations, Duality, and Convex Stochastic Dynamic Programs
- Lagrangian Relaxation via Ballstep Subgradient Methods
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- On a modified subgradient algorithm for dual problems via sharp augmented Lagrangian
- On the convergence of conditional -subgradient methods for convex programs and convex-concave saddle-point problems.
- Primal-dual subgradient methods for convex problems
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and Extensions
- The efficiency of ballstep subgradient level methods for convex optimization
- Two numerical methods for optimizing matrix stability
- Variational Analysis
- What is the Subdifferential of the Closed Convex Hull of a Function?
Cited in
(8)- Subgradient and sampling algorithms for \(\ell_1\) regression
- On the convergence of broadcast incremental algorithms with applications
- The method of codifferential descent for convex and global piecewise affine optimization
- Optimal sample complexity of subgradient descent for amplitude flow via non-Lipschitz matrix concentration
- A ranking-based adaptive artificial bee colony algorithm for global numerical optimization
- An optimal subgradient algorithm with subspace search for costly convex optimization problems
- Adaptive iterative Hessian sketch via A-optimal subsampling
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
This page was built for publication: A subgradient method based on gradient sampling for solving convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2795104)
