Efficient interval partitioning for constrained global optimization

Chandra Sekhar Pedamallu, Linet Özdamar, T. Csendes, Tamás Vinkó

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

A new efficient interval partitioning approach to solve constrained global optimization problems is proposed. This involves a new parallel subdivision direction selection method as well as an adaptive tree search. The latter explores nodes (intervals in variable domains) using a restricted hybrid depth-first and best-first branching strategy. This hybrid approach is also used for activating local search to identify feasible stationary points. The new tree search management technique results in improved performance across standard solution and computational indicators when compared to previously proposed techniques. On the other hand, the new parallel subdivision direction selection rule detects infeasible and suboptimal boxes earlier than existing rules, and this contributes to performance by enabling earlier reliable deletion of such subintervals from the search space.

Original languageEnglish
Pages (from-to)369-384
Number of pages16
JournalJournal of Global Optimization
Volume42
Issue number3
DOIs
Publication statusPublished - Nov 2008

Fingerprint

Constrained Global Optimization
Search Trees
Constrained optimization
Global optimization
Subdivision
Partitioning
Interval
Selection Rules
Stationary point
Hybrid Approach
Local Search
Search Space
Deletion
Branching
Optimization Problem
Vertex of a graph
Standards
Strategy

Keywords

  • Adaptive search tree management
  • Constrained global optimization
  • Interval partitioning
  • Parsing
  • Subdivision direction selection rules

ASJC Scopus subject areas

  • Computer Science Applications
  • Control and Optimization
  • Applied Mathematics
  • Management Science and Operations Research

Cite this

Efficient interval partitioning for constrained global optimization. / Pedamallu, Chandra Sekhar; Özdamar, Linet; Csendes, T.; Vinkó, Tamás.

In: Journal of Global Optimization, Vol. 42, No. 3, 11.2008, p. 369-384.

Research output: Contribution to journalArticle

Pedamallu, Chandra Sekhar ; Özdamar, Linet ; Csendes, T. ; Vinkó, Tamás. / Efficient interval partitioning for constrained global optimization. In: Journal of Global Optimization. 2008 ; Vol. 42, No. 3. pp. 369-384.
@article{478e8038bf0e4b9b9e2cd6342c5b2c73,
title = "Efficient interval partitioning for constrained global optimization",
abstract = "A new efficient interval partitioning approach to solve constrained global optimization problems is proposed. This involves a new parallel subdivision direction selection method as well as an adaptive tree search. The latter explores nodes (intervals in variable domains) using a restricted hybrid depth-first and best-first branching strategy. This hybrid approach is also used for activating local search to identify feasible stationary points. The new tree search management technique results in improved performance across standard solution and computational indicators when compared to previously proposed techniques. On the other hand, the new parallel subdivision direction selection rule detects infeasible and suboptimal boxes earlier than existing rules, and this contributes to performance by enabling earlier reliable deletion of such subintervals from the search space.",
keywords = "Adaptive search tree management, Constrained global optimization, Interval partitioning, Parsing, Subdivision direction selection rules",
author = "Pedamallu, {Chandra Sekhar} and Linet {\"O}zdamar and T. Csendes and Tam{\'a}s Vink{\'o}",
year = "2008",
month = "11",
doi = "10.1007/s10898-008-9297-7",
language = "English",
volume = "42",
pages = "369--384",
journal = "Journal of Global Optimization",
issn = "0925-5001",
publisher = "Springer Netherlands",
number = "3",

}

TY - JOUR

T1 - Efficient interval partitioning for constrained global optimization

AU - Pedamallu, Chandra Sekhar

AU - Özdamar, Linet

AU - Csendes, T.

AU - Vinkó, Tamás

PY - 2008/11

Y1 - 2008/11

N2 - A new efficient interval partitioning approach to solve constrained global optimization problems is proposed. This involves a new parallel subdivision direction selection method as well as an adaptive tree search. The latter explores nodes (intervals in variable domains) using a restricted hybrid depth-first and best-first branching strategy. This hybrid approach is also used for activating local search to identify feasible stationary points. The new tree search management technique results in improved performance across standard solution and computational indicators when compared to previously proposed techniques. On the other hand, the new parallel subdivision direction selection rule detects infeasible and suboptimal boxes earlier than existing rules, and this contributes to performance by enabling earlier reliable deletion of such subintervals from the search space.

AB - A new efficient interval partitioning approach to solve constrained global optimization problems is proposed. This involves a new parallel subdivision direction selection method as well as an adaptive tree search. The latter explores nodes (intervals in variable domains) using a restricted hybrid depth-first and best-first branching strategy. This hybrid approach is also used for activating local search to identify feasible stationary points. The new tree search management technique results in improved performance across standard solution and computational indicators when compared to previously proposed techniques. On the other hand, the new parallel subdivision direction selection rule detects infeasible and suboptimal boxes earlier than existing rules, and this contributes to performance by enabling earlier reliable deletion of such subintervals from the search space.

KW - Adaptive search tree management

KW - Constrained global optimization

KW - Interval partitioning

KW - Parsing

KW - Subdivision direction selection rules

UR - http://www.scopus.com/inward/record.url?scp=53449099929&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=53449099929&partnerID=8YFLogxK

U2 - 10.1007/s10898-008-9297-7

DO - 10.1007/s10898-008-9297-7

M3 - Article

VL - 42

SP - 369

EP - 384

JO - Journal of Global Optimization

JF - Journal of Global Optimization

SN - 0925-5001

IS - 3

ER -