CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: unconstrained optimization problems</title> <meta name="description" content="Search results for: unconstrained optimization problems"> <meta name="keywords" content="unconstrained optimization problems"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="unconstrained optimization problems" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="unconstrained optimization problems"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 9106</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: unconstrained optimization problems</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9106</span> Co-Evolutionary Fruit Fly Optimization Algorithm and Firefly Algorithm for Solving Unconstrained Optimization Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=R.%20M.%20Rizk-Allah">R. M. Rizk-Allah</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents co-evolutionary fruit fly optimization algorithm based on firefly algorithm (CFOA-FA) for solving unconstrained optimization problems. The proposed algorithm integrates the merits of fruit fly optimization algorithm (FOA), firefly algorithm (FA) and elite strategy to refine the performance of classical FOA. Moreover, co-evolutionary mechanism is performed by applying FA procedures to ensure the diversity of the swarm. Finally, the proposed algorithm CFOA- FA is tested on several benchmark problems from the usual literature and the numerical results have demonstrated the superiority of the proposed algorithm for finding the global optimal solution. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=firefly%20algorithm" title="firefly algorithm">firefly algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=fruit%20fly%20optimization%20algorithm" title=" fruit fly optimization algorithm"> fruit fly optimization algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=unconstrained%20optimization%20problems" title=" unconstrained optimization problems"> unconstrained optimization problems</a> </p> <a href="https://publications.waset.org/abstracts/15923/co-evolutionary-fruit-fly-optimization-algorithm-and-firefly-algorithm-for-solving-unconstrained-optimization-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/15923.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">536</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9105</span> A Conjugate Gradient Method for Large Scale Unconstrained Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohammed%20Belloufi">Mohammed Belloufi</a>, <a href="https://publications.waset.org/abstracts/search?q=Rachid%20Benzine"> Rachid Benzine</a>, <a href="https://publications.waset.org/abstracts/search?q=Badreddine%20Sellami"> Badreddine Sellami</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Conjugate gradient methods is useful for solving large scale optimization problems in scientific and engineering computation, characterized by the simplicity of their iteration and their low memory requirements. It is well known that the search direction plays a main role in the line search method. In this paper, we propose a search direction with the Wolfe line search technique for solving unconstrained optimization problems. Under the above line searches and some assumptions, the global convergence properties of the given methods are discussed. Numerical results and comparisons with other CG methods are given. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=unconstrained%20optimization" title="unconstrained optimization">unconstrained optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=conjugate%20gradient%20method" title=" conjugate gradient method"> conjugate gradient method</a>, <a href="https://publications.waset.org/abstracts/search?q=strong%20Wolfe%20line%20search" title=" strong Wolfe line search"> strong Wolfe line search</a>, <a href="https://publications.waset.org/abstracts/search?q=global%20convergence" title=" global convergence"> global convergence</a> </p> <a href="https://publications.waset.org/abstracts/40028/a-conjugate-gradient-method-for-large-scale-unconstrained-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40028.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">421</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9104</span> A New Class of Conjugate Gradient Methods Based on a Modified Search Direction for Unconstrained Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Belloufi%20Mohammed">Belloufi Mohammed</a>, <a href="https://publications.waset.org/abstracts/search?q=Sellami%20Badreddine"> Sellami Badreddine</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Conjugate gradient methods have played a special role for solving large scale optimization problems due to the simplicity of their iteration, convergence properties and their low memory requirements. In this work, we propose a new class of conjugate gradient methods which ensures sufficient descent. Moreover, we propose a new search direction with the Wolfe line search technique for solving unconstrained optimization problems, a global convergence result for general functions is established provided that the line search satisfies the Wolfe conditions. Our numerical experiments indicate that our proposed methods are preferable and in general superior to the classical conjugate gradient methods in terms of efficiency and robustness. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=unconstrained%20optimization" title="unconstrained optimization">unconstrained optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=conjugate%20gradient%20method" title=" conjugate gradient method"> conjugate gradient method</a>, <a href="https://publications.waset.org/abstracts/search?q=sufficient%20descent%20property" title=" sufficient descent property"> sufficient descent property</a>, <a href="https://publications.waset.org/abstracts/search?q=numerical%20comparisons" title=" numerical comparisons"> numerical comparisons</a> </p> <a href="https://publications.waset.org/abstracts/41725/a-new-class-of-conjugate-gradient-methods-based-on-a-modified-search-direction-for-unconstrained-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/41725.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">403</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9103</span> A New Conjugate Gradient Method with Guaranteed Descent</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=B.%20Sellami">B. Sellami</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Belloufi"> M. Belloufi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Conjugate gradient methods are an important class of methods for unconstrained optimization, especially for large-scale problems. Recently, they have been much studied. In this paper, we propose a new two-parameter family of conjugate gradient methods for unconstrained optimization. The two-parameter family of methods not only includes the already existing three practical nonlinear conjugate gradient methods, but also has other family of conjugate gradient methods as subfamily. The two-parameter family of methods with the Wolfe line search is shown to ensure the descent property of each search direction. Some general convergence results are also established for the two-parameter family of methods. The numerical results show that this method is efficient for the given test problems. In addition, the methods related to this family are uniformly discussed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=unconstrained%20optimization" title="unconstrained optimization">unconstrained optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=conjugate%20gradient%20method" title=" conjugate gradient method"> conjugate gradient method</a>, <a href="https://publications.waset.org/abstracts/search?q=line%20search" title=" line search"> line search</a>, <a href="https://publications.waset.org/abstracts/search?q=global%20convergence" title=" global convergence"> global convergence</a> </p> <a href="https://publications.waset.org/abstracts/41734/a-new-conjugate-gradient-method-with-guaranteed-descent" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/41734.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">452</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9102</span> A New Family of Globally Convergent Conjugate Gradient Methods</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=B.%20Sellami">B. Sellami</a>, <a href="https://publications.waset.org/abstracts/search?q=Y.%20Laskri"> Y. Laskri</a>, <a href="https://publications.waset.org/abstracts/search?q=M.%20Belloufi"> M. Belloufi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Conjugate gradient methods are an important class of methods for unconstrained optimization, especially for large-scale problems. Recently, they have been much studied. In this paper, a new family of conjugate gradient method is proposed for unconstrained optimization. This method includes the already existing two practical nonlinear conjugate gradient methods, which produces a descent search direction at every iteration and converges globally provided that the line search satisfies the Wolfe conditions. The numerical experiments are done to test the efficiency of the new method, which implies the new method is promising. In addition the methods related to this family are uniformly discussed. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=conjugate%20gradient%20method" title="conjugate gradient method">conjugate gradient method</a>, <a href="https://publications.waset.org/abstracts/search?q=global%20convergence" title=" global convergence"> global convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=line%20search" title=" line search"> line search</a>, <a href="https://publications.waset.org/abstracts/search?q=unconstrained%20optimization" title=" unconstrained optimization"> unconstrained optimization</a> </p> <a href="https://publications.waset.org/abstracts/40381/a-new-family-of-globally-convergent-conjugate-gradient-methods" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/40381.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">410</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9101</span> A Modified Nonlinear Conjugate Gradient Algorithm for Large Scale Unconstrained Optimization Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tsegay%20Giday%20Woldu">Tsegay Giday Woldu</a>, <a href="https://publications.waset.org/abstracts/search?q=Haibin%20Zhang"> Haibin Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Xin%20Zhang"> Xin Zhang</a>, <a href="https://publications.waset.org/abstracts/search?q=Yemane%20Hailu%20Fissuh"> Yemane Hailu Fissuh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> It is well known that nonlinear conjugate gradient method is one of the widely used first order methods to solve large scale unconstrained smooth optimization problems. Because of the low memory requirement, attractive theoretical features, practical computational efficiency and nice convergence properties, nonlinear conjugate gradient methods have a special role for solving large scale unconstrained optimization problems. Large scale optimization problems are with important applications in practical and scientific world. However, nonlinear conjugate gradient methods have restricted information about the curvature of the objective function and they are likely less efficient and robust compared to some second order algorithms. To overcome these drawbacks, the new modified nonlinear conjugate gradient method is presented. The noticeable features of our work are that the new search direction possesses the sufficient descent property independent of any line search and it belongs to a trust region. Under mild assumptions and standard Wolfe line search technique, the global convergence property of the proposed algorithm is established. Furthermore, to test the practical computational performance of our new algorithm, numerical experiments are provided and implemented on the set of some large dimensional unconstrained problems. The numerical results show that the proposed algorithm is an efficient and robust compared with other similar algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=conjugate%20gradient%20method" title="conjugate gradient method">conjugate gradient method</a>, <a href="https://publications.waset.org/abstracts/search?q=global%20convergence" title=" global convergence"> global convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=large%20scale%20optimization" title=" large scale optimization"> large scale optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=sufficient%20descent%20property" title=" sufficient descent property"> sufficient descent property</a> </p> <a href="https://publications.waset.org/abstracts/102625/a-modified-nonlinear-conjugate-gradient-algorithm-for-large-scale-unconstrained-optimization-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/102625.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">205</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9100</span> Descent Algorithms for Optimization Algorithms Using q-Derivative</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Geetanjali%20Panda">Geetanjali Panda</a>, <a href="https://publications.waset.org/abstracts/search?q=Suvrakanti%20Chakraborty"> Suvrakanti Chakraborty</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, Newton-like descent methods are proposed for unconstrained optimization problems, which use q-derivatives of the gradient of an objective function. First, a local scheme is developed with alternative sufficient optimality condition, and then the method is extended to a global scheme. Moreover, a variant of practical Newton scheme is also developed introducing a real sequence. Global convergence of these schemes is proved under some mild conditions. Numerical experiments and graphical illustrations are provided. Finally, the performance profiles on a test set show that the proposed schemes are competitive to the existing first-order schemes for optimization problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Descent%20algorithm" title="Descent algorithm">Descent algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=line%20search%20method" title=" line search method"> line search method</a>, <a href="https://publications.waset.org/abstracts/search?q=q%20calculus" title=" q calculus"> q calculus</a>, <a href="https://publications.waset.org/abstracts/search?q=Quasi%20Newton%20method" title=" Quasi Newton method"> Quasi Newton method</a> </p> <a href="https://publications.waset.org/abstracts/62700/descent-algorithms-for-optimization-algorithms-using-q-derivative" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/62700.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">398</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9099</span> On the convergence of the Mixed Integer Randomized Pattern Search Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ebert%20Brea">Ebert Brea</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We propose a novel direct search algorithm for identifying at least a local minimum of mixed integer nonlinear unconstrained optimization problems. The Mixed Integer Randomized Pattern Search Algorithm (MIRPSA), so-called by the author, is based on a randomized pattern search, which is modified by the MIRPSA for finding at least a local minimum of our problem. The MIRPSA has two main operations over the randomized pattern search: moving operation and shrinking operation. Each operation is carried out by the algorithm when a set of conditions is held. The convergence properties of the MIRPSA is analyzed using a Markov chain approach, which is represented by an infinite countable set of state space λ, where each state d(q) is defined by a measure of the qth randomized pattern search Hq, for all q in N. According to the algorithm, when a moving operation is carried out on the qth randomized pattern search Hq, the MIRPSA holds its state. Meanwhile, if the MIRPSA carries out a shrinking operation over the qth randomized pattern search Hq, the algorithm will visit the next state, this is, a shrinking operation at the qth state causes a changing of the qth state into (q+1)th state. It is worthwhile pointing out that the MIRPSA never goes back to any visited states because the MIRPSA only visits any qth by shrinking operations. In this article, we describe the MIRPSA for mixed integer nonlinear unconstrained optimization problems for doing a deep study of its convergence properties using Markov chain viewpoint. We herein include a low dimension case for showing more details of the MIRPSA, when the algorithm is used for identifying the minimum of a mixed integer quadratic function. Besides, numerical examples are also shown in order to measure the performance of the MIRPSA. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=direct%20search" title="direct search">direct search</a>, <a href="https://publications.waset.org/abstracts/search?q=mixed%20integer%20optimization" title=" mixed integer optimization"> mixed integer optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=random%20search" title=" random search"> random search</a>, <a href="https://publications.waset.org/abstracts/search?q=convergence" title=" convergence"> convergence</a>, <a href="https://publications.waset.org/abstracts/search?q=Markov%20chain" title=" Markov chain"> Markov chain</a> </p> <a href="https://publications.waset.org/abstracts/33175/on-the-convergence-of-the-mixed-integer-randomized-pattern-search-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33175.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">470</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9098</span> Second Order Optimality Conditions in Nonsmooth Analysis on Riemannian Manifolds</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Seyedehsomayeh%20Hosseini">Seyedehsomayeh Hosseini</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Much attention has been paid over centuries to understanding and solving the problem of minimization of functions. Compared to linear programming and nonlinear unconstrained optimization problems, nonlinear constrained optimization problems are much more difficult. Since the procedure of finding an optimizer is a search based on the local information of the constraints and the objective function, it is very important to develop techniques using geometric properties of the constraints and the objective function. In fact, differential geometry provides a powerful tool to characterize and analyze these geometric properties. Thus, there is clearly a link between the techniques of optimization on manifolds and standard constrained optimization approaches. Furthermore, there are manifolds that are not defined as constrained sets in R^n an important example is the Grassmann manifolds. Hence, to solve optimization problems on these spaces, intrinsic methods are used. In a nondifferentiable problem, the gradient information of the objective function generally cannot be used to determine the direction in which the function is decreasing. Therefore, techniques of nonsmooth analysis are needed to deal with such a problem. As a manifold, in general, does not have a linear structure, the usual techniques, which are often used in nonsmooth analysis on linear spaces, cannot be applied and new techniques need to be developed. This paper presents necessary and sufficient conditions for a strict local minimum of extended real-valued, nonsmooth functions defined on Riemannian manifolds. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Riemannian%20manifolds" title="Riemannian manifolds">Riemannian manifolds</a>, <a href="https://publications.waset.org/abstracts/search?q=nonsmooth%20optimization" title=" nonsmooth optimization"> nonsmooth optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=lower%20semicontinuous%20functions" title=" lower semicontinuous functions"> lower semicontinuous functions</a>, <a href="https://publications.waset.org/abstracts/search?q=subdifferential" title=" subdifferential"> subdifferential</a> </p> <a href="https://publications.waset.org/abstracts/35809/second-order-optimality-conditions-in-nonsmooth-analysis-on-riemannian-manifolds" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35809.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">361</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9097</span> Development of Scratching Monitoring System Based on Mathematical Model of Unconstrained Bed Sensing Method</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Takuya%20Sumi">Takuya Sumi</a>, <a href="https://publications.waset.org/abstracts/search?q=Syoko%20Nukaya"> Syoko Nukaya</a>, <a href="https://publications.waset.org/abstracts/search?q=Takashi%20Kaburagi"> Takashi Kaburagi</a>, <a href="https://publications.waset.org/abstracts/search?q=Hiroshi%20Tanaka"> Hiroshi Tanaka</a>, <a href="https://publications.waset.org/abstracts/search?q=Kajiro%20Watanabe"> Kajiro Watanabe</a>, <a href="https://publications.waset.org/abstracts/search?q=Yosuke%20Kurihara"> Yosuke Kurihara</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We propose an unconstrained measurement system for scratching motion based on mathematical model of unconstrained bed sensing method which could measure the bed vibrations due to the motion of the person on the bed. In this paper, we construct mathematical model of the unconstrained bed monitoring system, and we apply the unconstrained bed sensing method to the system for detecting scratching motion. The proposed sensors are placed under the three bed feet. When the person is lying on the bed, the output signals from the sensors are proportional to the magnitude of the vibration due to the scratching motion. Hence, we could detect the subject’s scratching motion from the output signals from ceramic sensors. We evaluated two scratching motions using the proposed system in the validity experiment as follows: First experiment is the subject’s scratching the right side cheek with his right hand, and; second experiment is the subject’s scratching the shin with another foot. As the results of the experiment, we recognized the scratching signals that enable the determination when the scratching occurred. Furthermore, the difference among the amplitudes of the output signals enabled us to estimate where the subject scratched. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=unconstrained%20bed%20sensing%20method" title="unconstrained bed sensing method">unconstrained bed sensing method</a>, <a href="https://publications.waset.org/abstracts/search?q=scratching" title=" scratching"> scratching</a>, <a href="https://publications.waset.org/abstracts/search?q=body%20movement" title=" body movement"> body movement</a>, <a href="https://publications.waset.org/abstracts/search?q=itchy" title=" itchy"> itchy</a>, <a href="https://publications.waset.org/abstracts/search?q=piezoceramics" title=" piezoceramics"> piezoceramics</a> </p> <a href="https://publications.waset.org/abstracts/1382/development-of-scratching-monitoring-system-based-on-mathematical-model-of-unconstrained-bed-sensing-method" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/1382.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">410</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9096</span> Cuckoo Search (CS) Optimization Algorithm for Solving Constrained Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sait%20Ali%20Uymaz">Sait Ali Uymaz</a>, <a href="https://publications.waset.org/abstracts/search?q=G%C3%BClay%20Tezel"> Gülay Tezel</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents the comparison results on the performance of the Cuckoo Search (CS) algorithm for constrained optimization problems. For constraint handling, CS algorithm uses penalty method. CS algorithm is tested on thirteen well-known test problems and the results obtained are compared to Particle Swarm Optimization (PSO) algorithm. Mean, best, median and worst values were employed for the analyses of performance. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cuckoo%20search" title="cuckoo search">cuckoo search</a>, <a href="https://publications.waset.org/abstracts/search?q=particle%20swarm%20optimization" title=" particle swarm optimization"> particle swarm optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=constrained%20optimization%20problems" title=" constrained optimization problems"> constrained optimization problems</a>, <a href="https://publications.waset.org/abstracts/search?q=penalty%20method" title=" penalty method"> penalty method</a> </p> <a href="https://publications.waset.org/abstracts/13991/cuckoo-search-cs-optimization-algorithm-for-solving-constrained-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/13991.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">557</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9095</span> Model of Optimal Centroids Approach for Multivariate Data Classification</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pham%20Van%20Nha">Pham Van Nha</a>, <a href="https://publications.waset.org/abstracts/search?q=Le%20Cam%20Binh"> Le Cam Binh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Particle swarm optimization (PSO) is a population-based stochastic optimization algorithm. PSO was inspired by the natural behavior of birds and fish in migration and foraging for food. PSO is considered as a multidisciplinary optimization model that can be applied in various optimization problems. PSO’s ideas are simple and easy to understand but PSO is only applied in simple model problems. We think that in order to expand the applicability of PSO in complex problems, PSO should be described more explicitly in the form of a mathematical model. In this paper, we represent PSO in a mathematical model and apply in the multivariate data classification. First, PSOs general mathematical model (MPSO) is analyzed as a universal optimization model. Then, Model of Optimal Centroids (MOC) is proposed for the multivariate data classification. Experiments were conducted on some benchmark data sets to prove the effectiveness of MOC compared with several proposed schemes. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=analysis%20of%20optimization" title="analysis of optimization">analysis of optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=artificial%20intelligence%20based%20optimization" title=" artificial intelligence based optimization"> artificial intelligence based optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization%20for%20learning%20and%20data%20analysis" title=" optimization for learning and data analysis"> optimization for learning and data analysis</a>, <a href="https://publications.waset.org/abstracts/search?q=global%20optimization" title=" global optimization"> global optimization</a> </p> <a href="https://publications.waset.org/abstracts/126058/model-of-optimal-centroids-approach-for-multivariate-data-classification" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/126058.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">208</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9094</span> Sequential Covering Algorithm for Nondifferentiable Global Optimization Problem and Applications</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mohamed%20Rahal">Mohamed Rahal</a>, <a href="https://publications.waset.org/abstracts/search?q=Djaouida%20Guetta"> Djaouida Guetta</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, the one-dimensional unconstrained global optimization problem of continuous functions satifying a Hölder condition is considered. We extend the algorithm of sequential covering SCA for Lipschitz functions to a large class of Hölder functions. The convergence of the method is studied and the algorithm can be applied to systems of nonlinear equations. Finally, some numerical examples are presented and illustrate the efficiency of the present approach. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=global%20optimization" title="global optimization">global optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=H%C3%B6lder%20functions" title=" Hölder functions"> Hölder functions</a>, <a href="https://publications.waset.org/abstracts/search?q=sequential%20covering%20method" title=" sequential covering method"> sequential covering method</a>, <a href="https://publications.waset.org/abstracts/search?q=systems%20of%20nonlinear%20equations" title=" systems of nonlinear equations"> systems of nonlinear equations</a> </p> <a href="https://publications.waset.org/abstracts/6507/sequential-covering-algorithm-for-nondifferentiable-global-optimization-problem-and-applications" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/6507.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">369</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9093</span> Improved Particle Swarm Optimization with Cellular Automata and Fuzzy Cellular Automata</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ramin%20Javadzadeh">Ramin Javadzadeh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The particle swarm optimization are Meta heuristic optimization method, which are used for clustering and pattern recognition applications are abundantly. These algorithms in multimodal optimization problems are more efficient than genetic algorithms. A major drawback in these algorithms is their slow convergence to global optimum and their weak stability can be considered in various running of these algorithms. In this paper, improved Particle swarm optimization is introduced for the first time to overcome its problems. The fuzzy cellular automata is used for improving the algorithm efficiently. The credibility of the proposed approach is evaluated by simulations, and it is shown that the proposed approach achieves better results can be achieved compared to the Particle swarm optimization algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cellular%20automata" title="cellular automata">cellular automata</a>, <a href="https://publications.waset.org/abstracts/search?q=cellular%20learning%20automata" title=" cellular learning automata"> cellular learning automata</a>, <a href="https://publications.waset.org/abstracts/search?q=local%20search" title=" local search"> local search</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=particle%20swarm%20optimization" title=" particle swarm optimization"> particle swarm optimization</a> </p> <a href="https://publications.waset.org/abstracts/24739/improved-particle-swarm-optimization-with-cellular-automata-and-fuzzy-cellular-automata" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/24739.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">606</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9092</span> A New Modification of Nonlinear Conjugate Gradient Coefficients with Global Convergence Properties</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahmad%20Alhawarat">Ahmad Alhawarat</a>, <a href="https://publications.waset.org/abstracts/search?q=Mustafa%20Mamat"> Mustafa Mamat</a>, <a href="https://publications.waset.org/abstracts/search?q=Mohd%20Rivaie"> Mohd Rivaie</a>, <a href="https://publications.waset.org/abstracts/search?q=Ismail%20Mohd"> Ismail Mohd</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Conjugate gradient method has been enormously used to solve large scale unconstrained optimization problems due to the number of iteration, memory, CPU time, and convergence property, in this paper we find a new class of nonlinear conjugate gradient coefficient with global convergence properties proved by exact line search. The numerical results for our new βK give a good result when it compared with well-known formulas. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=conjugate%20gradient%20method" title="conjugate gradient method">conjugate gradient method</a>, <a href="https://publications.waset.org/abstracts/search?q=conjugate%20gradient%20coefficient" title=" conjugate gradient coefficient"> conjugate gradient coefficient</a>, <a href="https://publications.waset.org/abstracts/search?q=global%20convergence" title=" global convergence"> global convergence</a> </p> <a href="https://publications.waset.org/abstracts/1392/a-new-modification-of-nonlinear-conjugate-gradient-coefficients-with-global-convergence-properties" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/1392.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">463</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9091</span> Global Convergence of a Modified Three-Term Conjugate Gradient Algorithms</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Belloufi%20Mohammed">Belloufi Mohammed</a>, <a href="https://publications.waset.org/abstracts/search?q=Sellami%20Badreddine"> Sellami Badreddine</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper deals with a new nonlinear modified three-term conjugate gradient algorithm for solving large-scale unstrained optimization problems. The search direction of the algorithms from this class has three terms and is computed as modifications of the classical conjugate gradient algorithms to satisfy both the descent and the conjugacy conditions. An example of three-term conjugate gradient algorithm from this class, as modifications of the classical and well known Hestenes and Stiefel or of the CG_DESCENT by Hager and Zhang conjugate gradient algorithms, satisfying both the descent and the conjugacy conditions is presented. Under mild conditions, we prove that the modified three-term conjugate gradient algorithm with Wolfe type line search is globally convergent. Preliminary numerical results show the proposed method is very promising. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=unconstrained%20optimization" title="unconstrained optimization">unconstrained optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=three-term%20conjugate%20gradient" title=" three-term conjugate gradient"> three-term conjugate gradient</a>, <a href="https://publications.waset.org/abstracts/search?q=sufficient%20descent%20property" title=" sufficient descent property"> sufficient descent property</a>, <a href="https://publications.waset.org/abstracts/search?q=line%20search" title=" line search"> line search</a> </p> <a href="https://publications.waset.org/abstracts/41727/global-convergence-of-a-modified-three-term-conjugate-gradient-algorithms" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/41727.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">375</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9090</span> Engineering Optimization Using Two-Stage Differential Evolution</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=K.%20Y.%20Tseng">K. Y. Tseng</a>, <a href="https://publications.waset.org/abstracts/search?q=C.%20Y.%20Wu"> C. Y. Wu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper employs a heuristic algorithm to solve engineering problems including truss structure optimization and optimal chiller loading (OCL) problems. Two different type algorithms, real-valued differential evolution (DE) and modified binary differential evolution (MBDE), are successfully integrated and then can obtain better performance in solving engineering problems. In order to demonstrate the performance of the proposed algorithm, this study adopts each one testing case of truss structure optimization and OCL problems to compare the results of other heuristic optimization methods. The result indicates that the proposed algorithm can obtain similar or better solution in comparing with previous studies. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=differential%20evolution" title="differential evolution">differential evolution</a>, <a href="https://publications.waset.org/abstracts/search?q=Truss%20structure%20optimization" title=" Truss structure optimization"> Truss structure optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20chiller%20loading" title=" optimal chiller loading"> optimal chiller loading</a>, <a href="https://publications.waset.org/abstracts/search?q=modified%20binary%20differential%20evolution" title=" modified binary differential evolution"> modified binary differential evolution</a> </p> <a href="https://publications.waset.org/abstracts/109896/engineering-optimization-using-two-stage-differential-evolution" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/109896.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">168</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9089</span> Digestion Optimization Algorithm: A Novel Bio-Inspired Intelligence for Global Optimization Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Akintayo%20E.%20Akinsunmade">Akintayo E. Akinsunmade</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The digestion optimization algorithm is a novel biological-inspired metaheuristic method for solving complex optimization problems. The algorithm development was inspired by studying the human digestive system. The algorithm mimics the process of food ingestion, breakdown, absorption, and elimination to eﬀectively and eﬃciently search for optimal solutions. This algorithm was tested for optimal solutions on seven diﬀerent types of optimization benchmark functions. The algorithm produced optimal solutions with standard errors, which were compared with the exact solution of the test functions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=bio-inspired%20algorithm" title="bio-inspired algorithm">bio-inspired algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=benchmark%20optimization%20functions" title=" benchmark optimization functions"> benchmark optimization functions</a>, <a href="https://publications.waset.org/abstracts/search?q=digestive%20system%20in%20human" title=" digestive system in human"> digestive system in human</a>, <a href="https://publications.waset.org/abstracts/search?q=algorithm%20development" title=" algorithm development"> algorithm development</a> </p> <a href="https://publications.waset.org/abstracts/194133/digestion-optimization-algorithm-a-novel-bio-inspired-intelligence-for-global-optimization-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/194133.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">8</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9088</span> A New Tool for Global Optimization Problems: Cuttlefish Algorithm </h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Adel%20Sabry%20Eesa">Adel Sabry Eesa</a>, <a href="https://publications.waset.org/abstracts/search?q=Adnan%20Mohsin%20Abdulazeez%20Brifcani"> Adnan Mohsin Abdulazeez Brifcani</a>, <a href="https://publications.waset.org/abstracts/search?q=Zeynep%20Orman"> Zeynep Orman</a> </p> <p class="card-text"><strong>Abstract:</strong></p> This paper presents a new meta-heuristic bio-inspired optimization algorithm which is called Cuttlefish Algorithm (CFA). The algorithm mimics the mechanism of color changing behavior of the cuttlefish to solve numerical global optimization problems. The colors and patterns of the cuttlefish are produced by reflected light from three different layers of cells. The proposed algorithm considers mainly two processes: reflection and visibility. Reflection process simulates light reflection mechanism used by these layers, while visibility process simulates visibility of matching patterns of the cuttlefish. To show the effectiveness of the algorithm, it is tested with some other popular bio-inspired optimization algorithms such as Genetic Algorithms (GA), Particle Swarm Optimization (PSO) and Bees Algorithm (BA) that have been previously proposed in the literature. Simulations and obtained results indicate that the proposed CFA is superior when compared with these algorithms. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Cuttlefish%20Algorithm" title="Cuttlefish Algorithm">Cuttlefish Algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=bio-inspired%20algorithms" title=" bio-inspired algorithms"> bio-inspired algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization" title=" optimization"> optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=global%20optimization%20problems" title=" global optimization problems"> global optimization problems</a> </p> <a href="https://publications.waset.org/abstracts/11956/a-new-tool-for-global-optimization-problems-cuttlefish-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/11956.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">563</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9087</span> An Enhanced Particle Swarm Optimization Algorithm for Multiobjective Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Houda%20Abadlia">Houda Abadlia</a>, <a href="https://publications.waset.org/abstracts/search?q=Nadia%20Smairi"> Nadia Smairi</a>, <a href="https://publications.waset.org/abstracts/search?q=Khaled%20Ghedira"> Khaled Ghedira</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Multiobjective Particle Swarm Optimization (MOPSO) has shown an effective performance for solving test functions and real-world optimization problems. However, this method has a premature convergence problem, which may lead to lack of diversity. In order to improve its performance, this paper presents a hybrid approach which embedded the MOPSO into the island model and integrated a local search technique, Variable Neighborhood Search, to enhance the diversity into the swarm. Experiments on two series of test functions have shown the effectiveness of the proposed approach. A comparison with other evolutionary algorithms shows that the proposed approach presented a good performance in solving multiobjective optimization problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=particle%20swarm%20optimization" title="particle swarm optimization">particle swarm optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=migration" title=" migration"> migration</a>, <a href="https://publications.waset.org/abstracts/search?q=variable%20neighborhood%20search" title=" variable neighborhood search"> variable neighborhood search</a>, <a href="https://publications.waset.org/abstracts/search?q=multiobjective%20optimization" title=" multiobjective optimization"> multiobjective optimization</a> </p> <a href="https://publications.waset.org/abstracts/99544/an-enhanced-particle-swarm-optimization-algorithm-for-multiobjective-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/99544.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">167</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9086</span> Multi-Criteria Based Robust Markowitz Model under Box Uncertainty</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Pulak%20Swain">Pulak Swain</a>, <a href="https://publications.waset.org/abstracts/search?q=A.%20K.%20Ojha"> A. K. Ojha</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Portfolio optimization is based on dealing with the problems of efficient asset allocation. Risk and Expected return are two conflicting criteria in such problems, where the investor prefers the return to be high and the risk to be low. Using multi-objective approach we can solve those type of problems. However the information which we have for the input parameters are generally ambiguous and the input values can fluctuate around some nominal values. We can not ignore the uncertainty in input values, as they can affect the asset allocation drastically. So we use Robust Optimization approach to the problems where the input parameters comes under box uncertainty. In this paper, we solve the multi criteria robust problem with the help of E- constraint method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=portfolio%20optimization" title="portfolio optimization">portfolio optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=multi-objective%20optimization" title=" multi-objective optimization"> multi-objective optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=%CF%B5%20-%20constraint%20method" title=" ϵ - constraint method"> ϵ - constraint method</a>, <a href="https://publications.waset.org/abstracts/search?q=box%20uncertainty" title=" box uncertainty"> box uncertainty</a>, <a href="https://publications.waset.org/abstracts/search?q=robust%20optimization" title=" robust optimization"> robust optimization</a> </p> <a href="https://publications.waset.org/abstracts/118411/multi-criteria-based-robust-markowitz-model-under-box-uncertainty" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/118411.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">139</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9085</span> Finite Element and Split Bregman Methods for Solving a Family of Optimal Control Problem with Partial Differential Equation Constraint</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mahmoud%20Lot">Mahmoud Lot</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this article, we will discuss the solution of elliptic optimal control problem. First, by using the nite element method, we obtain the discrete form of the problem. The obtained discrete problem is actually a large scale constrained optimization problem. Solving this optimization problem with traditional methods is diﬃcult and requires a lot of CPU time and memory. But split Bergman method converts the constrained problem to an unconstrained, and hence it saves time and memory requirement. Then we use the split Bregman method for solving this problem, and examples show the speed and accuracy of split Bregman methods for solving these types of problems. We also use the SQP method for solving the examples and compare with the split Bregman method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Split%20Bregman%20Method" title="Split Bregman Method">Split Bregman Method</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20control%20with%20elliptic%20partial%20differential%20equation%20constraint" title=" optimal control with elliptic partial differential equation constraint"> optimal control with elliptic partial differential equation constraint</a>, <a href="https://publications.waset.org/abstracts/search?q=finite%20element%20method" title=" finite element method"> finite element method</a> </p> <a href="https://publications.waset.org/abstracts/123437/finite-element-and-split-bregman-methods-for-solving-a-family-of-optimal-control-problem-with-partial-differential-equation-constraint" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/123437.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">152</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9084</span> Optimization of Personnel Selection Problems via Unconstrained Geometric Programming</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vildan%20Kistik">Vildan Kistik</a>, <a href="https://publications.waset.org/abstracts/search?q=Tuncay%20Can"> Tuncay Can</a> </p> <p class="card-text"><strong>Abstract:</strong></p> From a business perspective, cost and profit are two key factors for businesses. The intent of most businesses is to minimize the cost to maximize or equalize the profit, so as to provide the greatest benefit to itself. However, the physical system is very complicated because of technological constructions, rapid increase of competitive environments and similar factors. In such a system it is not easy to maximize profits or to minimize costs. Businesses must decide on the competence and competence of the personnel to be recruited, taking into consideration many criteria in selecting personnel. There are many criteria to determine the competence and competence of a staff member. Factors such as the level of education, experience, psychological and sociological position, and human relationships that exist in the field are just some of the important factors in selecting a staff for a firm. Personnel selection is a very important and costly process in terms of businesses in today's competitive market. Although there are many mathematical methods developed for the selection of personnel, unfortunately the use of these mathematical methods is rarely encountered in real life. In this study, unlike other methods, an exponential programming model was established based on the possibilities of failing in case the selected personnel was started to work. With the necessary transformations, the problem has been transformed into unconstrained Geometrical Programming problem and personnel selection problem is approached with geometric programming technique. Personnel selection scenarios for a classroom were established with the help of normal distribution and optimum solutions were obtained. In the most appropriate solutions, the personnel selection process for the classroom has been achieved with minimum cost. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=geometric%20programming" title="geometric programming">geometric programming</a>, <a href="https://publications.waset.org/abstracts/search?q=personnel%20selection" title=" personnel selection"> personnel selection</a>, <a href="https://publications.waset.org/abstracts/search?q=non-linear%20programming" title=" non-linear programming"> non-linear programming</a>, <a href="https://publications.waset.org/abstracts/search?q=operations%20research" title=" operations research"> operations research</a> </p> <a href="https://publications.waset.org/abstracts/70257/optimization-of-personnel-selection-problems-via-unconstrained-geometric-programming" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/70257.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">269</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9083</span> A Parallel Implementation of Artificial Bee Colony Algorithm within CUDA Architecture</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Selcuk%20Aslan">Selcuk Aslan</a>, <a href="https://publications.waset.org/abstracts/search?q=Dervis%20Karaboga"> Dervis Karaboga</a>, <a href="https://publications.waset.org/abstracts/search?q=Celal%20Ozturk"> Celal Ozturk</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Artificial Bee Colony (ABC) algorithm is one of the most successful swarm intelligence based metaheuristics. It has been applied to a number of constrained or unconstrained numerical and combinatorial optimization problems. In this paper, we presented a parallelized version of ABC algorithm by adapting employed and onlooker bee phases to the Compute Unified Device Architecture (CUDA) platform which is a graphical processing unit (GPU) programming environment by NVIDIA. The execution speed and obtained results of the proposed approach and sequential version of ABC algorithm are compared on functions that are typically used as benchmarks for optimization algorithms. Tests on standard benchmark functions with different colony size and number of parameters showed that proposed parallelization approach for ABC algorithm decreases the execution time consumed by the employed and onlooker bee phases in total and achieved similar or better quality of the results compared to the standard sequential implementation of the ABC algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Artificial%20Bee%20Colony%20algorithm" title="Artificial Bee Colony algorithm">Artificial Bee Colony algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=GPU%20computing" title=" GPU computing"> GPU computing</a>, <a href="https://publications.waset.org/abstracts/search?q=swarm%20intelligence" title=" swarm intelligence"> swarm intelligence</a>, <a href="https://publications.waset.org/abstracts/search?q=parallelization" title=" parallelization"> parallelization</a> </p> <a href="https://publications.waset.org/abstracts/44876/a-parallel-implementation-of-artificial-bee-colony-algorithm-within-cuda-architecture" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/44876.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">378</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9082</span> An Optimization Algorithm Based on Dynamic Schema with Dissimilarities and Similarities of Chromosomes</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Radhwan%20Yousif%20Sedik%20Al-Jawadi">Radhwan Yousif Sedik Al-Jawadi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Optimization is necessary for finding appropriate solutions to a range of real-life problems. In particular, genetic (or more generally, evolutionary) algorithms have proved very useful in solving many problems for which analytical solutions are not available. In this paper, we present an optimization algorithm called Dynamic Schema with Dissimilarity and Similarity of Chromosomes (DSDSC) which is a variant of the classical genetic algorithm. This approach constructs new chromosomes from a schema and pairs of existing ones by exploring their dissimilarities and similarities. To show the effectiveness of the algorithm, it is tested and compared with the classical GA, on 15 two-dimensional optimization problems taken from literature. We have found that, in most cases, our method is better than the classical genetic algorithm. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=chromosome%20injection" title="chromosome injection">chromosome injection</a>, <a href="https://publications.waset.org/abstracts/search?q=dynamic%20schema" title=" dynamic schema"> dynamic schema</a>, <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title=" genetic algorithm"> genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=similarity%20and%20dissimilarity" title=" similarity and dissimilarity"> similarity and dissimilarity</a> </p> <a href="https://publications.waset.org/abstracts/54193/an-optimization-algorithm-based-on-dynamic-schema-with-dissimilarities-and-similarities-of-chromosomes" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/54193.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">346</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9081</span> Ill-Posed Inverse Problems in Molecular Imaging</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ranadhir%20Roy">Ranadhir Roy</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Inverse problems arise in medical (molecular) imaging. These problems are characterized by large in three dimensions, and by the diffusion equation which models the physical phenomena within the media. The inverse problems are posed as a nonlinear optimization where the unknown parameters are found by minimizing the difference between the predicted data and the measured data. To obtain a unique and stable solution to an ill-posed inverse problem, a priori information must be used. Mathematical conditions to obtain stable solutions are established in Tikhonov’s regularization method, where the a priori information is introduced via a stabilizing functional, which may be designed to incorporate some relevant information of an inverse problem. Effective determination of the Tikhonov regularization parameter requires knowledge of the true solution, or in the case of optical imaging, the true image. Yet, in, clinically-based imaging, true image is not known. To alleviate these difficulties we have applied the penalty/modified barrier function (PMBF) method instead of Tikhonov regularization technique to make the inverse problems well-posed. Unlike the Tikhonov regularization method, the constrained optimization technique, which is based on simple bounds of the optical parameter properties of the tissue, can easily be implemented in the PMBF method. Imposing the constraints on the optical properties of the tissue explicitly restricts solution sets and can restore uniqueness. Like the Tikhonov regularization method, the PMBF method limits the size of the condition number of the Hessian matrix of the given objective function. The accuracy and the rapid convergence of the PMBF method require a good initial guess of the Lagrange multipliers. To obtain the initial guess of the multipliers, we use a least square unconstrained minimization problem. Three-dimensional images of fluorescence absorption coefficients and lifetimes were reconstructed from contact and noncontact experimentally measured data. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=constrained%20minimization" title="constrained minimization">constrained minimization</a>, <a href="https://publications.waset.org/abstracts/search?q=ill-conditioned%20inverse%20problems" title=" ill-conditioned inverse problems"> ill-conditioned inverse problems</a>, <a href="https://publications.waset.org/abstracts/search?q=Tikhonov%20regularization%20method" title=" Tikhonov regularization method"> Tikhonov regularization method</a>, <a href="https://publications.waset.org/abstracts/search?q=penalty%20modified%20barrier%20function%20method" title=" penalty modified barrier function method"> penalty modified barrier function method</a> </p> <a href="https://publications.waset.org/abstracts/50067/ill-posed-inverse-problems-in-molecular-imaging" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/50067.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">270</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9080</span> Discretization of Cuckoo Optimization Algorithm for Solving Quadratic Assignment Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Elham%20Kazemi">Elham Kazemi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Quadratic Assignment Problem (QAP) is one the combinatorial optimization problems about which research has been done in many companies for allocating some facilities to some locations. The issue of particular importance in this process is the costs of this allocation and the attempt in this problem is to minimize this group of costs. Since the QAP’s are from NP-hard problem, they cannot be solved by exact solution methods. Cuckoo Optimization Algorithm is a Meta-heuristicmethod which has higher capability to find the global optimal points. It is an algorithm which is basically raised to search a continuous space. The Quadratic Assignment Problem is the issue which can be solved in the discrete space, thus the standard arithmetic operators of Cuckoo Optimization Algorithm need to be redefined on the discrete space in order to apply the Cuckoo Optimization Algorithm on the discrete searching space. This paper represents the way of discretizing the Cuckoo optimization algorithm for solving the quadratic assignment problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Quadratic%20Assignment%20Problem%20%28QAP%29" title="Quadratic Assignment Problem (QAP)">Quadratic Assignment Problem (QAP)</a>, <a href="https://publications.waset.org/abstracts/search?q=Discrete%20Cuckoo%20Optimization%20Algorithm%20%28DCOA%29" title=" Discrete Cuckoo Optimization Algorithm (DCOA)"> Discrete Cuckoo Optimization Algorithm (DCOA)</a>, <a href="https://publications.waset.org/abstracts/search?q=meta-heuristic%20algorithms" title=" meta-heuristic algorithms"> meta-heuristic algorithms</a>, <a href="https://publications.waset.org/abstracts/search?q=optimization%20algorithms" title=" optimization algorithms"> optimization algorithms</a> </p> <a href="https://publications.waset.org/abstracts/25249/discretization-of-cuckoo-optimization-algorithm-for-solving-quadratic-assignment-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/25249.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">517</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9079</span> Solutions to Probabilistic Constrained Optimal Control Problems Using Concentration Inequalities</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Tomoaki%20Hashimoto">Tomoaki Hashimoto</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recently, optimal control problems subject to probabilistic constraints have attracted much attention in many research field. Although probabilistic constraints are generally intractable in optimization problems, several methods haven been proposed to deal with probabilistic constraints. In most methods, probabilistic constraints are transformed to deterministic constraints that are tractable in optimization problems. This paper examines a method for transforming probabilistic constraints into deterministic constraints for a class of probabilistic constrained optimal control problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=optimal%20control" title="optimal control">optimal control</a>, <a href="https://publications.waset.org/abstracts/search?q=stochastic%20systems" title=" stochastic systems"> stochastic systems</a>, <a href="https://publications.waset.org/abstracts/search?q=discrete-time%20systems" title=" discrete-time systems"> discrete-time systems</a>, <a href="https://publications.waset.org/abstracts/search?q=probabilistic%20constraints" title=" probabilistic constraints"> probabilistic constraints</a> </p> <a href="https://publications.waset.org/abstracts/57973/solutions-to-probabilistic-constrained-optimal-control-problems-using-concentration-inequalities" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/57973.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">278</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9078</span> An Ensemble Learning Method for Applying Particle Swarm Optimization Algorithms to Systems Engineering Problems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ken%20Hampshire">Ken Hampshire</a>, <a href="https://publications.waset.org/abstracts/search?q=Thomas%20Mazzuchi"> Thomas Mazzuchi</a>, <a href="https://publications.waset.org/abstracts/search?q=Shahram%20Sarkani"> Shahram Sarkani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> As a subset of metaheuristics, nature-inspired optimization algorithms such as particle swarm optimization (PSO) have shown promise both in solving intractable problems and in their extensibility to novel problem formulations due to their general approach requiring few assumptions. Unfortunately, single instantiations of algorithms require detailed tuning of parameters and cannot be proven to be best suited to a particular illustrative problem on account of the “no free lunch” (NFL) theorem. Using these algorithms in real-world problems requires exquisite knowledge of the many techniques and is not conducive to reconciling the various approaches to given classes of problems. This research aims to present a unified view of PSO-based approaches from the perspective of relevant systems engineering problems, with the express purpose of then eliciting the best solution for any problem formulation in an ensemble learning bucket of models approach. The central hypothesis of the research is that extending the PSO algorithms found in the literature to real-world optimization problems requires a general ensemble-based method for all problem formulations but a specific implementation and solution for any instance. The main results are a problem-based literature survey and a general method to find more globally optimal solutions for any systems engineering optimization problem. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=particle%20swarm%20optimization" title="particle swarm optimization">particle swarm optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=nature-inspired%20optimization" title=" nature-inspired optimization"> nature-inspired optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=metaheuristics" title=" metaheuristics"> metaheuristics</a>, <a href="https://publications.waset.org/abstracts/search?q=systems%20engineering" title=" systems engineering"> systems engineering</a>, <a href="https://publications.waset.org/abstracts/search?q=ensemble%20learning" title=" ensemble learning"> ensemble learning</a> </p> <a href="https://publications.waset.org/abstracts/167097/an-ensemble-learning-method-for-applying-particle-swarm-optimization-algorithms-to-systems-engineering-problems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/167097.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">98</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">9077</span> Chemical Reaction Algorithm for Expectation Maximization Clustering</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Li%20Ni">Li Ni</a>, <a href="https://publications.waset.org/abstracts/search?q=Pen%20ManMan"> Pen ManMan</a>, <a href="https://publications.waset.org/abstracts/search?q=Li%20KenLi"> Li KenLi</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Clustering is an intensive research for some years because of its multifaceted applications, such as biology, information retrieval, medicine, business and so on. The expectation maximization (EM) is a kind of algorithm framework in clustering methods, one of the ten algorithms of machine learning. Traditionally, optimization of objective function has been the standard approach in EM. Hence, research has investigated the utility of evolutionary computing and related techniques in the regard. Chemical Reaction Optimization (CRO) is a recently established method. So the property embedded in CRO is used to solve optimization problems. This paper presents an algorithm framework (EM-CRO) with modified CRO operators based on EM cluster problems. The hybrid algorithm is mainly to solve the problem of initial value sensitivity of the objective function optimization clustering algorithm. Our experiments mainly take the EM classic algorithm:k-means and fuzzy k-means as an example, through the CRO algorithm to optimize its initial value, get K-means-CRO and FKM-CRO algorithm. The experimental results of them show that there is improved efficiency for solving objective function optimization clustering problems. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=chemical%20reaction%20optimization" title="chemical reaction optimization">chemical reaction optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=expection%20maimization" title=" expection maimization"> expection maimization</a>, <a href="https://publications.waset.org/abstracts/search?q=initia" title=" initia"> initia</a>, <a href="https://publications.waset.org/abstracts/search?q=objective%20function%20clustering" title=" objective function clustering"> objective function clustering</a> </p> <a href="https://publications.waset.org/abstracts/54706/chemical-reaction-algorithm-for-expectation-maximization-clustering" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/54706.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">713</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=unconstrained%20optimization%20problems&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=unconstrained%20optimization%20problems&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=unconstrained%20optimization%20problems&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=unconstrained%20optimization%20problems&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=unconstrained%20optimization%20problems&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=unconstrained%20optimization%20problems&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=unconstrained%20optimization%20problems&page=8">8</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=unconstrained%20optimization%20problems&page=9">9</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=unconstrained%20optimization%20problems&page=10">10</a></li> <li class="page-item disabled"><span class="page-link">...</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=unconstrained%20optimization%20problems&page=303">303</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=unconstrained%20optimization%20problems&page=304">304</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=unconstrained%20optimization%20problems&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>