New interval partitioning algorithms for global optimization problems

New interval partitioning algorithms for global optimization problems

The objective of this thesis is to develop a generic methodology, which can solve bound constrained optimization problems (BCOP), continuous constraint satisfaction problems (CCSP) and constrained optimization problems (COP). A new subdivision direction selection method is proposed in this research...

Full description

Saved in:
Bibliographic Details
Main Author: Chandra Sekhar Pedamallu
Other Authors: Arun Kumar
Format: Theses and Dissertations
Published: 2008
Subjects:
DRNTU::Engineering::Mechanical engineering::Kinematics and dynamics of machinery
Online Access:https://hdl.handle.net/10356/6217
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
id sg-ntu-dr.10356-6217
record_format dspace
spelling sg-ntu-dr.10356-62172023-03-11T17:45:33Z New interval partitioning algorithms for global optimization problems Chandra Sekhar Pedamallu Arun Kumar School of Mechanical and Aerospace Engineering DRNTU::Engineering::Mechanical engineering::Kinematics and dynamics of machinery The objective of this thesis is to develop a generic methodology, which can solve bound constrained optimization problems (BCOP), continuous constraint satisfaction problems (CCSP) and constrained optimization problems (COP). A new subdivision direction selection method is proposed in this research for these problems. DOCTOR OF PHILOSOPHY (MAE) 2008-09-17T11:09:32Z 2008-09-17T11:09:32Z 2007 2007 Thesis Chandra, S. P. (2007). New interval partitioning algorithms for global optimization problems. Doctoral thesis, Nanyang Technological University, Singapore. https://hdl.handle.net/10356/6217 10.32657/10356/6217 Nanyang Technological University application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
topic DRNTU::Engineering::Mechanical engineering::Kinematics and dynamics of machinery
spellingShingle DRNTU::Engineering::Mechanical engineering::Kinematics and dynamics of machinery
Chandra Sekhar Pedamallu
New interval partitioning algorithms for global optimization problems
description The objective of this thesis is to develop a generic methodology, which can solve bound constrained optimization problems (BCOP), continuous constraint satisfaction problems (CCSP) and constrained optimization problems (COP). A new subdivision direction selection method is proposed in this research for these problems.
author2 Arun Kumar
author_facet Arun Kumar
Chandra Sekhar Pedamallu
format Theses and Dissertations
author Chandra Sekhar Pedamallu
author_sort Chandra Sekhar Pedamallu
title New interval partitioning algorithms for global optimization problems
title_short New interval partitioning algorithms for global optimization problems
title_full New interval partitioning algorithms for global optimization problems
title_fullStr New interval partitioning algorithms for global optimization problems
title_full_unstemmed New interval partitioning algorithms for global optimization problems
title_sort new interval partitioning algorithms for global optimization problems
publishDate 2008
url https://hdl.handle.net/10356/6217
_version_ 1761781647350431744

Similar Items