Sciweavers

161 search results - page 10 / 33
» Methods for convex and general quadratic programming
Sort
View
COR
2008
101views more  COR 2008»
14 years 11 months ago
Stochastic facility location with general long-run costs and convex short-run costs
This paper addresses the problem of minimizing the expected cost of locating a number of single product facilities and allocating uncertain customer demand to these facilities. Th...
Peter Schütz, Leen Stougie, Asgeir Tomasgard
76
Voted
CDC
2009
IEEE
173views Control Systems» more  CDC 2009»
15 years 3 months ago
Fault tolerant control allocation for a thruster-controlled floating platform using parametric programming
— The task in control allocation is to determine how to generate a specified generalized force from a redundant set of control effectors where the associated actuator control in...
Jørgen Spjøtvold, Tor Arne Johansen
ICASSP
2009
IEEE
15 years 2 months ago
Design of robust superdirective beamformers as a convex optimization problem
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...
Edwin Mabande, Adrian Schad, Walter Kellermann
JMIV
2006
124views more  JMIV 2006»
14 years 11 months ago
Iterative Total Variation Regularization with Non-Quadratic Fidelity
Abstract. A generalized iterative regularization procedure based on the total variation penalization is introduced for image denoising models with non-quadratic convex fidelity ter...
Lin He, Martin Burger, Stanley Osher
83
Voted
ICCV
2005
IEEE
16 years 1 months ago
Learning Non-Negative Sparse Image Codes by Convex Programming
Example-based learning of codes that statistically encode general image classes is of vital importance for computational vision. Recently, non-negative matrix factorization (NMF) ...
Christoph Schnörr, Matthias Heiler