YaBeSH Engineering and Technology Library

    • Journals
    • PaperQuest
    • YSE Standards
    • YaBeSH
    • Login
    View Item 
    •   YE&T Library
    • ASME
    • Journal of Mechanical Design
    • View Item
    •   YE&T Library
    • ASME
    • Journal of Mechanical Design
    • View Item
    • All Fields
    • Source Title
    • Year
    • Publisher
    • Title
    • Subject
    • Author
    • DOI
    • ISBN
    Advanced Search
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Archive

    Convex Estimators for Optimization of Kriging Model Problems

    Source: Journal of Mechanical Design:;2012:;volume( 134 ):;issue: 011::page 111005
    Author:
    Karim Hamza
    ,
    Mohammed Shalaby
    DOI: 10.1115/1.4007398
    Publisher: The American Society of Mechanical Engineers (ASME)
    Abstract: This paper presents a framework for identification of the global optimum of Kriging models that have been tuned to approximate the response of some generic objective function and constraints. The framework is based on a branch and bound scheme for subdivision of the search space into hypercubes while constructing convex underestimators of the Kriging models. The convex underestimators, which are the key development in this paper, provide a relaxation of the original problem. The relaxed problem has two main features: (i) convex optimization algorithms such as sequential quadratic programming (SQP) are guaranteed to find the global optimum of the relaxed problem and (ii) objective value of the relaxed problem is a lower bound within a hypercube for the original (Kriging model) problem. As accuracy of the convex estimators improves with subdivision of a hypercube, termination of a branch happens when either: (i) solution of the relaxed problem within the hypercube is no better than current best solution of the original problem or (ii) best solution of the original problem and that of the relaxed problem are within tolerance limits. To assess the significance of the proposed framework, comparison studies against genetic algorithm (GA), particle swarm optimization (PSO), random multistart sequential quadratic programming (mSQP), and DIRECT are conducted. The studies include four standard nonlinear test functions and two design application problems of water desalination and vehicle crashworthiness. The studies show the proposed framework deterministically finding the optimum for all the test problems. Among the tested stochastic search techniques (GA, PSO, mSQP), mSQP had the best performance as it consistently found the optimum in less computational time than the proposed approach except on the water desalination problem. DIRECT deterministically found the optima for the nonlinear test functions, but completely failed to find it for the water desalination and vehicle crashworthiness problems.
    keyword(s): Algorithms , Optimization , Functions , Water , Vehicles , Particle swarm optimization , Design , Bifurcation , Crashworthiness AND Optimization algorithms ,
    • Download: (1.236Mb)
    • Show Full MetaData Hide Full MetaData
    • Get RIS
    • Item Order
    • Go To Publisher
    • Price: 5000 Rial
    • Statistics

      Convex Estimators for Optimization of Kriging Model Problems

    URI
    http://yetl.yabesh.ir/yetl1/handle/yetl/149704
    Collections
    • Journal of Mechanical Design

    Show full item record

    contributor authorKarim Hamza
    contributor authorMohammed Shalaby
    date accessioned2017-05-09T00:52:59Z
    date available2017-05-09T00:52:59Z
    date copyrightNovember, 2012
    date issued2012
    identifier issn1050-0472
    identifier otherJMDEDB-926070#111005_1.pdf
    identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/149704
    description abstractThis paper presents a framework for identification of the global optimum of Kriging models that have been tuned to approximate the response of some generic objective function and constraints. The framework is based on a branch and bound scheme for subdivision of the search space into hypercubes while constructing convex underestimators of the Kriging models. The convex underestimators, which are the key development in this paper, provide a relaxation of the original problem. The relaxed problem has two main features: (i) convex optimization algorithms such as sequential quadratic programming (SQP) are guaranteed to find the global optimum of the relaxed problem and (ii) objective value of the relaxed problem is a lower bound within a hypercube for the original (Kriging model) problem. As accuracy of the convex estimators improves with subdivision of a hypercube, termination of a branch happens when either: (i) solution of the relaxed problem within the hypercube is no better than current best solution of the original problem or (ii) best solution of the original problem and that of the relaxed problem are within tolerance limits. To assess the significance of the proposed framework, comparison studies against genetic algorithm (GA), particle swarm optimization (PSO), random multistart sequential quadratic programming (mSQP), and DIRECT are conducted. The studies include four standard nonlinear test functions and two design application problems of water desalination and vehicle crashworthiness. The studies show the proposed framework deterministically finding the optimum for all the test problems. Among the tested stochastic search techniques (GA, PSO, mSQP), mSQP had the best performance as it consistently found the optimum in less computational time than the proposed approach except on the water desalination problem. DIRECT deterministically found the optima for the nonlinear test functions, but completely failed to find it for the water desalination and vehicle crashworthiness problems.
    publisherThe American Society of Mechanical Engineers (ASME)
    titleConvex Estimators for Optimization of Kriging Model Problems
    typeJournal Paper
    journal volume134
    journal issue11
    journal titleJournal of Mechanical Design
    identifier doi10.1115/1.4007398
    journal fristpage111005
    identifier eissn1528-9001
    keywordsAlgorithms
    keywordsOptimization
    keywordsFunctions
    keywordsWater
    keywordsVehicles
    keywordsParticle swarm optimization
    keywordsDesign
    keywordsBifurcation
    keywordsCrashworthiness AND Optimization algorithms
    treeJournal of Mechanical Design:;2012:;volume( 134 ):;issue: 011
    contenttypeFulltext
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian
     
    DSpace software copyright © 2002-2015  DuraSpace
    نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
    yabeshDSpacePersian