Sciweavers

3049 search results - page 77 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
AAAI
1998
15 years 5 months ago
Branch and Bound Algorithm Selection by Performance Prediction
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
Lionel Lobjois, Michel Lemaître
GECCO
2000
Springer
114views Optimization» more  GECCO 2000»
15 years 8 months ago
Variable Length Genomes for Evolutionary Algorithms
A general variable length genome, called exG, is developed here to address the problems of fixed length representations in canonical evolutionary algorithms. Convergence aspects o...
C.-Y. Lee, E. K. Antonsson
AMC
2007
154views more  AMC 2007»
15 years 4 months ago
A hybrid particle swarm optimization-back-propagation algorithm for feedforward neural network training
The particle swarm optimization algorithm was showed to converge rapidly during the initial stages of a global search, but around global optimum, the search process will become ve...
Jing-Ru Zhang, Jun Zhang, Tat-Ming Lok, Michael R....
JMLR
2012
13 years 6 months ago
Minimax Rates of Estimation for Sparse PCA in High Dimensions
We study sparse principal components analysis in the high-dimensional setting, where p (the number of variables) can be much larger than n (the number of observations). We prove o...
Vincent Q. Vu, Jing Lei
MOC
2002
81views more  MOC 2002»
15 years 4 months ago
Optimal a priori error estimates for the hp-version of the local discontinuous Galerkin method for convection--diffusion problem
We study the convergence properties of the hp-version of the local discontinuous Galerkin finite element method for convection-diffusion problems; we consider a model problem in a ...
Paul Castillo, Bernardo Cockburn, Dominik Schö...