Sciweavers

7519 search results - page 129 / 1504
» Optimizing Generic Functions
Sort
View
WCE
2007
15 years 6 months ago
A Multidimensional Bisection Method for Minimizing Function over Simplex
—A new method for minimization problem over simplex, as a generalization of a well-known in onedimensional optimization bisection method is proposed. The convergence of the metho...
A. N. Baushev, E. Y. Morozova
128
Voted
JAT
2008
57views more  JAT 2008»
15 years 5 months ago
Sharp approximations to the Bernoulli periodic functions by trigonometric polynomials
We obtain optimal trigonometric polynomials of a given degree N that majorize, minorize and approximate in L1(R/Z) the Bernoulli periodic functions. These are the periodic analogue...
Emanuel Carneiro
CMOT
2006
147views more  CMOT 2006»
15 years 5 months ago
Identifying sets of key players in a social network
A procedure is described for finding sets of key players in a social network. A key assumption is that the optimal selection of key players depends on what they are needed for. Acc...
Stephen P. Borgatti
ECCV
2000
Springer
16 years 6 months ago
Diffeomorphic Matching Problems in One Dimension: Designing and Minimizing Matching Functionals
This paper focuses on matching 1D structures by variational methods. We provide rigorous rules for the construction of the cost function, on the basis of an analysis of properties ...
Alain Trouvé, Laurent Younes
GECCO
2010
Springer
182views Optimization» more  GECCO 2010»
15 years 8 months ago
Benchmarking CMA-EGS on the BBOB 2010 noisy function testbed
This paper describes the implementation and the results for CMA-EGS on the BBOB 2010 noisy testbed. The CMAEGS is a hybrid strategy which combines elements from gradient search an...
Steffen Finck, Hans-Georg Beyer