Sciweavers

560 search results - page 45 / 112
» Level-set methods for convex optimization
Sort
View
CORR
2011
Springer
167views Education» more  CORR 2011»
14 years 10 months ago
Fast global convergence of gradient methods for high-dimensional statistical recovery
Many statistical M-estimators are based on convex optimization problems formed by the weighted sum of a loss function with a norm-based regularizer. We analyze the convergence rat...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...
146
Voted
TCAD
2008
136views more  TCAD 2008»
15 years 3 months ago
A Geometric Programming-Based Worst Case Gate Sizing Method Incorporating Spatial Correlation
We present an efficient optimization scheme for gate sizing in the presence of process variations. Our method is a worst-case design scheme, but it reduces the pessimism involved i...
Jaskirat Singh, Zhi-Quan Luo, Sachin S. Sapatnekar
112
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Geometric programming for aggregation of binary classifiers
Multiclass classification problems are often decomposed into multiple binary problems that are solved by individual binary classifiers whose results are integrated into a final...
Sunho Park, Seungjin Choi
110
Voted
CCE
2010
15 years 25 days ago
Optimizing the design of complex energy conversion systems by Branch and Cut
The paper examines the applicability of mathematical programming methods to the simultaneous optimization of the structure and the operational parameters of a combined-cycle-based...
Turang Ahadi-Oskui, Stefan Vigerske, Ivo Nowak, Ge...
DCG
2010
107views more  DCG 2010»
14 years 10 months ago
An Optimization Problem Related to Minkowski's Successive Minima
Abstract The purpose of this paper is to establish an inequality connecting the lattice point enumerator of a 0-symmetric convex body with its successive minima. To this end, we in...
Romanos Malikiosis