An interval partitioning approach for continuous constrained optimization

Chandra Sekhar Pedamallu, Linet Özdamar, T. Csendes

Research output: Chapter in Book/Report/Conference proceedingChapter

2 Citations (Scopus)

Abstract

Constrained Optimization Problems (COP’S) are encountered in many scientific fields concerned with industrial applications such as kinematics, chemical process optimization, molecular design, etc. When non-linear relationships among variables are defined by problem constraints resulting in non-convex feasible sets, the problem of identifying feasible solutions may become very hard. Consequently, finding the location of the global optimum in the COP is more difficult as compared to bound-constrained global optimization problems. This chapter proposes a new interval partitioning method for solving the COP. The proposed approach involves a new subdivision direction selection method as well as an adaptive search tree framework where nodes (boxes defining different variable domains) are explored using a restricted hybrid depth-first and best-first branching strategy. This hybrid approach is also used for activating local search in boxes with the aim of identifying different feasible stationary points. The proposed search tree management approach improves the convergence speed of the interval partitioning method that is also supported by the new parallel subdivision direction selection rule (used in selecting the variables to be partitioned in a given box). This rule targets directly the uncertainty degrees of constraints (with respect to feasibility) and the uncertainty degree of the objective function (with respect to optimality). Reducing these uncertainties as such results in the early and reliable detection of infeasible and sub-optimal boxes, thereby diminishing the number of boxes to be assessed. Consequently, chances of identifying local stationary points during the early stages of the search increase. The effectiveness of the proposed interval partitioning algorithm is illustrated on several practical application problems and compared with professional commercial local and global solvers. Empirical results show that the presented new approach is as good as available COP solvers.

Original languageEnglish
Title of host publicationSpringer Optimization and Its Applications
PublisherSpringer International Publishing
Pages73-96
Number of pages24
Volume4
Publication statusPublished - 2007

Publication series

NameSpringer Optimization and Its Applications
Volume4
ISSN (Print)19316828
ISSN (Electronic)19316836

Fingerprint

Continuous Optimization
Constrained Optimization
Partitioning
Search Trees
Stationary point
Subdivision
Uncertainty
Interval
Constrained Global Optimization
Selection Rules
Chemical Processes
Diminishing
Speed of Convergence
Global Optimum
Hybrid Approach
Constrained Optimization Problem
Industrial Application
Process Optimization
Local Search
Branching

Keywords

  • Continuous constrained optimization
  • Interval partitioning approach
  • Practical applications

ASJC Scopus subject areas

  • Control and Optimization

Cite this

Pedamallu, C. S., Özdamar, L., & Csendes, T. (2007). An interval partitioning approach for continuous constrained optimization. In Springer Optimization and Its Applications (Vol. 4, pp. 73-96). (Springer Optimization and Its Applications; Vol. 4). Springer International Publishing.

An interval partitioning approach for continuous constrained optimization. / Pedamallu, Chandra Sekhar; Özdamar, Linet; Csendes, T.

Springer Optimization and Its Applications. Vol. 4 Springer International Publishing, 2007. p. 73-96 (Springer Optimization and Its Applications; Vol. 4).

Research output: Chapter in Book/Report/Conference proceedingChapter

Pedamallu, CS, Özdamar, L & Csendes, T 2007, An interval partitioning approach for continuous constrained optimization. in Springer Optimization and Its Applications. vol. 4, Springer Optimization and Its Applications, vol. 4, Springer International Publishing, pp. 73-96.
Pedamallu CS, Özdamar L, Csendes T. An interval partitioning approach for continuous constrained optimization. In Springer Optimization and Its Applications. Vol. 4. Springer International Publishing. 2007. p. 73-96. (Springer Optimization and Its Applications).
Pedamallu, Chandra Sekhar ; Özdamar, Linet ; Csendes, T. / An interval partitioning approach for continuous constrained optimization. Springer Optimization and Its Applications. Vol. 4 Springer International Publishing, 2007. pp. 73-96 (Springer Optimization and Its Applications).
@inbook{9064005dc1714e628d6c944f764aab17,
title = "An interval partitioning approach for continuous constrained optimization",
abstract = "Constrained Optimization Problems (COP’S) are encountered in many scientific fields concerned with industrial applications such as kinematics, chemical process optimization, molecular design, etc. When non-linear relationships among variables are defined by problem constraints resulting in non-convex feasible sets, the problem of identifying feasible solutions may become very hard. Consequently, finding the location of the global optimum in the COP is more difficult as compared to bound-constrained global optimization problems. This chapter proposes a new interval partitioning method for solving the COP. The proposed approach involves a new subdivision direction selection method as well as an adaptive search tree framework where nodes (boxes defining different variable domains) are explored using a restricted hybrid depth-first and best-first branching strategy. This hybrid approach is also used for activating local search in boxes with the aim of identifying different feasible stationary points. The proposed search tree management approach improves the convergence speed of the interval partitioning method that is also supported by the new parallel subdivision direction selection rule (used in selecting the variables to be partitioned in a given box). This rule targets directly the uncertainty degrees of constraints (with respect to feasibility) and the uncertainty degree of the objective function (with respect to optimality). Reducing these uncertainties as such results in the early and reliable detection of infeasible and sub-optimal boxes, thereby diminishing the number of boxes to be assessed. Consequently, chances of identifying local stationary points during the early stages of the search increase. The effectiveness of the proposed interval partitioning algorithm is illustrated on several practical application problems and compared with professional commercial local and global solvers. Empirical results show that the presented new approach is as good as available COP solvers.",
keywords = "Continuous constrained optimization, Interval partitioning approach, Practical applications",
author = "Pedamallu, {Chandra Sekhar} and Linet {\"O}zdamar and T. Csendes",
year = "2007",
language = "English",
volume = "4",
series = "Springer Optimization and Its Applications",
publisher = "Springer International Publishing",
pages = "73--96",
booktitle = "Springer Optimization and Its Applications",

}

TY - CHAP

T1 - An interval partitioning approach for continuous constrained optimization

AU - Pedamallu, Chandra Sekhar

AU - Özdamar, Linet

AU - Csendes, T.

PY - 2007

Y1 - 2007

N2 - Constrained Optimization Problems (COP’S) are encountered in many scientific fields concerned with industrial applications such as kinematics, chemical process optimization, molecular design, etc. When non-linear relationships among variables are defined by problem constraints resulting in non-convex feasible sets, the problem of identifying feasible solutions may become very hard. Consequently, finding the location of the global optimum in the COP is more difficult as compared to bound-constrained global optimization problems. This chapter proposes a new interval partitioning method for solving the COP. The proposed approach involves a new subdivision direction selection method as well as an adaptive search tree framework where nodes (boxes defining different variable domains) are explored using a restricted hybrid depth-first and best-first branching strategy. This hybrid approach is also used for activating local search in boxes with the aim of identifying different feasible stationary points. The proposed search tree management approach improves the convergence speed of the interval partitioning method that is also supported by the new parallel subdivision direction selection rule (used in selecting the variables to be partitioned in a given box). This rule targets directly the uncertainty degrees of constraints (with respect to feasibility) and the uncertainty degree of the objective function (with respect to optimality). Reducing these uncertainties as such results in the early and reliable detection of infeasible and sub-optimal boxes, thereby diminishing the number of boxes to be assessed. Consequently, chances of identifying local stationary points during the early stages of the search increase. The effectiveness of the proposed interval partitioning algorithm is illustrated on several practical application problems and compared with professional commercial local and global solvers. Empirical results show that the presented new approach is as good as available COP solvers.

AB - Constrained Optimization Problems (COP’S) are encountered in many scientific fields concerned with industrial applications such as kinematics, chemical process optimization, molecular design, etc. When non-linear relationships among variables are defined by problem constraints resulting in non-convex feasible sets, the problem of identifying feasible solutions may become very hard. Consequently, finding the location of the global optimum in the COP is more difficult as compared to bound-constrained global optimization problems. This chapter proposes a new interval partitioning method for solving the COP. The proposed approach involves a new subdivision direction selection method as well as an adaptive search tree framework where nodes (boxes defining different variable domains) are explored using a restricted hybrid depth-first and best-first branching strategy. This hybrid approach is also used for activating local search in boxes with the aim of identifying different feasible stationary points. The proposed search tree management approach improves the convergence speed of the interval partitioning method that is also supported by the new parallel subdivision direction selection rule (used in selecting the variables to be partitioned in a given box). This rule targets directly the uncertainty degrees of constraints (with respect to feasibility) and the uncertainty degree of the objective function (with respect to optimality). Reducing these uncertainties as such results in the early and reliable detection of infeasible and sub-optimal boxes, thereby diminishing the number of boxes to be assessed. Consequently, chances of identifying local stationary points during the early stages of the search increase. The effectiveness of the proposed interval partitioning algorithm is illustrated on several practical application problems and compared with professional commercial local and global solvers. Empirical results show that the presented new approach is as good as available COP solvers.

KW - Continuous constrained optimization

KW - Interval partitioning approach

KW - Practical applications

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

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

M3 - Chapter

AN - SCOPUS:84976509025

VL - 4

T3 - Springer Optimization and Its Applications

SP - 73

EP - 96

BT - Springer Optimization and Its Applications

PB - Springer International Publishing

ER -