Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,930,399 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
Convex function
Convex optimization
Convex set
Drift plus penalty
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
A gossip algorithm for convex consensus optimization over networks
Jie Lu
,
Choon Yik Tang
,
Paul R. Regier
,
T. D. Bow
Proceedings of the American Control Conference
2010
Corpus ID: 13340565
In many applications, nodes in a network wish to achieve not only a consensus, but an optimal one. To date, a family of…
Expand
2010
2010
Globally Optimal Resource Allocation for Achieving Maximum Weighted Sum Rate
Kristoffer Eriksson
,
Shuying Shi
,
N. Vučić
,
M. Schubert
,
E. Larsson
IEEE Global Telecommunications Conference…
2010
Corpus ID: 2625815
We establish a general optimization framework for joint resource allocation and interference mitigation. By utilizing axiomatic…
Expand
2007
2007
A Pricing Mechanism for Resource Allocation in Wireless Multimedia Applications
Fangwen Fu
,
T. Stoenescu
,
M. Schaar
IEEE Journal on Selected Topics in Signal…
2007
Corpus ID: 14428466
We consider the problem of multiuser resource allocation for wireless multimedia applications deployed by autonomous and…
Expand
2006
2006
Collaborative Planning in Supply Chains by Lagrangian Relaxation and Genetic Algorithms
Lanshun Nie
,
Xiaofei Xu
,
D. Zhan
World Congress on Intelligent Control and…
2006
Corpus ID: 17024988
A collaborative planning framework combining the Lagrangian relaxation method and genetic algorithms is developed to coordinate…
Expand
Highly Cited
2004
Highly Cited
2004
Dual optimization methods for multiuser orthogonal frequency division multiplex systems
Wei Yu
,
R. Lui
,
R. Cendrillon
IEEE Global Telecommunications Conference…
2004
Corpus ID: 9633490
The design and optimization of orthogonal frequency division multiplex (OFDM) systems typically take the following form. The…
Expand
2003
2003
Single machine scheduling with symmetric earliness and tardiness penalties
J. A. Ventura
,
S. Radhakrishnan
European Journal of Operational Research
2003
Corpus ID: 5185114
Highly Cited
1999
Highly Cited
1999
A transmission-constrained unit commitment method in power system scheduling
C. Tseng
,
S. Oren
,
Carol S. Cheng
,
Chao-an Li
,
A. Svoboda
,
Raymond B. Johnson
Decision Support Systems
1999
Corpus ID: 14754704
1998
1998
A Lagrangean approach to network design problems
K. Holmberg
,
D. Yuan
1998
Corpus ID: 204105517
Highly Cited
1988
Highly Cited
1988
Routing in a Network with Unreliable Components
B. Gavish
,
Irina Neuman
IEEE Transactions on Communications
1988
Corpus ID: 15521260
A new approach to the joint selection of primary and secondary routes in a network with unreliable components is presented. The…
Expand
Highly Cited
1982
Highly Cited
1982
Cyclic subgradient projections
Y. Censor
,
A. Lent
Mathematical programming
1982
Corpus ID: 35218369
A cyclically controlled method of subgradient projections (CSP) for the convex feasibility problem of solving convex inequalities…
Expand
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)
ACCEPT & CONTINUE