Skip to search formSkip to main contentSkip to account menu

Convex optimization

Known as: Convex programming, Convex optimization problem, Convex problem 
Convex minimization, a subfield of optimization, studies the problem of minimizing convex functions over convex sets. The convexity property can make… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
This paper studies the tradeoff between energy consumption and application performance in wireless sensor networks by… 
Highly Cited
2007
Highly Cited
2007
This paper deals with the problem of medium access control (MAC)-layer fair power control in a wireless mesh network with an… 
Highly Cited
2006
Highly Cited
2006
For fading broadcast channels (BC), a throughput optimal scheduling policy called queue proportional scheduling (QPS) is… 
1989
1989
An algorithm for solving convex programming problems is derived from the differential equation characterizing the trajectory of… 
Highly Cited
1987
Highly Cited
1987
Separable sublinear functions are used to provide upper bounds on the recourse function of a stochastic program. The resulting… 
Highly Cited
1966
Highly Cited
1966
Highly Cited
1966
Abstract : In a previous paper (AD-612 896), the author described and characterized the equivalent convex program of a twostage…