Sciweavers

433 search results - page 16 / 87
» Modified Line Search Method for Global Optimization
Sort
View
CEC
2007
IEEE
13 years 9 months ago
Hybrid optimization using DIRECT, GA, and SQP for global exploration
— As there are many good optimization algorithms each with its own characteristics, it is very difficult to choose the best method for optimization problems. Thus, it is importa...
Satoru Hiwa, Tomoyuki Hiroyasu, Mitsunori Miki
ICCV
2009
IEEE
15 years 18 days ago
Globally Optimal Affine Epipolar Geometry from Apparent Contours
We study the problem of estimating the epipolar geometry from apparent contours of smooth curved surfaces with affine camera models. Since apparent contours are viewpoint depend...
Gang Li, Yanghai Tsin
GECCO
2007
Springer
142views Optimization» more  GECCO 2007»
14 years 1 months ago
Improving global numerical optimization using a search-space reduction algorithm
We have developed an algorithm for reduction of search-space, called Domain Optimization Algorithm (DOA), applied to global optimization. This approach can efficiently eliminate ...
Vinicius Veloso de Melo, Alexandre C. B. Delbem, D...
WSC
2004
13 years 9 months ago
Simulation Optimization Using Balanced Explorative and Exploitative Search
We present a new random search method for solving simulation optimization problems. Our approach emphasizes the need for maintaining the right balance between exploration and expl...
Andrei A. Prudius, Sigrún Andradótti...
SIAMIS
2010
190views more  SIAMIS 2010»
13 years 2 months ago
Analysis and Generalizations of the Linearized Bregman Method
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...
Wotao Yin