Sciweavers

1477 search results - page 72 / 296
» Random Convex Programs
Sort
View
IPCO
2010
231views Optimization» more  IPCO 2010»
13 years 10 months ago
Branched Polyhedral Systems
We introduce the framework of polyhedral branching systems that can be used in order to construct extended formulations for polyhedra by combining extended formulations for other p...
Volker Kaibel, Andreas Loos
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 8 months ago
Path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
SIAMJO
2008
85views more  SIAMJO 2008»
13 years 8 months ago
Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets
We consider a rather general class of mathematical programming problems with data uncertainty, where the uncertainty set is represented by a system of convex inequalities. We prove...
Igor Averbakh, Yun-Bin Zhao
TCAD
1998
107views more  TCAD 1998»
13 years 8 months ago
Optimizing dominant time constant in RC circuits
— Conventional methods for optimal sizing of wires and transistors use linear resistor-capacitor (RC) circuit models and the Elmore delay as a measure of signal delay. If the RC ...
Lieven Vandenberghe, Stephen P. Boyd, Abbas A. El ...
TCOM
2010
91views more  TCOM 2010»
13 years 7 months ago
Robust Power Allocation Algorithms for Wireless Relay Networks
—Resource allocation promises significant benefits in wireless networks. In order to fully reap these benefits, it is important to design efficient resource allocation algori...
Tony Q. S. Quek, Moe Z. Win, Marco Chiani