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.
2015
2015
A Novel Multiagent Control Scheme for Voltage Regulation in DC Distribution Systems
This paper proposes a novel multiagent control scheme to mitigate the voltage regulation challenges of dc distribution systems… 
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… 
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… 
Highly Cited
2004
Highly Cited
2004
A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
We introduce an algorithm to minimize a function of several variables with no convexity nor smoothness assumptions. The main… 
Highly Cited
2001
Highly Cited
2001
Bundle Methods in Stochastic Optimal Power Management: A Disaggregated Approach Using Preconditioners
A specialized variant of bundle methods suitable for large-scale problems with separable objective is presented. The method is… 
Highly Cited
2001
Highly Cited
2001
Filled functions for unconstrained global optimization
This paper is concerned with filled function techniques for unconstrained global minimization of a continuous function of several… 
Highly Cited
1999
Highly Cited
1999
A transmission-constrained unit commitment method in power system scheduling
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… 
Highly Cited
1982
Highly Cited
1982
Cyclic subgradient projections
A cyclically controlled method of subgradient projections (CSP) for the convex feasibility problem of solving convex inequalities… 
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)