Sciweavers

58 search results - page 2 / 12
» Graph-based quadratic optimization: A fast evolutionary appr...
Sort
View
SIAMJO
2010
133views more  SIAMJO 2010»
13 years 3 months ago
Infeasibility Detection and SQP Methods for Nonlinear Optimization
This paper addresses the need for nonlinear programming algorithms that provide fast local convergence guarantees no matter if a problem is feasible or infeasible. We present an a...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal
GECCO
2008
Springer
159views Optimization» more  GECCO 2008»
13 years 6 months ago
Co-evolution of active sensing and locomotion gaits of simulated snake-like robot
We propose an approach of automated co-evolution of the optimal values of attributes of active sensing (orientation, range and timing of activation of sensors) and the control of ...
Ivan Tanev, Katsunori Shimohara
IPCO
2010
153views Optimization» more  IPCO 2010»
13 years 2 months ago
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
Christoph Buchheim, Alberto Caprara, Andrea Lodi
CEC
2009
IEEE
13 years 11 months ago
Performance assessment of the hybrid Archive-based Micro Genetic Algorithm (AMGA) on the CEC09 test problems
— In this paper, the performance assessment of the hybrid Archive-based Micro Genetic Algorithm (AMGA) on a set of bound-constrained synthetic test problems is reported. The hybr...
Santosh Tiwari, Georges Fadel, Patrick Koch, Kalya...
ICML
2009
IEEE
13 years 11 months ago
Fast evolutionary maximum margin clustering
The maximum margin clustering approach is a recently proposed extension of the concept of support vector machines to the clustering problem. Briefly stated, it aims at finding a...
Fabian Gieseke, Tapio Pahikkala, Oliver Kramer