Simulated annealing with asymptotic convergence for nonlinear constrained global optimization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1713, Issue , 1999, Pages 461-475

  Wah, Benjamin W ^a   Wang, Tao ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; GLOBAL OPTIMIZATION; LAGRANGE MULTIPLIERS; MARKOV PROCESSES; NONLINEAR ANALYSIS; OPTIMIZATION; SIMULATED ANNEALING;

ASYMPTOTIC CONVERGENCE; CONSTRAINED GLOBAL OPTIMIZATION; CONSTRAINED MINIMIZATION PROBLEM; CONSTRAINED PROBLEM; CONSTRAINT FUNCTIONS; CONTINUOUS VARIABLES; LAGRANGIAN FUNCTIONS; NONLINEAR BENCHMARK;

CONSTRAINED OPTIMIZATION;

EID: 84957378692     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48085-3_33     Document Type: Conference Paper

References (12)

1. E. Aarts and J. Korst. Simulated Annealing and Boltzmann Machines. J. Wiley and Sons, 1989.
2. S. Anily and A Federgruen. Simulated annealing methods with general acceptance probabilities. Journal of Appl. Prob., 24:657–667, 1987.
3. D. P. Bertsekas. Constrained Optimization and Lagrange Multiplier Methods. Academic Press, 1982.
4. A. Corana, M. Marchesi, C. Martini, and S. Ridella. Minimizing multimodal functions of continuous variables with the simulated annealing algorithm. ACM Trans. on Mathematical Software, 13(3):262–280, 1987.
5. S. Koziel and Z. Michalewicz. Evolutionary algorithms, homomorphous mappings, and constrained parameter optimization. Evolutionary Computation, 7(1):19–44, 1999.
6. D. G. Luenberger. Linear and Nonlinear Programming. Addison-Wesley Publishing Company, 1984.
7. Z. Michalewicz and M. Schoenauer. Evolutionary algorithms for constrained parameter optimization problems. Evolutionary Computation, 4(1):1–32, 1996.
8. Y. Shang and B. W. Wah. A discrete Lagrangian based global search method for solving satisfiability problems. J. Global Optimization, 12(1):61–99, January 1998.
9. P. Spellucci. An SQP method for general nonlinear programs using only equality constrained subproblems. Mathematical Programming, 82:413–448, 1998.
10. A. Trouve. Cycle decomposition and simulated annealing. SIAM Journal on Control and Optimization, 34(3):966–986, 1996.
11. B. W. Wah and Z. Wu. The theory of discrete lagrange multipliers for nonlinear discrete optimization. Principles and Practice of Constraint Programming, (accepted to appear) October 1999.
12. Zhe Wu. Discrete Lagrangian Methods for Solving Nonlinear Discrete Constrained Optimization Problems. M.Sc. Thesis, Dept. of Computer Science, Univ. of Illinois, Urbana, IL, May 1998.