1118 search results - page 11 / 224 » Convex Optimization |
PG
2003
IEEE
15 years 2 months ago
2003
IEEE
We present an algorithm to construct a tight bounding polyhedron for a recursive procedural model. We first use an iterated function system (IFS) to represent the extent of the p...
79
Voted
ICASSP
2009
IEEE
15 years 1 months ago
2009
IEEE
Broadband data-independent beamforming designs aiming at constant beamwidth often lead to superdirective beamformers for low frequencies, if the sensor spacing is small relative t...
75
Voted
CDC
2009
IEEE
14 years 7 months ago
2009
IEEE
In this paper, we investigate the cell design of bacteria during the exponential growth. To this purpose, we propose to formulate the problem as a non differentiable convex optimiz...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
This paper presents an efficient implementation of a robust adaptive beamforming algorithm based on convex optimization for applications in the processing-constrained environment...
MOR
2006
14 years 9 months ago
2006
We apply the method known as simulated annealing to the following problem in convex optimization: minimize a linear function over an arbitrary convex set, where the convex set is ...