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)

Related topics

Related topics

48 relations
BackpropagationBarrier functionBregman methodCharacteristic function (convex analysis)

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
In this paper, a cross-layer framework to jointly optimize spectrum sensing and access in agile wireless networks is presented. A… 
2013
2013
Tight Convex Relaxations for Vector-Valued Labeling
Multilabel problems are of fundamental importance in computer vision and image analysis. Yet, finding global minima of the… 
2010
2010
Multi-Wafer Virtual Probe: Minimum-cost variation characterization by exploring wafer-to-wafer correlation
In this paper, we propose a new technique, referred to as Multi-Wafer Virtual Probe (MVP) to efficiently model wafer-level… 
2010
2010
Unequal error protection rateless coding design for multimedia multicasting
We study the design and optimization of unequal error protection (UEP) rateless codes for scalable multimedia multicasting. We… 
2009
2009
NOTES ON BROWDER'S AND HALPERN'S METHODS FOR NONEXPANSIVE MAPPINGS
We show that a projection applied to Browder's and Halpern's methods can find the minimum-norm fixed point of a nonexpansive… 
Highly Cited
2004
Highly Cited
2004
Energy-Constrained Optimal Quantization for Wireless Sensor Networks
As low power, low cost, and longevity of transceivers are major requirements in wireless sensor networks, optimizing their design… 
Review
1996
Review
1996
Trellis code design for correlated fading and achievable rates for tomlinson-harashima precoding
The increased data rates and reliability required to support emerging multimedia applications require new communications… 
1989
1989
The Projective SUMT Method for Convex Programming
An algorithm for solving convex programming problems is derived from the differential equation characterizing the trajectory of… 
Highly Cited
1975
Highly Cited
1975
The minimum distance for MLSE digital data systems of limited complexity
The minimum distance d_{\text{min}} is the fundamental performance parameter for modems using maximum likelihood sequence… 
Highly Cited
1966
Highly Cited
1966
Programming Under Uncertainty: The Solution Set
Abstract : In a previous paper (AD-612 896), the author described and characterized the equivalent convex program of a twostage… 
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)