Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 241,175,409 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.
2016
2016
Optimal Secure Multicast With Simultaneous Wireless Information and Power Transfer in Presence of Multiparty Eavesdropper Collusion
Wen-Jun Xu
,
Sheng-Yu Li
,
Chia-han Lee
,
Zhi-Yong Feng
,
Jia-Ru Lin
IEEE Transactions on Vehicular Technology
2016
Corpus ID: 19725786
In this paper, secure transmission with simultaneous information and energy multicast in the presence of multiparty eavesdropper…
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
2004
2004
Stable solutions on $\R^n$ and the primary branch of some non-self-adjoint convex problems
E. Dancer
Differential and Integral Equations
2004
Corpus ID: 123773580
2001
2001
Decentralized Computation of Weighted Max-Min Fair Bandwidth Allocation in Networks with Multicast Flows
Emily 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
Review
1996
Review
1996
Trellis code design for correlated fading and achievable rates for tomlinson-harashima precoding
R. Wesel
1996
Corpus ID: 14844440
The increased data rates and reliability required to support emerging multimedia applications require new communications…
Expand
1996
1996
Interior-Point Methods for Classes of Convex Programs
F. Jarre
1996
Corpus ID: 120178852
Many of the theoretical results of the previous chapters about interior-point methods for solving linear programs also hold for…
Expand
1987
1987
Directional derivatives for the value-function in semi-infinite programming
P. Zencke
,
R. Hettich
Mathematical programming
1987
Corpus ID: 41343888
For the problemP(λ): MaximizecTz subject toz∈Z(λ), whereZ(λ) is defined by an in general infinite set of linear inequalities, it…
Expand
Highly Cited
1975
Highly Cited
1975
The minimum distance for MLSE digital data systems of limited complexity
Richard 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
1975
1975
Constrained Kullback-Leibler Estimation; Generalized Cobb-Douglas Balance, and Unconstrained Convex Programming.
A. Charnes
,
W. Cooper
1975
Corpus ID: 116912959
Abstract : In this paper the authors characterize completely the relationships of (1) a more general case than Kullback-Leibler…
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