Sciweavers

309 search results - page 12 / 62
» Smooth Optimization with Approximate Gradient
Sort
View
ANOR
2002
100views more  ANOR 2002»
13 years 7 months ago
A Limited-Memory Multipoint Symmetric Secant Method for Bound Constrained Optimization
A new algorithm for solving smooth large-scale minimization problems with bound constraints is introduced. The way of dealing with active constraints is similar to the one used in...
Oleg P. Burdakov, José Mario Martíne...
GECCO
2010
Springer
227views Optimization» more  GECCO 2010»
13 years 11 months ago
Benchmarking SPSA on BBOB-2010 noisy function testbed
This paper presents the result for Simultaneous Perturbation Stochastic Approximation (SPSA) on the BBOB 2010 noisy testbed. SPSA is a stochastic gradient approximation strategy w...
Steffen Finck, Hans-Georg Beyer
SIAMJO
2011
13 years 2 months ago
Minimizing the Condition Number of a Gram Matrix
Abstract. The condition number of a Gram matrix defined by a polynomial basis and a set of points is often used to measure the sensitivity of the least squares polynomial approxim...
Xiaojun Chen, Robert S. Womersley, Jane J. Ye
TSP
2010
13 years 2 months ago
Improved dual decomposition based optimization for DSL dynamic spectrum management
Dynamic spectrum management (DSM) has been recognized as a key technology to significantly improve the performance of digital subscriber line (DSL) broadband access networks. The b...
Paschalis Tsiaflakis, Ion Necoara, Johan A. K. Suy...
WSC
2001
13 years 9 months ago
Global random optimization by simultaneous perturbation stochastic approximation
We examine the theoretical and numerical global convergence properties of a certain "gradient free" stochastic approximation algorithm called the "simultaneous pertu...
John L. Maryak, Daniel C. Chin