Skip to search formSkip to main contentSkip to account menu

Conic optimization

Known as: Conic programming 
Conic optimization is a subfield of convex optimization that studies a class of structured convex optimization problems called conic optimization… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Source localization in wireless sensor networks (WSNs) aims to determine the position of a source in a network, given inaccurate… 
2011
2011
A robust minimum sidelobe beamforming approach based on the spherical harmonics framework for spherical microphone arrays is… 
Highly Cited
2009
Highly Cited
2009
A computationally efficient distributed beamforming technique for multi-user relay networks is developed. The channel state… 
2008
2008
In the theory of polynomial-time interior-point methods (IPMs) two important classes of methods are distinguished: small-update… 
2006
2006
We propose a pivoting procedure for a class of second-order cone programming (SOCP) problems having one second-order cone, but… 
2005
2005
Consider the problem of finding optimal bounds on the expected value of piecewise polynomials over all measures with a given set… 
2003
2003
This article describes a generalization of the PBM method by Ben-Tal and Zibulevsky to convex semidefinite programming problems… 
2003
2003
Since Lim's 1986 paper on the frequency-response masking (FRM) technique for the design of FIR digital filters with very small… 
2003
2003
It is shown that a multi-target linear-quadratic control problem can be reduced to the classical tracking problem where the… 
Review
1998
Review
1998
Quantitative assessment of performance in image understanding tasks with real data is di cult since the data is complex and the…