Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,182,844 papers from all fields of science
Search
Sign In
Create Free Account
Subderivative
Known as:
Subdifferential
, Subgradient
In mathematics, the subderivative, subgradient, and subdifferential generalize the derivative to functions which are not differentiable. The…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
17 relations
Broader (2)
Convex analysis
Mathematical optimization
Convex function
Convex optimization
Convex set
Convexity in economics
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Resource Allocation in Spectrum-Sharing OFDMA Femtocells With Heterogeneous Services
Haijun Zhang
,
Chunxiao Jiang
,
N. Beaulieu
,
Xiaoli Chu
,
X. Wen
,
M. Tao
IEEE Transactions on Communications
2014
Corpus ID: 14762556
Femtocells are being considered a promising technique to improve the capacity and coverage for indoor wireless users. However…
Expand
Highly Cited
2009
Highly Cited
2009
Small gain theorems for large scale systems and construction of ISS Lyapunov functions
S. Dashkovskiy
,
Björn S. Rüffer
,
F. Wirth
IEEE Conference on Decision and Control
2009
Corpus ID: 781801
We consider interconnections of n nonlinear subsystems in the input-to-state stability (ISS) framework. For each subsystem an ISS…
Expand
Highly Cited
2005
Highly Cited
2005
Joint congestion control and media access control design for ad hoc wireless networks
Lijun Chen
,
S. Low
,
J. Doyle
Proceedings IEEE 24th Annual Joint Conference of…
2005
Corpus ID: 2748404
We present a model for the joint design of congestion control and media access control (MAC) for ad hoc wireless networks. Using…
Expand
Highly Cited
2000
Highly Cited
2000
A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
K. Holmberg
,
D. Yuan
Operational Research
2000
Corpus ID: 39092140
The capacitated network design problem is a multicommodity minimal cost network flow problem with fixed charges on the arcs and…
Expand
Highly Cited
1997
Highly Cited
1997
The aircraft rotation problem
L. Clarke
,
Ellis L. Johnson
,
G. Nemhauser
,
Z. Zhu
Annals of Operations Research
1997
Corpus ID: 27714200
Given a set of flights to be flown for a specific aircraft type, with specified maintenance locations, durations, and needed…
Expand
Highly Cited
1989
Highly Cited
1989
A system for routing and capacity assignment in computer communication networks
B. Gavish
,
Irina Neuman
IEEE Transactions on Communications
1989
Corpus ID: 27301397
The combined problem of selecting a primary route for each communicating pair and a capacity value for each link in computer…
Expand
Highly Cited
1981
Highly Cited
1981
Favorable Classes of Lipschitz Continuous Functions in Subgradient Optimization
R. Rockafellar
1981
Corpus ID: 117721722
Clarke has given a robust definition of subgradients of arbitrary Lipschitz continuous functions f on R^n, but for purposes of…
Expand
Highly Cited
1978
Highly Cited
1978
The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
J. Picard
,
M. Queyranne
Operational Research
1978
Corpus ID: 9776610
The time-dependent traveling salesman problem may be stated as a scheduling problem in which n jobs have to be processed at…
Expand
Highly Cited
1974
Highly Cited
1974
Note on a method of conjugate subgradients for minimizing nondifferentiable functions
P. Wolfe
Mathematical programming
1974
Corpus ID: 17616977
An algorithm is described for finding the minimum of any convex, not necessarily differentiable, functionf of several variables…
Expand
Highly Cited
1965
Highly Cited
1965
On the subdifferentiability of convex functions
A. Brøndsted
,
R. Rockafellar
1965
Corpus ID: 51763902
(Thus the subgradients of f correspond to the nonvertical supporting hyperplanes to the convex set consisting of all the points…
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
or Only Accept Required