Optimization Online


Symbolic-interval heuristic for bound-constrained minimization

Evgueni Petrov (petrov***at***irin.univ-nantes.fr)

Abstract: Bound-constrained global optimization helps answer many practical questions in chemistry, molecular biology, economics. Most of algorithms for solution of global optimization problems are a combination of interval methods and exhuastive search. The efficiency of such algorithms is characterized by their ability to detect and eliminate sub-optimal feasible regions. This ability is increased by availability of a good upper bound on the global minimum. In this paper, we present a symbolic-interval algorithm for calculation of upper bounds in bound-constrained global minimization problems and report the results of some experiments.

Keywords: bound-constrained optimization

Category 1: Nonlinear Optimization (Bound-constrained Optimization )

Citation: In proceedings of the 1st International Workshop on Global Constrained Optimization and Constraint Satisfaction (Cocos'02) Valbonne - Sophia Antipolis, France, October 2-4, 2002

Download: [Compressed Postscript][PDF]

Entry Submitted: 09/27/2002
Entry Accepted: 09/27/2002
Entry Last Modified: 09/27/2002

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society