4 search results - page 1 / 1 » Duality for almost convex optimization problems via the pert... |
JGO
2008
13 years 4 months ago
2008
Abstract. We deal with duality for almost convex finite dimensional optimization problems by means of the classical perturbation approach. To this aim some standard results from th...
EOR
2007
13 years 4 months ago
2007
Abstract. Given an optimization problem with a composite of a convex and componentwise increasing function with a convex vector function as objective function, by means of the conj...
IOR
2007
13 years 4 months ago
2007
We study a new class of decentralized algorithms for discrete optimization via simulation, which is inspired by the fictitious play algorithm applied to games with identical inte...
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...