Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 236,796,739 papers from all fields of science
Search
Sign In
Create Free Account
Convex optimization
Known as:
Convex programming
, Convex optimization problem
, Convex problem
Expand
Convex minimization, a subfield of optimization, studies the problem of minimizing convex functions over convex sets. The convexity property can make…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
48 relations
Backpropagation
Barrier function
Bregman method
Characteristic function (convex analysis)
Expand
Broader (1)
Convex analysis
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Cross-Layer Estimation and Control for Cognitive Radio: Exploiting Sparse Network Dynamics
Nicolò Michelusi
,
U. Mitra
IEEE Transactions on Cognitive Communications and…
2015
Corpus ID: 1808538
In this paper, a cross-layer framework to jointly optimize spectrum sensing and access in agile wireless networks is presented. A…
Expand
2010
2010
Unequal error protection rateless coding design for multimedia multicasting
Yu Cao
,
S. Blostein
,
W. Chan
IEEE International Symposium on Information…
2010
Corpus ID: 1722797
We study the design and optimization of unequal error protection (UEP) rateless codes for scalable multimedia multicasting. We…
Expand
2010
2010
Multi-Wafer Virtual Probe: Minimum-cost variation characterization by exploring wafer-to-wafer correlation
Wangyang Zhang
,
Xin Li
,
E. Acar
,
Frank Liu
,
Rob A. Rutenbar
IEEE/ACM International Conference on Computer…
2010
Corpus ID: 17419667
In this paper, we propose a new technique, referred to as Multi-Wafer Virtual Probe (MVP) to efficiently model wafer-level…
Expand
2007
2007
Achievable Rates of Compress-and-Forward Cooperative Relaying on Gaussian Vector Channels
S. Simoens
,
O. Muñoz
,
J. Vidal
IEEE International Conference on Communications
2007
Corpus ID: 1481106
The compress-and-forward (C&F) cooperative relaying strategy is known to outperform decode-and-forward (D&F) when the relay is…
Expand
Highly Cited
2004
Highly Cited
2004
Energy-Constrained Optimal Quantization for Wireless Sensor Networks
Xiliang Luo
,
G. Giannakis
First Annual IEEE Communications Society…
2004
Corpus ID: 5565501
As low power, low cost, and longevity of transceivers are major requirements in wireless sensor networks, optimizing their design…
Expand
2003
2003
PCG: A foothold selection algorithm for spider robot locomotion in 2D tunnels
Amir Shapiro
,
E. Rimon
IEEE International Conference on Robotics and…
2003
Corpus ID: 14409146
This paper presents an algorithm, called PCG, for planning the foothold positions of spider-like robots in planar tunnels bounded…
Expand
2001
2001
Decentralized Computation of Weighted Max-Min Fair Bandwidth Allocation in Networks with Multicast Flows
E. Graves
,
R. Srikant
,
D. Towsley
International Workshop on Distributed Computing
2001
Corpus ID: 94443
We consider the problem of designing decentralized algorithms to achieve max-min fairness in multicast networks. Starting with a…
Expand
Highly Cited
1975
Highly Cited
1975
The minimum distance for MLSE digital data systems of limited complexity
R. Anderson
,
G. Foschini
IEEE Transactions on Information Theory
1975
Corpus ID: 206732387
The minimum distance d_{\text{min}} is the fundamental performance parameter for modems using maximum likelihood sequence…
Expand
1974
1974
A simplicial algorithm for the nonlinear complementarity problem
M. Fisher
,
F. J. Gould
Mathematical programming
1974
Corpus ID: 30637671
A triangulation of the nonnegative orthant and a special labeling of the vertices lead to a combinatorial procedure for seeking…
Expand
Highly Cited
1966
Highly Cited
1966
Programming Under Uncertainty: The Solution Set
R. Wets
1966
Corpus ID: 39245195
Abstract : In a previous paper (AD-612 896), the author described and characterized the equivalent convex program of a twostage…
Expand