116 search results - page 1 / 24 » Reformulation and convex relaxation techniques for global op... |
4OR
2004
13 years 4 months ago
2004
COCOS
2003
Springer
13 years 10 months ago
2003
Springer
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
MP
2010
13 years 3 months ago
2010
Abstract. We study mixed integer nonlinear programs (MINLP)s that are driven by a collection of indicator variables where each indicator variable controls a subset of the decision ...
TWC
2008
13 years 4 months ago
2008
Multiuser downlink beamforming under quality of service (QoS) constraints has attracted considerable interest in recent years, because it is particularly appealing from a network o...
ICCV
2005
IEEE
14 years 6 months ago
2005
IEEE
We introduce a framework for computing statistically optimal estimates of geometric reconstruction problems. While traditional algorithms often suffer from either local minima or ...