A framework for analyzing sub-optimal performance of local search algorithms

Author： Nikolaev Alexander   Jacobson Sheldon   Hall Shane   Henderson Darrall  

Publisher： Springer Publishing Company

ISSN： 0926-6003

Source： Computational Optimization and Applications, Vol.49, Iss.3, 2011-07, pp. : 407-433

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Framework for Analyzing Local Convergence Properties with Applications to Proximal-Point Algorithms

By Dong Y.   Fischer A.  

Journal of Optimization Theory and Applications, Vol. 131, Iss. 1, 2006-10 ,pp. : 53-68

Springer Publishing Company

Access to resources Recommend Favorite

Analyzing the performance of simultaneous generalized hill climbing algorithms

By Vaughan Diane   Jacobson Sheldon   Kaul Hemanshu  

Computational Optimization and Applications, Vol. 37, Iss. 1, 2007-05 ,pp. : 103-119

Springer Publishing Company

Access to resources Recommend Favorite

A Complexity Analysis of Local Search Algorithms in Global Optimization

By Gaviano M.   Lera D.  

Optimization Methods and Software, Vol. 17, Iss. 1, 2002-01 ,pp. : 113-127

Taylor & Francis Ltd

Access to resources Recommend Favorite

Three new stochastic local search algorithms for continuous optimization problems

By Chetty Sivashan   Adewumi Aderemi  

Computational Optimization and Applications, Vol. 56, Iss. 3, 2013-12 ,pp. : 675-721

Springer Publishing Company

Access to resources Recommend Favorite

Optimal precision of parameter estimation in images with local sub-Poissonian quantum fluctuations

By Fade J.   Treps N.   Fabre C.   Réfrégier P.  

The European Physical Journal D - Atomic, Molecular and Optical Physics, Vol. 50, Iss. 2, 2008-12 ,pp. : 215-227

Springer Publishing Company

Access to resources Recommend Favorite