86 search results - page 1 / 18 » On the complexity of optimization over the standard simplex |
EOR
2008
13 years 5 months ago
2008
We review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we derive new results on the computational complexity of approxi...
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. The paper focuses on the efficiency of the hybrid evolutionary algorithm (HEA) for solving the global optimization problem arising in electronic imaging. The particular v...
CVIU
2011
12 years 8 months ago
2011
Quadratic optimization lies at the very heart of many structural pattern recognition and computer vision problems, such as graph matching, object recognition, image segmentation, ...
ICMCS
2005
IEEE
13 years 10 months ago
2005
IEEE
In this paper, we analyze a standard compatible error correction technique for multimedia transmissions over 802.11 WLANs that exploits, when available, the information of previou...
LION
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...