Skip to search formSkip to main contentSkip to account menu

Subgradient method

Known as: Bundle method, Nonsmooth minimization, Subgradient methods 
Subgradient methods are iterative methods for solving convex minimization problems. Originally developed by Naum Z. Shor and others in the 1960s and… 
Wikipedia (opens in a new tab)

Related topics

Related topics

14 relations
Convex functionConvex optimizationConvex setDrift plus penalty

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Stochastic Smoothing for Nonsmooth Minimizations: Accelerating SGD by Exploiting Structure
In this work we consider the stochastic minimization of nonsmooth convex loss functions, a central problem in machine learning… 
2010
2010
A gossip algorithm for convex consensus optimization over networks
In many applications, nodes in a network wish to achieve not only a consensus, but an optimal one. To date, a family of… 
2010
2010
Globally Optimal Resource Allocation for Achieving Maximum Weighted Sum Rate
We establish a general optimization framework for joint resource allocation and interference mitigation. By utilizing axiomatic… 
2006
2006
Utility-Optimal Medium Access Control: Reverse and Forward Engineering
This paper analyzes and designs medium access control (MAC) protocols for wireless ad-hoc networks through the network utility… 
2006
2006
Collaborative Planning in Supply Chains by Lagrangian Relaxation and Genetic Algorithms
A collaborative planning framework combining the Lagrangian relaxation method and genetic algorithms is developed to coordinate… 
Highly Cited
2004
Highly Cited
2004
Dual optimization methods for multiuser orthogonal frequency division multiplex systems
The design and optimization of orthogonal frequency division multiplex (OFDM) systems typically take the following form. The… 
2003
2003
Single machine scheduling with symmetric earliness and tardiness penalties
Highly Cited
1999
Highly Cited
1999
A transmission-constrained unit commitment method in power system scheduling
1998
1998
A Lagrangean approach to network design problems
Highly Cited
1988
Highly Cited
1988
Routing in a Network with Unreliable Components
A new approach to the joint selection of primary and secondary routes in a network with unreliable components is presented. The… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)