Science.gov

Sample records for convex optimization algorithms

  1. Convex Functions Smooth Optimization Non-Smooth Optimization Randomized Algorithms Parallel/Distributed Optimization Convex Optimization

    E-print Network

    Marlin, Benjamin

    Convex Functions Smooth Optimization Non-Smooth Optimization Randomized Algorithms Parallel Smooth Optimization Non-Smooth Optimization Randomized Algorithms Parallel/Distributed Optimization Smooth Optimization Non-Smooth Optimization Randomized Algorithms Parallel/Distributed Optimization

  2. RESCALED PURE GREEDY ALGORITHM FOR CONVEX OPTIMIZATION

    E-print Network

    Petrova, Guergana

    of these algorithms work only if the minimum of E is attained in the convex hull of D, since the approximant xm to the convex hull of D and has a rate of convergence O(m1-q). This algorithm is an appropriate modificationRESCALED PURE GREEDY ALGORITHM FOR CONVEX OPTIMIZATION ZHEMING GAO, GUERGANA PETROVA Abstract. We

  3. Optimal Output-Sensitive Convex Hull Algorithms in Two and Three Dimensions

    E-print Network

    Danner, Andrew

    Optimal Output-Sensitive Convex Hull Algorithms in Two and Three Dimensions Timothy M. Chan present simple output-sensitive algorithms that construct the convex hull of a set of n points in two the convex hull in O(nh) time. This bound was later improved to O(nlogh) by an algorithm due to Kirkpatrick

  4. Optimal OutputSensitive Convex Hull Algorithms in Two and Three Dimensions

    E-print Network

    Chan, Timothy M.

    Optimal Output­Sensitive Convex Hull Algorithms in Two and Three Dimensions Timothy M. Chan \\Lambda present simple output­sensitive algorithms that construct the convex hull of a set of n points in two, we point out a simple output­sensitive convex hull algorithm in E 2 and its extension in E 3 , both

  5. Byzantine Convex Consensus: An Optimal Algorithm Lewis Tseng1,3

    E-print Network

    Vaidya, Nitin

    Byzantine Convex Consensus: An Optimal Algorithm Lewis Tseng1,3 , and Nitin Vaidya2,3 1 Department in the convex hull of the input vectors at the fault-free nodes [9, 13]. The d-dimensional vectors can to be a convex polytope in the d-dimensional space, such that the decided polytope is within the convex hull

  6. Phase retrieval using iterative Fourier transform and convex optimization algorithm

    NASA Astrophysics Data System (ADS)

    Zhang, Fen; Cheng, Hong; Zhang, Quanbing; Wei, Sui

    2015-05-01

    Phase is an inherent characteristic of any wave field. Statistics show that greater than 25% of the information is encoded in the amplitude term and 75% of the information is in the phase term. The technique of phase retrieval means acquire phase by computation using magnitude measurements and provides data information for holography display, 3D field reconstruction, X-ray crystallography, diffraction imaging, astronomical imaging and many other applications. Mathematically, solving phase retrieval problem is an inverse problem taking the physical and computation constraints. Some recent algorithms use the principle of compressive sensing, such as PhaseLift, PhaseCut and compressive phase retrieval etc. they formulate phase retrieval problems as one of finding the rank-one solution to a system of linear matrix equations and make the overall algorithm a convex program over n n matrices. However, by "lifting" a vector problem to a matrix one, these methods lead to a much higher computational cost as a result. Furthermore, they only use intensity measurements but few physical constraints. In the paper, a new algorithm is proposed that combines above convex optimization methods with a well known iterative Fourier transform algorithm (IFTA). The IFTA iterates between the object domain and spectral domain to reinforce the physical information and reaches convergence quickly which has been proved in many applications such as compute-generated-hologram (CGH). Herein the output phase of the IFTA is treated as the initial guess of convex optimization methods, and then the reconstructed phase is numerically computed by using modified TFOCS. Simulation results show that the combined algorithm increases the likelihood of successful recovery as well as improves the precision of solution.

  7. Convex Functions Smooth Optimization Non-Smooth Optimization Randomized Algorithms Parallel/Distributed Optimization Convex Optimization for Big Data

    E-print Network

    Marlin, Benjamin

    /Distributed Optimization Convex Optimization for Big Data Asian Conference on Machine Learning Mark Schmidt November 2014/Distributed Optimization Context: Big Data and Big Models We are collecting data at unprecedented rates. Seen across many/Distributed Optimization Context: Big Data and Big Models We are collecting data at unprecedented rates. Seen across many

  8. Convex Optimization Convex Optimization

    E-print Network

    Masci, Frank

    in the United States of America by Cambridge University Press, New York http://www.cambridge.org Information published 2004 Seventh printing with corrections 2009 Printed in the United Kingdom at the University Press that preserve convexity . . . . . . . . . . . . . . . . . . . . 35 2.4 Generalized inequalities

  9. A General Iterative Shrinkage and Thresholding Algorithm for Non-convex Regularized Optimization Problems.

    PubMed

    Gong, Pinghua; Zhang, Changshui; Lu, Zhaosong; Huang, Jianhua Z; Ye, Jieping

    2013-01-01

    Non-convex sparsity-inducing penalties have recently received considerable attentions in sparse learning. Recent theoretical investigations have demonstrated their superiority over the convex counterparts in several sparse learning settings. However, solving the non-convex optimization problems associated with non-convex penalties remains a big challenge. A commonly used approach is the Multi-Stage (MS) convex relaxation (or DC programming), which relaxes the original non-convex problem to a sequence of convex problems. This approach is usually not very practical for large-scale problems because its computational cost is a multiple of solving a single convex problem. In this paper, we propose a General Iterative Shrinkage and Thresholding (GIST) algorithm to solve the nonconvex optimization problem for a large class of non-convex penalties. The GIST algorithm iteratively solves a proximal operator problem, which in turn has a closed-form solution for many commonly used penalties. At each outer iteration of the algorithm, we use a line search initialized by the Barzilai-Borwein (BB) rule that allows finding an appropriate step size quickly. The paper also presents a detailed convergence analysis of the GIST algorithm. The efficiency of the proposed algorithm is demonstrated by extensive experiments on large-scale data sets. PMID:25285330

  10. Optimal In-Place and Cache-Oblivious Algorithms for 3-d Convex Hulls and 2-d Segment Intersection

    E-print Network

    Chan, Timothy M.

    Optimal In-Place and Cache-Oblivious Algorithms for 3-d Convex Hulls and 2-d Segment Intersection-place algorithm for the basic 3-d convex hull prob- lem (and, in particular, for 2-d Voronoi diagrams: In-place algorithms, Convex hulls, Voronoi diagrams, Segment intersection, Cache- oblivious

  11. Convex Optimization for Big Data: Scalable, randomized, and parallel algorithms for big data analytics

    NASA Astrophysics Data System (ADS)

    Cevher, Volkan; Becker, Stephen; Schmidt, Mark

    2014-09-01

    This article reviews recent advances in convex optimization algorithms for Big Data, which aim to reduce the computational, storage, and communications bottlenecks. We provide an overview of this emerging field, describe contemporary approximation techniques like first-order methods and randomization for scalability, and survey the important role of parallel and distributed computation. The new Big Data algorithms are based on surprisingly simple principles and attain staggering accelerations even on classical problems.

  12. A nonmonotone trustregion algorithm for nonlinear optimization subject to convex

    E-print Network

    Toint, Philippe

    and the corresponding exit codes, i.e. the codes indicating the reason for algorithm termination, were corrected (in f b b b b 5 10 15 20 CATENARY s s CHEMRCTA s CHEMRCTB s s s s HEARTLS s HS75 s s s s s s s s s HS114 s s s s s s HS75 s s s s s s s s s s MEYER3 s NYSTROM5 i i i i i i i i TENBARS1 s s s s TENBARS2 s s s ORTHREGA

  13. Convex Functions Smooth Optimization Non-Smooth Optimization Stochastic Optimization Convex Optimization

    E-print Network

    Marlin, Benjamin

    Convex Functions Smooth Optimization Non-Smooth Optimization Stochastic Optimization Convex Optimization Mark Schmidt - CMPT 419/726 #12;Convex Functions Smooth Optimization Non-Smooth Optimization;Convex Functions Smooth Optimization Non-Smooth Optimization Stochastic Optimization Motivation: Why

  14. Hybrid Random/Deterministic Parallel Algorithms for Convex and Nonconvex Big Data Optimization

    NASA Astrophysics Data System (ADS)

    Daneshmand, Amir; Facchinei, Francisco; Kungurtsev, Vyacheslav; Scutari, Gesualdo

    2015-08-01

    We propose a decomposition framework for the parallel optimization of the sum of a differentiable {(possibly nonconvex)} function and a nonsmooth (possibly nonseparable), convex one. The latter term is usually employed to enforce structure in the solution, typically sparsity. The main contribution of this work is a novel \\emph{parallel, hybrid random/deterministic} decomposition scheme wherein, at each iteration, a subset of (block) variables is updated at the same time by minimizing local convex approximations of the original nonconvex function. To tackle with huge-scale problems, the (block) variables to be updated are chosen according to a \\emph{mixed random and deterministic} procedure, which captures the advantages of both pure deterministic and random update-based schemes. Almost sure convergence of the proposed scheme is established. Numerical results show that on huge-scale problems the proposed hybrid random/deterministic algorithm outperforms both random and deterministic schemes.

  15. An Inner Convex Approximation Algorithm for BMI Optimization and Applications in Control

    E-print Network

    Dinh, Quoc Tran; Diehl, Moritz

    2012-01-01

    In this work, we propose a new local optimization method to solve a class of nonconvex semidefinite programming (SDP) problems. The basic idea is to approximate the feasible set of the nonconvex SDP problem by inner positive semidefinite convex approximations via a parameterization technique. This leads to an iterative procedure to search a local optimum of the nonconvex problem. The convergence of the algorithm is analyzed under mild assumptions. Applications in static output feedback control are benchmarked and numerical tests are implemented based on the data from the COMPLeib library.

  16. Implementation of a Point Algorithm for Real-Time Convex Optimization

    NASA Technical Reports Server (NTRS)

    Acikmese, Behcet; Motaghedi, Shui; Carson, John

    2007-01-01

    The primal-dual interior-point algorithm implemented in G-OPT is a relatively new and efficient way of solving convex optimization problems. Given a prescribed level of accuracy, the convergence to the optimal solution is guaranteed in a predetermined, finite number of iterations. G-OPT Version 1.0 is a flight software implementation written in C. Onboard application of the software enables autonomous, real-time guidance and control that explicitly incorporates mission constraints such as control authority (e.g. maximum thrust limits), hazard avoidance, and fuel limitations. This software can be used in planetary landing missions (Mars pinpoint landing and lunar landing), as well as in proximity operations around small celestial bodies (moons, asteroids, and comets). It also can be used in any spacecraft mission for thrust allocation in six-degrees-of-freedom control.

  17. Quasi-Newton Algorithms for Non-smooth Online Strongly Convex Optimization

    E-print Network

    Godwin, Mark Franklin

    2011-01-01

    ONLINE PORTFOLIO OPTIMIZATION To gain insight into the algorithms strategies we run numerical experiments with a portfolio of Coke,Coke, IBM and GE Algorithm FTAL-OPO FTAL-SC UCRP Wealth APY Volatility CHAPTER 5. ONLINE

  18. Convex Optimization: from Real-Time Embedded

    E-print Network

    Hall, Julian

    , vision networking circuit design combinatorial optimization quantum mechanics Convex Optimization 7-means, EM, auto-encoders (bi-convex) Convex Optimization 8 #12;Example -- Support vector machine data (ai

  19. Adaptive Algorithms for Planar Convex Hull Problems

    NASA Astrophysics Data System (ADS)

    Ahn, Hee-Kap; Okamoto, Yoshio

    We study problems in computational geometry from the viewpoint of adaptive algorithms. Adaptive algorithms have been extensively studied for the sorting problem, and in this paper we generalize the framework to geometric problems. To this end, we think of geometric problems as permutation (or rearrangement) problems of arrays, and define the "presortedness" as a distance from the input array to the desired output array. We call an algorithm adaptive if it runs faster when a given input array is closer to the desired output, and furthermore it does not make use of any information of the presortedness. As a case study, we look into the planar convex hull problem for which we discover two natural formulations as permutation problems. An interesting phenomenon that we prove is that for one formulation the problem can be solved adaptively, but for the other formulation no adaptive algorithm can be better than an optimal output-sensitive algorithm for the planar convex hull problem.

  20. An Implementation of a Convex Hull Algorithm

    E-print Network

    Waldmann, Uwe

    An Implementation of a Convex Hull Algorithm Version 1.0 Michael M¨uller Joachim Ziegler MPI­I­94;Abstract We give an implementation of an incremental construction algorithm for convex hulls in IRd using Literate Programming and LEDA in C++. We treat convex hulls in arbitrary dimensions without any non

  1. Speculative Parallelization of a Randomized Incremental Convex Hull Algorithm

    E-print Network

    Palop del Río, Belén

    Speculative Parallelization of a Randomized Incremental Convex Hull Algorithm M. Cintra (i), D Incremental Algorithm" Why the Convex hull? Why Speculative Parallelization? Why Randomized Algorithms Algorithm" Why the Convex hull? Frequently used simple structure whose computation is bottleneck for many

  2. Convex optimization methods for model reduction

    E-print Network

    Sou, Kin Cheong, 1979-

    2008-01-01

    Model reduction and convex optimization are prevalent in science and engineering applications. In this thesis, convex optimization solution techniques to three different model reduction problems are studied.Parameterized ...

  3. A Convex Optimization Approach to pMRI Reconstruction

    E-print Network

    Zhang, Cishen

    2013-01-01

    In parallel magnetic resonance imaging (pMRI) reconstruction without using estimation of coil sensitivity functions, one group of algorithms reconstruct sensitivity encoded images of the coils first followed by the magnitude only image reconstruction, e.g. GRAPPA, and another group of algorithms jointly compute the image and sensitivity functions by regularized optimization which is a non-convex problem with local only solutions. For the magnitude only image reconstruction, this paper derives a reconstruction formulation, which is linear in the magnitude image, and an associated convex hull in the solution space of the formulated equation containing the magnitude of the image. As a result, the magnitude only image reconstruction for pMRI is formulated into a two-step convex optimization problem, which has a globally optimal solution. An algorithm based on split-bregman and nuclear norm regularized optimizations is proposed to implement the two-step convex optimization and its applications to phantom and in-vi...

  4. Kernel regression for travel time estimation via convex optimization

    E-print Network

    Kernel regression for travel time estimation via convex optimization Sbastien Blandin , Laurent El Ghaoui and Alexandre Bayen Abstract--We develop an algorithm aimed at estimating travel time on segments of a road network using a convex optimiza- tion framework. Sampled travel time from probe vehicles

  5. Space-efficient algorithms for computing the convex hull of a simple polygonal line

    E-print Network

    Chan, Timothy M.

    Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time¨onnimann et al. give optimal in-place algorithms for computing two-dimensional convex hulls. For this problem for stable partition. If the points inside the convex hull can be discarded, then there is a truly simple so

  6. Reachable Grasps on a Polygon: The Convex Rope Algorithm

    E-print Network

    Amaral, Luis A.N.

    . Introduction 3. The RopeConstruction 4. Convex Hull Algorithm 5. CCW Convex Rope Algorithm 6. Descriptionof CCWReachable Grasps on a Polygon: The Convex Rope Algorithm M. A. Ycshkin and A. C. Sanderson CMU Convex Rope Algorithm 7. Conclusion 8. Acknowledgements 1 4 6 9 10 12 15 15 #12;#12;ii List of Figures

  7. Space-Efficient Planar Convex Hull Algorithms 1

    E-print Network

    Morin, Pat

    Space-Efficient Planar Convex Hull Algorithms 1 Herv´e Br¨onnimann, John Iacono, CIS, Polytechnic-efficient algorithms for computing the convex hull of a planar point set. Key words: Computational geometry, convex on the hull. As early as 1972, Graham [1] gave a convex hull algorithm with O(n log n) worst-case running time

  8. A convex hull algorithm for neural networks

    SciTech Connect

    Wennyre, E. )

    1989-11-01

    A convex hull algorithm for neural networks is presented. It is applicable in both two and three dimensions, and has a time complexity of O(N) for the off-line case, O(log N) for the on-line case in two dimensions, and O(hN), O(N), respectively, for three dimensions (h is the number of faces in the convex hull). The constant bounding the complexity is expected to be very small.

  9. An Overview Of Software For Convex Optimization

    E-print Network

    Borchers, Brian

    convex, problems solved by gradient based local search methods.) The development of interior point Shift From the 1960's through the early 1990's, many people divided optimization in linear programming (convex, non-smooth, problems solved by the simplex method) and nonlinear programming (smooth, typically

  10. Joint Equalization and Decoding via Convex Optimization

    E-print Network

    Kim, Byung Hak

    2012-07-16

    The unifying theme of this dissertation is the development of new solutions for decoding and inference problems based on convex optimization methods. Th first part considers the joint detection and decoding problem for ...

  11. A Modeless Convex Hull Algorithm for Simple Polygons

    E-print Network

    Amaral, Luis A.N.

    A Modeless Convex Hull Algorithm for Simple Polygons M. A. Peshkin and A. C. Sanderson CMU-RI-TR-85 3. Convex Hull Algorithm 4. Acknowledgements 1 3 5 6 #12;#12;ii List of Figures Figure 1-1: Bykat;#12;Abstract We present an order n algorithm which computes the convex hull of a two-dimensional non

  12. Finding Locally Optimal, Collision-Free Trajectories with Sequential Convex Optimization

    E-print Network

    Abbeel, Pieter

    Finding Locally Optimal, Collision-Free Trajectories with Sequential Convex Optimization John a novel approach for incorporating collision avoidance into trajectory optimization as a method of solving also compared to CHOMP, a leading approach for trajectory optimization. Our algorithm was faster than

  13. GLOBAL OPTIMIZATION IN COMPUTER VISION: CONVEXITY, CUTS AND

    E-print Network

    Lunds Universitet

    GLOBAL OPTIMIZATION IN COMPUTER VISION: CONVEXITY, CUTS AND APPROXIMATION ALGORITHMS CARL OLSSON in computer vision. Numerous prob- lems in this field as well as in image analysis and other branches. International Conference on Computer Vision (ICCV), Rio de Janeiro, Brazil, 2007. C. Olsson, F. Kahl, R

  14. SpaceE#cient Planar Convex Hull Algorithms 1

    E-print Network

    Morin, Pat

    Space­E#cient Planar Convex Hull Algorithms 1 Herv??e Br?onnimann, John Iacono, CIS, Polytechnic­e#cient algorithms for computing the convex hull of a planar point set. Key words: Computational geometry, convex on the hull. As early as 1972, Graham [1] gave a convex hull algorithm with O(n log n) worst­case running time

  15. Parallel Algorithms for HigherDimensional Convex Hulls (Preliminary Version)

    E-print Network

    Goodrich, Michael T.

    Parallel Algorithms for HigherDimensional Convex Hulls (Preliminary Version) NANCY M. AMATO becomes W(h + n log h), where h is the size of the convex hull. The first outputsensitive algorithm, due and deterministic parallel meth ods for constructing convex hulls in IR d , for any fixed d. Our methods

  16. Approximation Algorithms for Outlier Removal in Convex Hulls Michael Biro

    E-print Network

    Goldman, William

    Approximation Algorithms for Outlier Removal in Convex Hulls Michael Biro Justine Bonanno Roozbeh a subset of k of the points that has minimum-area or minimum-perimeter convex hull. We give algorithms that. Computer Science, Stony Brook University, rebrahimi@cs.stonybrook.edu 2 Minimum-Perimeter Convex Hull We

  17. Algorithms for the Computation of Reduced Convex Hulls

    NASA Astrophysics Data System (ADS)

    Goodrich, Ben; Albrecht, David; Tischer, Peter

    Geometric interpretations of Support Vector Machines (SVMs) have introduced the concept of a reduced convex hull. A reduced convex hull is the set of all convex combinations of a set of points where the weight any single point can be assigned is bounded from above by a constant. This paper decouples reduced convex hulls from their origins in SVMs and allows them to be constructed independently. Two algorithms for the computation of reduced convex hulls are presented - a simple recursive algorithm for points in the plane and an algorithm for points in an arbitrary dimensional space. Upper bounds on the number of vertices and facets in a reduced convex hull are used to analyze the worst-case complexity of the algorithms.

  18. First-order convex feasibility algorithms for x-ray CT

    SciTech Connect

    Sidky, Emil Y.; Pan Xiaochuan; Jorgensen, Jakob S.

    2013-03-15

    Purpose: Iterative image reconstruction (IIR) algorithms in computed tomography (CT) are based on algorithms for solving a particular optimization problem. Design of the IIR algorithm, therefore, is aided by knowledge of the solution to the optimization problem on which it is based. Often times, however, it is impractical to achieve accurate solution to the optimization of interest, which complicates design of IIR algorithms. This issue is particularly acute for CT with a limited angular-range scan, which leads to poorly conditioned system matrices and difficult to solve optimization problems. In this paper, we develop IIR algorithms which solve a certain type of optimization called convex feasibility. The convex feasibility approach can provide alternatives to unconstrained optimization approaches and at the same time allow for rapidly convergent algorithms for their solution-thereby facilitating the IIR algorithm design process. Methods: An accelerated version of the Chambolle-Pock (CP) algorithm is adapted to various convex feasibility problems of potential interest to IIR in CT. One of the proposed problems is seen to be equivalent to least-squares minimization, and two other problems provide alternatives to penalized, least-squares minimization. Results: The accelerated CP algorithms are demonstrated on a simulation of circular fan-beam CT with a limited scanning arc of 144 Degree-Sign . The CP algorithms are seen in the empirical results to converge to the solution of their respective convex feasibility problems. Conclusions: Formulation of convex feasibility problems can provide a useful alternative to unconstrained optimization when designing IIR algorithms for CT. The approach is amenable to recent methods for accelerating first-order algorithms which may be particularly useful for CT with limited angular-range scanning. The present paper demonstrates the methodology, and future work will illustrate its utility in actual CT application.

  19. Qhull: Quickhull algorithm for computing the convex hull

    NASA Astrophysics Data System (ADS)

    Barber, C. Bradford; Dobkin, David P.; Huhdanpaa, Hannu

    2013-04-01

    Qhull computes the convex hull, Delaunay triangulation, Voronoi diagram, halfspace intersection about a point, furthest-site Delaunay triangulation, and furthest-site Voronoi diagram. The source code runs in 2-d, 3-d, 4-d, and higher dimensions. Qhull implements the Quickhull algorithm for computing the convex hull. It handles roundoff errors from floating point arithmetic. It computes volumes, surface areas, and approximations to the convex hull.

  20. First-order Methods for Convex Optimization with Inexact Oracle

    E-print Network

    Glineur, Franois

    Effect of inexact oracle on GM/FGM 7 Applications to other classes of convex problems Non-smooth convex optimization 4 Definition of inexact oracle 5 Examples of inexact oracles 6 Effect of inexact oracle on GM/FGM Examples of inexact oracles 6 Effect of inexact oracle on GM/FGM 7 Applications to other classes of convex

  1. Approximation Algorithm for the Largest Area Convex Hull of Same Size Non-overlapping Axis-Aligned Squares

    NASA Astrophysics Data System (ADS)

    Ju, Wenqi; Luo, Jun

    Given a set of n equal size and non-overlapping axis-aligned squares, we need to choose exactly one point in each square to make the area of a convex hull of the resulting point set as large as possible. Previous algorithm [10] on this problem gives an optimal algorithm with O(n 3) running time. In this paper, we propose an approximation algorithm which runs in O(nlogn) time and gives a convex hull with area larger than the area of the optimal convex hull minus the area of one square.

  2. Reachable grasps on a polygon: the convex rope algorithm M. A. Peshkin and A. C. Sanderson

    E-print Network

    Amaral, Luis A.N.

    , reachable, planning, external visibility, polygon, convex rope, convex hull, algorithm, CReachable grasps on a polygon: the convex rope algorithm M. A. Peshkin and A. C. Sanderson IEEE: the convex rope algorithm (pdf file) M. A. Peshkin and A. C. Sanderson IEEE Transactions on Robotics

  3. An Output Sensitive Algorithm for Discrete Convex Sariel HarPeled +

    E-print Network

    Har-Peled, Sariel

    An Output Sensitive Algorithm for Discrete Convex Hulls # Sariel Har­Peled + September 22, 1997­sensitive algorithm for calculating the discrete hull C 0 of a su#ciently round convex body C. The algorithm runs Abstract Given a convex body C in the plane, its discrete hull is C 0 = ConvexHull(C # L), where L = ZZ

  4. How Good are Convex Hull Algorithms? \\Lambda David Avis David Bremner y

    E-print Network

    Avis, David

    How Good are Convex Hull Algorithms? \\Lambda David Avis David Bremner y January, 1995 Abstract describe hard polytopes for convex hull algorithms based on pivoting , those based on triangulation describe some hard polytopes for various convex hull algorithms. A d dimensional convex polyhedron

  5. CS 606 Convex Hull Algorithms Abhiram Ranade We describe several algorithms for computing the convex hull of N points in the plane: (1)

    E-print Network

    Ranade, Abhiram G.

    CS 606 Convex Hull Algorithms Abhiram Ranade We describe several algorithms for computing the convex hull of N points in the plane: (1) N processor EREW PRAM algorithm requiring time O(log 2 N ), (2 since the time for computing convex hulls sequentially is #(N log N ). We also describe Brent

  6. First-order Methods for Convex Optimization with Inexact Oracle

    E-print Network

    Glineur, Franois

    Examples of inexact oracles 4 Effect of inexact oracle on GM/FGM 5 Applications in Non-smooth Convex Examples of inexact oracles 4 Effect of inexact oracle on GM/FGM 5 Applications in Non-smooth Convex Optimization, two main FOM: 1 Gradient method (GM) 2 Fast gradient method (FGM) 6 #12;Gradient Method Very

  7. Stochastic first order methods in smooth convex optimization

    E-print Network

    Glineur, François

    ://www.uclouvain.be/core DISCUSSION PAPER #12;CORE DISCUSSION PAPER 2011/70 Stochastic first order methods in smooth convex by the author. #12;January 13, 2012 2 1 Introduction This paper is devoted to the development of efficient first2011/70 Stochastic first order methods in smooth convex optimization Olivier Devolder Center

  8. Asynchronous Convex Hull Consensus in the Presence of Crash Faults

    E-print Network

    Vaidya, Nitin

    approximate convex hull consensus algorithm with optimal fault tolerance that reaches consen- sus]: [Distributed applications] General Terms Algorithm, Theory Keywords Convex hull consensus, vector inputsAsynchronous Convex Hull Consensus in the Presence of Crash Faults Lewis Tseng Department

  9. A Global Optimization Algorithm for Nonconvex Generalized Disjunctive Programming and Applications to Process Systems

    E-print Network

    Neumaier, Arnold

    algorithm exploits the convex hull relaxation for the discrete search, and the fact that the spatial branch variables, the convex hull of each nonlinear disjunction is constructed. The relaxed convex GDP problem. Keywords: Nonconvex GDP, nonconvex MINLP, convex hull relaxation, branch and bound, global optimization

  10. A capacity scaling algorithm for convex cost submodular flows

    SciTech Connect

    Iwata, Satoru

    1996-12-31

    This paper presents a scaling scheme for submodular functions. A small but strictly submodular function is added before scaling so that the resulting functions should be submodular. This scaling scheme leads to a weakly polynomial algorithm to solve minimum cost integral submodular flow problems with separable convex cost functions, provided that an oracle for exchange capacities are available.

  11. Motion Planning with Sequential Convex Optimization and Convex Collision Checking

    E-print Network

    Patil, Sachin

    3D-printed implants for intracavitary brachytherapy. Details, videos, and source code is freely trajectories, and (f) optimized layout for bounded curvature channels within 3D-printed vaginal implants-planning is necessary. Sampling-based motion planners [Kavraki et al., 1996; LaValle, 2006] are very effective and offer

  12. Convex Onion Peeling Genetic Algorithm: An Efficient Solution to Map Labeling of Point-Feature

    E-print Network

    Bae, Wan

    Convex Onion Peeling Genetic Algorithm: An Efficient Solution to Map Labeling of Point-Feature Wan-feature and develop a new genetic algorithm to solve this problem. We adopt a data struc- ture called convex onion peeling and utilize it in our pro- posed Convex Onion Peeling Genetic Algorithm (COPGA) to efficiently

  13. A Minimalist's Implementation of the 3-d Divide-and-Conquer Convex Hull Algorithm

    E-print Network

    Chan, Timothy M.

    A Minimalist's Implementation of the 3-d Divide-and-Conquer Convex Hull Algorithm Timothy M. Chan divide-and- conquer algorithm for computing 3-d convex hulls (and in particular, 2-d Delaunay A commentary on known 3-d convex hull algorithms We first give a quick survey on the existing options

  14. JOURNAL OF ALGORITHMS 14, 381-394 (1993) Convex Hulls for Random Lines

    E-print Network

    Devroye, Luc

    1993-01-01

    JOURNAL OF ALGORITHMS 14, 381-394 (1993) Convex Hulls for Random Lines Luc DEVROYE AND GODFRIED an 0(n log n) time algorithm for computing such a convex hull . Let NI, and N,1 be the number of points-case time algorithm with 0(n) space for this problem. They show that the vertices of the convex hull of I

  15. Parameterized Implementations of Classical Planar Convex Hull Algorithms and Extreme Point Computations \\Lambda

    E-print Network

    Waldmann, Uwe

    Parameterized Implementations of Classical Planar Convex Hull Algorithms and Extreme Point Bykat's Algorithm 31 11 Jarvis' Algorithm 35 12 Convex Hull Traits Models 38 12.1 Default Traits­kernel, primitives provided by LEDA, and others. The interfaces of the convex hull functions are compliant

  16. A Note on Linear Expected Time Algorithms for Finding Convex Hulls

    E-print Network

    Toussaint, Godfried T.

    A Note on Linear Expected Time Algorithms for Finding Convex Hulls L. Devroye and G.T. Toussaint with com­ mon density f , and let E(C) be the average complexity of an algorithm that finds the convex hull be the complexity of a given convex hull algorithms for X 1 ; : : : ; X n (thus, C is a random variable

  17. Algorithm for detecting human faces based on convex-hull.

    PubMed

    Park, Minsick; Park, Chang-Woo; Park, Mignon; Lee, Chang-Hoon

    2002-03-25

    In this paper, we proposed a new method to detect faces in color based on the convex-hull. We detect two kinds of regions that are skin and hair likeness region. After preprocessing, we apply the convex-hull to their regions and can find a face from their intersection relationship. The proposed algorithm can accomplish face detection in an image involving rotated and turned faces as well as several faces. To validity the effectiveness of the proposed method, we make experiment with various cases. PMID:19436356

  18. Algorithm for detecting human faces based on convex-hull

    NASA Astrophysics Data System (ADS)

    Park, Minsick; Park, Chang-Woo; Park, Mignon; Lee, Chang-Hoon

    2002-03-01

    In this paper, we proposed a new method to detect faces in color based on the convex-hull. We detect two kinds of regions that are skin and hair likeness region. After preprocessing, we apply the convex-hull to their regions and can find a face from their intersection relationship. The proposed algorithm can accomplish face detection in an image involving rotated and turned faces as well as several faces. To validity the effectiveness of the proposed method, we make experiment with various cases.

  19. Enhancements on the Convex Programming Based Powered Descent Guidance Algorithm for Mars Landing

    NASA Technical Reports Server (NTRS)

    Acikmese, Behcet; Blackmore, Lars; Scharf, Daniel P.; Wolf, Aron

    2008-01-01

    In this paper, we present enhancements on the powered descent guidance algorithm developed for Mars pinpoint landing. The guidance algorithm solves the powered descent minimum fuel trajectory optimization problem via a direct numerical method. Our main contribution is to formulate the trajectory optimization problem, which has nonconvex control constraints, as a finite dimensional convex optimization problem, specifically as a finite dimensional second order cone programming (SOCP) problem. SOCP is a subclass of convex programming, and there are efficient SOCP solvers with deterministic convergence properties. Hence, the resulting guidance algorithm can potentially be implemented onboard a spacecraft for real-time applications. Particularly, this paper discusses the algorithmic improvements obtained by: (i) Using an efficient approach to choose the optimal time-of-flight; (ii) Using a computationally inexpensive way to detect the feasibility/ infeasibility of the problem due to the thrust-to-weight constraint; (iii) Incorporating the rotation rate of the planet into the problem formulation; (iv) Developing additional constraints on the position and velocity to guarantee no-subsurface flight between the time samples of the temporal discretization; (v) Developing a fuel-limited targeting algorithm; (vi) Initial result on developing an onboard table lookup method to obtain almost fuel optimal solutions in real-time.

  20. An Output Sensitive Algorithm for Discrete Convex Sariel Har-Peled

    E-print Network

    Har-Peled, Sariel

    An Output Sensitive Algorithm for Discrete Convex Hulls Sariel Har-Peled September 22, 1997 Abstract Given a convex body C in the plane, its discrete hull is C0 = ConvexHull(C L), where L = ZZ?ZZ is the integer lattice. We present an O(|C0| log (C))-time algorithm for calculating the discrete hull of C

  1. An Efficient Algorithm for the Convex Hull of Planar Scattered Point Set

    NASA Astrophysics Data System (ADS)

    Fu, Z.; Lu, Y.

    2012-07-01

    Computing the convex hull of a point set is requirement in the GIS applications. This paper studies on the problem of minimum convex hull and presents an improved algorithm for the minimum convex hull of planar scattered point set. It adopts approach that dividing the point set into several sub regions to get an initial convex hull boundary firstly. Then the points on the boundary, which cannot be vertices of the minimum convex hull, are removed one by one. Finally the concave points on the boundary, which cannot be vertices of the minimum convex hull, are withdrew. Experimental analysis shows the efficiency of the algorithm compared with other methods.

  2. Illinois, pp. 3540, October 1980. [22] G. T. Toussaint and B. K. Bhattacharya, ``Optimal algorithms for computing the mini

    E-print Network

    Toussaint, Godfried T.

    . Preparata, ``Approximation algorithms for convex hulls,'' Comm. ACM 25 (January 1982), 64­68. [24] S. G. Akl and G. T. Toussaint, ``A fast algorithm for the planar convex hull problem,'' in­ ternal manuscript time­and­storage efficient implementation of an optimal planar convex hull algorithm,'' Technical

  3. Mapping the Energy Landscape of Non-Convex Optimization Problems

    E-print Network

    Zhu, Song Chun

    and the corresponding ELM. The ELM of an energy landscape reveals important char- acteristics of the landscapeMapping the Energy Landscape of Non-Convex Optimization Problems Maira Pavlovskaia1 , Kewei Tu2 and Technology, ShanghaiTech University, No. 8 Building, 319 Yueyang Road, Shanghai 200031, China tukw

  4. FIR Filter Design via Spectral Factorization and Convex Optimization 1 FIR Filter Design via Spectral Factorization

    E-print Network

    FIR Filter Design via Spectral Factorization and Convex Optimization 1 FIR Filter Design via UCSB 10 24 97 FIR Filter Design via Spectral Factorization and Convex Optimization 2 Outline Convex optimization & interior-point methods FIR lters & magnitude specs Spectral factorization Examples lowpass lter

  5. A Characterization Theorem and an Algorithm for a Convex Hull Problem Bahman Kalantari

    E-print Network

    Goldman, William

    A Characterization Theorem and an Algorithm for a Convex Hull Problem Bahman Kalantari Extended Abstract. Given a set S = {v1, . . . , vn} Rm and a point p Rm , testing if p conv(S), the convex hull(p, p ) d(p, p) d(p, p ). (3) Not only this approximation is useful for the convex hull problem

  6. An algorithm for determining the convex hull of random points

    SciTech Connect

    Borgwardt, K.H.

    1994-12-31

    This talk presents an accelerated Gift-Wrapping Algorithm for constructing and calculating the convex hull of random points in n-dimensional Euclidean space. The method under consideration is a combination of Gift-Wrapping with an implicit and dynamical Throw-Away-Principle. Exploiting some advantages of the revised Simplex-Method, the algorithm carries out a walk on the surface of the desired polytope and visits all faces. For this algorithm we develop a probabilistic analysis. Let the random points be distributed identically, independently and symmetrically under rotations. We succeed in calculating the corresponding mean values for the computational effort for the parameterized family of distributions over the n-dimensional unit ball.

  7. Algorithms for bilevel optimization

    NASA Technical Reports Server (NTRS)

    Alexandrov, Natalia; Dennis, J. E., Jr.

    1994-01-01

    General multilevel nonlinear optimization problems arise in design of complex systems and can be used as a means of regularization for multi-criteria optimization problems. Here, for clarity in displaying our ideas, we restrict ourselves to general bi-level optimization problems, and we present two solution approaches. Both approaches use a trust-region globalization strategy, and they can be easily extended to handle the general multilevel problem. We make no convexity assumptions, but we do assume that the problem has a nondegenerate feasible set. We consider necessary optimality conditions for the bi-level problem formulations and discuss results that can be extended to obtain multilevel optimization formulations with constraints at each level.

  8. An Associative Implementation Of Classical Convex Hull Algorithms Maher M. Atwah and Johnnie W. Baker Selim Akl

    E-print Network

    Potter, Jerry L.

    An Associative Implementation Of Classical Convex Hull Algorithms Maher M. Atwah and Johnnie W for the convex hull problem. These algorithms are a parallel adaptation of the Jarvis March and the Quickhull a set S of points in the plane, the convex hull of S is the smallest convex polygon for which each point

  9. 10-725/36-725: Convex Optimization Spring 2015 Lecture 26: April 22nd

    E-print Network

    Tibshirani, Ryan

    also implicitly mean doing it efficiently, i.e., in polynomial time. 26-1 #12;26-2 Lecture 26: April 2210-725/36-725: Convex Optimization Spring 2015 Lecture 26: April 22nd Lecturer: Ryan Tibshirani (to global optimality). 26.1 Non-convex problems Non-convex problems typically have higher variance

  10. Continuous-time distributed convex optimization on directed graphs

    E-print Network

    Gharesifard, Bahman

    2012-01-01

    This paper studies the continuous-time distributed optimization of a sum of convex functions over directed graphs. Contrary to what is known in the consensus literature, where the same dynamics works for both undirected and directed scenarios, we show that the consensus-based dynamics that solves the continuous-time distributed optimization problem for undirected graphs fails to converge when transcribed to the directed setting. This study sets the basis for the design of an alternative distributed dynamics which we show is guaranteed to converge, on any strongly connected weight-balanced digraph, to the set of minimizers of a sum of convex differentiable functions with globally Lipschitz gradients. Our technical approach combines notions of invariance and cocoercivity with the positive definiteness properties of graph matrices to establish the results.

  11. VeriQuickhull: fast sequential and parallel algorithms for computing the planar convex hull

    E-print Network

    Sambasivam, Mashilamani

    1999-01-01

    Computing the convex hull of a set of points in the plane is one of the most studied problems in computational geometry. The Quickhull algorithm is a popular convex hull algorithm. While the main structure of Quickhull is axed, many different...

  12. Stochastic Convex Optimization with Multiple Objectives

    E-print Network

    Jin, Rong

    stochastic multiple objective optimization is to linearly combine multiple objectives with a fixed weight r Rn denote random returns of the n risky assets, and w W {w Rn + : n i wi = 1} denote the distribution of an investor's wealth over all assets. The return for an investment distribution is defined as w

  13. Scalable analysis of nonlinear systems using convex optimization

    NASA Astrophysics Data System (ADS)

    Papachristodoulou, Antonis

    In this thesis, we investigate how convex optimization can be used to analyze different classes of nonlinear systems at various scales algorithmically. The methodology is based on the construction of appropriate Lyapunov-type certificates using sum of squares techniques. After a brief introduction on the mathematical tools that we will be using, we turn our attention to robust stability and performance analysis of systems described by Ordinary Differential Equations. A general framework for constrained systems analysis is developed, under which stability of systems with polynomial, non-polynomial vector fields and switching systems, as well estimating the region of attraction and the L2 gain can be treated in a unified manner. We apply our results to examples from biology and aerospace. We then consider systems described by Functional Differential Equations (FDEs), i.e., time-delay systems. Their main characteristic is that they are infinite dimensional, which complicates their analysis. We first show how the complete Lyapunov-Krasovskii functional can be constructed algorithmically for linear time-delay systems. Then, we concentrate on delay-independent and delay-dependent stability analysis of nonlinear FDEs using sum of squares techniques. An example from ecology is given. The scalable stability analysis of congestion control algorithms for the Internet is investigated next. The models we use result in an arbitrary interconnection of FDE subsystems, for which we require that stability holds for arbitrary delays, network topologies and link capacities. Through a constructive proof, we develop a Lyapunov functional for FAST---a recently developed network congestion control scheme---so that the Lyapunov stability properties scale with the system size. We also show how other network congestion control schemes can be analyzed in the same way. Finally, we concentrate on systems described by Partial Differential Equations. We show that axially constant perturbations of the Navier-Stokes equations for Hagen-Poiseuille flow are globally stable, even though the background noise is amplified as R3 where R is the Reynolds number, giving a 'robust yet fragile' interpretation. We also propose a sum of squares methodology for the analysis of systems described by parabolic PDEs. We conclude this work with an account for future research.

  14. Illinois, pp. 35-40, October 1980. [22] G. T. Toussaint and B. K. Bhattacharya, "Optimal algorithms for computing the mini-

    E-print Network

    Toussaint, Godfried T.

    . Preparata, "Approximation algorithms for convex hulls," Comm. ACM 25 (January 1982), 64-68. [24] S. G. Akl and G. T. Toussaint, "A fast algorithm for the planar convex hull problem," in- ternal manuscript-and-storage efficient implementation of an optimal planar convex hull algorithm," Technical Report No. SOCS 81

  15. Rapid Generation of Optimal Asteroid Powered Descent Trajectories Via Convex Optimization

    NASA Technical Reports Server (NTRS)

    Pinson, Robin; Lu, Ping

    2015-01-01

    This paper investigates a convex optimization based method that can rapidly generate the fuel optimal asteroid powered descent trajectory. The ultimate goal is to autonomously design the optimal powered descent trajectory on-board the spacecraft immediately prior to the descent burn. Compared to a planetary powered landing problem, the major difficulty is the complex gravity field near the surface of an asteroid that cannot be approximated by a constant gravity field. This paper uses relaxation techniques and a successive solution process that seeks the solution to the original nonlinear, nonconvex problem through the solutions to a sequence of convex optimal control problems.

  16. Studies integrating geometry, probability, and optimization under convexity

    E-print Network

    Nogueira, Alexandre Belloni

    2006-01-01

    Convexity has played a major role in a variety of fields over the past decades. Nevertheless, the convexity assumption continues to reveal new theoretical paradigms and applications. This dissertation explores convexity ...

  17. Sparse representations and convex optimization as tools for LOFAR radio interferometric imaging

    NASA Astrophysics Data System (ADS)

    Girard, J. N.; Garsden, H.; Starck, J. L.; Corbel, S.; Woiselle, A.; Tasse, C.; McKean, J. P.; Bobin, J.

    2015-08-01

    Compressed sensing theory is slowly making its way to solve more and more astronomical inverse problems. We address here the application of sparse representations, convex optimization and proximal theory to radio interferometric imaging. First, we expose the theory behind interferometric imaging, sparse representations and convex optimization, and second, we illustrate their application with numerical tests with SASIR, an implementation of the FISTA, a Forward-Backward splitting algorithm hosted in a LOFAR imager. Various tests have been conducted in Garsden et al., 2015. The main results are: i) an improved angular resolution (super resolution of a factor ? 2) with point sources as compared to CLEAN on the same data, ii) correct photometry measurements on a field of point sources at high dynamic range and iii) the imaging of extended sources with improved fidelity. SASIR provides better reconstructions (five time less residuals) of the extended emission as compared to CLEAN. With the advent of large radiotelescopes, there is scope for improving classical imaging methods with convex optimization methods combined with sparse representations.

  18. Convex hull based neuro-retinal optic cup ellipse optimization in glaucoma diagnosis.

    PubMed

    Zhang, Zhuo; Liu, Jiang; Cherian, Neetu Sara; Sun, Ying; Lim, Joo Hwee; Wong, Wing Kee; Tan, Ngan Meng; Lu, Shijian; Li, Huiqi; Wong, Tien Ying

    2009-01-01

    Glaucoma is the second leading cause of blindness. Glaucoma can be diagnosed through measurement of neuro-retinal optic cup-to-disc ratio (CDR). Automatic calculation of optic cup boundary is challenging due to the interweavement of blood vessels with the surrounding tissues around the cup. A Convex Hull based Neuro-Retinal Optic Cup Ellipse Optimization algorithm improves the accuracy of the boundary estimation. The algorithm's effectiveness is demonstrated on 70 clinical patient's data set collected from Singapore Eye Research Institute. The root mean squared error of the new algorithm is 43% better than the ARGALI system which is the state-of-the-art. This further leads to a large clinical evaluation of the algorithm involving 15 thousand patients from Australia and Singapore. PMID:19963748

  19. Firefly Algorithms for Multimodal Optimization

    E-print Network

    Yang, Xin-She

    2010-01-01

    Nature-inspired algorithms are among the most powerful algorithms for optimization. This paper intends to provide a detailed description of a new Firefly Algorithm (FA) for multimodal optimization applications. We will compare the proposed firefly algorithm with other metaheuristic algorithms such as particle swarm optimization (PSO). Simulations and results indicate that the proposed firefly algorithm is superior to existing metaheuristic algorithms. Finally we will discuss its applications and implications for further research.

  20. Efficient Market Making via Convex Optimization, and a Connection to Online Learning

    E-print Network

    Chen, Yiling

    12 Efficient Market Making via Convex Optimization, and a Connection to Online Learning JACOB of computationally efficient markets tailored to an arbitrary, yet relatively small, space of securities with bounded hull. By reducing the problem of automated market making to convex optimization, where many efficient

  1. Algorithmic approach for improved mixed-integer reformulations of convex Generalized Disjunctive Programs

    E-print Network

    Grossmann, Ignacio E.

    Algorithmic approach for improved mixed-integer reformulations of convex Generalized Disjunctive-M and Hull reformulation. We illustrate the application of this algorithm with several examples. The results University, Pittsburgh, PA 15213 July, 2013 Abstract In this work, we propose an algorithmic approach

  2. libCreme: An optimization library for evaluating convex-roof entanglement measures

    E-print Network

    Beat Rthlisberger; Jrg Lehmann; Daniel Loss

    2011-07-22

    We present the software library libCreme which we have previously used to successfully calculate convex-roof entanglement measures of mixed quantum states appearing in realistic physical systems. Evaluating the amount of entanglement in such states is in general a non-trivial task requiring to solve a highly non-linear complex optimization problem. The algorithms provided here are able to achieve to do this for a large and important class of entanglement measures. The library is mostly written in the Matlab programming language, but is fully compatible to the free and open-source Octave platform. Some inefficient subroutines are written in C/C++ for better performance. This manuscript discusses the most important theoretical concepts and workings of the algorithms, focussing on the actual implementation and usage within the library. Detailed examples in the end should make it easy for the user to apply libCreme to specific problems.

  3. Approximate D-optimal designs of experiments on the convex hull of a finite set

    E-print Network

    Trnovska, Maria

    Approximate D-optimal designs of experiments on the convex hull of a finite set of information-optimality covers many special design settings, e.g. the D-optimal experimental design for re- gression models of standard D-optimality. Moreover, we show that DH-optimal designs can be numerically computed using

  4. Asynchronous Convex Consensus in the Presence of Crash Faults Lewis Tseng1

    E-print Network

    Vaidya, Nitin

    within the convex hull of the inputs at the fault-free processes. We explore the convex consensus problem algorithm with optimal fault tolerance that reaches consensus on an optimal output polytope. Convex, and the processes reach consensus on a d-dimensional vector within the convex hull of the inputs at fault

  5. BROADBAND SENSOR LOCATION SELECTION USING CONVEX OPTIMIZATION IN VERY LARGE SCALE ARRAYS

    E-print Network

    Balan, Radu V.

    BROADBAND SENSOR LOCATION SELECTION USING CONVEX OPTIMIZATION IN VERY LARGE SCALE ARRAYS Yenming M pattern design, sensor location selection, very large scale arrays, convex op- timization, simulated annealing 1. INTRODUCTION Consider a large scale sensor array having N sensors that monitors a surveillance

  6. Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization

    E-print Network

    Toint, Philippe

    Evaluation complexity of adaptive cubic regularization methods for convex unconstrained complexity of adaptive cubic regularization methods for convex unconstrained optimization C. Cartis , N. I. M.gould@sftc.ac.uk Namur Center for Complex Systems (NAXYS), FUNDP-University of Namur, 61, rue de Bruxelles, B-5000 Namur

  7. On the Complexity of Optimization Problems for 3Dimensional Convex Polyhedra and Decision Trees \\Lambda

    E-print Network

    Goodrich, Michael T.

    On the Complexity of Optimization Problems for 3Dimensional Convex Polyhedra and Decision Trees and decision trees are NPhard or NPcomplete. One of the techniques we employ is a lineartime method, decision trees. 1 Introduction Convex polyhedra are fundamental geometric structures (e.g., see [20

  8. A Localization Method for Multistatic SAR Based on Convex Optimization.

    PubMed

    Zhong, Xuqi; Wu, Junjie; Yang, Jianyu; Sun, Zhichao; Huang, Yuling; Li, Zhongyu

    2015-01-01

    In traditional localization methods for Synthetic Aperture Radar (SAR), the bistatic range sum (BRS) estimation and Doppler centroid estimation (DCE) are needed for the calculation of target localization. However, the DCE error greatly influences the localization accuracy. In this paper, a localization method for multistatic SAR based on convex optimization without DCE is investigated and the influence of BRS estimation error on localization accuracy is analysed. Firstly, by using the information of each transmitter and receiver (T/R) pair and the target in SAR image, the model functions of T/R pairs are constructed. Each model function's maximum is on the circumference of the ellipse which is the iso-range for its model function's T/R pair. Secondly, the target function whose maximum is located at the position of the target is obtained by adding all model functions. Thirdly, the target function is optimized based on gradient descent method to obtain the position of the target. During the iteration process, principal component analysis is implemented to guarantee the accuracy of the method and improve the computational efficiency. The proposed method only utilizes BRSs of a target in several focused images from multistatic SAR. Therefore, compared with traditional localization methods for SAR, the proposed method greatly improves the localization accuracy. The effectivity of the localization approach is validated by simulation experiment. PMID:26566031

  9. A Localization Method for Multistatic SAR Based on Convex Optimization

    PubMed Central

    2015-01-01

    In traditional localization methods for Synthetic Aperture Radar (SAR), the bistatic range sum (BRS) estimation and Doppler centroid estimation (DCE) are needed for the calculation of target localization. However, the DCE error greatly influences the localization accuracy. In this paper, a localization method for multistatic SAR based on convex optimization without DCE is investigated and the influence of BRS estimation error on localization accuracy is analysed. Firstly, by using the information of each transmitter and receiver (T/R) pair and the target in SAR image, the model functions of T/R pairs are constructed. Each model functions maximum is on the circumference of the ellipse which is the iso-range for its model functions T/R pair. Secondly, the target function whose maximum is located at the position of the target is obtained by adding all model functions. Thirdly, the target function is optimized based on gradient descent method to obtain the position of the target. During the iteration process, principal component analysis is implemented to guarantee the accuracy of the method and improve the computational efficiency. The proposed method only utilizes BRSs of a target in several focused images from multistatic SAR. Therefore, compared with traditional localization methods for SAR, the proposed method greatly improves the localization accuracy. The effectivity of the localization approach is validated by simulation experiment. PMID:26566031

  10. Optimizing Quantum Adiabatic Algorithm

    E-print Network

    Hongye Hu; Biao Wu

    2015-11-24

    In quantum adiabatic algorithm, as the adiabatic parameter $s(t)$ changes slowly from zero to one with finite rate, a transition to excited states inevitably occurs and this induces an intrinsic computational error. We show that this computational error depends not only on the total computation time $T$ but also on the time derivatives of the adiabatic parameter $s(t)$ at the beginning and the end of evolution. Previous work (Phys. Rev. A \\textbf{82}, 052305) also suggested this result. With six typical paths, we systematically demonstrate how to optimally design an adiabatic path to reduce the computational errors. Our method has a clear physical picture and also explains the pattern of computational error. In this paper we focus on quantum adiabatic search algorithm although our results are general.

  11. Convex Relaxation for Optimal Power Flow Problem: Mesh Networks Ramtin Madani, Somayeh Sojoudi and Javad Lavaei

    E-print Network

    Lavaei, Javad

    . INTRODUCTION The optimal power flow (OPF) problem aims to find an optimal operating point of a power system1 Convex Relaxation for Optimal Power Flow Problem: Mesh Networks Ramtin Madani, Somayeh Sojoudi and Javad Lavaei Abstract--This paper is concerned with the optimal power flow (OPF) problem. We have

  12. Ant Algorithms for Discrete Optimization

    E-print Network

    Gambardella, Luca Maria

    Ant Algorithms for Discrete Optimization Marco Dorigo and Gianni Di Caro IRIDIA, Universit´e Libre, Switzerland luca@idsia.ch Abstract This paper overviews recent work on ant algorithms, that is, algorithms for discrete optimization which took inspiration from the observation of ant colonies foraging behavior

  13. SPACE-EFFICIENT PLANAR CONVEX HULL ALGORITHMS Herv e Bronnimann y John Iacono y Jyrki Katajainen z Pat Morin x Jason Morrison x

    E-print Network

    Toussaint, Godfried T.

    SPACE-EFFICIENT PLANAR CONVEX HULL ALGORITHMS #3; Herv#19;e Bronnimann y John Iacono y Jyrki is used by the algorithm. We describe four space-e?cient algorithms for computing the convex hull. As early as 1972, Graham [13] gave a convex hull algorithm with O(n log n) worst-case running time in which

  14. Adopt Algorithm for Distributed Constraint Optimization

    E-print Network

    Modi, Jay

    Adopt Algorithm for Distributed Constraint Optimization Adopt Algorithm for Distributed ConstraintAdopt Distributed Constraint Optimization Problem (DCOP) l Adopt algorithm First-ever distributed, asynchronous- optimality is proven #12;9 Adopt: Asynchronous Distributed OptimizationAdopt: Asynchronous Distributed

  15. SLOPEADAPTIVE VARIABLE SELECTION VIA CONVEX OPTIMIZATION

    PubMed Central

    Bogdan, Ma?gorzata; van den Berg, Ewout; Sabatti, Chiara; Su, Weijie; Cands, Emmanuel J.

    2015-01-01

    We introduce a new estimator for the vector of coefficients ? in the linear model y = X? + z, where X has dimensions n p with p possibly larger than n. SLOPE, short for Sorted L-One Penalized Estimation, is the solution to minb??p12?y?Xb??22+?1|b|(1)+?2|b|(2)+?+?p|b|(p),where ?1 ? ?2 ? ? ?p ? 0 and |b|(1)?|b|(2)???|b|(p) are the decreasing absolute values of the entries of b. This is a convex program and we demonstrate a solution algorithm whose computational complexity is roughly comparable to that of classical ?1 procedures such as the Lasso. Here, the regularizer is a sorted ?1 norm, which penalizes the regression coefficients according to their rank: the higher the rankthat is, stronger the signalthe larger the penalty. This is similar to the Benjamini and Hochberg [J. Roy. Statist. Soc. Ser. B 57 (1995) 289300] procedure (BH) which compares more significant p-values with more stringent thresholds. One notable choice of the sequence {?i} is given by the BH critical values ?BH(i)=z(1?i?q/2p), where q ? (0, 1) and z(?) is the quantile of a standard normal distribution. SLOPE aims to provide finite sample guarantees on the selected model; of special interest is the false discovery rate (FDR), defined as the expected proportion of irrelevant regressors among all selected predictors. Under orthogonal designs, SLOPE with ?BH provably controls FDR at level q. Moreover, it also appears to have appreciable inferential properties under more general designs X while having substantial power, as demonstrated in a series of experiments running on both simulated and real data.

  16. A Probabilistic Convex Hull Query Tool Zhou Zhao, Da Yan and Wilfred Ng

    E-print Network

    Ng, Wilfred Siu Hung

    Terms Algorithms Keywords Probabilistic Convex Hull, Query Processing, Uncertain 1. INTRODUCTION optimization [2]. A large number of algorithms have been proposed to compute convex hull. A- mong them Andrew's Monotone Chain algorithm [6] finds the convex hull of a set of n 2D points in O(n log n) time

  17. [3-D endocardial surface modelling based on the convex hull algorithm].

    PubMed

    Lu, Ying; Xi, Ri-hui; Shen, Hai-dong; Ye, You-li; Zhang, Yong

    2006-11-01

    In this paper, a method based on the convex hull algorithm is presented for extracting modelling data from the locations of catheter electrodes within a cardiac chamber, so as to create a 3-D model of the heart chamber during diastole and to obtain a good result in the 3-D reconstruction of the chamber based on VTK. PMID:17300005

  18. In-Place Planar Convex Hull Algorithms ? Herv e Bronnimann 1 , John Iacono 1 , Jyrki Katajainen 2 , Pat Morin 3 , Jason

    E-print Network

    Toussaint, Godfried T.

    In-Place Planar Convex Hull Algorithms ? Herv#19;e Bronnimann 1 , John Iacono 1 , Jyrki Katajainen. In this paper we describe three in-place algorithms for computing the convex hull of a planar point set. All- tation where sorting has an (n log n) lower bound, every convex hull algorithm must require (n log n

  19. Vdwm 9, number 5 INFORMATION PROCESSING LETT.ERS 16 December 1979 A LINEAR ALGORITHM FOR FINDING THE CONVEX HULL OF A SIhIPLE POLYGON *

    E-print Network

    Mascarenhas, Walter Figueiredo

    Convex hull, simple polygon, analysis of algorithms 1. Introduction The problem of determining the convex THE CONVEX HULL OF A SIhIPLE POLYGON * Duncan McCALLUM and David AVIS School of Computer Science, Mc was supported by the National Research Council of Canada under research grant NRC A3013. The convex hull

  20. libCreme: An optimization library for evaluating convex-roof entanglement measures

    NASA Astrophysics Data System (ADS)

    Rthlisberger, Beat; Lehmann, Jrg; Loss, Daniel

    2012-01-01

    We present the software library libCreme which we have previously used to successfully calculate convex-roof entanglement measures of mixed quantum states appearing in realistic physical systems. Evaluating the amount of entanglement in such states is in general a non-trivial task requiring to solve a highly non-linear complex optimization problem. The algorithms provided here are able to achieve to do this for a large and important class of entanglement measures. The library is mostly written in the MATLAB programming language, but is fully compatible to the free and open-source OCTAVE platform. Some inefficient subroutines are written in C/C++ for better performance. This manuscript discusses the most important theoretical concepts and workings of the algorithms, focusing on the actual implementation and usage within the library. Detailed examples in the end should make it easy for the user to apply libCreme to specific problems. Program summaryProgram title:libCreme Catalogue identifier: AEKD_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEKD_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: GNU GPL version 3 No. of lines in distributed program, including test data, etc.: 4323 No. of bytes in distributed program, including test data, etc.: 70 542 Distribution format: tar.gz Programming language: Matlab/Octave and C/C++ Computer: All systems running Matlab or Octave Operating system: All systems running Matlab or Octave Classification: 4.9, 4.15 Nature of problem: Evaluate convex-roof entanglement measures. This involves solving a non-linear (unitary) optimization problem. Solution method: Two algorithms are provided: A conjugate-gradient method using a differential-geometric approach and a quasi-Newton method together with a mapping to Euclidean space. Running time: Typically seconds to minutes for a density matrix of a few low-dimensional systems and a decent implementation of the pure-state entanglement measure.

  1. Convex optimization of coincidence time resolution for a high-resolution PET system.

    PubMed

    Reynolds, Paul D; Olcott, Peter D; Pratx, Guillem; Lau, Frances W Y; Levin, Craig S

    2011-02-01

    We are developing a dual panel breast-dedicated positron emission tomography (PET) system using LSO scintillators coupled to position sensitive avalanche photodiodes (PSAPD). The charge output is amplified and read using NOVA RENA-3 ASICs. This paper shows that the coincidence timing resolution of the RENA-3 ASIC can be improved using certain list-mode calibrations. We treat the calibration problem as a convex optimization problem and use the RENA-3's analog-based timing system to correct the measured data for time dispersion effects from correlated noise, PSAPD signal delays and varying signal amplitudes. The direct solution to the optimization problem involves a matrix inversion that grows order (n(3)) with the number of parameters. An iterative method using single-coordinate descent to approximate the inversion grows order (n). The inversion does not need to run to convergence, since any gains at high iteration number will be low compared to noise amplification. The system calibration method is demonstrated with measured pulser data as well as with two LSO-PSAPD detectors in electronic coincidence. After applying the algorithm, the 511 keV photopeak paired coincidence time resolution from the LSO-PSAPD detectors under study improved by 57%, from the raw value of 16.3 0.07 ns full-width at half-maximum (FWHM) to 6.92 0.02 ns FWHM ( 11.52 0.05 ns to 4.89 0.02 ns for unpaired photons). PMID:20876008

  2. Ant Algorithms for Discrete Optimization

    E-print Network

    Libre de Bruxelles, Universit

    Ant Algorithms for Discrete Optimization Marco Dorigo Gianni Di Caro IRIDIA CP 194/6 Universit@iridia.ulb.ac.be Luca M. Gambardella IDSIA Corso Elvezia 36 CH-6900 Lugano Switzerland luca@idsia.ch Keywords ant algorithms, ant colony optimiza- tion, swarm intelligence, metaheuris- tics, natural computation Abstract

  3. A near-optimal heuristic for minimum weight triangulation of convex polygons

    SciTech Connect

    Levcopoulos, C.; Krznaric, D.

    1997-06-01

    A linear-time heuristic for minimum weight triangulation of convex polygons is presented. This heuristic produces a triangulation of length within a factor 1 + {epsilon} from the optimum, where {epsilon} is an arbitrarily small positive constant. This is the first sub-cubic algorithm which guarantees such an approximation factor, and it has interesting applications.

  4. Compensation of modal dispersion in multimode fiber systems using adaptive optics via convex optimization

    NASA Astrophysics Data System (ADS)

    Panicker, Rahul Alex

    Multimode fibers (MMF) are widely deployed in local-, campus-, and storage-area-networks. Achievable data rates and transmission distances are, however, limited by the phenomenon of modal dispersion. We propose a system to compensate for modal dispersion using adaptive optics. This leads to a 10- to 100-fold improvement in performance over current standards. We propose a provably optimal technique for minimizing inter-symbol interference (ISI) in MMF systems using adaptive optics via convex optimization. We use a spatial light modulator (SLM) to shape the spatial profile of light launched into an MMF. We derive an expression for the system impulse response in terms of the SLM reflectance and the field patterns of the MMF principal modes. Finding optimal SLM settings to minimize ISI, subject to physical constraints, is posed as an optimization problem. We observe that our problem can be cast as a second-order cone program, which is a convex optimization problem. Its global solution can, therefore, be found with minimal computational complexity. Simulations show that this technique opens up an eye pattern originally closed due to ISI. We then propose fast, low-complexity adaptive algorithms for optimizing the SLM settings. We show that some of these converge to the global optimum in the absence of noise. We also propose modified versions of these algorithms to improve resilience to noise and speed of convergence. Next, we experimentally compare the proposed adaptive algorithms in 50-mum graded-index (GRIN) MMFs using a liquid-crystal SLM. We show that continuous-phase sequential coordinate ascent (CPSCA) gives better bit-error-ratio performance than 2- or 4-phase sequential coordinate ascent, in concordance with simulations. We evaluate the bandwidth characteristics of CPSCA, and show that a single SLM is able to simultaneously compensate over up to 9 wavelength-division-multiplexed (WDM) 10-Gb/s channels, spaced by 50 GHz, over a total bandwidth of 450 GHz. We also show that CPSCA is able to compensate for modal dispersion over up to 2.2 km, even in the presence of mid-span connector offsets up to 4 mum (simulated in experiment by offset splices). A known non-adaptive launching technique using a fusion-spliced single-mode-to-multimode patchcord is shown to fail under these conditions. Finally, we demonstrate 10 x 10 Gb/s dense WDM transmission over 2.2 km of 50-mum GRIN MMF. We combine transmitter-based adaptive optics and receiver-based single-mode filtering, and control the launched field pattern for ten 10-Gb/s non-return-to-zero channels, wavelength-division multiplexed on a 200-GHz grid in the C band. We achieve error-free transmission through 2.2 km of 50-mum GRIN MMF for launch offsets up to 10 mum and for worst-case launched polarization. We employ a ten-channel transceiver based on parallel integration of electronics and photonics.

  5. Comparing a Coevolutionary Genetic Algorithm for Multiobjective Optimization

    NASA Technical Reports Server (NTRS)

    Lohn, Jason D.; Kraus, William F.; Haith, Gary L.; Clancy, Daniel (Technical Monitor)

    2002-01-01

    We present results from a study comparing a recently developed coevolutionary genetic algorithm (CGA) against a set of evolutionary algorithms using a suite of multiobjective optimization benchmarks. The CGA embodies competitive coevolution and employs a simple, straightforward target population representation and fitness calculation based on developmental theory of learning. Because of these properties, setting up the additional population is trivial making implementation no more difficult than using a standard GA. Empirical results using a suite of two-objective test functions indicate that this CGA performs well at finding solutions on convex, nonconvex, discrete, and deceptive Pareto-optimal fronts, while giving respectable results on a nonuniform optimization. On a multimodal Pareto front, the CGA finds a solution that dominates solutions produced by eight other algorithms, yet the CGA has poor coverage across the Pareto front.

  6. Random search optimization based on genetic algorithm and discriminant function

    NASA Technical Reports Server (NTRS)

    Kiciman, M. O.; Akgul, M.; Erarslanoglu, G.

    1990-01-01

    The general problem of optimization with arbitrary merit and constraint functions, which could be convex, concave, monotonic, or non-monotonic, is treated using stochastic methods. To improve the efficiency of the random search methods, a genetic algorithm for the search phase and a discriminant function for the constraint-control phase were utilized. The validity of the technique is demonstrated by comparing the results to published test problem results. Numerical experimentation indicated that for cases where a quick near optimum solution is desired, a general, user-friendly optimization code can be developed without serious penalties in both total computer time and accuracy.

  7. Information-theoretic lower bounds on the oracle complexity of convex optimization

    E-print Network

    Ravikumar, Pradeep

    of Statistics UC Berkeley wainwrig@eecs.berkeley.edu Abstract Despite a large literature on upper bounds Department of Statistics UC Berkeley bartlett@cs.berkeley.edu Pradeep Ravikumar Department of Computer of these prob- lems. Given the extensive use of convex optimization in machine learning and statistics, gaining

  8. A Convex Optimization Approach to Modeling Consumer Heterogeneity in Conjoint Estimation

    E-print Network

    Pontil, Massimiliano

    , Econometric Models, Estimation and Other Statistical Techniques, Hierarchical Bayes Analysis, Marketing-based conjoint estimation using convex optimization and statistical machine learning. We compare our approach with hierarchical Bayes (HB) both theoretically and empirically. Both our methods and HB shrink individual

  9. Limit shape of optimal convex lattice polygons . . . 1 LIMIT SHAPE OF

    E-print Network

    Stojakovic, Milos

    and explicitly find the limit shape of the sequence of these optimal convex lattice polygons as the number() Ip , Cp y () Ip ) , 0 ) , Cp y () = 2 ( - 1 3 (p + 1)-3/p + k=0 ( -3 p - 1 k ) pk pk + 2 ) , Ip = 1 0 ( p 1 - lp)2 dl. Some

  10. Design on Non-Convex Regions: Optimal Experiments for Spatial Process Prediction

    E-print Network

    Brennand, Tracy

    Pratola B.Sc., 2005. Brock University a project submitted in partial fulfillment of the requirements: Matthew Timothy Pratola Degree: Master of Science Title of project: Design on Non-Convex Regions: Optimal from the Department of Math- ematics and Computer Science at Duquesne University for providing

  11. An Exact Solution to the Transistor Sizing Problem for CMOS Circuits Using Convex Optimization

    E-print Network

    Sapatnekar, Sachin

    An Exact Solution to the Transistor Sizing Problem for CMOS Circuits Using Convex Optimization topology, the delay can be controlled by varying the sizes of transistors in the circuit. Here, the size of a transistor is measured in terms of its channel width, since the channel lengths in a digital circuit

  12. GUIDED SEARCH CONSENSUS: LARGE SCALE POINT CLOUD REGISTRATION BY CONVEX OPTIMIZATION

    E-print Network

    Instituto de Sistemas e Robotica

    GUIDED SEARCH CONSENSUS: LARGE SCALE POINT CLOUD REGISTRATION BY CONVEX OPTIMIZATION Manuel Marques the kind of patterns that makeup the large artistic tile panel on the background. These panels are pieces. Typical application: Searching for repetitive patterns on a tile panel. palaces and historic buildings

  13. Regularization Constants in LS-SVMs: a Fast Estimate via Convex Optimization

    E-print Network

    Regularization Constants in LS-SVMs: a Fast Estimate via Convex Optimization Kristiaan Pelckmans Support Vector Machines (LS-SVMs) for regression and classification is considered. The formulation of the LS-SVM training and regularization constant tuning problem (w.r.t. the validation performance

  14. 10-725: Convex Optimization Fall 2013 Lecture 9: Newton Method

    E-print Network

    Tibshirani, Ryan

    's method, the formal Newton method began to evolve from Isaac Newton (1669) for finding roots10-725: Convex Optimization Fall 2013 Lecture 9: Newton Method Lecturer: Barnabas Poczos.1 Motivation Newton method is originally developed for finding a root of a function. It is also known as Newton

  15. An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming

    NASA Astrophysics Data System (ADS)

    Buchheim, Christoph; Caprara, Alberto; Lodi, Andrea

    We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumeration tree, corresponding to the fixing of a subset of the variables, a lower bound is given by the continuous minimum of the restricted objective function. We improve this bound by exploiting the integrality of the variables using suitably-defined lattice-free ellipsoids. Experiments show that our approach is very fast on both unconstrained problems and problems with box constraints. The main reason is that all expensive calculations can be done in a preprocessing phase, while a single node in the enumeration tree can be processed in linear time in the problem dimension.

  16. Multilevel algorithms for nonlinear optimization

    NASA Technical Reports Server (NTRS)

    Alexandrov, Natalia; Dennis, J. E., Jr.

    1994-01-01

    Multidisciplinary design optimization (MDO) gives rise to nonlinear optimization problems characterized by a large number of constraints that naturally occur in blocks. We propose a class of multilevel optimization methods motivated by the structure and number of constraints and by the expense of the derivative computations for MDO. The algorithms are an extension to the nonlinear programming problem of the successful class of local Brown-Brent algorithms for nonlinear equations. Our extensions allow the user to partition constraints into arbitrary blocks to fit the application, and they separately process each block and the objective function, restricted to certain subspaces. The methods use trust regions as a globalization strategy, and they have been shown to be globally convergent under reasonable assumptions. The multilevel algorithms can be applied to all classes of MDO formulations. Multilevel algorithms for solving nonlinear systems of equations are a special case of the multilevel optimization methods. In this case, they can be viewed as a trust-region globalization of the Brown-Brent class.

  17. Genetic algorithm optimization of entanglement

    E-print Network

    Jorge C. Navarro-Munoz; H. C. Rosu; R. Lopez-Sandoval

    2006-11-13

    We present an application of a genetic algorithmic computational method to the optimization of the concurrence measure of entanglement for the cases of one dimensional chains, as well as square and triangular lattices in a simple tight-binding approach in which the hopping of electrons is much stronger than the phonon dissipation

  18. Firefly Algorithm, Levy Flights and Global Optimization

    E-print Network

    Yang, Xin-She

    2010-01-01

    Nature-inspired algorithms such as Particle Swarm Optimization and Firefly Algorithm are among the most powerful algorithms for optimization. In this paper, we intend to formulate a new metaheuristic algorithm by combining Levy flights with the search strategy via the Firefly Algorithm. Numerical studies and results suggest that the proposed Levy-flight firefly algorithm is superior to existing metaheuristic algorithms. Finally implications for further research and wider applications will be discussed.

  19. A Weiszfeld-like algorithm for a Weber location problem constrained to a closed and convex set

    E-print Network

    Torres, Germn A

    2012-01-01

    The Weber problem consists of finding a point in $\\mathbbm{R}^n$ that minimizes the weighted sum of distances from $m$ points in $\\mathbbm{R}^n$ that are not collinear. An application that motivated this problem is the optimal location of facilities in the 2-dimensional case. A classical method to solve the Weber problem, proposed by Weiszfeld in 1937, is based on a fixed point iteration. In this work a Weber problem constrained to a closed and convex set is considered. A Weiszfeld-like algorithm, well defined even when an iterate is a vertex, is presented. The iteration function $Q$ that defines the proposed algorithm, is based mainly on an orthogonal projection over the feasible set, combined with the iteration function of the modified Weiszfeld algorithm presented by Vardi and Zhang in 2001. It can be proved that $x^*$ is a fixed point of the iteration function $Q$ if and only if $x^*$ is the solution of the constrained Weber problem. Besides that, under certain hypotheses, $x^*$ satisfies the KKT optimali...

  20. Coordination and Control of Multiple Spacecraft using Convex Optimization Techniques

    E-print Network

    the highly coor- dinated, distributed array of vehicles for earth mapping interferometers and synthetic aperture radar. This thesis presents coordination and control algorithms designed for a fleet of spacecraft-time as part of an on-board autonomous formation flying control system. This thesis also investigates several

  1. Experimental Validation of a Numerical Controller Using Convex Optimization with Linear Matrix Inequalities on a Quarter-Car Suspension System

    E-print Network

    Chintala, Rohit

    2012-10-19

    Numerical methods of designing control systems are currently an active area of research. Convex optimization with linear matrix inequalities (LMIs) is one such method. Control objectives like minimizing the H_2, H_infinity ...

  2. Parallel Selective Algorithms for Nonconvex Big Data Optimization

    NASA Astrophysics Data System (ADS)

    Facchinei, Francisco; Scutari, Gesualdo; Sagratella, Simone

    2015-04-01

    We propose a decomposition framework for the parallel optimization of the sum of a differentiable (possibly nonconvex) function and a (block) separable nonsmooth, convex one. The latter term is usually employed to enforce structure in the solution, typically sparsity. Our framework is very flexible and includes both fully parallel Jacobi schemes and Gauss- Seidel (i.e., sequential) ones, as well as virtually all possibilities "in between" with only a subset of variables updated at each iteration. Our theoretical convergence results improve on existing ones, and numerical results on LASSO, logistic regression, and some nonconvex quadratic problems show that the new method consistently outperforms existing algorithms.

  3. On the optimality of the neighbor-joining algorithm

    PubMed Central

    Eickmeyer, Kord; Huggins, Peter; Pachter, Lior; Yoshida, Ruriko

    2008-01-01

    The popular neighbor-joining (NJ) algorithm used in phylogenetics is a greedy algorithm for finding the balanced minimum evolution (BME) tree associated to a dissimilarity map. From this point of view, NJ is "optimal" when the algorithm outputs the tree which minimizes the balanced minimum evolution criterion. We use the fact that the NJ tree topology and the BME tree topology are determined by polyhedral subdivisions of the spaces of dissimilarity maps R+(n2) to study the optimality of the neighbor-joining algorithm. In particular, we investigate and compare the polyhedral subdivisions for n ? 8. This requires the measurement of volumes of spherical polytopes in high dimension, which we obtain using a combination of Monte Carlo methods and polyhedral algorithms. Our results include a demonstration that highly unrelated trees can be co-optimal in BME reconstruction, and that NJ regions are not convex. We obtain the l2 radius for neighbor-joining for n = 5 and we conjecture that the ability of the neighbor-joining algorithm to recover the BME tree depends on the diameter of the BME tree. PMID:18447942

  4. Genetic Algorithm for Optimization: Preprocessor and Algorithm

    NASA Technical Reports Server (NTRS)

    Sen, S. K.; Shaykhian, Gholam A.

    2006-01-01

    Genetic algorithm (GA) inspired by Darwin's theory of evolution and employed to solve optimization problems - unconstrained or constrained - uses an evolutionary process. A GA has several parameters such the population size, search space, crossover and mutation probabilities, and fitness criterion. These parameters are not universally known/determined a priori for all problems. Depending on the problem at hand, these parameters need to be decided such that the resulting GA performs the best. We present here a preprocessor that achieves just that, i.e., it determines, for a specified problem, the foregoing parameters so that the consequent GA is a best for the problem. We stress also the need for such a preprocessor both for quality (error) and for cost (complexity) to produce the solution. The preprocessor includes, as its first step, making use of all the information such as that of nature/character of the function/system, search space, physical/laboratory experimentation (if already done/available), and the physical environment. It also includes the information that can be generated through any means - deterministic/nondeterministic/graphics. Instead of attempting a solution of the problem straightway through a GA without having/using the information/knowledge of the character of the system, we would do consciously a much better job of producing a solution by using the information generated/created in the very first step of the preprocessor. We, therefore, unstintingly advocate the use of a preprocessor to solve a real-world optimization problem including NP-complete ones before using the statistically most appropriate GA. We also include such a GA for unconstrained function optimization problems.

  5. Exact Convex Relaxation of Optimal Power Flow in Radial Networks

    SciTech Connect

    Gan, LW; Li, N; Topcu, U; Low, SH

    2015-01-01

    The optimal power flow (OPF) problem determines a network operating point that minimizes a certain objective such as generation cost or power loss. It is nonconvex. We prove that a global optimum of OPF can be obtained by solving a second-order cone program, under a mild condition after shrinking the OPF feasible set slightly, for radial power networks. The condition can be checked a priori, and holds for the IEEE 13, 34, 37, 123-bus networks and two real-world networks.

  6. Convexity of Ruin Probability and Optimal Dividend Strategies for a General Lvy Process

    PubMed Central

    Yin, Chuancun; Yuen, Kam Chuen; Shen, Ying

    2015-01-01

    We consider the optimal dividends problem for a company whose cash reserves follow a general Lvy process with certain positive jumps and arbitrary negative jumps. The objective is to find a policy which maximizes the expected discounted dividends until the time of ruin. Under appropriate conditions, we use some recent results in the theory of potential analysis of subordinators to obtain the convexity properties of probability of ruin. We present conditions under which the optimal dividend strategy, among all admissible ones, takes the form of a barrier strategy. PMID:26351655

  7. Resistive Network Optimal Power Flow: Uniqueness and Algorithms

    SciTech Connect

    Tan, CW; Cai, DWH; Lou, X

    2015-01-01

    The optimal power flow (OPF) problem minimizes the power loss in an electrical network by optimizing the voltage and power delivered at the network buses, and is a nonconvex problem that is generally hard to solve. By leveraging a recent development on the zero duality gap of OPF, we propose a second-order cone programming convex relaxation of the resistive network OPF, and study the uniqueness of the optimal solution using differential topology, especially the Poincare-Hopf Index Theorem. We characterize the global uniqueness for different network topologies, e.g., line, radial, and mesh networks. This serves as a starting point to design distributed local algorithms with global behaviors that have low complexity, are computationally fast, and can run under synchronous and asynchronous settings in practical power grids.

  8. Nonnegative Mixed-Norm Convex Optimization for Mitotic Cell Detection in Phase Contrast Microscopy

    PubMed Central

    Hao, Tong; Gao, Zan; Su, Yuting; Yang, Zhaoxuan

    2013-01-01

    This paper proposes a nonnegative mix-norm convex optimization method for mitotic cell detection. First, we apply an imaging model-based microscopy image segmentation method that exploits phase contrast optics to extract mitotic candidates in the input images. Then, a convex objective function regularized by mix-norm with nonnegative constraint is proposed to induce sparsity and consistence for discriminative representation of deformable objects in a sparse representation scheme. At last, a Support Vector Machine classifier is utilized for mitotic cell modeling and detection. This method can overcome the difficulty in feature formulation for deformable objects and is independent of tracking or temporal inference model. The comparison experiments demonstrate that the proposed method can produce competing results with the state-of-the-art methods. PMID:24348733

  9. The minimum-error discrimination via Helstrom family of ensembles and Convex Optimization

    E-print Network

    M. A. Jafarizadeh; Y. Mazhari; M. Aali

    2009-10-28

    Using the convex optimization method and Helstrom family of ensembles introduced in Ref. [1], we have discussed optimal ambiguous discrimination in qubit systems. We have analyzed the problem of the optimal discrimination of N known quantum states and have obtained maximum success probability and optimal measurement for N known quantum states with equiprobable prior probabilities and equidistant from center of the Bloch ball, not all of which are on the one half of the Bloch ball and all of the conjugate states are pure. An exact solution has also been given for arbitrary three known quantum states. The given examples which use our method include: 1. Diagonal N mixed states; 2. N equiprobable states and equidistant from center of the Bloch ball which their corresponding Bloch vectors are inclined at the equal angle from z axis; 3. Three mirror-symmetric states; 4. States that have been prepared with equal prior probabilities on vertices of a Platonic solid. Keywords: minimum-error discrimination, success probability, measurement, POVM elements, Helstrom family of ensembles, convex optimization, conjugate states PACS Nos: 03.67.Hk, 03.65.Ta

  10. DERIVATIVE-FREE OPTIMIZATION Algorithms, software and

    E-print Network

    Grossmann, Ignacio E.

    -ligand binding Two new algorithms #12;3 MODEL CALIBRATION (Maguthan and Shoemaker, 2005) Tetrachloroethene Stochastic global optimization Hit-and-run Simulated annealing Genetic algorithms Particle swarm1 DERIVATIVE-FREE OPTIMIZATION Algorithms, software and applications Nick Sahinidis National Energy

  11. Advances in Convex Optimization: Theory, Algorithms, and Applications

    E-print Network

    processing, circuit design, . . . ISIT 02 Lausanne 7/3/02 9 #12;Recent history (198497) interior new standard problem classes generalized inequalities and semidefinite programming interior ISIT 02 Lausanne 7/3/02 8 #12;What's new (since 1990 or so) powerful primal-dual interior

  12. A New Adaptive Algorithm for Convex Quadratic Multicriteria Optimization

    E-print Network

    Fliege, Jörg

    ) of the form min 1 2 xT Qx + cT x s. t. Ax = b, x 0, (1) with c IRn , b IRm , A IRm?n and a symmetric -1 2 xT Qx + bT s. t. -Qx + AT + s = c, s 0, (2) 2 #12;with the dual variables s IRn and IRm . The set of primal-dual feasible 3-tupel w = (x, , s) is given by := {w = (x, , s) IRn ?IRm ?IRn | Ax = b

  13. IEEE TRANS. ON CONTROL OF NETWORK SYSTEMS, JUNE 2014 (WITH PROOFS) 1 Convex Relaxation of Optimal Power Flow

    E-print Network

    Low, Steven H.

    SYSTEMS, JUNE 2014 (WITH PROOFS) 3 I. INTRODUCTION The optimal power flow (OPF) problem is fundamental Power Flow Part II: Exactness Steven H. Low Electrical Engineering, Computing+Mathematical Sciences recent advances in the convex relaxation of the optimal power flow (OPF) problem, focusing on structural

  14. A fast adaptive convex hull algorithm on two-dimensional processor arrays with a reconfigurable BUS system

    NASA Technical Reports Server (NTRS)

    Olariu, S.; Schwing, J.; Zhang, J.

    1991-01-01

    A bus system that can change dynamically to suit computational needs is referred to as reconfigurable. We present a fast adaptive convex hull algorithm on a two-dimensional processor array with a reconfigurable bus system (2-D PARBS, for short). Specifically, we show that computing the convex hull of a planar set of n points taken O(log n/log m) time on a 2-D PARBS of size mn x n with 3 less than or equal to m less than or equal to n. Our result implies that the convex hull of n points in the plane can be computed in O(1) time in a 2-D PARBS of size n(exp 1.5) x n.

  15. Convex hull: a new method to determine the separation space used and to optimize operating conditions for comprehensive two-dimensional gas chromatography.

    PubMed

    Semard, Galle; Peulon-Agasse, Valerie; Bruchet, Auguste; Bouillon, Jean-Philippe; Cardinal, Pascal

    2010-08-13

    It is important to develop methods of optimizing the selection of column sets and operating conditions for comprehensive two-dimensional gas chromatography. A new method for the calculation of the percentage of separation space used was developed using Delaunay's triangulation algorithms (convex hull). This approach was compared with an existing method and showed better precision and accuracy. It was successfully applied to the selection of the most convenient column set and the geometrical parameters of second column for the analysis of 49 target compounds in wastewater. PMID:20633886

  16. Memetic firefly algorithm for combinatorial optimization

    E-print Network

    Fister, Iztok; Fister, Iztok; Brest, Janez

    2012-01-01

    Firefly algorithms belong to modern meta-heuristic algorithms inspired by nature that can be successfully applied to continuous optimization problems. In this paper, we have been applied the firefly algorithm, hybridized with local search heuristic, to combinatorial optimization problems, where we use graph 3-coloring problems as test benchmarks. The results of the proposed memetic firefly algorithm (MFFA) were compared with the results of the Hybrid Evolutionary Algorithm (HEA), Tabucol, and the evolutionary algorithm with SAW method (EA-SAW) by coloring the suite of medium-scaled random graphs (graphs with 500 vertices) generated using the Culberson random graph generator. The results of firefly algorithm were very promising and showed a potential that this algorithm could successfully be applied in near future to the other combinatorial optimization problems as well.

  17. A fast optimization algorithm for multicriteria intensity modulated proton therapy planning

    SciTech Connect

    Chen Wei; Craft, David; Madden, Thomas M.; Zhang, Kewu; Kooy, Hanne M.; Herman, Gabor T.

    2010-09-15

    Purpose: To describe a fast projection algorithm for optimizing intensity modulated proton therapy (IMPT) plans and to describe and demonstrate the use of this algorithm in multicriteria IMPT planning. Methods: The authors develop a projection-based solver for a class of convex optimization problems and apply it to IMPT treatment planning. The speed of the solver permits its use in multicriteria optimization, where several optimizations are performed which span the space of possible treatment plans. The authors describe a plan database generation procedure which is customized to the requirements of the solver. The optimality precision of the solver can be specified by the user. Results: The authors apply the algorithm to three clinical cases: A pancreas case, an esophagus case, and a tumor along the rib cage case. Detailed analysis of the pancreas case shows that the algorithm is orders of magnitude faster than industry-standard general purpose algorithms (MOSEK's interior point optimizer, primal simplex optimizer, and dual simplex optimizer). Additionally, the projection solver has almost no memory overhead. Conclusions: The speed and guaranteed accuracy of the algorithm make it suitable for use in multicriteria treatment planning, which requires the computation of several diverse treatment plans. Additionally, given the low memory overhead of the algorithm, the method can be extended to include multiple geometric instances and proton range possibilities, for robust optimization.

  18. Intelligent perturbation algorithms for space scheduling optimization

    NASA Technical Reports Server (NTRS)

    Kurtzman, Clifford R.

    1991-01-01

    Intelligent perturbation algorithms for space scheduling optimization are presented in the form of the viewgraphs. The following subject areas are covered: optimization of planning, scheduling, and manifesting; searching a discrete configuration space; heuristic algorithms used for optimization; use of heuristic methods on a sample scheduling problem; intelligent perturbation algorithms are iterative refinement techniques; properties of a good iterative search operator; dispatching examples of intelligent perturbation algorithm and perturbation operator attributes; scheduling implementations using intelligent perturbation algorithms; major advances in scheduling capabilities; the prototype ISF (industrial Space Facility) experiment scheduler; optimized schedule (max revenue); multi-variable optimization; Space Station design reference mission scheduling; ISF-TDRSS command scheduling demonstration; and example task - communications check.

  19. A generalized gradient algorithm for dynamic optimization

    NASA Technical Reports Server (NTRS)

    Zhao, Yiyuan; Bryson, A. E.; Slattery, R.

    1989-01-01

    A gradient algorithm is developed that determines optimal trajectories with path equality constraints and terminal constraints. A generalized gradient is formed which improves both the performance index and the path equality constraints simultaneously. The algorithm is extended to treat terminal constraints by using Bryson's impulse response technique. The main features of this algorithm are its numerical stability and smooth convergence near the optimum.

  20. An Optimal Class Association Rule Algorithm

    NASA Astrophysics Data System (ADS)

    Jean Claude, Turiho; Sheng, Yang; Chuang, Li; Kaia, Xie

    Classification and association rule mining algorithms are two important aspects of data mining. Class association rule mining algorithm is a promising approach for it involves the use of association rule mining algorithm to discover classification rules. This paper introduces an optimal class association rule mining algorithm known as OCARA. It uses optimal association rule mining algorithm and the rule set is sorted by priority of rules resulting into a more accurate classifier. It outperforms the C4.5, CBA, RMR on UCI eight data sets, which is proved by experimental results.

  1. An approximation algorithm for cutting out convex polygons Adrian Dumitrescu y

    E-print Network

    Dumitrescu, Adrian

    convex, one has to cut along all intervals where the cutting line intersects the paper. The pieces of paper . A cutting sequence is a finite sequence of cuts such that, after the last one, the piece of paper on a convex piece of paper, cut P out of the piece of paper in the cheapest possible way. No polynomial

  2. Intelligent perturbation algorithms to space scheduling optimization

    NASA Technical Reports Server (NTRS)

    Kurtzman, Clifford R.

    1991-01-01

    The limited availability and high cost of crew time and scarce resources make optimization of space operations critical. Advances in computer technology coupled with new iterative search techniques permit the near optimization of complex scheduling problems that were previously considered computationally intractable. Described here is a class of search techniques called Intelligent Perturbation Algorithms. Several scheduling systems which use these algorithms to optimize the scheduling of space crew, payload, and resource operations are also discussed.

  3. A Characterization Theorem and An Algorithm for A Convex Hull Problem

    E-print Network

    Kalantari, Bahman

    2012-01-01

    Given a set $S= \\{v_1, ..., v_n\\} \\subset \\mathbb{R} ^m$ and a point $p \\in \\mathbb{R} ^m$, we wish to test if $p \\in {\\rm Conv}(S)$, the convex hull of $S$. This is a fundamental problem in computational geometry and linear programming. First, we prove: $p \\in {\\rm Conv}(S)$ if and only if for each $p' \\in {\\rm Conv}(S) - \\{p \\}$ there exists $v_j \\in S$ such that the Euclidean distance inequality $d(p',v_j) > d(p,v_j)$ holds. Next, we describe a fully polynomial time approximation scheme: given $\\epsilon >0$ in $O(mn\\epsilon^{-2})$ arithmetic operations it computes $p' \\in {\\rm Conv}(S)$ such that either $d(p', p) \\leq \\epsilon d(p,v_j)$ for some $j$, or $d(p',v_i) < d(p,v_i)$ for all $i=1, ..., n$. In the latter case the hyperplane that orthogonally bisects the line $pp'$ separates $p$ from ${\\rm Conv}(S)$. We also show how to solve linear programming via this approximation algorithm and give a corresponding complexity analysis.

  4. An Algorithmic Framework for Multiobjective Optimization

    PubMed Central

    Ganesan, T.; Elamvazuthi, I.; Shaari, Ku Zilati Ku; Vasant, P.

    2013-01-01

    Multiobjective (MO) optimization is an emerging field which is increasingly being encountered in many fields globally. Various metaheuristic techniques such as differential evolution (DE), genetic algorithm (GA), gravitational search algorithm (GSA), and particle swarm optimization (PSO) have been used in conjunction with scalarization techniques such as weighted sum approach and the normal-boundary intersection (NBI) method to solve MO problems. Nevertheless, many challenges still arise especially when dealing with problems with multiple objectives (especially in cases more than two). In addition, problems with extensive computational overhead emerge when dealing with hybrid algorithms. This paper discusses these issues by proposing an alternative framework that utilizes algorithmic concepts related to the problem structure for generating efficient and effective algorithms. This paper proposes a framework to generate new high-performance algorithms with minimal computational overhead for MO optimization. PMID:24470795

  5. A Comprehensive Review of Swarm Optimization Algorithms

    PubMed Central

    2015-01-01

    Many swarm optimization algorithms have been introduced since the early 60s, Evolutionary Programming to the most recent, Grey Wolf Optimization. All of these algorithms have demonstrated their potential to solve many optimization problems. This paper provides an in-depth survey of well-known optimization algorithms. Selected algorithms are briefly explained and compared with each other comprehensively through experiments conducted using thirty well-known benchmark functions. Their advantages and disadvantages are also discussed. A number of statistical tests are then carried out to determine the significant performances. The results indicate the overall advantage of Differential Evolution (DE) and is closely followed by Particle Swarm Optimization (PSO), compared with other considered approaches. PMID:25992655

  6. The minimum-error discrimination via Helstrom family of ensembles and Convex Optimization

    E-print Network

    Jafarizadeh, M A; Aali, M

    2009-01-01

    Using the convex optimization method and Helstrom family of ensembles introduced in Ref. [1], we have discussed optimal ambiguous discrimination in qubit systems. We have analyzed the problem of the optimal discrimination of N known quantum states and have obtained maximum success probability and optimal measurement for N known quantum states with equiprobable prior probabilities and equidistant from center of the Bloch ball, not all of which are on the one half of the Bloch ball and all of the conjugate states are pure. An exact solution has also been given for arbitrary three known quantum states. The given examples which use our method include: 1. Diagonal N mixed states; 2. N equiprobable states and equidistant from center of the Bloch ball which their corresponding Bloch vectors are inclined at the equal angle from z axis; 3. Three mirror-symmetric states; 4. States that have been prepared with equal prior probabilities on vertices of a Platonic solid. Keywords: minimum-error discrimination, success prob...

  7. Automatic segmentation for brain MR images via a convex optimized segmentation and bias field correction coupled model.

    PubMed

    Chen, Yunjie; Zhao, Bo; Zhang, Jianwei; Zheng, Yuhui

    2014-09-01

    Accurate segmentation of magnetic resonance (MR) images remains challenging mainly due to the intensity inhomogeneity, which is also commonly known as bias field. Recently active contour models with geometric information constraint have been applied, however, most of them deal with the bias field by using a necessary pre-processing step before segmentation of MR data. This paper presents a novel automatic variational method, which can segment brain MR images meanwhile correcting the bias field when segmenting images with high intensity inhomogeneities. We first define a function for clustering the image pixels in a smaller neighborhood. The cluster centers in this objective function have a multiplicative factor that estimates the bias within the neighborhood. In order to reduce the effect of the noise, the local intensity variations are described by the Gaussian distributions with different means and variances. Then, the objective functions are integrated over the entire domain. In order to obtain the global optimal and make the results independent of the initialization of the algorithm, we reconstructed the energy function to be convex and calculated it by using the Split Bregman theory. A salient advantage of our method is that its result is independent of initialization, which allows robust and fully automated application. Our method is able to estimate the bias of quite general profiles, even in 7T MR images. Moreover, our model can also distinguish regions with similar intensity distribution with different variances. The proposed method has been rigorously validated with images acquired on variety of imaging modalities with promising results. PMID:24832358

  8. Probabilistic Convex Hull Queries over Uncertain Data

    E-print Network

    Ng, Wilfred Siu Hung

    to verify the efficiency of our algorithms for answering PCH queries. Index Terms--Convex hull, uncertain, it is not a point on the convex hull as it does not decide the polygon shape. A lot of algorithms have been proposed for convex hull computation, such as Andrew's Monotone Chain algorithm [6], which finds the convex hull

  9. The Optimal Solution of a Non-Convex State-Dependent LQR Problem and Its Applications

    PubMed Central

    Xu, Xudan; Zhu, J. Jim; Zhang, Ping

    2014-01-01

    This paper studies a Non-convex State-dependent Linear Quadratic Regulator (NSLQR) problem, in which the control penalty weighting matrix in the performance index is state-dependent. A necessary and sufficient condition for the optimal solution is established with a rigorous proof by Euler-Lagrange Equation. It is found that the optimal solution of the NSLQR problem can be obtained by solving a Pseudo-Differential-Riccati-Equation (PDRE) simultaneously with the closed-loop system equation. A Comparison Theorem for the PDRE is given to facilitate solution methods for the PDRE. A linear time-variant system is employed as an example in simulation to verify the proposed optimal solution. As a non-trivial application, a goal pursuit process in psychology is modeled as a NSLQR problem and two typical goal pursuit behaviors found in human and animals are reproduced using different control weighting . It is found that these two behaviors save control energy and cause less stress over Conventional Control Behavior typified by the LQR control with a constant control weighting , in situations where only the goal discrepancy at the terminal time is of concern, such as in Marathon races and target hitting missions. PMID:24747417

  10. Adaptable optimization : theory and algorithms

    E-print Network

    Caramanis, Constantine (Constantine Michael), 1977-

    2006-01-01

    Optimization under uncertainty is a central ingredient for analyzing and designing systems with incomplete information. This thesis addresses uncertainty in optimization, in a dynamic framework where information is revealed ...

  11. Aerodynamic Shape Optimization using an Evolutionary Algorithm

    NASA Technical Reports Server (NTRS)

    Hoist, Terry L.; Pulliam, Thomas H.

    2003-01-01

    A method for aerodynamic shape optimization based on an evolutionary algorithm approach is presented and demonstrated. Results are presented for a number of model problems to access the effect of algorithm parameters on convergence efficiency and reliability. A transonic viscous airfoil optimization problem-both single and two-objective variations is used as the basis for a preliminary comparison with an adjoint-gradient optimizer. The evolutionary algorithm is coupled with a transonic full potential flow solver and is used to optimize the inviscid flow about transonic wings including multi-objective and multi-discipline solutions that lead to the generation of pareto fronts. The results indicate that the evolutionary algorithm approach is easy to implement, flexible in application and extremely reliable.

  12. Aerodynamic Shape Optimization using an Evolutionary Algorithm

    NASA Technical Reports Server (NTRS)

    Holst, Terry L.; Pulliam, Thomas H.; Kwak, Dochan (Technical Monitor)

    2003-01-01

    A method for aerodynamic shape optimization based on an evolutionary algorithm approach is presented and demonstrated. Results are presented for a number of model problems to access the effect of algorithm parameters on convergence efficiency and reliability. A transonic viscous airfoil optimization problem, both single and two-objective variations, is used as the basis for a preliminary comparison with an adjoint-gradient optimizer. The evolutionary algorithm is coupled with a transonic full potential flow solver and is used to optimize the inviscid flow about transonic wings including multi-objective and multi-discipline solutions that lead to the generation of pareto fronts. The results indicate that the evolutionary algorithm approach is easy to implement, flexible in application and extremely reliable.

  13. Schrodinger Equation As a General Optimization Algorithm

    E-print Network

    Xiaofei Huang

    2009-02-10

    One of the greatest scientific achievements of physics in the 20th century is the discovery of quantum mechanics. The Schrodinger equation is the most fundamental equation in quantum mechanics describing the time-based evolution of the quantum state of a physical system. It has been found that the time-independent version of the equation can be derived from a general optimization algorithm. Instead of arguing for a new interpretation and possible deeper principle for quantum mechanics, this paper elaborates a few points of the equation as a general global optimization algorithm. Benchmarked against randomly generated hard optimization problems, this paper shows that the algorithm significantly outperformed a classic local optimization algorithm. The former found a solution in one second with a single trial better than the best one found by the latter around one hour after one hundred thousand trials.

  14. Algorithms for optimizing hydropower system operation

    SciTech Connect

    Grygier, J.C.; Stedinger, J.R.

    1985-01-01

    Successive liner programming, an optimal control algorithm, and a combination of linear programming and dynamic programming (LP-DP) are employed to optimize the operation of multireservoir hydrosystems given a deterministic inflow forecast. The algorithm maximize the value of energy produced at on-peak rates, plus the estimated value of water remaining in storage at the end of the 12-month planning period. The LP-DP algorithm is clearly dominated: it takes longer to find a solution and produces significantly less hydropower than the other two procedures. Successive linear programming (SLP) appears to find the global maximum and is easily implemented. For simple systems the optimal control algorithm finds the optimum in about one fifth the time required by SLP but is harder to implement. Computing costs for a two-reservoir, 12-month deterministic problem averaged about seven cents per run using optimal control and 37 cents using successive linear programming.

  15. Strict convexity and C 1, ? regularity of potential functions in optimal transportation under condition A3w

    NASA Astrophysics Data System (ADS)

    Chen, Shibing; Wang, Xu-Jia

    2016-01-01

    In this paper we prove the strict c-convexity and the C 1, ? regularity for potential functions in optimal transportation under condition (A3w). These results were obtained by Caffarelli [1,3,4] for the cost c (x, y) =| x - y | 2, by Liu [11], Loeper [15], Trudinger and Wang [20] for costs satisfying the condition (A3). For costs satisfying the condition (A3w), the results have also been proved by Figalli, Kim, and McCann [6], assuming that the initial and target domains are uniformly c-convex, see also [21]; and by Guillen and Kitagawa [8], assuming the cost function satisfies A3w in larger domains. In this paper we prove the strict c-convexity and the C 1, ? regularity assuming either the support of source density is compactly contained in a larger domain where the cost function satisfies A3w, or the dimension 2 ? n ? 4.

  16. An optimal algorithm for ressource allocation problem in concave context A. Le Poupon and O. Rioul

    E-print Network

    Rioul, Olivier

    -optimal results because the optimal solution does not necessarily lie on the convex hull in the A-B plane (see fig on the convex hull are joigned by a segment of slope . The Shoham-Gersho procedure [1] finds a point on the convex hull as the path corresponding to the whole sequence of multipliers 1 2 · · · M . We propose

  17. Adaptive cuckoo search algorithm for unconstrained optimization.

    PubMed

    Ong, Pauline

    2014-01-01

    Modification of the intensification and diversification approaches in the recently developed cuckoo search algorithm (CSA) is performed. The alteration involves the implementation of adaptive step size adjustment strategy, and thus enabling faster convergence to the global optimal solutions. The feasibility of the proposed algorithm is validated against benchmark optimization functions, where the obtained results demonstrate a marked improvement over the standard CSA, in all the cases. PMID:25298971

  18. Adaptive Cuckoo Search Algorithm for Unconstrained Optimization

    PubMed Central

    2014-01-01

    Modification of the intensification and diversification approaches in the recently developed cuckoo search algorithm (CSA) is performed. The alteration involves the implementation of adaptive step size adjustment strategy, and thus enabling faster convergence to the global optimal solutions. The feasibility of the proposed algorithm is validated against benchmark optimization functions, where the obtained results demonstrate a marked improvement over the standard CSA, in all the cases. PMID:25298971

  19. Generalized gradient algorithm for trajectory optimization

    NASA Technical Reports Server (NTRS)

    Zhao, Yiyuan; Bryson, A. E.; Slattery, R.

    1990-01-01

    The generalized gradient algorithm presented and verified as a basis for the solution of trajectory optimization problems improves the performance index while reducing path equality constraints, and terminal equality constraints. The algorithm is conveniently divided into two phases, of which the first, 'feasibility' phase yields a solution satisfying both path and terminal constraints, while the second, 'optimization' phase uses the results of the first phase as initial guesses.

  20. Belief Propagation Algorithm for Portfolio Optimization Problems

    PubMed Central

    2015-01-01

    The typical behavior of optimal solutions to portfolio optimization problems with absolute deviation and expected shortfall models using replica analysis was pioneeringly estimated by S. Ciliberti et al. [Eur. Phys. B. 57, 175 (2007)]; however, they have not yet developed an approximate derivation method for finding the optimal portfolio with respect to a given return set. In this study, an approximation algorithm based on belief propagation for the portfolio optimization problem is presented using the Bethe free energy formalism, and the consistency of the numerical experimental results of the proposed algorithm with those of replica analysis is confirmed. Furthermore, the conjecture of H. Konno and H. Yamazaki, that the optimal solutions with the absolute deviation model and with the mean-variance model have the same typical behavior, is verified using replica analysis and the belief propagation algorithm. PMID:26305462

  1. Ant Algorithms Solve Difficult Optimization Problems

    E-print Network

    Libre de Bruxelles, Universit

    Ant Algorithms Solve Difficult Optimization Problems Marco Dorigo IRIDIA Universite Libre de Bruxelles 50 Avenue F. Roosevelt B-1050 Brussels, Belgium mdorigo@ulb.ac.be Abstract. The ant algorithms research field builds on the idea that the study of the behavior of ant colonies or other social insects

  2. Global Optimality of the Successive Maxbet Algorithm.

    ERIC Educational Resources Information Center

    Hanafi, Mohamed; ten Berge, Jos M. F.

    2003-01-01

    It is known that the Maxbet algorithm, which is an alternative to the method of generalized canonical correlation analysis and Procrustes analysis, may converge to local maxima. Discusses an eigenvalue criterion that is sufficient, but not necessary, for global optimality of the successive Maxbet algorithm. (SLD)

  3. Evolutionary Algorithm for Optimal Vaccination Scheme

    NASA Astrophysics Data System (ADS)

    Parousis-Orthodoxou, K. J.; Vlachos, D. S.

    2014-03-01

    The following work uses the dynamic capabilities of an evolutionary algorithm in order to obtain an optimal immunization strategy in a user specified network. The produced algorithm uses a basic genetic algorithm with crossover and mutation techniques, in order to locate certain nodes in the inputted network. These nodes will be immunized in an SIR epidemic spreading process, and the performance of each immunization scheme, will be evaluated by the level of containment that provides for the spreading of the disease.

  4. Automated bone segmentation from dental CBCT images using patch-based sparse representation and convex optimization

    SciTech Connect

    Wang, Li; Gao, Yaozong; Shi, Feng; Liao, Shu; Li, Gang; Chen, Ken Chung; Shen, Steve G. F.; Yan, Jin; Lee, Philip K. M.; Chow, Ben; Liu, Nancy X.; Xia, James J.; Department of Surgery , Weill Medical College, Cornell University, New York, New York 10065; Department of Oral and Craniomaxillofacial Surgery and Science, Shanghai Ninth People's Hospital, Shanghai Jiao Tong University College of Medicine, Shanghai, China 200011 ; Shen, Dinggang

    2014-04-15

    Purpose: Cone-beam computed tomography (CBCT) is an increasingly utilized imaging modality for the diagnosis and treatment planning of the patients with craniomaxillofacial (CMF) deformities. Accurate segmentation of CBCT image is an essential step to generate three-dimensional (3D) models for the diagnosis and treatment planning of the patients with CMF deformities. However, due to the poor image quality, including very low signal-to-noise ratio and the widespread image artifacts such as noise, beam hardening, and inhomogeneity, it is challenging to segment the CBCT images. In this paper, the authors present a new automatic segmentation method to address these problems. Methods: To segment CBCT images, the authors propose a new method for fully automated CBCT segmentation by using patch-based sparse representation to (1) segment bony structures from the soft tissues and (2) further separate the mandible from the maxilla. Specifically, a region-specific registration strategy is first proposed to warp all the atlases to the current testing subject and then a sparse-based label propagation strategy is employed to estimate a patient-specific atlas from all aligned atlases. Finally, the patient-specific atlas is integrated into amaximum a posteriori probability-based convex segmentation framework for accurate segmentation. Results: The proposed method has been evaluated on a dataset with 15 CBCT images. The effectiveness of the proposed region-specific registration strategy and patient-specific atlas has been validated by comparing with the traditional registration strategy and population-based atlas. The experimental results show that the proposed method achieves the best segmentation accuracy by comparison with other state-of-the-art segmentation methods. Conclusions: The authors have proposed a new CBCT segmentation method by using patch-based sparse representation and convex optimization, which can achieve considerably accurate segmentation results in CBCT segmentation based on 15 patients.

  5. A review of the book "Functional analysis and applied optimization in Banach spaces -Applications to non-convex variational problems" by Fabio Botelho,

    E-print Network

    Henrion, Didier

    A review of the book "Functional analysis and applied optimization in Banach spaces - Applications to non-convex variational problems" by Fabio Botelho, Springer, Cham, Switzerland, 2014. The book extensively in the landmark book [I. Ekeland, R. Temam. Convex analysis and variational problems. Elsevier

  6. Social Emotional Optimization Algorithm for Nonlinear Constrained Optimization Problems

    NASA Astrophysics Data System (ADS)

    Xu, Yuechun; Cui, Zhihua; Zeng, Jianchao

    Nonlinear programming problem is one important branch in operational research, and has been successfully applied to various real-life problems. In this paper, a new approach called Social emotional optimization algorithm (SEOA) is used to solve this problem which is a new swarm intelligent technique by simulating the human behavior guided by emotion. Simulation results show that the social emotional optimization algorithm proposed in this paper is effective and efficiency for the nonlinear constrained programming problems.

  7. Variable-Metric Algorithm For Constrained Optimization

    NASA Technical Reports Server (NTRS)

    Frick, James D.

    1989-01-01

    Variable Metric Algorithm for Constrained Optimization (VMACO) is nonlinear computer program developed to calculate least value of function of n variables subject to general constraints, both equality and inequality. First set of constraints equality and remaining constraints inequalities. Program utilizes iterative method in seeking optimal solution. Written in ANSI Standard FORTRAN 77.

  8. Algorithms for optimal dyadic decision trees

    SciTech Connect

    Hush, Don; Porter, Reid

    2009-01-01

    A new algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data sets. This paper enhances and extends this algorithm by: introducing an adaptive grid search for the regularization parameter that guarantees optimal solutions for all relevant trees sizes, revising the core tree-building algorithm so that its run time is substantially smaller for most regularization parameter values on the grid, and incorporating new data structures and data pre-processing steps that provide significant run time enhancement in practice.

  9. Optimal Microdata File Merging: A New Model & Network Optimization Algorithm

    E-print Network

    Barr, Richard

    1 Optimal Microdata File Merging: A New Model & Network Optimization Algorithm Richard S. Barr, SMU Choices available: Commission a new study Ignore variables Impute missing items Merge two files to combine surveys #12;5 Merging Microdata Files Two microdata samples Are drawn from the same population

  10. Online estimation of lower and upper bounds for heart sound boundaries in chest sound using Convex-hull algorithm.

    PubMed

    a?lar, F; Ozbek, I Y

    2012-01-01

    Heart sound localization in chest sound is an essential part for many heart sound cancellation algorithms. The main difficulty for heart sound localization methods is the precise determination of the onset and offset boundaries of the heart sound segment. This paper presents a novel method to estimate lower and upper bounds for the onset and offset of the heart sound segment, which can be used as anchor points for more precise estimation. For this purpose, first chest sound is divided into frames and then entropy and smoothed entropy features of these frames are extracted, and used in the Convex-hull algorithm to estimate the upper and lower bounds for heart sound boundaries. The Convex-hull algorithm constructs a special type of envelope function for entropy features and if the maximal difference between the envelope function and the entropy is larger than a certain threshold, this point is considered as a heart sound bound. The results of the proposed method are compared with a baseline method which is a modified version of a well-known heart sound localization method. The results show that the proposed method outperforms the baseline method in terms of accuracy and detection error rate. Also, the experimental results show that smoothing entropy features significantly improves the performance of both baseline and proposed methods. PMID:23366867

  11. An Efficient Chemical Reaction Optimization Algorithm for Multiobjective Optimization.

    PubMed

    Bechikh, Slim; Chaabani, Abir; Ben Said, Lamjed

    2015-10-01

    Recently, a new metaheuristic called chemical reaction optimization was proposed. This search algorithm, inspired by chemical reactions launched during collisions, inherits several features from other metaheuristics such as simulated annealing and particle swarm optimization. This fact has made it, nowadays, one of the most powerful search algorithms in solving mono-objective optimization problems. In this paper, we propose a multiobjective variant of chemical reaction optimization, called nondominated sorting chemical reaction optimization, in an attempt to exploit chemical reaction optimization features in tackling problems involving multiple conflicting criteria. Since our approach is based on nondominated sorting, one of the main contributions of this paper is the proposal of a new quasi-linear average time complexity quick nondominated sorting algorithm; thereby making our multiobjective algorithm efficient from a computational cost viewpoint. The experimental comparisons against several other multiobjective algorithms on a variety of benchmark problems involving various difficulties show the effectiveness and the efficiency of this multiobjective version in providing a well-converged and well-diversified approximation of the Pareto front. PMID:25373137

  12. Algorithm selection in structural optimization

    E-print Network

    Clune, Rory P. (Rory Patrick)

    2013-01-01

    Structural optimization is largely unused as a practical design tool, despite an extensive academic literature which demonstrates its potential to dramatically improve design processes and outcomes. Many factors inhibit ...

  13. Optimizing connected component labeling algorithms

    SciTech Connect

    Wu, Kesheng; Otoo, Ekow; Shoshani, Arie

    2005-01-16

    This paper presents two new strategies that can be used to greatly improve the speed of connected component labeling algorithms. To assign a label to a new object, most connected component labeling algorithms use a scanning step that examines some of its neighbors. The first strategy exploits the dependencies among them to reduce the number of neighbors examined. When considering 8-connected components in a 2D image, this can reduce the number of neighbors examined from four to one in many cases. The second strategy uses an array to store the equivalence information among the labels. This replaces the pointer based rooted trees used to store the same equivalence information. It reduces the memory required and also produces consecutive final labels. Using an array instead of the pointer based rooted trees speeds up the connected component labeling algorithms by a factor of 5 {approx} 100 in our tests on random binary images.

  14. Protein structure optimization with a "Lamarckian" ant colony algorithm.

    PubMed

    Oakley, Mark T; Richardson, E Grace; Carr, Harriet; Johnston, Roy L

    2013-01-01

    We describe the LamarckiAnt algorithm: a search algorithm that combines the features of a "Lamarckian" genetic algorithm and ant colony optimization. We have implemented this algorithm for the optimization of BLN model proteins, which have frustrated energy landscapes and represent a challenge for global optimization algorithms. We demonstrate that LamarckiAnt performs competitively with other state-of-the-art optimization algorithms. PMID:24407312

  15. New algorithms for binary wavefront optimization

    NASA Astrophysics Data System (ADS)

    Zhang, Xiaolong; Kner, Peter

    2015-03-01

    Binary amplitude modulation promises to allow rapid focusing through strongly scattering media with a large number of segments due to the faster update rates of digital micromirror devices (DMDs) compared to spatial light modulators (SLMs). While binary amplitude modulation has a lower theoretical enhancement than phase modulation, the faster update rate should more than compensate for the difference - a factor of ?2 /2. Here we present two new algorithms, a genetic algorithm and a transmission matrix algorithm, for optimizing the focus with binary amplitude modulation that achieve enhancements close to the theoretical maximum. Genetic algorithms have been shown to work well in noisy environments and we show that the genetic algorithm performs better than a stepwise algorithm. Transmission matrix algorithms allow complete characterization and control of the medium but require phase control either at the input or output. Here we introduce a transmission matrix algorithm that works with only binary amplitude control and intensity measurements. We apply these algorithms to binary amplitude modulation using a Texas Instruments Digital Micromirror Device. Here we report an enhancement of 152 with 1536 segments (9.90%N) using a genetic algorithm with binary amplitude modulation and an enhancement of 136 with 1536 segments (8.9%N) using an intensity-only transmission matrix algorithm.

  16. A cuckoo search algorithm for multimodal optimization.

    PubMed

    Cuevas, Erik; Reyna-Orta, Adolfo

    2014-01-01

    Interest in multimodal optimization is expanding rapidly, since many practical engineering problems demand the localization of multiple optima within a search space. On the other hand, the cuckoo search (CS) algorithm is a simple and effective global optimization algorithm which can not be directly applied to solve multimodal optimization problems. This paper proposes a new multimodal optimization algorithm called the multimodal cuckoo search (MCS). Under MCS, the original CS is enhanced with multimodal capacities by means of (1) the incorporation of a memory mechanism to efficiently register potential local optima according to their fitness value and the distance to other potential solutions, (2) the modification of the original CS individual selection strategy to accelerate the detection process of new local minima, and (3) the inclusion of a depuration procedure to cyclically eliminate duplicated memory elements. The performance of the proposed approach is compared to several state-of-the-art multimodal optimization algorithms considering a benchmark suite of fourteen multimodal problems. Experimental results indicate that the proposed strategy is capable of providing better and even a more consistent performance over existing well-known multimodal algorithms for the majority of test problems yet avoiding any serious computational deterioration. PMID:25147850

  17. A Cuckoo Search Algorithm for Multimodal Optimization

    PubMed Central

    2014-01-01

    Interest in multimodal optimization is expanding rapidly, since many practical engineering problems demand the localization of multiple optima within a search space. On the other hand, the cuckoo search (CS) algorithm is a simple and effective global optimization algorithm which can not be directly applied to solve multimodal optimization problems. This paper proposes a new multimodal optimization algorithm called the multimodal cuckoo search (MCS). Under MCS, the original CS is enhanced with multimodal capacities by means of (1) the incorporation of a memory mechanism to efficiently register potential local optima according to their fitness value and the distance to other potential solutions, (2) the modification of the original CS individual selection strategy to accelerate the detection process of new local minima, and (3) the inclusion of a depuration procedure to cyclically eliminate duplicated memory elements. The performance of the proposed approach is compared to several state-of-the-art multimodal optimization algorithms considering a benchmark suite of fourteen multimodal problems. Experimental results indicate that the proposed strategy is capable of providing better and even a more consistent performance over existing well-known multimodal algorithms for the majority of test problems yet avoiding any serious computational deterioration. PMID:25147850

  18. Convex optimization of MRI exposure for mitigation of RF-heating from active medical implants

    NASA Astrophysics Data System (ADS)

    Crcoles, Juan; Zastrow, Earl; Kuster, Niels

    2015-09-01

    Local RF-heating of elongated medical implants during magnetic resonance imaging (MRI) may pose a significant health risk to patients. The actual patient risk depends on various parameters including RF magnetic field strength and frequency, MR coil design, patients anatomy, posture, and imaging position, implant location, RF coupling efficiency of the implant, and the bio-physiological responses associated with the induced local heating. We present three constrained convex optimization strategies that incorporate the implants RF-heating characteristics, for the reduction of local heating of medical implants during MRI. The study emphasizes the complementary performances of the different formulations. The analysis demonstrates that RF-induced heating of elongated metallic medical implants can be carefully controlled and balanced against MRI quality. A reduction of heating of up to 25 dB can be achieved at the cost of reduced uniformity in the magnitude of the B1+ field of less than 5%. The current formulations incorporate a priori knowledge of clinically-specific parameters, which is assumed to be available. Before these techniques can be applied practically in the broader clinical context, further investigations are needed to determine whether reduced access to a priori knowledge regarding, e.g. the patients anatomy, implant routing, RF-transmitter, and RF-implant coupling, can be accepted within reasonable levels of uncertainty.

  19. UNCORRECTEDPROOF Algorithms for Optimizing Rheology

    E-print Network

    Yang, Youqing "Richard"

    of Lithospheric Deformation Abstract Lithospheric deformation results from dynamic interplay of tectonic driving the observational constraints to obtain the optimal driving forces and lithospheric rheology. The results a viscous thin-sheet showed that the shear traction from the Pacific-North American plate boundary

  20. Enhanced Fuel-Optimal Trajectory-Generation Algorithm for Planetary Pinpoint Landing

    NASA Technical Reports Server (NTRS)

    Acikmese, Behcet; Blackmore, James C.; Scharf, Daniel P.

    2011-01-01

    An enhanced algorithm is developed that builds on a previous innovation of fuel-optimal powered-descent guidance (PDG) for planetary pinpoint landing. The PDG problem is to compute constrained, fuel-optimal trajectories to land a craft at a prescribed target on a planetary surface, starting from a parachute cut-off point and using a throttleable descent engine. The previous innovation showed the minimal-fuel PDG problem can be posed as a convex optimization problem, in particular, as a Second-Order Cone Program, which can be solved to global optimality with deterministic convergence properties, and hence is a candidate for onboard implementation. To increase the speed and robustness of this convex PDG algorithm for possible onboard implementation, the following enhancements are incorporated: 1) Fast detection of infeasibility (i.e., control authority is not sufficient for soft-landing) for subsequent fault response. 2) The use of a piecewise-linear control parameterization, providing smooth solution trajectories and increasing computational efficiency. 3) An enhanced line-search algorithm for optimal time-of-flight, providing quicker convergence and bounding the number of path-planning iterations needed. 4) An additional constraint that analytically guarantees inter-sample satisfaction of glide-slope and non-sub-surface flight constraints, allowing larger discretizations and, hence, faster optimization. 5) Explicit incorporation of Mars rotation rate into the trajectory computation for improved targeting accuracy. These enhancements allow faster convergence to the fuel-optimal solution and, more importantly, remove the need for a "human-in-the-loop," as constraints will be satisfied over the entire path-planning interval independent of step-size (as opposed to just at the discrete time points) and infeasible initial conditions are immediately detected. Finally, while the PDG stage is typically only a few minutes, ignoring the rotation rate of Mars can introduce 10s of meters of error. By incorporating it, the enhanced PDG algorithm becomes capable of pinpoint targeting.

  1. Rapid Generation of Optimal Asteroid Powered Descent Trajectories Via Convex Optimization

    NASA Technical Reports Server (NTRS)

    Pinson, Robin; Lu, Ping

    2015-01-01

    Mission proposals that land on asteroids are becoming popular. However, in order to have a successful mission the spacecraft must reliably and softly land at the intended landing site. The problem under investigation is how to design a fuel-optimal powered descent trajectory that can be quickly computed on-board the spacecraft, without interaction from ground control. An optimal trajectory designed immediately prior to the descent burn has many advantages. These advantages include the ability to use the actual vehicle starting state as the initial condition in the trajectory design and the ease of updating the landing target site if the original landing site is no longer viable. For long trajectories, the trajectory can be updated periodically by a redesign of the optimal trajectory based on current vehicle conditions to improve the guidance performance. One of the key drivers for being completely autonomous is the infrequent and delayed communication between ground control and the vehicle. Challenges that arise from designing an asteroid powered descent trajectory include complicated nonlinear gravity fields, small rotating bodies and low thrust vehicles.

  2. Algorithm Optimally Allocates Actuation of a Spacecraft

    NASA Technical Reports Server (NTRS)

    Motaghedi, Shi

    2007-01-01

    A report presents an algorithm that solves the following problem: Allocate the force and/or torque to be exerted by each thruster and reaction-wheel assembly on a spacecraft for best performance, defined as minimizing the error between (1) the total force and torque commanded by the spacecraft control system and (2) the total of forces and torques actually exerted by all the thrusters and reaction wheels. The algorithm incorporates the matrix vector relationship between (1) the total applied force and torque and (2) the individual actuator force and torque values. It takes account of such constraints as lower and upper limits on the force or torque that can be applied by a given actuator. The algorithm divides the aforementioned problem into two optimization problems that it solves sequentially. These problems are of a type, known in the art as semi-definite programming problems, that involve linear matrix inequalities. The algorithm incorporates, as sub-algorithms, prior algorithms that solve such optimization problems very efficiently. The algorithm affords the additional advantage that the solution requires the minimum rate of consumption of fuel for the given best performance.

  3. Global Optimization of Chemical Processes using Stochastic Algorithms

    E-print Network

    Neumaier, Arnold

    Global Optimization of Chemical Processes using Stochastic Algorithms JULIO R. BANGA 1 and WARREN D and deterministic algorithms. Results closer to the global optimum are reported for the optimal control algorithm, that is very efficient for global optimization. This algorithm has solved a number of complex

  4. Annealing a Genetic Algorithm for Constrained Optimization1

    E-print Network

    Mendivil, Franklin

    Annealing a Genetic Algorithm for Constrained Optimization1 F. Mendivil2 3 and R. Shonkwiler4 Abstract In this paper, we adapt a genetic algorithm for constrained optimization problems. We use will converge to a globally optimal feasible state. Key Words: Genetic algorithms, constrained optimization

  5. Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions

    E-print Network

    Agarwal, Alekh

    We analyze a class of estimators based on convex relaxation for solving high-dimensional matrix decomposition problems. The observations are noisy realizations of a linear transformation [bar through "X" symbol] of the sum ...

  6. An efficient algorithm for numerical airfoil optimization

    NASA Technical Reports Server (NTRS)

    Vanderplaats, G. N.

    1979-01-01

    A new optimization algorithm is presented. The method is based on sequential application of a second-order Taylor's series approximation to the airfoil characteristics. Compared to previous methods, design efficiency improvements of more than a factor of 2 are demonstrated. If multiple optimizations are performed, the efficiency improvements are more dramatic due to the ability of the technique to utilize existing data. The method is demonstrated by application to subsonic and transonic airfoil design but is a general optimization technique and is not limited to a particular application or aerodynamic analysis.

  7. Scale-Free Algorithms for Online Linear Optimization

    E-print Network

    Pl, Dvid

    Entropy No GIGA [23] Any Bounded 1 2 w 2 2 No RDA [22] Any Any Strongly Convex No FTRL-Proximal [11, 10 guarantee that depends on b rather than on B. There is a clear practical need to design algorithms

  8. Combinatorial Multiobjective Optimization Using Genetic Algorithms

    NASA Technical Reports Server (NTRS)

    Crossley, William A.; Martin. Eric T.

    2002-01-01

    The research proposed in this document investigated multiobjective optimization approaches based upon the Genetic Algorithm (GA). Several versions of the GA have been adopted for multiobjective design, but, prior to this research, there had not been significant comparisons of the most popular strategies. The research effort first generalized the two-branch tournament genetic algorithm in to an N-branch genetic algorithm, then the N-branch GA was compared with a version of the popular Multi-Objective Genetic Algorithm (MOGA). Because the genetic algorithm is well suited to combinatorial (mixed discrete / continuous) optimization problems, the GA can be used in the conceptual phase of design to combine selection (discrete variable) and sizing (continuous variable) tasks. Using a multiobjective formulation for the design of a 50-passenger aircraft to meet the competing objectives of minimizing takeoff gross weight and minimizing trip time, the GA generated a range of tradeoff designs that illustrate which aircraft features change from a low-weight, slow trip-time aircraft design to a heavy-weight, short trip-time aircraft design. Given the objective formulation and analysis methods used, the results of this study identify where turboprop-powered aircraft and turbofan-powered aircraft become more desirable for the 50 seat passenger application. This aircraft design application also begins to suggest how a combinatorial multiobjective optimization technique could be used to assist in the design of morphing aircraft.

  9. Worst-case Optimal Join Algorithms

    E-print Network

    Ngo, Hung Q; R, Christopher; Rudra, Atri

    2012-01-01

    Efficient join processing is one of the most fundamental and well-studied tasks in database research. In this work, we examine algorithms for natural join queries over many relations and describe a novel algorithm to process these queries optimally in terms of worst-case data complexity. Our result builds on recent work by Atserias, Grohe, and Marx, who gave bounds on the size of a full conjunctive query in terms of the sizes of the individual relations in the body of the query. These bounds, however, are not constructive: they rely on Shearer's entropy inequality which is information-theoretic. Thus, the previous results leave open the question of whether there exist algorithms whose running time achieve these optimal bounds. An answer to this question may be interesting to database practice, as it is known that any algorithm based on the traditional select-project-join style plans typically employed in an RDBMS are asymptotically slower than the optimal for some queries. We construct an algorithm whose runn...

  10. A Computational Intelligence Optimization Algorithm Based

    E-print Network

    Ziegler, Günter M.

    A Computational Intelligence Optimization Algorithm Based on the Behavior of the Social-Spider Erik, the use of compu- tational intelligence approaches has been recently extended to address challenging real of behavior. Swarm intelligence, as a compu- tational intelligence paradigm, models the collective behavior

  11. Optimization of a chemical identification algorithm

    NASA Astrophysics Data System (ADS)

    Chyba, Thomas H.; Fisk, Brian; Gunning, Christin; Farley, Kevin; Polizzi, Amber; Baughman, David; Simpson, Steven; Slamani, Mohamed-Adel; Almassy, Robert; Da Re, Ryan; Li, Eunice; MacDonald, Steve; Slamani, Ahmed; Mitchell, Scott A.; Pendell-Jones, Jay; Reed, Timothy L.; Emge, Darren

    2010-04-01

    A procedure to evaluate and optimize the performance of a chemical identification algorithm is presented. The Joint Contaminated Surface Detector (JCSD) employs Raman spectroscopy to detect and identify surface chemical contamination. JCSD measurements of chemical warfare agents, simulants, toxic industrial chemicals, interferents and bare surface backgrounds were made in the laboratory and under realistic field conditions. A test data suite, developed from these measurements, is used to benchmark algorithm performance throughout the improvement process. In any one measurement, one of many possible targets can be present along with interferents and surfaces. The detection results are expressed as a 2-category classification problem so that Receiver Operating Characteristic (ROC) techniques can be applied. The limitations of applying this framework to chemical detection problems are discussed along with means to mitigate them. Algorithmic performance is optimized globally using robust Design of Experiments and Taguchi techniques. These methods require figures of merit to trade off between false alarms and detection probability. Several figures of merit, including the Matthews Correlation Coefficient and the Taguchi Signal-to-Noise Ratio are compared. Following the optimization of global parameters which govern the algorithm behavior across all target chemicals, ROC techniques are employed to optimize chemical-specific parameters to further improve performance.

  12. Groundwater Remediation Strategy Using Global Optimization Algorithms

    E-print Network

    Neumaier, Arnold

    Groundwater Remediation Strategy Using Global Optimization Algorithms Shreedhar Maskey1 ; Andreja Jonoski2 ; and Dimitri P. Solomatine3 Abstract: The remediation of groundwater contamination by pumping, are used to minimize both cleanup time and cleanup cost taking pumping rates and/or well locations

  13. GENERALIZED OPTIMIZATION ALGORITHM FOR SPEECH RECOGNITION TRANSDUCERS

    E-print Network

    Allauzen, Cyril

    GENERALIZED OPTIMIZATION ALGORITHM FOR SPEECH RECOGNITION TRANSDUCERS Cyril Allauzen and Mehryar provide a common representation for the components of a speech recognition system. In previous work, we, determinization. However, not all weighted automata and transducers used in large- vocabulary speech recognition

  14. GENERALIZED OPTIMIZATION ALGORITHM FOR SPEECH RECOGNITION TRANSDUCERS

    E-print Network

    Mohri, Mehryar

    GENERALIZED OPTIMIZATION ALGORITHM FOR SPEECH RECOGNITION TRANSDUCERS Cyril Allauzen and Mehryar provide a common representation for the components of a speech recognition system. In previous work, we, determinization. However, not all weighted automata and transducers used in large vocabulary speech recognition

  15. A Simple But Effective Evolutionary Algorithm for Complicated Optimization Problems

    E-print Network

    Xu, Y.G.

    A simple but effective evolutionary algorithm is proposed in this paper for solving complicated optimization problems. The new algorithm presents two hybridization operations incorporated with the conventional genetic ...

  16. Optimization of advanced telecommunication algorithms from power and performance perspective

    E-print Network

    Khan, Zahid

    2011-11-22

    This thesis investigates optimization of advanced telecommunication algorithms from power and performance perspectives. The algorithms chosen are MIMO and LDPC. MIMO is implemented in custom ASIC for power optimization ...

  17. A reliable algorithm for optimal control synthesis

    NASA Technical Reports Server (NTRS)

    Vansteenwyk, Brett; Ly, Uy-Loi

    1992-01-01

    In recent years, powerful design tools for linear time-invariant multivariable control systems have been developed based on direct parameter optimization. In this report, an algorithm for reliable optimal control synthesis using parameter optimization is presented. Specifically, a robust numerical algorithm is developed for the evaluation of the H(sup 2)-like cost functional and its gradients with respect to the controller design parameters. The method is specifically designed to handle defective degenerate systems and is based on the well-known Pade series approximation of the matrix exponential. Numerical test problems in control synthesis for simple mechanical systems and for a flexible structure with densely packed modes illustrate positively the reliability of this method when compared to a method based on diagonalization. Several types of cost functions have been considered: a cost function for robust control consisting of a linear combination of quadratic objectives for deterministic and random disturbances, and one representing an upper bound on the quadratic objective for worst case initial conditions. Finally, a framework for multivariable control synthesis has been developed combining the concept of closed-loop transfer recovery with numerical parameter optimization. The procedure enables designers to synthesize not only observer-based controllers but also controllers of arbitrary order and structure. Numerical design solutions rely heavily on the robust algorithm due to the high order of the synthesis model and the presence of near-overlapping modes. The design approach is successfully applied to the design of a high-bandwidth control system for a rotorcraft.

  18. Optimized Dynamical Decoupling via Genetic Algorithms

    E-print Network

    Gregory Quiroz; Daniel A. Lidar

    2013-08-07

    We utilize genetic algorithms to find optimal dynamical decoupling (DD) sequences for a single-qubit system subjected to a general decoherence model under a variety of control pulse conditions. We focus on the case of sequences with equal pulse-intervals and perform the optimization with respect to pulse type and order. In this manner we obtain robust DD sequences, first in the limit of ideal pulses, then when including pulse imperfections such as finite pulse duration and qubit rotation (flip-angle) errors. Although our optimization is numerical, we identify a deterministic structure underlies the top-performing sequences. We use this structure to devise DD sequences which outperform previously designed concatenated DD (CDD) and quadratic DD (QDD) sequences in the presence of pulse errors. We explain our findings using time-dependent perturbation theory and provide a detailed scaling analysis of the optimal sequences.

  19. Heuristic Kalman algorithm for solving optimization problems.

    PubMed

    Toscano, Rosario; Lyonnet, Patrick

    2009-10-01

    The main objective of this paper is to present a new optimization approach, which we call heuristic Kalman algorithm (HKA). We propose it as a viable approach for solving continuous nonconvex optimization problems. The principle of the proposed approach is to consider explicitly the optimization problem as a measurement process designed to produce an estimate of the optimum. A specific procedure, based on the Kalman method, was developed to improve the quality of the estimate obtained through the measurement process. The efficiency of HKA is evaluated in detail through several nonconvex test problems, both in the unconstrained and constrained cases. The results are then compared to those obtained via other metaheuristics. These various numerical experiments show that the HKA has very interesting potentialities for solving nonconvex optimization problems, notably concerning the computation time and the success ratio. PMID:19336312

  20. An efficient and robust grid optimization algorithm

    NASA Technical Reports Server (NTRS)

    Soni, Bharat K.; Yang, Shaochen

    1992-01-01

    The development of an efficient and robust grid optimization is presented. This algorithm is developed by combining the best characteristics of algebraic, elliptic, and hyperbolic grid generation techniques. This development is based on the following observations and evaluations: (1) algebraic systems are fast and economical; (2) precise spacing control is always achieved; (3) grid generation by elliptic systems is always smooth; and (4) the hyperbolic system preserves the orthogonality at the solid boundary and the point distribution in the field. Computational examples representing practical internal flow configurations are presented to demonstrate the algorithm.

  1. Learning Computer Programs with the Bayesian Optimization Algorithm

    E-print Network

    Fernandez, Thomas

    of the Bayesian Optimization Algorithm (BOA), a probabilistic model building genetic algorithm, to the domain of program tree evolution. The new system, BOA programming (BOAP), improves significantly on previous algorithms, such as the (hierarchical) Bayesian Optimization Algorithm (BOA) [6]. BOA is asymptotically more

  2. A Genetic Algorithm for Minimax Optimization Problems Jeffrey W. Herrmann

    E-print Network

    Herrmann, Jeffrey W.

    A Genetic Algorithm for Minimax Optimization Problems Jeffrey W. Herrmann Department of Mechanical-space genetic algorithm as a general technique to solve minimax optimization problems. This algorithm maintains of applications. To illustrate its potential, we use the two-space genetic algorithm to solve a parallel machine

  3. Intelligent perturbation algorithms for space scheduling optimization

    NASA Technical Reports Server (NTRS)

    Kurtzman, Clifford R.

    1990-01-01

    The optimization of space operations is examined in the light of optimization heuristics for computer algorithms and iterative search techniques. Specific attention is given to the search concepts known collectively as intelligent perturbation algorithms (IPAs) and their application to crew/resource allocation problems. IPAs iteratively examine successive schedules which become progressively more efficient, and the characteristics of good perturbation operators are listed. IPAs can be applied to aerospace systems to efficiently utilize crews, payloads, and resources in the context of systems such as Space-Station scheduling. A program is presented called the MFIVE Space Station Scheduling Worksheet which generates task assignments and resource usage structures. The IPAs can be used to develop flexible manifesting and scheduling for the Industrial Space Facility.

  4. Machining fixture layout optimization using particle swarm optimization algorithm

    NASA Astrophysics Data System (ADS)

    Dou, Jianping; Wang, Xingsong; Wang, Lei

    2010-12-01

    Optimization of fixture layout (locator and clamp locations) is critical to reduce geometric error of the workpiece during machining process. In this paper, the application of particle swarm optimization (PSO) algorithm is presented to minimize the workpiece deformation in the machining region. A PSO based approach is developed to optimize fixture layout through integrating ANSYS parametric design language (APDL) of finite element analysis to compute the objective function for a given fixture layout. Particle library approach is used to decrease the total computation time. The computational experiment of 2D case shows that the numbers of function evaluations are decreased about 96%. Case study illustrates the effectiveness and efficiency of the PSO based optimization approach.

  5. Machining fixture layout optimization using particle swarm optimization algorithm

    NASA Astrophysics Data System (ADS)

    Dou, Jianping; Wang, Xingsong; Wang, Lei

    2011-05-01

    Optimization of fixture layout (locator and clamp locations) is critical to reduce geometric error of the workpiece during machining process. In this paper, the application of particle swarm optimization (PSO) algorithm is presented to minimize the workpiece deformation in the machining region. A PSO based approach is developed to optimize fixture layout through integrating ANSYS parametric design language (APDL) of finite element analysis to compute the objective function for a given fixture layout. Particle library approach is used to decrease the total computation time. The computational experiment of 2D case shows that the numbers of function evaluations are decreased about 96%. Case study illustrates the effectiveness and efficiency of the PSO based optimization approach.

  6. Convex Programming Tools for Disjunctive Programs

    E-print Network

    Soares, João Luís Cardoso

    region is the con- vex hull of the union of convex sets. The objective function is also convex conceptualizing a Branch-and-cut algorithm for mixed-integer convex programming. 1 Introduction The processConvex Programming Tools for Disjunctive Programs Jo~ao Soares, Departamento de Matem

  7. Multidisciplinary design optimization using genetic algorithms

    NASA Technical Reports Server (NTRS)

    Unal, Resit

    1994-01-01

    Multidisciplinary design optimization (MDO) is an important step in the conceptual design and evaluation of launch vehicles since it can have a significant impact on performance and life cycle cost. The objective is to search the system design space to determine values of design variables that optimize the performance characteristic subject to system constraints. Gradient-based optimization routines have been used extensively for aerospace design optimization. However, one limitation of gradient based optimizers is their need for gradient information. Therefore, design problems which include discrete variables can not be studied. Such problems are common in launch vehicle design. For example, the number of engines and material choices must be integer values or assume only a few discrete values. In this study, genetic algorithms are investigated as an approach to MDO problems involving discrete variables and discontinuous domains. Optimization by genetic algorithms (GA) uses a search procedure which is fundamentally different from those gradient based methods. Genetic algorithms seek to find good solutions in an efficient and timely manner rather than finding the best solution. GA are designed to mimic evolutionary selection. A population of candidate designs is evaluated at each iteration, and each individual's probability of reproduction (existence in the next generation) depends on its fitness value (related to the value of the objective function). Progress toward the optimum is achieved by the crossover and mutation operations. GA is attractive since it uses only objective function values in the search process, so gradient calculations are avoided. Hence, GA are able to deal with discrete variables. Studies report success in the use of GA for aircraft design optimization studies, trajectory analysis, space structure design and control systems design. In these studies reliable convergence was achieved, but the number of function evaluations was large compared with efficient gradient methods. Applicaiton of GA is underway for a cost optimization study for a launch-vehicle fuel-tank and structural design of a wing. The strengths and limitations of GA for launch vehicle design optimization is studied.

  8. Algorithms for optimizing CT fluence control

    NASA Astrophysics Data System (ADS)

    Hsieh, Scott S.; Pelc, Norbert J.

    2014-03-01

    The ability to customize the incident x-ray fluence in CT via beam-shaping filters or mA modulation is known to improve image quality and/or reduce radiation dose. Previous work has shown that complete control of x-ray fluence (ray-by-ray fluence modulation) would further improve dose efficiency. While complete control of fluence is not currently possible, emerging concepts such as dynamic attenuators and inverse-geometry CT allow nearly complete control to be realized. Optimally using ray-by-ray fluence modulation requires solving a very high-dimensional optimization problem. Most optimization techniques fail or only provide approximate solutions. We present efficient algorithms for minimizing mean or peak variance given a fixed dose limit. The reductions in variance can easily be translated to reduction in dose, if the original variance met image quality requirements. For mean variance, a closed form solution is derived. The peak variance problem is recast as iterated, weighted mean variance minimization, and at each iteration it is possible to bound the distance to the optimal solution. We apply our algorithms in simulations of scans of the thorax and abdomen. Peak variance reductions of 45% and 65% are demonstrated in the abdomen and thorax, respectively, compared to a bowtie filter alone. Mean variance shows smaller gains (about 15%).

  9. A new algorithm for general multiobjective optimization

    NASA Technical Reports Server (NTRS)

    Sobieszczanski-Sobieski, Jaroslaw; Dovi, Augustine R.; Wrenn, Gregory A.

    1988-01-01

    The paper describes a new technique for converting a constrained optimization problem to an unconstrained one, and a new method for multiobjective optimization based on that technique. The technique transforms the objective functions into goal constraints. The goal constraints are appended to the set of behavior constraints, and the envelope of all functions in the set is searched for an unconstrained minimum. The technique can be categorized as a SUMT algorithm. In multiobjective applications, the approach has the advantage of locating a compromise minimum without the need to optimize for each individual objective function separately. The constrained to unconstrained conversion is described, followed by a description of the multiobjective problem. Two example problems are presented to demonstrate the robustness of the method.

  10. A new algorithm for general multiobjective optimization

    NASA Technical Reports Server (NTRS)

    Sobieszczanski-Sobieski, Jaroslaw; Dovi, Augustine R.; Wrenn, Gregory A.

    1988-01-01

    Described is a new technique for converting a constrained optimization problem to an unconstrained one, and a new method for multiobjective optimization based on that technique. The technique transforms the objective functions into goal constraints. The goal constraints are appended to the set of behavior constraints and the envelope of all functions in the set is searched for an unconstrained minimum. The technique may be categorized as a SUMT algorithm. In multiobjective applications, the approach has the advantage of locating a compromise minimum without the need to optimize for each individual objective function separately. The constrained to unconstrained conversion is described, followed by a description of the multiobjective problem. Two example problems are presented to demonstrate the robustness of the method.

  11. Bell-Curve Based Evolutionary Optimization Algorithm

    NASA Technical Reports Server (NTRS)

    Sobieszczanski-Sobieski, J.; Laba, K.; Kincaid, R.

    1998-01-01

    The paper presents an optimization algorithm that falls in the category of genetic, or evolutionary algorithms. While the bit exchange is the basis of most of the Genetic Algorithms (GA) in research and applications in America, some alternatives, also in the category of evolutionary algorithms, but use a direct, geometrical approach have gained popularity in Europe and Asia. The Bell-Curve Based Evolutionary Algorithm (BCB) is in this alternative category and is distinguished by the use of a combination of n-dimensional geometry and the normal distribution, the bell-curve, in the generation of the offspring. The tool for creating a child is a geometrical construct comprising a line connecting two parents and a weighted point on that line. The point that defines the child deviates from the weighted point in two directions: parallel and orthogonal to the connecting line, the deviation in each direction obeying a probabilistic distribution. Tests showed satisfactory performance of BCB. The principal advantage of BCB is its controllability via the normal distribution parameters and the geometrical construct variables.

  12. Intervals in evolutionary algorithms for global optimization

    SciTech Connect

    Patil, R.B.

    1995-05-01

    Optimization is of central concern to a number of disciplines. Interval Arithmetic methods for global optimization provide us with (guaranteed) verified results. These methods are mainly restricted to the classes of objective functions that are twice differentiable and use a simple strategy of eliminating a splitting larger regions of search space in the global optimization process. An efficient approach that combines the efficient strategy from Interval Global Optimization Methods and robustness of the Evolutionary Algorithms is proposed. In the proposed approach, search begins with randomly created interval vectors with interval widths equal to the whole domain. Before the beginning of the evolutionary process, fitness of these interval parameter vectors is defined by evaluating the objective function at the center of the initial interval vectors. In the subsequent evolutionary process the local optimization process returns an estimate of the bounds of the objective function over the interval vectors. Though these bounds may not be correct at the beginning due to large interval widths and complicated function properties, the process of reducing interval widths over time and a selection approach similar to simulated annealing helps in estimating reasonably correct bounds as the population evolves. The interval parameter vectors at these estimated bounds (local optima) are then subjected to crossover and mutation operators. This evolutionary process continues for predetermined number of generations in the search of the global optimum.

  13. Convex Hull Problems The construction of convex hulls is perhaps the oldest and beststudied problems

    E-print Network

    Erickson, Jeff

    , 136, 142]. Over twenty years ago, Graham described an algorithm that constructs the convex hull of n] described an algorithm that constructs convex hulls in time O(nf), where f is the number of facets on which current convex hull algorithms perform quite badly, sometimes requiring exponential time (in d

  14. Towards a Genetic Algorithm for Function Optimization Sonja Novkovic

    E-print Network

    Towards a Genetic Algorithm for Function Optimization Sonja Novkovic and Davor Sverko Abstract: This article analyses a version of genetic algorithm (GA, Holland 1975) designed for function optimization, such as non-coding segments, elitist selection and multiple crossover. Key words: Genetic algorithm, Royal

  15. USE OF GENETIC ALGORITHMS FOR OPTIMAL INVESTMENT STRATEGIES

    E-print Network

    Brennand, Tracy

    USE OF GENETIC ALGORITHMS FOR OPTIMAL INVESTMENT STRATEGIES by Fan Zhang B.Ec., RenMin University;APPROVAL Name: Fan Zhang Degree: Master of Science Title of Project: Use of Genetic Algorithms for Optimal Approved: ii #12;Abstract In this project, a genetic algorithm (GA) is used in the development

  16. Genetic Algorithms for Combinatorial Optimization: The Assembly Line Balancing Problem

    E-print Network

    Ferris, Michael C.

    Genetic Algorithms for Combinatorial Optimization: The Assembly Line Balancing Problem Edward J optimization. We consider the application of the genetic algorithm to a particular problem, the Assembly Line Balancing Problem. A general description of genetic algorithms is given, and their specialized use on our

  17. Lunar Habitat Optimization Using Genetic Algorithms

    NASA Technical Reports Server (NTRS)

    SanScoucie, M. P.; Hull, P. V.; Tinker, M. L.; Dozier, G. V.

    2007-01-01

    Long-duration surface missions to the Moon and Mars will require bases to accommodate habitats for the astronauts. Transporting the materials and equipment required to build the necessary habitats is costly and difficult. The materials chosen for the habitat walls play a direct role in protection against each of the mentioned hazards. Choosing the best materials, their configuration, and the amount required is extremely difficult due to the immense size of the design region. Clearly, an optimization method is warranted for habitat wall design. Standard optimization techniques are not suitable for problems with such large search spaces; therefore, a habitat wall design tool utilizing genetic algorithms (GAs) has been developed. GAs use a "survival of the fittest" philosophy where the most fit individuals are more likely to survive and reproduce. This habitat design optimization tool is a multiobjective formulation of up-mass, heat loss, structural analysis, meteoroid impact protection, and radiation protection. This Technical Publication presents the research and development of this tool as well as a technique for finding the optimal GA search parameters.

  18. Instrument design and optimization using genetic algorithms

    SciTech Connect

    Hoelzel, Robert; Bentley, Phillip M.; Fouquet, Peter

    2006-10-15

    This article describes the design of highly complex physical instruments by using a canonical genetic algorithm (GA). The procedure can be applied to all instrument designs where performance goals can be quantified. It is particularly suited to the optimization of instrument design where local optima in the performance figure of merit are prevalent. Here, a GA is used to evolve the design of the neutron spin-echo spectrometer WASP which is presently being constructed at the Institut Laue-Langevin, Grenoble, France. A comparison is made between this artificial intelligence approach and the traditional manual design methods. We demonstrate that the search of parameter space is more efficient when applying the genetic algorithm, and the GA produces a significantly better instrument design. Furthermore, it is found that the GA increases flexibility, by facilitating the reoptimization of the design after changes in boundary conditions during the design phase. The GA also allows the exploration of 'nonstandard' magnet coil geometries. We conclude that this technique constitutes a powerful complementary tool for the design and optimization of complex scientific apparatus, without replacing the careful thought processes employed in traditional design methods.

  19. Harmonic Optimization of Multilevel Converters Using Genetic Algorithms Abstract--In this paper, a genetic algorithm (GA) optimization

    E-print Network

    Tolbert, Leon M.

    Harmonic Optimization of Multilevel Converters Using Genetic Algorithms Abstract-- In this paper, a genetic algorithm (GA) optimization technique is applied to multilevel inverter to determine optimum. In this paper, a general genetic algorithm (GA) approach will be presented, which solves the same problem

  20. Optimal quantum algorithm for polynomial interpolation

    E-print Network

    Andrew M. Childs; Wim van Dam; Shih-Han Hung; Igor E. Shparlinski

    2015-09-30

    We consider the number of quantum queries required to determine the coefficients of a degree-d polynomial over GF(q). A lower bound shown independently by Kane and Kutin and by Meyer and Pommersheim shows that d/2+1/2 quantum queries are needed to solve this problem with bounded error, whereas an algorithm of Boneh and Zhandry shows that d quantum queries are sufficient. We show that the lower bound is achievable: d/2+1/2 quantum queries suffice to determine the polynomial with bounded error. Furthermore, we show that d/2+1 queries suffice to achieve probability approaching 1 for large q. These upper bounds improve results of Boneh and Zhandry on the insecurity of cryptographic protocols against quantum attacks. We also show that our algorithm's success probability as a function of the number of queries is precisely optimal. Furthermore, the algorithm can be implemented with gate complexity poly(log q) with negligible decrease in the success probability.

  1. Optimality of the neighbor joining algorithm and faces of the balanced minimum evolution polytope.

    PubMed

    Haws, David C; Hodge, Terrell L; Yoshida, Ruriko

    2011-11-01

    Balanced minimum evolution (BME) is a statistically consistent distance-based method to reconstruct a phylogenetic tree from an alignment of molecular data. In 2000, Pauplin showed that the BME method is equivalent to optimizing a linear functional over the BME polytope, the convex hull of the BME vectors obtained from Pauplin's formula applied to all binary trees. The BME method is related to the Neighbor Joining (NJ) Algorithm, now known to be a greedy optimization of the BME principle. Further, the NJ and BME algorithms have been studied previously to understand when the NJ Algorithm returns a BME tree for small numbers of taxa. In this paper we aim to elucidate the structure of the BME polytope and strengthen knowledge of the connection between the BME method and NJ Algorithm. We first prove that any subtree-prune-regraft move from a binary tree to another binary tree corresponds to an edge of the BME polytope. Moreover, we describe an entire family of faces parameterized by disjoint clades. We show that these clade-faces are smaller dimensional BME polytopes themselves. Finally, we show that for any order of joining nodes to form a tree, there exists an associated distance matrix (i.e., dissimilarity map) for which the NJ Algorithm returns the BME tree. More strongly, we show that the BME cone and every NJ cone associated to a tree T have an intersection of positive measure. PMID:21373975

  2. Modified artificial bee colony algorithm for reactive power optimization

    NASA Astrophysics Data System (ADS)

    Sulaiman, Noorazliza; Mohamad-Saleh, Junita; Abro, Abdul Ghani

    2015-05-01

    Bio-inspired algorithms (BIAs) implemented to solve various optimization problems have shown promising results which are very important in this severely complex real-world. Artificial Bee Colony (ABC) algorithm, a kind of BIAs has demonstrated tremendous results as compared to other optimization algorithms. This paper presents a new modified ABC algorithm referred to as JA-ABC3 with the aim to enhance convergence speed and avoid premature convergence. The proposed algorithm has been simulated on ten commonly used benchmarks functions. Its performance has also been compared with other existing ABC variants. To justify its robust applicability, the proposed algorithm has been tested to solve Reactive Power Optimization problem. The results have shown that the proposed algorithm has superior performance to other existing ABC variants e.g. GABC, BABC1, BABC2, BsfABC dan IABC in terms of convergence speed. Furthermore, the proposed algorithm has also demonstrated excellence performance in solving Reactive Power Optimization problem.

  3. The Use of Genetic Algorithms in Multilayer Mirror Optimization

    E-print Network

    Hart, Gus

    The Use of Genetic Algorithms in Multilayer Mirror Optimization by Shannon Lunt March 1999 of the Chromosomes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 6 Flow chart of the Genetic Algorithm.7 Outline . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 2 Genetic

  4. Optimal Pid Controller Design Using Adaptive Vurpso Algorithm

    NASA Astrophysics Data System (ADS)

    Zirkohi, Majid Moradi

    2015-04-01

    The purpose of this paper is to improve theVelocity Update Relaxation Particle Swarm Optimization algorithm (VURPSO). The improved algorithm is called Adaptive VURPSO (AVURPSO) algorithm. Then, an optimal design of a Proportional-Integral-Derivative (PID) controller is obtained using the AVURPSO algorithm. An adaptive momentum factor is used to regulate a trade-off between the global and the local exploration abilities in the proposed algorithm. This operation helps the system to reach the optimal solution quickly and saves the computation time. Comparisons on the optimal PID controller design confirm the superiority of AVURPSO algorithm to the optimization algorithms mentioned in this paper namely the VURPSO algorithm, the Ant Colony algorithm, and the conventional approach. Comparisons on the speed of convergence confirm that the proposed algorithm has a faster convergence in a less computation time to yield a global optimum value. The proposed AVURPSO can be used in the diverse areas of optimization problems such as industrial planning, resource allocation, scheduling, decision making, pattern recognition and machine learning. The proposed AVURPSO algorithm is efficiently used to design an optimal PID controller.

  5. Expedite Particle Swarm Optimization Algorithm (EPSO) for Optimization of MSA

    NASA Astrophysics Data System (ADS)

    Rathi, Amit; Vijay, Ritu

    This paper presents a new designing method of Rectangular patch Microstrip Antenna using an Artificial searches Algorithm with some constraints. It requires two stages for designing. In first stage, bandwidth of MSA is modeled using bench Mark function. In second stage, output of first stage give to modified Artificial search Algorithm which is Particle Swarm Algorithm (PSO) as input and get output in the form of five parameter- dimensions width, frequency range, dielectric loss tangent, length over a ground plane with a substrate thickness and electrical thickness. In PSO Cognition, factor and Social learning Factor give very important effect on balancing the local search and global search in PSO. Basing the modification of cognition factor and social learning factor, this paper presents the strategy that at the starting process cognition-learning factor has more effect then social learning factor. Gradually social learning factor has more impact after learning cognition factor for find out global best. The aim is to find out under above circumstances these modifications in PSO can give better result for optimization of microstrip Antenna (MSA).

  6. Improved hybrid optimization algorithm for 3D protein structure prediction.

    PubMed

    Zhou, Changjun; Hou, Caixia; Wei, Xiaopeng; Zhang, Qiang

    2014-07-01

    A new improved hybrid optimization algorithm - PGATS algorithm, which is based on toy off-lattice model, is presented for dealing with three-dimensional protein structure prediction problems. The algorithm combines the particle swarm optimization (PSO), genetic algorithm (GA), and tabu search (TS) algorithms. Otherwise, we also take some different improved strategies. The factor of stochastic disturbance is joined in the particle swarm optimization to improve the search ability; the operations of crossover and mutation that are in the genetic algorithm are changed to a kind of random liner method; at last tabu search algorithm is improved by appending a mutation operator. Through the combination of a variety of strategies and algorithms, the protein structure prediction (PSP) in a 3D off-lattice model is achieved. The PSP problem is an NP-hard problem, but the problem can be attributed to a global optimization problem of multi-extremum and multi-parameters. This is the theoretical principle of the hybrid optimization algorithm that is proposed in this paper. The algorithm combines local search and global search, which overcomes the shortcoming of a single algorithm, giving full play to the advantage of each algorithm. In the current universal standard sequences, Fibonacci sequences and real protein sequences are certified. Experiments show that the proposed new method outperforms single algorithms on the accuracy of calculating the protein sequence energy value, which is proved to be an effective way to predict the structure of proteins. PMID:25069136

  7. Bayesian nonparametric multivariate convex regression

    E-print Network

    Hannah, Lauren A

    2011-01-01

    In many applications, such as economics, operations research and reinforcement learning, one often needs to estimate a multivariate regression function f subject to a convexity constraint. For example, in sequential decision processes the value of a state under optimal subsequent decisions may be known to be convex or concave. We propose a new Bayesian nonparametric multivariate approach based on characterizing the unknown regression function as the max of a random collection of unknown hyperplanes. This specification induces a prior with large support in a Kullback-Leibler sense on the space of convex functions, while also leading to strong posterior consistency. Although we assume that f is defined over R^p, we show that this model has a convergence rate of log(n)^{-1} n^{-1/(d+2)} under the empirical L2 norm when f actually maps a d dimensional linear subspace to R. We design an efficient reversible jump MCMC algorithm for posterior computation and demonstrate the methods through application to value funct...

  8. PDE Nozzle Optimization Using a Genetic Algorithm

    NASA Technical Reports Server (NTRS)

    Billings, Dana; Turner, James E. (Technical Monitor)

    2000-01-01

    Genetic algorithms, which simulate evolution in natural systems, have been used to find solutions to optimization problems that seem intractable to standard approaches. In this study, the feasibility of using a GA to find an optimum, fixed profile nozzle for a pulse detonation engine (PDE) is demonstrated. The objective was to maximize impulse during the detonation wave passage and blow-down phases of operation. Impulse of each profile variant was obtained by using the CFD code Mozart/2.0 to simulate the transient flow. After 7 generations, the method has identified a nozzle profile that certainly is a candidate for optimum solution. The constraints on the generality of this possible solution remain to be clarified.

  9. Honey Bees Inspired Optimization Method: The Bees Algorithm

    PubMed Central

    Yuce, Baris; Packianather, Michael S.; Mastrocinque, Ernesto; Pham, Duc Truong; Lambiase, Alfredo

    2013-01-01

    Optimization algorithms are search methods where the goal is to find an optimal solution to a problem, in order to satisfy one or more objective functions, possibly subject to a set of constraints. Studies of social animals and social insects have resulted in a number of computational models of swarm intelligence. Within these swarms their collective behavior is usually very complex. The collective behavior of a swarm of social organisms emerges from the behaviors of the individuals of that swarm. Researchers have developed computational optimization methods based on biology such as Genetic Algorithms, Particle Swarm Optimization, and Ant Colony. The aim of this paper is to describe an optimization algorithm called the Bees Algorithm, inspired from the natural foraging behavior of honey bees, to find the optimal solution. The algorithm performs both an exploitative neighborhood search combined with random explorative search. In this paper, after an explanation of the natural foraging behavior of honey bees, the basic Bees Algorithm and its improved versions are described and are implemented in order to optimize several benchmark functions, and the results are compared with those obtained with different optimization algorithms. The results show that the Bees Algorithm offering some advantage over other optimization methods according to the nature of the problem. PMID:26462528

  10. Honey Bees Inspired Optimization Method: The Bees Algorithm.

    PubMed

    Yuce, Baris; Packianather, Michael S; Mastrocinque, Ernesto; Pham, Duc Truong; Lambiase, Alfredo

    2013-01-01

    Optimization algorithms are search methods where the goal is to find an optimal solution to a problem, in order to satisfy one or more objective functions, possibly subject to a set of constraints. Studies of social animals and social insects have resulted in a number of computational models of swarm intelligence. Within these swarms their collective behavior is usually very complex. The collective behavior of a swarm of social organisms emerges from the behaviors of the individuals of that swarm. Researchers have developed computational optimization methods based on biology such as Genetic Algorithms, Particle Swarm Optimization, and Ant Colony. The aim of this paper is to describe an optimization algorithm called the Bees Algorithm, inspired from the natural foraging behavior of honey bees, to find the optimal solution. The algorithm performs both an exploitative neighborhood search combined with random explorative search. In this paper, after an explanation of the natural foraging behavior of honey bees, the basic Bees Algorithm and its improved versions are described and are implemented in order to optimize several benchmark functions, and the results are compared with those obtained with different optimization algorithms. The results show that the Bees Algorithm offering some advantage over other optimization methods according to the nature of the problem. PMID:26462528

  11. Automated segmentation of CBCT image using spiral CT atlases and convex optimization.

    PubMed

    Wang, Li; Chen, Ken Chung; Shi, Feng; Liao, Shu; Li, Gang; Gao, Yaozong; Shen, Steve G F; Yan, Jin; Lee, Philip K M; Chow, Ben; Liu, Nancy X; Xia, James J; Shen, Dinggang

    2013-01-01

    Cone-beam computed tomography (CBCT) is an increasingly utilized imaging modality for the diagnosis and treatment planning of the patients with craniomaxillofacial (CMF) deformities. CBCT scans have relatively low cost and low radiation dose in comparison to conventional spiral CT scans. However, a major limitation of CBCT scans is the widespread image artifacts such as noise, beam hardening and inhomogeneity, causing great difficulties for accurate segmentation of bony structures from soft tissues, as well as separating mandible from maxilla. In this paper, we presented a novel fully automated method for CBCT image segmentation. In this method, we first estimated a patient-specific atlas using a sparse label fusion strategy from predefined spiral CT atlases. This patient-specific atlas was then integrated into a convex segmentation framework based on maximum a posteriori probability for accurate segmentation. Finally, the performance of our method was validated via comparisons with manual ground-truth segmentations. PMID:24505768

  12. On convexity of H-infinity Riccati solutions

    NASA Technical Reports Server (NTRS)

    Li, X. P.; Chang, B. C.

    1991-01-01

    The authors revealed several important eigen properties of the stabilizing solutions of the two H-infinity Riccati equations and their product. Among them, the most prominent one is that the spectral radius of the product of these two Riccati solutions is a continuous, nonincreasing, convex function of gamma in the domain of interest. Based on these properties, quadratically convergent algorithms are developed to compute the optimal H-infinity norm. Two examples are used to illustrate the algorithms.

  13. Genetic Algorithms Applied to Multi-Objective Aerodynamic Shape Optimization

    NASA Technical Reports Server (NTRS)

    Holst, Terry L.

    2004-01-01

    A genetic algorithm approach suitable for solving multi-objective optimization problems is described and evaluated using a series of aerodynamic shape optimization problems. Several new features including two variations of a binning selection algorithm and a gene-space transformation procedure are included. The genetic algorithm is suitable for finding pareto optimal solutions in search spaces that are defined by any number of genes and that contain any number of local extrema. A new masking array capability is included allowing any gene or gene subset to be eliminated as decision variables from the design space. This allows determination of the effect of a single gene or gene subset on the pareto optimal solution. Results indicate that the genetic algorithm optimization approach is flexible in application and reliable. The binning selection algorithms generally provide pareto front quality enhancements and moderate convergence efficiency improvements for most of the problems solved.

  14. COMBINATIONAL LOGIC CIRCUITS DESIGN THROUGH ANT COLONY OPTIMIZATION ALGORITHM

    E-print Network

    Al-Saiari, Uthman

    based on a modified Ant Colony (ACO) algorithm is presented. The re- sults obtained using the proposed. The first work in evolutionary design of digital circuits, Designer Genetic Algorithms (DGA), was proposed problems. Unlike Genetic Algorithms (GAs), which is a blind search heuristic, ACO is an optimization of co

  15. HEURISTIC OPTIMIZATION AND ALGORITHM TUNING APPLIED TO SORPTIVE BARRIER DESIGN

    EPA Science Inventory

    While heuristic optimization is applied in environmental applications, ad-hoc algorithm configuration is typical. We use a multi-layer sorptive barrier design problem as a benchmark for an algorithm-tuning procedure, as applied to three heuristics (genetic algorithms, simulated ...

  16. Engineering local optimality in quantum Monte Carlo algorithms

    SciTech Connect

    Pollet, Lode . E-mail: pollet@itp.phys.ethz.ch; Houcke, Kris Van; Rombouts, Stefan M.A.

    2007-08-10

    Quantum Monte Carlo algorithms based on a world-line representation such as the worm algorithm and the directed loop algorithm are among the most powerful numerical techniques for the simulation of non-frustrated spin models and of bosonic models. Both algorithms work in the grand-canonical ensemble and can have a winding number larger than zero. However, they retain a lot of intrinsic degrees of freedom which can be used to optimize the algorithm. We let us guide by the rigorous statements on the globally optimal form of Markov chain Monte Carlo simulations in order to devise a locally optimal formulation of the worm algorithm while incorporating ideas from the directed loop algorithm. We provide numerical examples for the soft-core Bose-Hubbard model and various spin-S models.

  17. An Improved Marriage in Honey Bees Optimization Algorithm for Single Objective Unconstrained Optimization

    PubMed Central

    Celik, Yuksel; Ulker, Erkan

    2013-01-01

    Marriage in honey bees optimization (MBO) is a metaheuristic optimization algorithm developed by inspiration of the mating and fertilization process of honey bees and is a kind of swarm intelligence optimizations. In this study we propose improved marriage in honey bees optimization (IMBO) by adding Levy flight algorithm for queen mating flight and neighboring for worker drone improving. The IMBO algorithm's performance and its success are tested on the well-known six unconstrained test functions and compared with other metaheuristic optimization algorithms. PMID:23935416

  18. An improved marriage in honey bees optimization algorithm for single objective unconstrained optimization.

    PubMed

    Celik, Yuksel; Ulker, Erkan

    2013-01-01

    Marriage in honey bees optimization (MBO) is a metaheuristic optimization algorithm developed by inspiration of the mating and fertilization process of honey bees and is a kind of swarm intelligence optimizations. In this study we propose improved marriage in honey bees optimization (IMBO) by adding Levy flight algorithm for queen mating flight and neighboring for worker drone improving. The IMBO algorithm's performance and its success are tested on the well-known six unconstrained test functions and compared with other metaheuristic optimization algorithms. PMID:23935416

  19. Transonic Wing Shape Optimization Using a Genetic Algorithm

    NASA Technical Reports Server (NTRS)

    Holst, Terry L.; Pulliam, Thomas H.; Kwak, Dochan (Technical Monitor)

    2002-01-01

    A method for aerodynamic shape optimization based on a genetic algorithm approach is demonstrated. The algorithm is coupled with a transonic full potential flow solver and is used to optimize the flow about transonic wings including multi-objective solutions that lead to the generation of pareto fronts. The results indicate that the genetic algorithm is easy to implement, flexible in application and extremely reliable.

  20. Genetic-Algorithm Tool For Search And Optimization

    NASA Technical Reports Server (NTRS)

    Wang, Lui; Bayer, Steven

    1995-01-01

    SPLICER computer program used to solve search and optimization problems. Genetic algorithms adaptive search procedures (i.e., problem-solving methods) based loosely on processes of natural selection and Darwinian "survival of fittest." Algorithms apply genetically inspired operators to populations of potential solutions in iterative fashion, creating new populations while searching for optimal or nearly optimal solution to problem at hand. Written in Think C.

  1. A New Optimized GA-RBF Neural Network Algorithm

    PubMed Central

    Zhao, Dean; Su, Chunyang; Hu, Chanli; Zhao, Yuyan

    2014-01-01

    When confronting the complex problems, radial basis function (RBF) neural network has the advantages of adaptive and self-learning ability, but it is difficult to determine the number of hidden layer neurons, and the weights learning ability from hidden layer to the output layer is low; these deficiencies easily lead to decreasing learning ability and recognition precision. Aiming at this problem, we propose a new optimized RBF neural network algorithm based on genetic algorithm (GA-RBF algorithm), which uses genetic algorithm to optimize the weights and structure of RBF neural network; it chooses new ways of hybrid encoding and optimizing simultaneously. Using the binary encoding encodes the number of the hidden layer's neurons and using real encoding encodes the connection weights. Hidden layer neurons number and connection weights are optimized simultaneously in the new algorithm. However, the connection weights optimization is not complete; we need to use least mean square (LMS) algorithm for further leaning, and finally get a new algorithm model. Using two UCI standard data sets to test the new algorithm, the results show that the new algorithm improves the operating efficiency in dealing with complex problems and also improves the recognition precision, which proves that the new algorithm is valid. PMID:25371666

  2. Model results of optimized convex shapes for a solar thermal rocket thruster

    SciTech Connect

    Cartier, S.L.

    1995-11-01

    A computational, 3-D model for evaluating the performance of solar thermal thrusters is under development. The model combines Monte-Carlo and ray-tracing techniques to follow the ray paths of concentrated solar radiation through an axially symmetric heat-exchanger surface for both convex and concave cavity shapes. The enthalpy of a propellant, typically hydrogen gas, increases as it flows over the outer surface of the absorber/exchanger cavity. Surface temperatures are determined by the requirement that the input radiant power to surface elements balance with the reradiated power and heat conducted to the propellant. The model uses tabulated forms of surface emissivity and gas enthalpy. Temperature profiles result by iteratively calculating surface and propellant temperatures until the solutions converge to stable values. The model provides a means to determine the effectiveness of incorporating a secondary concentrator into the heat-exchanger cavity. A secondary concentrator increases the amount of radiant energy entering the cavity. The model will be used to evaluate the data obtained from upcoming experiments. Characteristics of some absorber/exchanger cavity shapes combined with optionally attached conical secondary concentrators for various propellant flow rates are presented. In addition, shapes that recover some of the diffuse radiant energy which would otherwise not enter the secondary concentrator are considered.

  3. Pathwise Coordinate optimization

    E-print Network

    Friedman, Jerome Isaac; Hoefling, Holger; Tibshirani, Robert

    2007-01-01

    We consider ``one-at-a-time'' coordinate-wise descent algorithms for a class of convex optimization problems. An algorithm of this kind has been proposed for the L_1-penalized regression (lasso) in the lterature, but it seems to hav e been largely ignored. Indeed, it seems that coordinate-wise algorithms are not often used in convex optimization. We show that this algorithm is very competitive with the well known LARS (or hom otopy) procedure in large lasso problems, and that it can be applied to related methods such as t he garotte and elastic net. It turns out that coordinate-wise descent does not work in the ``fu sed lasso'' however, so we derive a generalized algorithm that yields the solution in much less time that a standard convex optimizer. Finally we generalize the procedure to the two-dimensional fused lasso, and demonstrate its performance on some image smoothing problems.

  4. CONVEX HULLS FOR RANDOM LINES Luc Devroye

    E-print Network

    Toussaint, Godfried T.

    (n), and they exhibited an O(n log n) time algorithm for computing such a convex hull. Let N ch and N ol be the number lead to an algorithm for computing the convex hull of I in O(n log n) worst­case time and O(n) expected to obtain O(n) critical points and subsequently find their convex hull with any O(n log n) algorithm. We

  5. Global Tree Optimization: A Nongreedy Decision Tree Algorithm

    E-print Network

    Mitchell, John E.

    Global Tree Optimization: A Non­greedy Decision Tree Algorithm Kristin P. Bennett Email bennek­greedy approach for constructing globally optimal multivariate decision trees with fixed structure is pro­ posed­ rion at each decision node, typically one node at a time. In contrast, global tree optimization

  6. An Iterative Global Optimization Algorithm for Potential Energy Minimization

    E-print Network

    An Iterative Global Optimization Algorithm for Potential Energy Minimization N. P. Moloi and M. M, potential energy, iterative, global optimization. 1 Introduction Potential energy functions are becoming and in structure-based drug design. These functions are often used as global optimization problems in search

  7. Algorithms for joint optimization of stability and diversity in planning combinatorial libraries of chimeric proteins.

    PubMed

    Zheng, Wei; Friedman, Alan M; Bailey-Kellogg, Chris

    2009-08-01

    In engineering protein variants by constructing and screening combinatorial libraries of chimeric proteins, two complementary and competing goals are desired: the new proteins must be similar enough to the evolutionarily-selected wild-type proteins to be stably folded, and they must be different enough to display functional variation. We present here the first method, Staversity, to simultaneously optimize stability and diversity in selecting sets of breakpoint locations for site-directed recombination. Our goal is to uncover all "undominated" breakpoint sets, for which no other breakpoint set is better in both factors. Our first algorithm finds the undominated sets serving as the vertices of the lower envelope of the two-dimensional (stability and diversity) convex hull containing all possible breakpoint sets. Our second algorithm identifies additional breakpoint sets in the concavities that are either undominated or dominated only by undiscovered breakpoint sets within a distance bound computed by the algorithm. Both algorithms are efficient, requiring only time polynomial in the numbers of residues and breakpoints, while characterizing a space defined by an exponential number of possible breakpoint sets. We applied Staversity to identify 2-10 breakpoint plans for different sets of parent proteins taken from the purE family, as well as for parent proteins TEM-1 and PSE-4 from the beta-lactamase family. The average normalized distance between our plans and the lower bound for optimal plans is around 2%. Our plans dominate most (60-90% on average for each parent set) of the plans found by other possible approaches, random sampling or explicit optimization for stability with implicit optimization for diversity. The identified breakpoint sets provide a compact representation of good plans, enabling a protein engineer to understand and account for the trade-offs between two key considerations in combinatorial chimeragenesis. PMID:19645597

  8. Genetic Algorithms Applied to Multi-Objective Aerodynamic Shape Optimization

    NASA Technical Reports Server (NTRS)

    Holst, Terry L.

    2005-01-01

    A genetic algorithm approach suitable for solving multi-objective problems is described and evaluated using a series of aerodynamic shape optimization problems. Several new features including two variations of a binning selection algorithm and a gene-space transformation procedure are included. The genetic algorithm is suitable for finding Pareto optimal solutions in search spaces that are defined by any number of genes and that contain any number of local extrema. A new masking array capability is included allowing any gene or gene subset to be eliminated as decision variables from the design space. This allows determination of the effect of a single gene or gene subset on the Pareto optimal solution. Results indicate that the genetic algorithm optimization approach is flexible in application and reliable. The binning selection algorithms generally provide Pareto front quality enhancements and moderate convergence efficiency improvements for most of the problems solved.

  9. Aalborg Universitet Dynamic Consensus Algorithm Based Distributed Global Efficiency Optimization of a

    E-print Network

    Vasquez, Juan Carlos

    Consensus Algorithm Based Distributed Global Efficiency Optimization of a Droop Controlled DC Microgrid Consensus Algorithm Based Distributed Global Efficiency Optimization of a Droop Controlled DC MicrogridAalborg Universitet Dynamic Consensus Algorithm Based Distributed Global Efficiency Optimization

  10. Global Multiobjective Optimization via Estimation of Distribution Algorithm with Biased Initialization and

    E-print Network

    Jin, Yaochu

    Global Multiobjective Optimization via Estimation of Distribution Algorithm with Biased initialization inserts several globally Pareto optimal solutions into the initial pop- ulation; biased crossover, and Search General Terms Algorithm Keywords estimation of distribution algorithm, global optimization

  11. Krill herd: A new bio-inspired optimization algorithm

    NASA Astrophysics Data System (ADS)

    Gandomi, Amir Hossein; Alavi, Amir Hossein

    2012-12-01

    In this paper, a novel biologically-inspired algorithm, namely krill herd (KH) is proposed for solving optimization tasks. The KH algorithm is based on the simulation of the herding behavior of krill individuals. The minimum distances of each individual krill from food and from highest density of the herd are considered as the objective function for the krill movement. The time-dependent position of the krill individuals is formulated by three main factors: (i) movement induced by the presence of other individuals (ii) foraging activity, and (iii) random diffusion. For more precise modeling of the krill behavior, two adaptive genetic operators are added to the algorithm. The proposed method is verified using several benchmark problems commonly used in the area of optimization. Further, the KH algorithm is compared with eight well-known methods in the literature. The KH algorithm is capable of efficiently solving a wide range of benchmark optimization problems and outperforms the exciting algorithms.

  12. The Minimum-Norm-Point Algorithm Applied to Submodular Function Minimization and

    E-print Network

    the convex hull ^P of P, and the algorithm works if the linear optimization can (efficiently) be done over] presented an algorithm for finding the minimum-norm point in the con- vex hull of a given finite set the polytope ^P. In the original problem setting by Wolfe [15] the polytope ^P is expressed as the convex hull

  13. Biology-Derived Algorithms in Engineering Optimization

    E-print Network

    Yang, Xin-She

    2010-01-01

    Biology-derived algorithms are an important part of computational sciences, which are essential to many scientific disciplines and engineering applications. Many computational methods are derived from or based on the analogy to natural evolution and biological activities, and these biologically inspired computations include genetic algorithms, neural networks, cellular automata, and other algorithms.

  14. A parallel Jacobson-Oksman optimization algorithm. [parallel processing (computers)

    NASA Technical Reports Server (NTRS)

    Straeter, T. A.; Markos, A. T.

    1975-01-01

    A gradient-dependent optimization technique which exploits the vector-streaming or parallel-computing capabilities of some modern computers is presented. The algorithm, derived by assuming that the function to be minimized is homogeneous, is a modification of the Jacobson-Oksman serial minimization method. In addition to describing the algorithm, conditions insuring the convergence of the iterates of the algorithm and the results of numerical experiments on a group of sample test functions are presented. The results of these experiments indicate that this algorithm will solve optimization problems in less computing time than conventional serial methods on machines having vector-streaming or parallel-computing capabilities.

  15. Two New PRP Conjugate Gradient Algorithms for Minimization Optimization Models

    PubMed Central

    Yuan, Gonglin; Duan, Xiabin; Liu, Wenjie; Wang, Xiaoliang; Cui, Zengru; Sheng, Zhou

    2015-01-01

    Two new PRP conjugate Algorithms are proposed in this paper based on two modified PRP conjugate gradient methods: the first algorithm is proposed for solving unconstrained optimization problems, and the second algorithm is proposed for solving nonlinear equations. The first method contains two aspects of information: function value and gradient value. The two methods both possess some good properties, as follows: 1)?k ? 0 2) the search direction has the trust region property without the use of any line search method 3) the search direction has sufficient descent property without the use of any line search method. Under some suitable conditions, we establish the global convergence of the two algorithms. We conduct numerical experiments to evaluate our algorithms. The numerical results indicate that the first algorithm is effective and competitive for solving unconstrained optimization problems and that the second algorithm is effective for solving large-scale nonlinear equations. PMID:26502409

  16. An Adaptive Unified Differential Evolution Algorithm for Global Optimization

    SciTech Connect

    Qiang, Ji; Mitchell, Chad

    2014-11-03

    In this paper, we propose a new adaptive unified differential evolution algorithm for single-objective global optimization. Instead of the multiple mutation strate- gies proposed in conventional differential evolution algorithms, this algorithm employs a single equation unifying multiple strategies into one expression. It has the virtue of mathematical simplicity and also provides users the flexibility for broader exploration of the space of mutation operators. By making all control parameters in the proposed algorithm self-adaptively evolve during the process of optimization, it frees the application users from the burden of choosing appro- priate control parameters and also improves the performance of the algorithm. In numerical tests using thirteen basic unimodal and multimodal functions, the proposed adaptive unified algorithm shows promising performance in compari- son to several conventional differential evolution algorithms.

  17. OUTPUTSENSITIVE CONSTRUCTION OF CONVEX HULLS TIMOTHY MOONYEW CHAN

    E-print Network

    Chan, Timothy M.

    in computational geometry. This thesis investigates efficient algorithms for the convex hull problem, where Convex Hull Algorithms : : : : : : : : : : : : : : : : : : : : : : 8 1.5 Results in This Thesis for divide and conquer : : : : : : : : : : : : : : : : : : : 36 3.2 A Prune­and­Divide Convex Hull Algorithm

  18. Fast Randomized Parallel Methods for Planar Convex Hull Construction \\Lambda

    E-print Network

    Goodrich, Michael T.

    parallel algorithms for constructing 2dimensional convex hulls on a randomized CRCW PRAM. Specifically, we in the convex hull (h is O(n), but can be as small as O(1)). Our algorithm for unsorted inputs depends in some cases, in that they give a 2dimensional convex hull algorithm that runs in O(n log h) time, where

  19. GPU accelerated Convex Hull Computation , Jie-yi Zhaoa

    E-print Network

    North Carolina at Chapel Hill, University of

    ://gamma.cs.unc.edu/ghull/ Abstract We present a hybrid algorithm to compute the convex hull of points in three or higher dimensionalForce GTX 580 and the hybrid algorithm improves the overall performance of convex hull computation by 10 algorithms have been proposed for parallel convex hull computation, there is relatively little work on fast

  20. Genetic algorithms for multicriteria shape optimization of induction furnace

    NASA Astrophysics Data System (ADS)

    K?s, Pavel; Mach, Frantiek; Karban, Pavel; Doleel, Ivo

    2012-09-01

    In this contribution we deal with a multi-criteria shape optimization of an induction furnace. We want to find shape parameters of the furnace in such a way, that two different criteria are optimized. Since they cannot be optimized simultaneously, instead of one optimum we find set of partially optimal designs, so called Pareto front. We compare two different approaches to the optimization, one using nonlinear conjugate gradient method and second using variation of genetic algorithm. As can be seen from the numerical results, genetic algorithm seems to be the right choice for this problem. Solution of direct problem (coupled problem consisting of magnetic and heat field) is done using our own code Agros2D. It uses finite elements of higher order leading to fast and accurate solution of relatively complicated coupled problem. It also provides advanced scripting support, allowing us to prepare parametric model of the furnace and simply incorporate various types of optimization algorithms.

  1. A hybrid artificial bee colony algorithm for numerical function optimization

    NASA Astrophysics Data System (ADS)

    Alqattan, Zakaria N.; Abdullah, Rosni

    2015-02-01

    Artificial Bee Colony (ABC) algorithm is one of the swarm intelligence algorithms; it has been introduced by Karaboga in 2005. It is a meta-heuristic optimization search algorithm inspired from the intelligent foraging behavior of the honey bees in nature. Its unique search process made it as one of the most competitive algorithm with some other search algorithms in the area of optimization, such as Genetic algorithm (GA) and Particle Swarm Optimization (PSO). However, the ABC performance of the local search process and the bee movement or the solution improvement equation still has some weaknesses. The ABC is good in avoiding trapping at the local optimum but it spends its time searching around unpromising random selected solutions. Inspired by the PSO, we propose a Hybrid Particle-movement ABC algorithm called HPABC, which adapts the particle movement process to improve the exploration of the original ABC algorithm. Numerical benchmark functions were used in order to experimentally test the HPABC algorithm. The results illustrate that the HPABC algorithm can outperform the ABC algorithm in most of the experiments (75% better in accuracy and over 3 times faster).

  2. A Modified BFGS Formula Using a Trust Region Model for Nonsmooth Convex Minimizations

    PubMed Central

    Cui, Zengru; Yuan, Gonglin; Sheng, Zhou; Liu, Wenjie; Wang, Xiaoliang; Duan, Xiabin

    2015-01-01

    This paper proposes a modified BFGS formula using a trust region model for solving nonsmooth convex minimizations by using the Moreau-Yosida regularization (smoothing) approach and a new secant equation with a BFGS update formula. Our algorithm uses the function value information and gradient value information to compute the Hessian. The Hessian matrix is updated by the BFGS formula rather than using second-order information of the function, thus decreasing the workload and time involved in the computation. Under suitable conditions, the algorithm converges globally to an optimal solution. Numerical results show that this algorithm can successfully solve nonsmooth unconstrained convex problems. PMID:26501775

  3. The Coral Reefs Optimization Algorithm: A Novel Metaheuristic for Efficiently Solving Optimization Problems

    PubMed Central

    Salcedo-Sanz, S.; Del Ser, J.; Landa-Torres, I.; Gil-Lpez, S.; Portilla-Figueras, J. A.

    2014-01-01

    This paper presents a novel bioinspired algorithm to tackle complex optimization problems: the coral reefs optimization (CRO) algorithm. The CRO algorithm artificially simulates a coral reef, where different corals (namely, solutions to the optimization problem considered) grow and reproduce in coral colonies, fighting by choking out other corals for space in the reef. This fight for space, along with the specific characteristics of the corals' reproduction, produces a robust metaheuristic algorithm shown to be powerful for solving hard optimization problems. In this research the CRO algorithm is tested in several continuous and discrete benchmark problems, as well as in practical application scenarios (i.e., optimum mobile network deployment and off-shore wind farm design). The obtained results confirm the excellent performance of the proposed algorithm and open line of research for further application of the algorithm to real-world problems. PMID:25147860

  4. Convex Hull Problems The construction of convex hulls is perhaps the oldest and best-studied problems

    E-print Network

    Erickson, Jeff

    , 136, 142]. Over twenty years ago, Graham described an algorithm that constructs the convex hull of n that constructs convex hulls in time O(nf), where f is the number of facets in the output. An algorithm of Chan, 12] describe families of polytopes on which current convex hull algorithms perform quite badly

  5. Artificial bee colony algorithm for constrained possibilistic portfolio optimization problem

    NASA Astrophysics Data System (ADS)

    Chen, Wei

    2015-07-01

    In this paper, we discuss the portfolio optimization problem with real-world constraints under the assumption that the returns of risky assets are fuzzy numbers. A new possibilistic mean-semiabsolute deviation model is proposed, in which transaction costs, cardinality and quantity constraints are considered. Due to such constraints the proposed model becomes a mixed integer nonlinear programming problem and traditional optimization methods fail to find the optimal solution efficiently. Thus, a modified artificial bee colony (MABC) algorithm is developed to solve the corresponding optimization problem. Finally, a numerical example is given to illustrate the effectiveness of the proposed model and the corresponding algorithm.

  6. Computing Covering Polyhedra of NonConvex Objects

    E-print Network

    Nyström, Ingela

    polyhedron is convex and is a good approximation of the convex hull of the object. The algorithm uses 3 hull, [6], and then subtracting the object from the hull. The convex hull is also interesting in itself. In many practical cases, an approximation of the convex hull is adequate. Approximations can be found

  7. PCB Drill Path Optimization by Combinatorial Cuckoo Search Algorithm

    PubMed Central

    Lim, Wei Chen Esmonde; Kanagaraj, G.; Ponnambalam, S. G.

    2014-01-01

    Optimization of drill path can lead to significant reduction in machining time which directly improves productivity of manufacturing systems. In a batch production of a large number of items to be drilled such as printed circuit boards (PCB), the travel time of the drilling device is a significant portion of the overall manufacturing process. To increase PCB manufacturing productivity and to reduce production costs, a good option is to minimize the drill path route using an optimization algorithm. This paper reports a combinatorial cuckoo search algorithm for solving drill path optimization problem. The performance of the proposed algorithm is tested and verified with three case studies from the literature. The computational experience conducted in this research indicates that the proposed algorithm is capable of efficiently finding the optimal path for PCB holes drilling process. PMID:24707198

  8. PCB drill path optimization by combinatorial cuckoo search algorithm.

    PubMed

    Lim, Wei Chen Esmonde; Kanagaraj, G; Ponnambalam, S G

    2014-01-01

    Optimization of drill path can lead to significant reduction in machining time which directly improves productivity of manufacturing systems. In a batch production of a large number of items to be drilled such as printed circuit boards (PCB), the travel time of the drilling device is a significant portion of the overall manufacturing process. To increase PCB manufacturing productivity and to reduce production costs, a good option is to minimize the drill path route using an optimization algorithm. This paper reports a combinatorial cuckoo search algorithm for solving drill path optimization problem. The performance of the proposed algorithm is tested and verified with three case studies from the literature. The computational experience conducted in this research indicates that the proposed algorithm is capable of efficiently finding the optimal path for PCB holes drilling process. PMID:24707198

  9. Bio-inspired optimization algorithms for smart antennas

    E-print Network

    Zuniga, Virgilio

    2011-11-22

    This thesis studies the effectiveness of bio-inspired optimization algorithms in controlling adaptive antenna arrays. Smart antennas are able to automatically extract the desired signal from interferer signals and external ...

  10. Genetic Algorithms applications to optimization and system identification

    E-print Network

    Lin, Yun-Jeng

    1998-01-01

    Genetic Algorithms (GA) are very different from the traditional optimization techniques. GA is a new generation of artificial intelligence and its principles mimic the behavior of the biologic genes in the natural world. Its execution is simple...

  11. Application of a gradient-based algorithm to structural optimization

    E-print Network

    Ghisbain, Pierre

    2009-01-01

    Optimization methods have shown to be efficient at improving structural design, but their use is limited in the engineering practice by the difficulty of adapting state-of-the-art algorithms to particular engineering ...

  12. EFFICIENT ALGORITHMS FOR THE OPTIMAL-RATIO REGION DETECTION PROBLEMS IN DISCRETE GEOMETRY WITH APPLICATIONS.

    PubMed

    Wu, Xiaodong

    2006-01-01

    In this paper, we study several interesting optimal-ratio region detection (ORD) problems in d-D (d ? 3) discrete geometric spaces, which arise in high dimensional medical image segmentation. Given a d-D voxel grid of n cells, two classes of geometric regions that are enclosed by a single or two coupled smooth heighfield surfaces defined on the entire grid domain are considered. The objective functions are normalized by a function of the desired regions, which avoids a bias to produce an overly large or small region resulting from data noise. The normalization functions that we employ are used in real medical image segmentation. To our best knowledge, no previous results on these problems in high dimensions are known. We develop a unified algorithmic framework based on a careful characterization of the intrinsic geometric structures and a nontrivial graph transformation scheme, yielding efficient polynomial time algorithms for solving these ORD problems. Our main ideas include the following. We observe that the optimal solution to the ORD problems can be obtained via the construction of a convex hull for a set of O(n) unknown 2-D points using the hand probing technique. The probing oracles are implemented by computing a minimum s-t cut in a weighted directed graph. The ORD problems are then solved by O(n) calls to the minimum s-t cut algorithm. For the class of regions bounded by a single heighfield surface, our further investigation shows that the O(n) calls to the minimum s-t cut algorithm are on a monotone parametric flow network, which enables to detect the optimal-ratio region in the complexity of computing a single maximum flow. PMID:25414538

  13. Parallel projected variable metric algorithms for unconstrained optimization

    NASA Technical Reports Server (NTRS)

    Freeman, T. L.

    1989-01-01

    The parallel variable metric optimization algorithms of Straeter (1973) and van Laarhoven (1985) are reviewed, and the possible drawbacks of the algorithms are noted. By including Davidon (1975) projections in the variable metric updating, researchers can generalize Straeter's algorithm to a family of parallel projected variable metric algorithms which do not suffer the above drawbacks and which retain quadratic termination. Finally researchers consider the numerical performance of one member of the family on several standard example problems and illustrate how the choice of the displacement vectors affects the performance of the algorithm.

  14. A Unified Differential Evolution Algorithm for Global Optimization

    SciTech Connect

    Qiang, Ji; Mitchell, Chad

    2014-06-24

    Abstract?In this paper, we propose a new unified differential evolution (uDE) algorithm for single objective global optimization. Instead of selecting among multiple mutation strategies as in the conventional differential evolution algorithm, this algorithm employs a single equation as the mutation strategy. It has the virtue of mathematical simplicity and also provides users the flexbility for broader exploration of different mutation strategies. Numerical tests using twelve basic unimodal and multimodal functions show promising performance of the proposed algorithm in comparison to convential differential evolution algorithms.

  15. Adaptive optimal control: an algorithm for direct digital control

    SciTech Connect

    Farris, D.R.; McDonald, T.E.

    1980-01-01

    An algorithm for applying advanced control concepts in heating, ventilating, and air conditioning (HVAC) systems has been developed at the Los Alamos Scientific Laboratory (LASL). The algorithm uses optimal control and is adaptive in nature. Simulations for a solar heated and cooled building indicate that use of this algorithm can accomplish a substantial savings in auxiliary energy consumption. In this paper, the algorithm is described and its application is illustrated with a simple example. Simulation results for a more complex system are also presented. The hardware, including the digital computer, needed to implement this algorithm is briefly discussed.

  16. Wave Algorithms: Optimal Database Search and Catalysis

    E-print Network

    Apoorva D. Patel

    2006-12-20

    Grover's database search algorithm, although discovered in the context of quantum computation, can be implemented using any physical system that allows superposition of states. A physical realization of this algorithm is described using coupled simple harmonic oscillators, which can be exactly solved in both classical and quantum domains. Classical wave algorithms are far more stable against decoherence compared to their quantum counterparts. In addition to providing convenient demonstration models, they may have a role in practical situations, such as catalysis.

  17. Genetic algorithms - What fitness scaling is optimal?

    NASA Technical Reports Server (NTRS)

    Kreinovich, Vladik; Quintana, Chris; Fuentes, Olac

    1993-01-01

    A problem of choosing the best scaling function as a mathematical optimization problem is formulated and solved under different optimality criteria. A list of functions which are optimal under different criteria is presented which includes both the best functions empirically proved and new functions that may be worth trying.

  18. Superscattering of light optimized by a genetic algorithm

    SciTech Connect

    Mirzaei, Ali Miroshnichenko, Andrey E.; Shadrivov, Ilya V.; Kivshar, Yuri S.

    2014-07-07

    We analyse scattering of light from multi-layer plasmonic nanowires and employ a genetic algorithm for optimizing the scattering cross section. We apply the mode-expansion method using experimental data for material parameters to demonstrate that our genetic algorithm allows designing realistic core-shell nanostructures with the superscattering effect achieved at any desired wavelength. This approach can be employed for optimizing both superscattering and cloaking at different wavelengths in the visible spectral range.

  19. Horizontal Well Placement Optimization in Gas Reservoirs Using Genetic Algorithms

    E-print Network

    Gibbs, Trevor Howard

    2011-08-08

    PLACEMENT OPTIMIZATION IN GAS RESERVOIRS USING GENETIC ALGORITHMS A Thesis by TREVOR HOWARD GIBBS Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree of MASTER... OF SCIENCE May 2010 Major Subject: Petroleum Engineering HORIZONTAL WELL PLACEMENT OPTIMIZATION IN GAS RESERVOIRS USING GENETIC ALGORITHMS A Thesis by TREVOR HOWARD GIBBS Submitted to the Office of Graduate Studies of Texas A...

  20. Stress-based upper-bound method and convex optimization: case of the Gurson material

    NASA Astrophysics Data System (ADS)

    Pastor, Franck; Trillat, Malorie; Pastor, Joseph; Loute, Etienne

    2006-04-01

    A nonlinear interior point method associated with the kinematic theorem of limit analysis is proposed. Associating these two tools enables one to determine an upper bound of the limit loading of a Gurson material structure from the knowledge of the sole yield criterion. We present the main features of the interior point algorithm and an original method providing a rigorous kinematic bound from a stress formulation of the problem. This method is tested by solving in plane strain the problem of a Gurson infinite bar compressed between rough rigid plates. To cite this article: F. Pastor et al., C. R. Mecanique 334 (2006).

  1. Motivation Defect correction The algorithm Summary Defect correction in optimization

    E-print Network

    Hemker, P.W.

    Motivation Defect correction The algorithm Summary Defect correction in optimization "Manifold Mapping" P.W. Hemker IPIR/CWI/UvA June 11, 2010 Manifold Mapping P.W. Hemker #12;Motivation Defect correction The algorithm Summary Motivation Motivation determine x1, x2, x1, x3, x4, x5, x6, x7 Manifold

  2. Evolutionary Optimization Algorithm with Learned Behavior for Image Restoration

    NASA Astrophysics Data System (ADS)

    Promislov, V. G.

    The Evolution Strategy algorithm for maximum entropy image restoration with learned behavior is discussed. Evolutionary algorithms are widely used to search for solutions to ``ill-posed" optimization problems. These are based on the simulation of the natural evolution process within a population of individuals. We are introducing a way to drive restoration, without significant impact on the final result in case of misguiding.

  3. Optimal Algorithms for GSM Viterbi Modules M.Sc. Student

    E-print Network

    soft-decision bits. The power and area optimization is only considered at the algorithm-metal- layer CMOS technology. Keywords: Convolutional decoder, Viterbi algorithm, Low power, Low area and Mathematical Modelling Technical University of Denmark July 30, 2003 #12;#12;#12;Abstract A power/area optimum

  4. Time Optimal Algorithms for Black Hole Search B. Balamohan1

    E-print Network

    Santoro, Nicola

    Time Optimal Algorithms for Black Hole Search in Rings B. Balamohan1 , P. Flocchini1 , A. Miri2 the same algorithm, to determine within finite time the location of the black hole. In this paper we consider the black hole search problem in asynchronous ring networks of n nodes, and focus on the time

  5. Parallel optimization algorithms and their implementation in VLSI design

    NASA Technical Reports Server (NTRS)

    Lee, G.; Feeley, J. J.

    1991-01-01

    Two new parallel optimization algorithms based on the simplex method are described. They may be executed by a SIMD parallel processor architecture and be implemented in VLSI design. Several VLSI design implementations are introduced. An application example is reported to demonstrate that the algorithms are effective.

  6. MULTISCALE PARALLEL GENETIC ALGORITHMS FOR OPTIMAL GROUNDWATER REMEDIATION DESIGN

    E-print Network

    Minsker, Barbara S.

    MULTISCALE PARALLEL GENETIC ALGORITHMS FOR OPTIMAL GROUNDWATER REMEDIATION DESIGN BY MEGHNA BABBAR for the degree of Master of Science in Environmental Engineering in Civil Engineering in the Graduate College of the University of Illinois at Urbana-Champaign, 2002 Urbana, Illinois #12;iii ABSTRACT Genetic algorithms (GAs

  7. AN SLP ALGORITHM AND ITS APPLICATION TO TOPOLOGY OPTIMIZATION

    E-print Network

    Gomes, Francisco A. M.

    AN SLP ALGORITHM AND ITS APPLICATION TO TOPOLOGY OPTIMIZATION FRANCISCO A. M. GOMES AND THADEU A by Svanberg [19], and sequential linear programming (SLP). Although showing a good performance in practice, most of the SLP algorithms used in topology optimiza- tion lack a global convergence theory. This paper

  8. Using Genetic Algorithms to Optimize Operating System Parameters

    E-print Network

    Feitelson, Dror

    Using Genetic Algorithms to Optimize Operating System Parameters Dror G. Feitelson Michael Naaman files containing information about the local workload, and genetic algorithms are used to select of parame ters that can be modified by the system administrator in order to tune system performance

  9. Convex-relaxed kernel mapping for image segmentation.

    PubMed

    Ben Salah, Mohamed; Ben Ayed, Ismail; Jing Yuan; Hong Zhang

    2014-03-01

    This paper investigates a convex-relaxed kernel mapping formulation of image segmentation. We optimize, under some partition constraints, a functional containing two characteristic terms: 1) a data term, which maps the observation space to a higher (possibly infinite) dimensional feature space via a kernel function, thereby evaluating nonlinear distances between the observations and segments parameters and 2) a total-variation term, which favors smooth segment surfaces (or boundaries). The algorithm iterates two steps: 1) a convex-relaxation optimization with respect to the segments by solving an equivalent constrained problem via the augmented Lagrange multiplier method and 2) a convergent fixed-point optimization with respect to the segments parameters. The proposed algorithm can bear with a variety of image types without the need for complex and application-specific statistical modeling, while having the computational benefits of convex relaxation. Our solution is amenable to parallelized implementations on graphics processing units (GPUs) and extends easily to high dimensions. We evaluated the proposed algorithm with several sets of comprehensive experiments and comparisons, including: 1) computational evaluations over 3D medical-imaging examples and high-resolution large-size color photographs, which demonstrate that a parallelized implementation of the proposed method run on a GPU can bring a significant speed-up and 2) accuracy evaluations against five state-of-the-art methods over the Berkeley color-image database and a multimodel synthetic data set, which demonstrates competitive performances of the algorithm. PMID:24723519

  10. FAST APPROXIMATION OF CONVEX HULL Ladislav Kavan

    E-print Network

    Plotkin, Joshua B.

    algorithms are described in [2, 1]. However, in certain applications we do not need an exact convex hull, i-spaces, and moreover it is an outer convex hull, i.e. CH(A) ACHk(A) If |A| = N, then the algorithm ACHk(A) runs in OFAST APPROXIMATION OF CONVEX HULL Ladislav Kavan FEE CTU in Prague Karlovo nam. 13 Prague 2, Czech

  11. Optimization of Reactive Power based on Newton-Raphson algorithm

    E-print Network

    Lavaei, Javad

    based on your specific power flow system model. 1. Impact of Reactive Power Fig.1 simplified and hence will lower the voltage at the load. It is important to plan a reasonable reactive power distribution and flow. Reactive power optimization focuses on mathematical models and optimization algorithms

  12. Model Specification Searches Using Ant Colony Optimization Algorithms

    ERIC Educational Resources Information Center

    Marcoulides, George A.; Drezner, Zvi

    2003-01-01

    Ant colony optimization is a recently proposed heuristic procedure inspired by the behavior of real ants. This article applies the procedure to model specification searches in structural equation modeling and reports the results. The results demonstrate the capabilities of ant colony optimization algorithms for conducting automated searches.

  13. GLOBAL OPTIMIZATION AND APPROXIMATION ALGORITHMS IN COMPUTER VISION

    E-print Network

    Lunds Universitet

    Vision Abstract Computer Vision is today a wide research area including topics like robot vision, image relaxations, computer vision, binary quadratic optimization. Classification system and/or index terms (if anyGLOBAL OPTIMIZATION AND APPROXIMATION ALGORITHMS IN COMPUTER VISION CARL OLSSON Faculty

  14. Piloted simulation of an on-board trajectory optimization algorithm

    NASA Technical Reports Server (NTRS)

    Price, D. B.; Calise, A. J.; Moerder, D. D.

    1981-01-01

    This paper will describe a real time piloted simulation of algorithms designed for on-board computation of time-optimal intercept trajectories for an F-8 aircraft. The algorithms, which were derived using singular perturbation theory, generate commands that are displayed to the pilot on flight director needles on the 8-ball. By flying the airplane so as to zero the horizontal and vertical needles, the pilot flies an approximation to a time-optimal intercept trajectory. The various display and computation modes that are available will be described and results will be presented illustrating the performance of the algorithms with a pilot in the loop.

  15. Convex Hull of Planar H-Polyhedra Axel Simon and Andy King

    E-print Network

    Kent, University of

    algorithm inherits its O(n log n) time complexity. The standard tactic for calculating the convex hull of H in Section 3. Section 4 concludes. 2 Planar Convex Hull Algorithm The planar convex hull algorithm takesConvex Hull of Planar H-Polyhedra Axel Simon and Andy King Computing Laboratory University of Kent

  16. Applications of Geometry Processing CudaHull: Fast parallel 3D convex hull on the GPU

    E-print Network

    El-Sana, Jihad

    algorithm for computing the convex hull of a set of points in 3D using the CUDA programming model, can be reduced to the convex hull. Fast convex-hull algorithms are useful for interactive appli environments [3]. Numerous algorithms were proposed to compute the convex hull of a finite set of points

  17. OPTIMIZATION OF LONG RURAL FEEDERS USING A GENETIC ALGORITHM

    SciTech Connect

    Wishart, Michael; Ledwich, Gerard; Ghosh, Arindam; Ivanovich, Grujica

    2010-06-15

    This paper describes the optimization of conductor size and the voltage regulator location and magnitude of long rural distribution lines. The optimization minimizes the lifetime cost of the lines, including capital costs and losses while observing voltage drop and operational constraints using a Genetic Algorithm (GA). The GA optimization is applied to a real Single Wire Earth Return (SWER) network in regional Queensland and results are presented.

  18. Optimizing algorithms for the comparative analysis of

    E-print Network

    Will, Sebastian

    Fakultat der Albert-Ludwigs-Universitat Freiburg von Diplom-Informatikerin (Bioinformatik) Christina Boltzmann-distributed structure ensembles. The core algorithm of the existing approach ExpaRNA solves

  19. A parallel variable metric optimization algorithm

    NASA Technical Reports Server (NTRS)

    Straeter, T. A.

    1973-01-01

    An algorithm, designed to exploit the parallel computing or vector streaming (pipeline) capabilities of computers is presented. When p is the degree of parallelism, then one cycle of the parallel variable metric algorithm is defined as follows: first, the function and its gradient are computed in parallel at p different values of the independent variable; then the metric is modified by p rank-one corrections; and finally, a single univariant minimization is carried out in the Newton-like direction. Several properties of this algorithm are established. The convergence of the iterates to the solution is proved for a quadratic functional on a real separable Hilbert space. For a finite-dimensional space the convergence is in one cycle when p equals the dimension of the space. Results of numerical experiments indicate that the new algorithm will exploit parallel or pipeline computing capabilities to effect faster convergence than serial techniques.

  20. PCNN document segmentation method based on bacterial foraging optimization algorithm

    NASA Astrophysics Data System (ADS)

    Liao, Yanping; Zhang, Peng; Guo, Qiang; Wan, Jian

    2014-04-01

    Pulse Coupled Neural Network(PCNN) is widely used in the field of image processing, but it is a difficult task to define the relative parameters properly in the research of the applications of PCNN. So far the determination of parameters of its model needs a lot of experiments. To deal with the above problem, a document segmentation based on the improved PCNN is proposed. It uses the maximum entropy function as the fitness function of bacterial foraging optimization algorithm, adopts bacterial foraging optimization algorithm to search the optimal parameters, and eliminates the trouble of manually set the experiment parameters. Experimental results show that the proposed algorithm can effectively complete document segmentation. And result of the segmentation is better than the contrast algorithms.

  1. Air data system optimization using a genetic algorithm

    NASA Technical Reports Server (NTRS)

    Deshpande, Samir M.; Kumar, Renjith R.; Seywald, Hans; Siemers, Paul M., III

    1992-01-01

    An optimization method for flush-orifice air data system design has been developed using the Genetic Algorithm approach. The optimization of the orifice array minimizes the effect of normally distributed random noise in the pressure readings on the calculation of air data parameters, namely, angle of attack, sideslip angle and freestream dynamic pressure. The optimization method is applied to the design of Pressure Distribution/Air Data System experiment (PD/ADS) proposed for inclusion in the Aeroassist Flight Experiment (AFE). Results obtained by the Genetic Algorithm method are compared to the results obtained by conventional gradient search method.

  2. A Discrete Lagrangian Algorithm for Optimal Routing Problems

    SciTech Connect

    Kosmas, O. T.; Vlachos, D. S.; Simos, T. E.

    2008-11-06

    The ideas of discrete Lagrangian methods for conservative systems are exploited for the construction of algorithms applicable in optimal ship routing problems. The algorithm presented here is based on the discretisation of Hamilton's principle of stationary action Lagrangian and specifically on the direct discretization of the Lagrange-Hamilton principle for a conservative system. Since, in contrast to the differential equations, the discrete Euler-Lagrange equations serve as constrains for the optimization of a given cost functional, in the present work we utilize this feature in order to minimize the cost function for optimal ship routing.

  3. Genetic Algorithms Can Improve the Construction of D-Optimal Experimental Designs

    E-print Network

    Zell, Andreas

    Genetic Algorithms Can Improve the Construction of D-Optimal Experimental Designs J. POLAND, A better results. Key-Words: - Genetic Algorithm, Memetic Algorithm, Design of Experiments, DOE, D-Optimal algorithms for constructing D- optimal designs are Monte Carlo algorithms, heuristics, that base on the idea

  4. A superlinear interior points algorithm for engineering design optimization

    NASA Technical Reports Server (NTRS)

    Herskovits, J.; Asquier, J.

    1990-01-01

    We present a quasi-Newton interior points algorithm for nonlinear constrained optimization. It is based on a general approach consisting of the iterative solution in the primal and dual spaces of the equalities in Karush-Kuhn-Tucker optimality conditions. This is done in such a way to have primal and dual feasibility at each iteration, which ensures satisfaction of those optimality conditions at the limit points. This approach is very strong and efficient, since at each iteration it only requires the solution of two linear systems with the same matrix, instead of quadratic programming subproblems. It is also particularly appropriate for engineering design optimization inasmuch at each iteration a feasible design is obtained. The present algorithm uses a quasi-Newton approximation of the second derivative of the Lagrangian function in order to have superlinear asymptotic convergence. We discuss theoretical aspects of the algorithm and its computer implementation.

  5. A Hybrid Ant Colony Algorithm for Loading Pattern Optimization

    NASA Astrophysics Data System (ADS)

    Hoareau, F.

    2014-06-01

    Electricit de France (EDF) operates 58 nuclear power plant (NPP), of the Pressurized Water Reactor (PWR) type. The loading pattern (LP) optimization of these NPP is currently done by EDF expert engineers. Within this framework, EDF R&D has developed automatic optimization tools that assist the experts. The latter can resort, for instance, to a loading pattern optimization software based on ant colony algorithm. This paper presents an analysis of the search space of a few realistic loading pattern optimization problems. This analysis leads us to introduce a hybrid algorithm based on ant colony and a local search method. We then show that this new algorithm is able to generate loading patterns of good quality.

  6. New Lower Bounds for Convex Hull Problems in Odd Dimensions

    E-print Network

    Erickson, Jeff

    described an algorithm that constructs the convex hull of n points in the plane in O(nlogn) time 15] describes an algorithm for constructing convex hulls in IRd in time O(nbd=2c + nlogn). Since an nNew Lower Bounds for Convex Hull Problems in Odd Dimensions Je Erickson Computer Science Division

  7. On Computing the Convex Hull of (Piecewise) Curved Objects

    E-print Network

    Aurenhammer, Franz

    , if the objects are polygonal, then applying to their total set of vertices any convex hull algorithm for finite of these facts, algorithms that specialize on computing the convex hull of a finite set of circular arcsOn Computing the Convex Hull of (Piecewise) Curved Objects Franz Aurenhammer and Bert J

  8. A Genetic Algorithm Approach to Multiple-Response Optimization

    SciTech Connect

    Ortiz, Francisco; Simpson, James R.; Pignatiello, Joseph J.; Heredia-Langner, Alejandro

    2004-10-01

    Many designed experiments require the simultaneous optimization of multiple responses. A common approach is to use a desirability function combined with an optimization algorithm to find the most desirable settings of the controllable factors. However, as the problem grows even moderately in either the number of factors or the number of responses, conventional optimization algorithms can fail to find the global optimum. An alternative approach is to use a heuristic search procedure such as a genetic algorithm (GA). This paper proposes and develops a multiple-response solution technique using a GA in conjunction with an unconstrained desirability function. The GA requires that several parameters be determined in order for the algorithm to operate effectively. We perform a robust designed experiment in order to tune the genetic algorithm to perform well regardless of the complexity of the multiple-response optimization problem. The performance of the proposed GA method is evaluated and compared with the performance of the method that combines the desirability with the generalized reduced gradient (GRG) optimization. The evaluation shows that only the proposed GA approach consistently and effectively solves multiple-response problems of varying complexity.

  9. Fast Approximate Convex Decomposition

    E-print Network

    Ghosh, Mukulika

    2012-10-19

    Approximate convex decomposition (ACD) is a technique that partitions an input object into "approximately convex" components. Decomposition into approximately convex pieces is both more efficient to compute than exact convex decomposition and can...

  10. Comparative Evaluation of Different Optimization Algorithms for Structural Design Applications

    NASA Technical Reports Server (NTRS)

    Patnaik, Surya N.; Coroneos, Rula M.; Guptill, James D.; Hopkins, Dale A.

    1996-01-01

    Non-linear programming algorithms play an important role in structural design optimization. Fortunately, several algorithms with computer codes are available. At NASA Lewis Research Centre, a project was initiated to assess the performance of eight different optimizers through the development of a computer code CometBoards. This paper summarizes the conclusions of that research. CometBoards was employed to solve sets of small, medium and large structural problems, using the eight different optimizers on a Cray-YMP8E/8128 computer. The reliability and efficiency of the optimizers were determined from the performance of these problems. For small problems, the performance of most of the optimizers could be considered adequate. For large problems, however, three optimizers (two sequential quadratic programming routines, DNCONG of IMSL and SQP of IDESIGN, along with Sequential Unconstrained Minimizations Technique SUMT) outperformed others. At optimum, most optimizers captured an identical number of active displacement and frequency constraints but the number of active stress constraints differed among the optimizers. This discrepancy can be attributed to singularity conditions in the optimization and the alleviation of this discrepancy can improve the efficiency of optimizers.

  11. Performance Trend of Different Algorithms for Structural Design Optimization

    NASA Technical Reports Server (NTRS)

    Patnaik, Surya N.; Coroneos, Rula M.; Guptill, James D.; Hopkins, Dale A.

    1996-01-01

    Nonlinear programming algorithms play an important role in structural design optimization. Fortunately, several algorithms with computer codes are available. At NASA Lewis Research Center, a project was initiated to assess performance of different optimizers through the development of a computer code CometBoards. This paper summarizes the conclusions of that research. CometBoards was employed to solve sets of small, medium and large structural problems, using different optimizers on a Cray-YMP8E/8128 computer. The reliability and efficiency of the optimizers were determined from the performance of these problems. For small problems, the performance of most of the optimizers could be considered adequate. For large problems however, three optimizers (two sequential quadratic programming routines, DNCONG of IMSL and SQP of IDESIGN, along with the sequential unconstrained minimizations technique SUMT) outperformed others. At optimum, most optimizers captured an identical number of active displacement and frequency constraints but the number of active stress constraints differed among the optimizers. This discrepancy can be attributed to singularity conditions in the optimization and the alleviation of this discrepancy can improve the efficiency of optimizers.

  12. Optimal Design of RF Energy Harvesting Device Using Genetic Algorithm

    NASA Astrophysics Data System (ADS)

    Mori, T.; Sato, Y.; Adriano, R.; Igarashi, H.

    2015-11-01

    This paper presents optimal design of an RF energy harvesting device using genetic algorithm (GA). In the present RF harvester, a planar spiral antenna (PSA) is loaded with matching and rectifying circuits. On the first stage of the optimal design, the shape parameters of PSA are optimized using . Then, the equivalent circuit of the optimized PSA is derived for optimization of the circuits. Finally, the parameters of RF energy harvesting circuit are optimized to maximize the output power using GA. It is shown that the present optimization increases the output power by a factor of five. The manufactured energy harvester starts working when the input electric field is greater than 0.5 V/m.

  13. Minimum Convex Partition of a Constrained Point Set Thomas Fevens Henk Meijer David Rappaport

    E-print Network

    Rappaport, David

    is the boundary of the convex hull of S, and every bounded interior face is a convex polygon. A minimum convex. In this paper, we will present a polynomial time algorithm to find a minimum convex partition with respect to a point set S where S is constrained to lie on the boundaries of a fixed number of nested convex hulls. 1

  14. Improved Clonal Selection Algorithm Combined with Ant Colony Optimization

    NASA Astrophysics Data System (ADS)

    Gao, Shangce; Wang, Wei; Dai, Hongwei; Li, Fangjia; Tang, Zheng

    Both the clonal selection algorithm (CSA) and the ant colony optimization (ACO) are inspired by natural phenomena and are effective tools for solving complex problems. CSA can exploit and explore the solution space parallely and effectively. However, it can not use enough environment feedback information and thus has to do a large redundancy repeat during search. On the other hand, ACO is based on the concept of indirect cooperative foraging process via secreting pheromones. Its positive feedback ability is nice but its convergence speed is slow because of the little initial pheromones. In this paper, we propose a pheromone-linker to combine these two algorithms. The proposed hybrid clonal selection and ant colony optimization (CSA-ACO) reasonably utilizes the superiorities of both algorithms and also overcomes their inherent disadvantages. Simulation results based on the traveling salesman problems have demonstrated the merit of the proposed algorithm over some traditional techniques.

  15. Optimization of computer-generated binary holograms using genetic algorithms

    NASA Astrophysics Data System (ADS)

    Cojoc, Dan; Alexandrescu, Adrian

    1999-11-01

    The aim of this paper is to compare genetic algorithms against direct point oriented coding in the design of binary phase Fourier holograms, computer generated. These are used as fan-out elements for free space optical interconnection. Genetic algorithms are optimization methods which model the natural process of genetic evolution. The configuration of the hologram is encoded to form a chromosome. To start the optimization, a population of different chromosomes randomly generated is considered. The chromosomes compete, mate and mutate until the best chromosome is obtained according to a cost function. After explaining the operators that are used by genetic algorithms, this paper presents two examples with 32 X 32 genes in a chromosome. The crossover type and the number of mutations are shown to be important factors which influence the convergence of the algorithm. GA is demonstrated to be a useful tool to design namely binary phase holograms of complicate structures.

  16. Optimized Algorithms for Prediction within Robotic Tele-Operative Interfaces

    NASA Technical Reports Server (NTRS)

    Martin, Rodney A.; Wheeler, Kevin R.; SunSpiral, Vytas; Allan, Mark B.

    2006-01-01

    Robonaut, the humanoid robot developed at the Dexterous Robotics Laboratory at NASA Johnson Space Center serves as a testbed for human-robot collaboration research and development efforts. One of the primary efforts investigates how adjustable autonomy can provide for a safe and more effective completion of manipulation-based tasks. A predictive algorithm developed in previous work was deployed as part of a software interface that can be used for long-distance tele-operation. In this paper we provide the details of this algorithm, how to improve upon the methods via optimization, and also present viable alternatives to the original algorithmic approach. We show that all of the algorithms presented can be optimized to meet the specifications of the metrics shown as being useful for measuring the performance of the predictive methods. Judicious feature selection also plays a significant role in the conclusions drawn.

  17. Genetic Algorithm Optimizes Q-LAW Control Parameters

    NASA Technical Reports Server (NTRS)

    Lee, Seungwon; von Allmen, Paul; Petropoulos, Anastassios; Terrile, Richard

    2008-01-01

    A document discusses a multi-objective, genetic algorithm designed to optimize Lyapunov feedback control law (Q-law) parameters in order to efficiently find Pareto-optimal solutions for low-thrust trajectories for electronic propulsion systems. These would be propellant-optimal solutions for a given flight time, or flight time optimal solutions for a given propellant requirement. The approximate solutions are used as good initial solutions for high-fidelity optimization tools. When the good initial solutions are used, the high-fidelity optimization tools quickly converge to a locally optimal solution near the initial solution. Q-law control parameters are represented as real-valued genes in the genetic algorithm. The performances of the Q-law control parameters are evaluated in the multi-objective space (flight time vs. propellant mass) and sorted by the non-dominated sorting method that assigns a better fitness value to the solutions that are dominated by a fewer number of other solutions. With the ranking result, the genetic algorithm encourages the solutions with higher fitness values to participate in the reproduction process, improving the solutions in the evolution process. The population of solutions converges to the Pareto front that is permitted within the Q-law control parameter space.

  18. Phase retrieval, error reduction algorithm, and Fienup variants: A view from convex optimization

    E-print Network

    Luke, D. Russell

    is of paramount importance in various areas of applied physics and engineering. The state of the art for solving numerical scheme to solve this type of problem. While its intrinsic mechanism is clear physicallyottingen 37083 Gottingen, Germany. January 14, 2002 version 1.29 Abstract The phase retrieval problem

  19. INTERIOR-POINT ALGORITHMS FOR CONVEX OPTIMIZATION BASED ON PRIMAL-DUAL METRICS

    E-print Network

    Tunel, Levent

    Doctoral Scholarship, ONR Research Grant N00014-12-10049, and a Dis- covery Grant from NSERC. Levent Tuncel, and in applications. Part of the success of primal-dual symmetric methods for LP and SDP might stem from the fact

  20. The Guided Improvement Algorithm for Exact, General-Purpose, Many-Objective Combinatorial Optimization

    E-print Network

    Jackson, Daniel

    2009-07-03

    This paper presents a new general-purpose algorithm for exact solving of combinatorial many-objective optimization problems. We call this new algorithm the guided improvement algorithm. The algorithm is implemented on top ...

  1. Bayesian Optimization Algorithm, Population Sizing, and Time to Convergence

    SciTech Connect

    Pelikan, M.; Goldberg, D.E.; Cantu-Paz, E.

    2000-01-19

    This paper analyzes convergence properties of the Bayesian optimization algorithm (BOA). It settles the BOA into the framework of problem decomposition used frequently in order to model and understand the behavior of simple genetic algorithms. The growth of the population size and the number of generations until convergence with respect to the size of a problem is theoretically analyzed. The theoretical results are supported by a number of experiments.

  2. Genetic algorithms in optimal multistage distribution network planning

    SciTech Connect

    Miranda, V.; Ranito, J.V.; Proenca, L.M. )

    1994-11-01

    This paper describes a genetic algorithm approach to the optimal multistage planning of distribution networks. The authors describe a mathematical and algorithmic model that they have developed and experimented with success. The paper also presents application examples, with real size systems. The advantages of adopting this new approach are discussed in the planning context, namely in conjunction with the adoption of multicriteria decision making methods.

  3. Shape Optimization of Rubber Bushing Using Differential Evolution Algorithm

    PubMed Central

    2014-01-01

    The objective of this study is to design rubber bushing at desired level of stiffness characteristics in order to achieve the ride quality of the vehicle. A differential evolution algorithm based approach is developed to optimize the rubber bushing through integrating a finite element code running in batch mode to compute the objective function values for each generation. Two case studies were given to illustrate the application of proposed approach. Optimum shape parameters of 2D bushing model were determined by shape optimization using differential evolution algorithm. PMID:25276848

  4. New near-optimal feedback guidance algorithms for space missions

    NASA Astrophysics Data System (ADS)

    Hawkins, Matthew Jay

    This dissertation describes several different spacecraft guidance algorithms, with applications including asteroid intercept and rendezvous, planetary landing, and orbital transfer. A comprehensive review of spacecraft guidance algorithms for asteroid intercept and rendezvous. Zero-Effort-Miss/Zero-Effort-Velocity (ZEM/ZEV) guidance is introduced and applied to asteroid intercept and rendezvous, and to a wealth of different example problems, including missile intercept, planetary landing, and orbital transfer. It is seen that the ZEM/ZEV guidance law can be used in many different scenarios, and that it provides near-optimal performance where an analytical optimal guidance law does not exist, such as in a non-linear gravity field.

  5. Fuzzy Adaptive Swarm Optimization Algorithm for Discrete Environments

    NASA Astrophysics Data System (ADS)

    Zahedi, M. Hadi; S. Haghighi, M. Mehdi

    The heuristic methods have been widely developed for solution of complicated optimization methods. Recently hybrid methods that are based on combination of different approaches have shown more potential in this regard. Fuzzy simulation and Particle Swarm Optimization algorithm are integrated to design a hybrid intelligent algorithm to solve the np-hard problem such as travelling salesman problem in efficient and faster way of solutions. The results obtained with the proposed method show its potential in achieving both accuracy and speed in small and medium size problems, compared to many advanced methods.

  6. Constraint Algorithm for Extremals in Optimal Control Problems

    E-print Network

    Maria Barbero-Lian; Miguel C. Muoz-Lecanda

    2008-02-06

    A geometric method is described to characterize the different kinds of extremals in optimal control theory. This comes from the use of a presymplectic constraint algorithm starting from the necessary conditions given by Pontryagin's Maximum Principle. Apart from the design of this general algorithm useful for any optimal control problem, it is showed how it works to split the set of extremals and, in particular, to characterize the strict abnormality. An example of strict abnormal extremal for a particular control-affine system is also given.

  7. A Parallel Particle Swarm Optimization Algorithm Accelerated by Asynchronous Evaluations

    NASA Technical Reports Server (NTRS)

    Venter, Gerhard; Sobieszczanski-Sobieski, Jaroslaw

    2005-01-01

    A parallel Particle Swarm Optimization (PSO) algorithm is presented. Particle swarm optimization is a fairly recent addition to the family of non-gradient based, probabilistic search algorithms that is based on a simplified social model and is closely tied to swarming theory. Although PSO algorithms present several attractive properties to the designer, they are plagued by high computational cost as measured by elapsed time. One approach to reduce the elapsed time is to make use of coarse-grained parallelization to evaluate the design points. Previous parallel PSO algorithms were mostly implemented in a synchronous manner, where all design points within a design iteration are evaluated before the next iteration is started. This approach leads to poor parallel speedup in cases where a heterogeneous parallel environment is used and/or where the analysis time depends on the design point being analyzed. This paper introduces an asynchronous parallel PSO algorithm that greatly improves the parallel e ciency. The asynchronous algorithm is benchmarked on a cluster assembled of Apple Macintosh G5 desktop computers, using the multi-disciplinary optimization of a typical transport aircraft wing as an example.

  8. A new efficient optimal path planner for mobile robot based on Invasive Weed Optimization algorithm

    NASA Astrophysics Data System (ADS)

    Mohanty, Prases K.; Parhi, Dayal R.

    2014-12-01

    Planning of the shortest/optimal route is essential for efficient operation of autonomous mobile robot or vehicle. In this paper Invasive Weed Optimization (IWO), a new meta-heuristic algorithm, has been implemented for solving the path planning problem of mobile robot in partially or totally unknown environments. This meta-heuristic optimization is based on the colonizing property of weeds. First we have framed an objective function that satisfied the conditions of obstacle avoidance and target seeking behavior of robot in partially or completely unknown environments. Depending upon the value of objective function of each weed in colony, the robot avoids obstacles and proceeds towards destination. The optimal trajectory is generated with this navigational algorithm when robot reaches its destination. The effectiveness, feasibility, and robustness of the proposed algorithm has been demonstrated through series of simulation and experimental results. Finally, it has been found that the developed path planning algorithm can be effectively applied to any kinds of complex situation.

  9. Optimization Algorithm for the Generation of ONCV Pseudopotentials

    E-print Network

    Schlipf, Martin

    2015-01-01

    We present an optimization algorithm to construct pseudopotentials and use it to generate a set of Optimized Norm-Conserving Vanderbilt (ONCV) pseudopotentials for elements up to Z=83 (Bi) (excluding Lanthanides). We introduce a quality function that assesses the agreement of a pseudopotential calculation with all-electron FLAPW results, and the necessary plane-wave energy cutoff. This quality function allows us to use a Nelder-Mead optimization algorithm on a training set of materials to optimize the input parameters of the pseudopotential construction for most of the periodic table. We control the accuracy of the resulting pseudopotentials on a test set of materials independent of the training set. We find that the automatically constructed pseudopotentials provide a good agreement with the all-electron results obtained using the FLEUR code with a plane-wave energy cutoff of approximately 60 Ry.

  10. Chaos Time Series Prediction Based on Membrane Optimization Algorithms

    PubMed Central

    Li, Meng; Yi, Liangzhong; Pei, Zheng; Gao, Zhisheng

    2015-01-01

    This paper puts forward a prediction model based on membrane computing optimization algorithm for chaos time series; the model optimizes simultaneously the parameters of phase space reconstruction (?, m) and least squares support vector machine (LS-SVM) (?, ?) by using membrane computing optimization algorithm. It is an important basis for spectrum management to predict accurately the change trend of parameters in the electromagnetic environment, which can help decision makers to adopt an optimal action. Then, the model presented in this paper is used to forecast band occupancy rate of frequency modulation (FM) broadcasting band and interphone band. To show the applicability and superiority of the proposed model, this paper will compare the forecast model presented in it with conventional similar models. The experimental results show that whether single-step prediction or multistep prediction, the proposed model performs best based on three error measures, namely, normalized mean square error (NMSE), root mean square error (RMSE), and mean absolute percentage error (MAPE). PMID:25874249

  11. Wavelet phase estimation using ant colony optimization algorithm

    NASA Astrophysics Data System (ADS)

    Wang, Shangxu; Yuan, Sanyi; Ma, Ming; Zhang, Rui; Luo, Chunmei

    2015-11-01

    Eliminating seismic wavelet is important in seismic high-resolution processing. However, artifacts may arise in seismic interpretation when the wavelet phase is inaccurately estimated. Therefore, we propose a frequency-dependent wavelet phase estimation method based on the ant colony optimization (ACO) algorithm with global optimization capacity. The wavelet phase can be optimized with the ACO algorithm by fitting nearby-well seismic traces with well-log data. Our proposed method can rapidly produce a frequency-dependent wavelet phase and optimize the seismic-to-well tie, particularly for weak signals. Synthetic examples demonstrate the effectiveness of the proposed ACO-based wavelet phase estimation method, even in the presence of a colored noise. Real data example illustrates that seismic deconvolution using an optimum mixed-phase wavelet can provide more information than that using an optimum constant-phase wavelet.

  12. Approximate Designs for Linear Regression: Invariance, Admissibility, and Optimality

    E-print Network

    Magdeburg, Universität

    , but the side conditions are given as a convex hull of some (infinite) generator. Such side conditions seem is a difficult problem. In the approximate theory the related optimization problems possess convex structures a combination of both reduction concepts can be used for developing a highly efficient and fast algorithm

  13. Optimal Placement Algorithms for Virtual Machines

    E-print Network

    Bellur, Umesh; SD, Madhu Kumar

    2010-01-01

    Cloud computing provides a computing platform for the users to meet their demands in an efficient, cost-effective way. Virtualization technologies are used in the clouds to aid the efficient usage of hardware. Virtual machines (VMs) are utilized to satisfy the user needs and are placed on physical machines (PMs) of the cloud for effective usage of hardware resources and electricity in the cloud. Optimizing the number of PMs used helps in cutting down the power consumption by a substantial amount. In this paper, we present an optimal technique to map virtual machines to physical machines (nodes) such that the number of required nodes is minimized. We provide two approaches based on linear programming and quadratic programming techniques that significantly improve over the existing theoretical bounds and efficiently solve the problem of virtual machine (VM) placement in data centers.

  14. Control optimization, stabilization and computer algorithms for aircraft applications

    NASA Technical Reports Server (NTRS)

    1975-01-01

    Research related to reliable aircraft design is summarized. Topics discussed include systems reliability optimization, failure detection algorithms, analysis of nonlinear filters, design of compensators incorporating time delays, digital compensator design, estimation for systems with echoes, low-order compensator design, descent-phase controller for 4-D navigation, infinite dimensional mathematical programming problems and optimal control problems with constraints, robust compensator design, numerical methods for the Lyapunov equations, and perturbation methods in linear filtering and control.

  15. An efficient cuckoo search algorithm for numerical function optimization

    NASA Astrophysics Data System (ADS)

    Ong, Pauline; Zainuddin, Zarita

    2013-04-01

    Cuckoo search algorithm which reproduces the breeding strategy of the best known brood parasitic bird, the cuckoos has demonstrated its superiority in obtaining the global solution for numerical optimization problems. However, the involvement of fixed step approach in its exploration and exploitation behavior might slow down the search process considerably. In this regards, an improved cuckoo search algorithm with adaptive step size adjustment is introduced and its feasibility on a variety of benchmarks is validated. The obtained results show that the proposed scheme outperforms the standard cuckoo search algorithm in terms of convergence characteristic while preserving the fascinating features of the original method.

  16. q-Gaussian based Smoothed Functional Algorithm for Stochastic Optimization

    E-print Network

    Ghoshdastidar, Debarghya; Bhatnagar, Shalabh

    2012-01-01

    The q-Gaussian distribution results from maximizing certain generalizations of Shannon entropy under some constraints. The importance of q-Gaussian distributions stems from the fact that they exhibit power-law behavior, and also generalize Gaussian distributions. In this paper, we propose a Smoothed Functional (SF) scheme for gradient estimation using q-Gaussian distribution, and also propose an algorithm for optimization based on the above scheme. Convergence results of the algorithm are presented. Performance of the proposed algorithm is shown by simulation results on a queuing model.

  17. A simple algorithm for optimization and model fitting: AGA (asexual genetic algorithm)

    NASA Astrophysics Data System (ADS)

    Cant, J.; Curiel, S.; Martnez-Gmez, E.

    2009-07-01

    Context: Mathematical optimization can be used as a computational tool to obtain the optimal solution to a given problem in a systematic and efficient way. For example, in twice-differentiable functions and problems with no constraints, the optimization consists of finding the points where the gradient of the objective function is zero and using the Hessian matrix to classify the type of each point. Sometimes, however it is impossible to compute these derivatives and other type of techniques must be employed such as the steepest descent/ascent method and more sophisticated methods such as those based on the evolutionary algorithms. Aims: We present a simple algorithm based on the idea of genetic algorithms (GA) for optimization. We refer to this algorithm as AGA (asexual genetic algorithm) and apply it to two kinds of problems: the maximization of a function where classical methods fail and model fitting in astronomy. For the latter case, we minimize the chi-square function to estimate the parameters in two examples: the orbits of exoplanets by taking a set of radial velocity data, and the spectral energy distribution (SED) observed towards a YSO (Young Stellar Object). Methods: The algorithm AGA may also be called genetic, although it differs from standard genetic algorithms in two main aspects: a) the initial population is not encoded; and b) the new generations are constructed by asexual reproduction. Results: Applying our algorithm in optimizing some complicated functions, we find the global maxima within a few iterations. For model fitting to the orbits of exoplanets and the SED of a YSO, we estimate the parameters and their associated errors.

  18. Benchmarking derivative-free optimization algorithms.

    SciTech Connect

    More', J. J.; Wild, S. M.; Mathematics and Computer Science; Cornell Univ.

    2009-01-01

    We propose data profiles as a tool for analyzing the performance of derivative-free optimization solvers when there are constraints on the computational budget. We use performance and data profiles, together with a convergence test that measures the decrease in function value, to analyze the performance of three solvers on sets of smooth, noisy, and piecewise-smooth problems. Our results provide estimates for the performance difference between these solvers, and show that on these problems, the model-based solver tested performs better than the two direct search solvers tested.

  19. Optimal brushless DC motor design using genetic algorithms

    NASA Astrophysics Data System (ADS)

    Rahideh, A.; Korakianitis, T.; Ruiz, P.; Keeble, T.; Rothman, M. T.

    2010-11-01

    This paper presents a method for the optimal design of a slotless permanent magnet brushless DC (BLDC) motor with surface mounted magnets using a genetic algorithm. Characteristics of the motor are expressed as functions of motor geometries. The objective function is a combination of losses, volume and cost to be minimized simultaneously. Electrical and mechanical requirements (i.e. voltage, torque and speed) and other limitations (e.g. upper and lower limits of the motor geometries) are cast into constraints of the optimization problem. One sample case is used to illustrate the design and optimization technique.

  20. ON THE OPTIMALITY OF AN ALGORITHM OF REINGOLD AND SUPOWIT

    E-print Network

    Prodinger, Helmut

    ON THE OPTIMALITY OF AN ALGORITHM OF REINGOLD AND SUPOWIT Peter J. Grabner and Helmut Prodinger will also multiply by the factor ??. And if This research was supported by the Austrian­Hungarian cooperation X 1 #12; 2 PETER J. GRABNER AND HELMUT PRODINGER we want to compare the expected costs according

  1. THE OPTIMALITY OF AN ALGORITHM OF REINGOLD AND SUPOWIT

    E-print Network

    Grabner, Peter J.

    THE OPTIMALITY OF AN ALGORITHM OF REINGOLD AND SUPOWIT Peter J. Grabner and Helmut Prodinger is pretty much the same as in []. This research was supported by the Austrian-Hungarian cooperation 10U3 Typeset by AMS-TEX 1 #12;2 PETER J. GRABNER AND HELMUT PRODINGER We have F0 = G0 = 0, and for n 1 Fn = 2

  2. Stochastics and Statistics Algorithmic aspects of meanvariance optimization in Markov

    E-print Network

    Tsitsiklis, John

    Stochastics and Statistics Algorithmic aspects of mean­variance optimization in Markov decision processes Shie Mannor a, , John N. Tsitsiklis b a Department of Electrical and Engineering, Technion, Haifa Complexity theory a b s t r a c t We consider finite horizon Markov decision processes under performance

  3. Attitude determination using vector observations: A fast optimal matrix algorithm

    NASA Technical Reports Server (NTRS)

    Markley, F. Landis

    1993-01-01

    The attitude matrix minimizing Wahba's loss function is computed directly by a method that is competitive with the fastest known algorithm for finding this optimal estimate. The method also provides an estimate of the attitude error covariance matrix. Analysis of the special case of two vector observations identifies those cases for which the TRIAD or algebraic method minimizes Wahba's loss function.

  4. Extended Semantics and Optimization Algorithms for CP-Networks

    E-print Network

    Dimopoulos, Yannis

    Extended Semantics and Optimization Algorithms for CP-Networks Ronen I. Brafman Dept. of Computer;cation tasks. CP-nets were designed to make the process of preference elicitation simpler and more intuitive for lay users by graphically structuring a set of Ceteris Paribus (CP) preference statements

  5. Path Cost Optimization Using Genetic Algorithm with Supervised Crossover Operator

    E-print Network

    Tse, Chi K. "Michael"

    Path Cost Optimization Using Genetic Algorithm with Supervised Crossover Operator Chi-Tsun Cheng , Kia Fallahi , Henry Leung and Chi K. Tse Dept. of Electronic & Information Engineering, Hong Kong Polytechnic University, Hong Kong Dept. of Electrical & Computer Engineering, University of Calgary, Calgary

  6. Environmental Optimization Using the WAste Reduction Algorithm (WAR)

    EPA Science Inventory

    Traditionally chemical process designs were optimized using purely economic measures such as rate of return. EPA scientists developed the WAste Reduction algorithm (WAR) so that environmental impacts of designs could easily be evaluated. The goal of WAR is to reduce environme...

  7. Local optimality of dictionary learning algorithms Boris Mailh

    E-print Network

    Plumbley, Mark

    Local optimality of dictionary learning algorithms Boris Mailh Centre for Digital Music School of Electronic Engineering Computer Science Queen Mary University of London boris.mailhe@eecs.qmul.ac.uk Mark Plumbley Centre for Digital Music School of Electronic Engineering Computer Science Queen Mary University

  8. Clustering Algorithms Optimizer: A Framework for Large Datasets

    E-print Network

    Horn, David

    tissues, associating tissues with subtypes of a disease) as well as revealing functional classes of genesClustering Algorithms Optimizer: A Framework for Large Datasets Roy Varshavsky1,* , David Horn2 bioinformatics tasks, including categorization of protein sequences and analysis of gene-expression data

  9. Optimal Sleep-Wakeup Algorithms for Barriers of Wireless Sensors

    E-print Network

    Kumar, Santosh

    Optimal Sleep-Wakeup Algorithms for Barriers of Wireless Sensors Santosh Kumar Ten H. Lai Marc E,posner.1,sinha.43}@osu.edu Abstract-- The problem of sleep wakeup has been extensively studied the sleep- wakeup problem is NP-Hard for this model, several heuristics ex- ist. For the model of barrier

  10. Numerical Optimization Algorithms and Software for Systems Biology

    SciTech Connect

    Saunders, Michael

    2013-02-02

    The basic aims of this work are: to develop reliable algorithms for solving optimization problems involving large stoi- chiometric matrices; to investigate cyclic dependency between metabolic and macromolecular biosynthetic networks; and to quantify the significance of thermodynamic constraints on prokaryotic metabolism.

  11. Worst-case Optimal Join Algorithms Hung Q. Ngo

    E-print Network

    Thrun, Sebastian

    Worst-case Optimal Join Algorithms Hung Q. Ngo University at Buffalo, SUNY hungngo@buffalo.edu Ely by Bollobs and Thomason, one of whose special cases is the famous Loomis- Whitney inequality. Hence, our, fractional cover bound, Loomis-Whitney inequal- ity, Bollobs-Thomason inequality Permission to make digital

  12. A genetic algorithm approach in interface and surface structure optimization

    SciTech Connect

    Zhang, Jian

    2010-05-16

    The thesis is divided into two parts. In the first part a global optimization method is developed for the interface and surface structures optimization. Two prototype systems are chosen to be studied. One is Si[001] symmetric tilted grain boundaries and the other is Ag/Au induced Si(111) surface. It is found that Genetic Algorithm is very efficient in finding lowest energy structures in both cases. Not only existing structures in the experiments can be reproduced, but also many new structures can be predicted using Genetic Algorithm. Thus it is shown that Genetic Algorithm is a extremely powerful tool for the material structures predictions. The second part of the thesis is devoted to the explanation of an experimental observation of thermal radiation from three-dimensional tungsten photonic crystal structures. The experimental results seems astounding and confusing, yet the theoretical models in the paper revealed the physics insight behind the phenomena and can well reproduced the experimental results.

  13. Engineering design optimization using species-conserving genetic algorithms

    NASA Astrophysics Data System (ADS)

    Li, Jian-Ping; Balazs, M. E.; Parks, G. T.

    2007-03-01

    The species conservation technique described here, in which the population of a genetic algorithm is divided into several groups according to their similarity, is inspired by ecology. Each group with similar characteristics is called a species and is centred on a dominating individual, called the species seed. A genetic algorithm based on this species conservation technique, called the species-conserving genetic algorithm (SCGA), was established and has been proved to be effective in finding multiple solutions of multimodal optimization problems. In this article, the SCGA is used to solve engineering design optimization problems. Different distance measures (measures of similarity) are investigated to analyse the performance of the SCGA. It is shown that the Euclidean distance is not the only possible basis for defining a species and sometimes may not make sense in engineering applications. Two structural design problems are used to demonstrate how the choice of a meaningful measure of similarity will help the exploration for significant designs.

  14. Optimal reservoir operation policies using novel nested algorithms

    NASA Astrophysics Data System (ADS)

    Delipetrev, Blagoj; Jonoski, Andreja; Solomatine, Dimitri

    2015-04-01

    Historically, the two most widely practiced methods for optimal reservoir operation have been dynamic programming (DP) and stochastic dynamic programming (SDP). These two methods suffer from the so called "dual curse" which prevents them to be used in reasonably complex water systems. The first one is the "curse of dimensionality" that denotes an exponential growth of the computational complexity with the state - decision space dimension. The second one is the "curse of modelling" that requires an explicit model of each component of the water system to anticipate the effect of each system's transition. We address the problem of optimal reservoir operation concerning multiple objectives that are related to 1) reservoir releases to satisfy several downstream users competing for water with dynamically varying demands, 2) deviations from the target minimum and maximum reservoir water levels and 3) hydropower production that is a combination of the reservoir water level and the reservoir releases. Addressing such a problem with classical methods (DP and SDP) requires a reasonably high level of discretization of the reservoir storage volume, which in combination with the required releases discretization for meeting the demands of downstream users leads to computationally expensive formulations and causes the curse of dimensionality. We present a novel approach, named "nested" that is implemented in DP, SDP and reinforcement learning (RL) and correspondingly three new algorithms are developed named nested DP (nDP), nested SDP (nSDP) and nested RL (nRL). The nested algorithms are composed from two algorithms: 1) DP, SDP or RL and 2) nested optimization algorithm. Depending on the way we formulate the objective function related to deficits in the allocation problem in the nested optimization, two methods are implemented: 1) Simplex for linear allocation problems, and 2) quadratic Knapsack method in the case of nonlinear problems. The novel idea is to include the nested optimization algorithm into the state transition that lowers the starting problem dimension and alleviates the curse of dimensionality. The algorithms can solve multi-objective optimization problems, without significantly increasing the complexity and the computational expenses. The algorithms can handle dense and irregular variable discretization, and are coded in Java as prototype applications. The three algorithms were tested at the multipurpose reservoir Knezevo of the Zletovica hydro-system located in the Republic of Macedonia, with eight objectives, including urban water supply, agriculture, ensuring ecological flow, and generation of hydropower. Because the Zletovica hydro-system is relatively complex, the novel algorithms were pushed to their limits, demonstrating their capabilities and limitations. The nSDP and nRL derived/learned the optimal reservoir policy using 45 (1951-1995) years historical data. The nSDP and nRL optimal reservoir policy was tested on 10 (1995-2005) years historical data, and compared with nDP optimal reservoir operation in the same period. The nested algorithms and optimal reservoir operation results are analysed and explained.

  15. Multiobjective Optimization of Rocket Engine Pumps Using Evolutionary Algorithm

    NASA Technical Reports Server (NTRS)

    Oyama, Akira; Liou, Meng-Sing

    2001-01-01

    A design optimization method for turbopumps of cryogenic rocket engines has been developed. Multiobjective Evolutionary Algorithm (MOEA) is used for multiobjective pump design optimizations. Performances of design candidates are evaluated by using the meanline pump flow modeling method based on the Euler turbine equation coupled with empirical correlations for rotor efficiency. To demonstrate the feasibility of the present approach, a single stage centrifugal pump design and multistage pump design optimizations are presented. In both cases, the present method obtains very reasonable Pareto-optimal solutions that include some designs outperforming the original design in total head while reducing input power by one percent. Detailed observation of the design results also reveals some important design criteria for turbopumps in cryogenic rocket engines. These results demonstrate the feasibility of the EA-based design optimization method in this field.

  16. Optimization algorithms for large-scale multireservoir hydropower systems

    SciTech Connect

    Hiew, K.L.

    1987-01-01

    Five optimization algorithms were vigorously evaluated based on applications on a hypothetical five-reservoir hydropower system. These algorithms are incremental dynamic programming (IDP), successive linear programing (SLP), feasible direction method (FDM), optimal control theory (OCT) and objective-space dynamic programming (OSDP). The performance of these algorithms were comparatively evaluated using unbiased, objective criteria which include accuracy of results, rate of convergence, smoothness of resulting storage and release trajectories, computer time and memory requirements, robustness and other pertinent secondary considerations. Results have shown that all the algorithms, with the exception of OSDP converge to optimum objective values within 1.0% difference from one another. The highest objective value is obtained by IDP, followed closely by OCT. Computer time required by these algorithms, however, differ by more than two orders of magnitude, ranging from 10 seconds in the case of OCT to a maximum of about 2000 seconds for IDP. With a well-designed penalty scheme to deal with state-space constraints, OCT proves to be the most-efficient algorithm based on its overall performance. SLP, FDM, and OCT were applied to the case study of Mahaweli project, a ten-powerplant system in Sri Lanka.

  17. Global structual optimizations of surface systems with a genetic algorithm

    SciTech Connect

    Chuang, Feng-Chuan

    2005-05-01

    Global structural optimizations with a genetic algorithm were performed for atomic cluster and surface systems including aluminum atomic clusters, Si magic clusters on the Si(111) 7 x 7 surface, silicon high-index surfaces, and Ag-induced Si(111) reconstructions. First, the global structural optimizations of neutral aluminum clusters Al{sub n} (n up to 23) were performed using a genetic algorithm coupled with a tight-binding potential. Second, a genetic algorithm in combination with tight-binding and first-principles calculations were performed to study the structures of magic clusters on the Si(111) 7 x 7 surface. Extensive calculations show that the magic cluster observed in scanning tunneling microscopy (STM) experiments consist of eight Si atoms. Simulated STM images of the Si magic cluster exhibit a ring-like feature similar to STM experiments. Third, a genetic algorithm coupled with a highly optimized empirical potential were used to determine the lowest energy structure of high-index semiconductor surfaces. The lowest energy structures of Si(105) and Si(114) were determined successfully. The results of Si(105) and Si(114) are reported within the framework of highly optimized empirical potential and first-principles calculations. Finally, a genetic algorithm coupled with Si and Ag tight-binding potentials were used to search for Ag-induced Si(111) reconstructions at various Ag and Si coverages. The optimized structural models of {radical}3 x {radical}3, 3 x 1, and 5 x 2 phases were reported using first-principles calculations. A novel model is found to have lower surface energy than the proposed double-honeycomb chained (DHC) model both for Au/Si(111) 5 x 2 and Ag/Si(111) 5 x 2 systems.

  18. Optimal control of switched linear systems based on Migrant Particle Swarm Optimization algorithm

    NASA Astrophysics Data System (ADS)

    Xie, Fuqiang; Wang, Yongji; Zheng, Zongzhun; Li, Chuanfeng

    2009-10-01

    The optimal control problem for switched linear systems with internally forced switching has more constraints than with externally forced switching. Heavy computations and slow convergence in solving this problem is a major obstacle. In this paper we describe a new approach for solving this problem, which is called Migrant Particle Swarm Optimization (Migrant PSO). Imitating the behavior of a flock of migrant birds, the Migrant PSO applies naturally to both continuous and discrete spaces, in which definitive optimization algorithm and stochastic search method are combined. The efficacy of the proposed algorithm is illustrated via a numerical example.

  19. Computing the convex hull of disks using only their chirotope Luc Habert and Michel Pocchiola

    E-print Network

    Pocchiola, Michel

    been developped to design output sensitive convex hull algorithm [4]. (The re­ lated problem­ gorithm that computes a pseudo­triangulation given the convex­hull. This algorithm also runs in O(n log n algorithms, and our algorithms use simpler data­structures. Theoretical motivations The convex hull de­ pends

  20. Convex Hull of Arithmetic Automata

    E-print Network

    Leroux, Jrme

    2008-01-01

    Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to represent the whole set of solutions of complex linear constraints combining both integral and real variables. In this paper, the closed convex hull of arithmetic automata is proved rational polyhedral. Moreover an algorithm computing the linear constraints defining these convex set is provided. Such an algorithm is useful for effectively extracting geometrical properties of the whole set of solutions of complex constraints symbolically represented by arithmetic automata.

  1. Optimization of image processing algorithms on mobile platforms

    NASA Astrophysics Data System (ADS)

    Poudel, Pramod; Shirvaikar, Mukul

    2011-03-01

    This work presents a technique to optimize popular image processing algorithms on mobile platforms such as cell phones, net-books and personal digital assistants (PDAs). The increasing demand for video applications like context-aware computing on mobile embedded systems requires the use of computationally intensive image processing algorithms. The system engineer has a mandate to optimize them so as to meet real-time deadlines. A methodology to take advantage of the asymmetric dual-core processor, which includes an ARM and a DSP core supported by shared memory, is presented with implementation details. The target platform chosen is the popular OMAP 3530 processor for embedded media systems. It has an asymmetric dual-core architecture with an ARM Cortex-A8 and a TMS320C64x Digital Signal Processor (DSP). The development platform was the BeagleBoard with 256 MB of NAND RAM and 256 MB SDRAM memory. The basic image correlation algorithm is chosen for benchmarking as it finds widespread application for various template matching tasks such as face-recognition. The basic algorithm prototypes conform to OpenCV, a popular computer vision library. OpenCV algorithms can be easily ported to the ARM core which runs a popular operating system such as Linux or Windows CE. However, the DSP is architecturally more efficient at handling DFT algorithms. The algorithms are tested on a variety of images and performance results are presented measuring the speedup obtained due to dual-core implementation. A major advantage of this approach is that it allows the ARM processor to perform important real-time tasks, while the DSP addresses performance-hungry algorithms.

  2. Multidisciplinary Multiobjective Optimal Design for Turbomachinery Using Evolutionary Algorithm

    NASA Technical Reports Server (NTRS)

    2005-01-01

    This report summarizes Dr. Lian s efforts toward developing a robust and efficient tool for multidisciplinary and multi-objective optimal design for turbomachinery using evolutionary algorithms. This work consisted of two stages. The first stage (from July 2003 to June 2004) Dr. Lian focused on building essential capabilities required for the project. More specifically, Dr. Lian worked on two subjects: an enhanced genetic algorithm (GA) and an integrated optimization system with a GA and a surrogate model. The second stage (from July 2004 to February 2005) Dr. Lian formulated aerodynamic optimization and structural optimization into a multi-objective optimization problem and performed multidisciplinary and multi-objective optimizations on a transonic compressor blade based on the proposed model. Dr. Lian s numerical results showed that the proposed approach can effectively reduce the blade weight and increase the stage pressure ratio in an efficient manner. In addition, the new design was structurally safer than the original design. Five conference papers and three journal papers were published on this topic by Dr. Lian.

  3. Convex Hull Realizations of the Multiplihedra

    E-print Network

    Forcey, Stefan

    2007-01-01

    We present a simple algorithm for determining the extremal points in Euclidean space whose convex hull is the n^{th} polytope in the sequence known as the multiplihedra. This answers the open question of whether the multiplihedra could be realized as convex polytopes.

  4. Designing Artificial Neural Networks Using Particle Swarm Optimization Algorithms.

    PubMed

    Garro, Beatriz A; Vzquez, Roberto A

    2015-01-01

    Artificial Neural Network (ANN) design is a complex task because its performance depends on the architecture, the selected transfer function, and the learning algorithm used to train the set of synaptic weights. In this paper we present a methodology that automatically designs an ANN using particle swarm optimization algorithms such as Basic Particle Swarm Optimization (PSO), Second Generation of Particle Swarm Optimization (SGPSO), and a New Model of PSO called NMPSO. The aim of these algorithms is to evolve, at the same time, the three principal components of an ANN: the set of synaptic weights, the connections or architecture, and the transfer functions for each neuron. Eight different fitness functions were proposed to evaluate the fitness of each solution and find the best design. These functions are based on the mean square error (MSE) and the classification error (CER) and implement a strategy to avoid overtraining and to reduce the number of connections in the ANN. In addition, the ANN designed with the proposed methodology is compared with those designed manually using the well-known Back-Propagation and Levenberg-Marquardt Learning Algorithms. Finally, the accuracy of the method is tested with different nonlinear pattern classification problems. PMID:26221132

  5. Designing Artificial Neural Networks Using Particle Swarm Optimization Algorithms

    PubMed Central

    Garro, Beatriz A.; Vzquez, Roberto A.

    2015-01-01

    Artificial Neural Network (ANN) design is a complex task because its performance depends on the architecture, the selected transfer function, and the learning algorithm used to train the set of synaptic weights. In this paper we present a methodology that automatically designs an ANN using particle swarm optimization algorithms such as Basic Particle Swarm Optimization (PSO), Second Generation of Particle Swarm Optimization (SGPSO), and a New Model of PSO called NMPSO. The aim of these algorithms is to evolve, at the same time, the three principal components of an ANN: the set of synaptic weights, the connections or architecture, and the transfer functions for each neuron. Eight different fitness functions were proposed to evaluate the fitness of each solution and find the best design. These functions are based on the mean square error (MSE) and the classification error (CER) and implement a strategy to avoid overtraining and to reduce the number of connections in the ANN. In addition, the ANN designed with the proposed methodology is compared with those designed manually using the well-known Back-Propagation and Levenberg-Marquardt Learning Algorithms. Finally, the accuracy of the method is tested with different nonlinear pattern classification problems. PMID:26221132

  6. OPTIMIZATION OF TURBOMACHINERY AIRFOILS WITH A GENETIC/SEQUENTIAL QUADRATIC PROGRAMMING ALGORITHM

    E-print Network

    Dennis, Brian

    OPTIMIZATION OF TURBOMACHINERY AIRFOILS WITH A GENETIC/SEQUENTIAL QUADRATIC PROGRAMMING ALGORITHM words: shape optimization, aerodynamic design, turbomachinery, aerodynamics, genetic algorithms-magneto- gasdynamic effects. In the case of a turbomachinery aerodynamics, sources of entropy production other than

  7. Hierarchical Artificial Bee Colony Algorithm for RFID Network Planning Optimization

    PubMed Central

    Ma, Lianbo; Chen, Hanning; Hu, Kunyuan; Zhu, Yunlong

    2014-01-01

    This paper presents a novel optimization algorithm, namely, hierarchical artificial bee colony optimization, called HABC, to tackle the radio frequency identification network planning (RNP) problem. In the proposed multilevel model, the higher-level species can be aggregated by the subpopulations from lower level. In the bottom level, each subpopulation employing the canonical ABC method searches the part-dimensional optimum in parallel, which can be constructed into a complete solution for the upper level. At the same time, the comprehensive learning method with crossover and mutation operators is applied to enhance the global search ability between species. Experiments are conducted on a set of 10 benchmark optimization problems. The results demonstrate that the proposed HABC obtains remarkable performance on most chosen benchmark functions when compared to several successful swarm intelligence and evolutionary algorithms. Then HABC is used for solving the real-world RNP problem on two instances with different scales. Simulation results show that the proposed algorithm is superior for solving RNP, in terms of optimization accuracy and computation robustness. PMID:24592200

  8. Optimization of an antenna array using genetic algorithms

    SciTech Connect

    Kiehbadroudinezhad, Shahideh; Noordin, Nor Kamariah; Sali, A.; Abidin, Zamri Zainal

    2014-06-01

    An array of antennas is usually used in long distance communication. The observation of celestial objects necessitates a large array of antennas, such as the Giant Metrewave Radio Telescope (GMRT). Optimizing this kind of array is very important when observing a high performance system. The genetic algorithm (GA) is an optimization solution for these kinds of problems that reconfigures the position of antennas to increase the u-v coverage plane or decrease the sidelobe levels (SLLs). This paper presents how to optimize a correlator antenna array using the GA. A brief explanation about the GA and operators used in this paper (mutation and crossover) is provided. Then, the results of optimization are discussed. The results show that the GA provides efficient and optimum solutions among a pool of candidate solutions in order to achieve the desired array performance for the purposes of radio astronomy. The proposed algorithm is able to distribute the u-v plane more efficiently than GMRT with a more than 95% distribution ratio at snapshot, and to fill the u-v plane from a 20% to more than 68% filling ratio as the number of generations increases in the hour tracking observations. Finally, the algorithm is able to reduce the SLL to 21.75 dB.

  9. Using Heuristic Algorithms to Optimize Observing Target Sequences

    NASA Astrophysics Data System (ADS)

    Sosnowska, D.; Ouadahi, A.; Buchschacher, N.; Weber, L.; Pepe, F.

    2014-05-01

    The preparation of observations is normally carried out at the telescope by the visiting observer. In order to help the observer, we propose several algorithms to automatically optimize the sequence of targets. The optimization consists of assuring that all the chosen targets are observable within the given time interval, and to find their best execution order in terms of the observation quality and the shortest telescope displacement time. Since an exhaustive search is too expensive in time, we researched heuristic algorithms, specifically: Min-Conflict, Non-Sorting Genetic Algorithms and Simulated Annealing. Multiple metaheuristics are used in parallel to swiftly give an approximation of the best solution, with all the constraints satisfied and the total execution time minimized. The optimization process has a duration on the order of tens of seconds, allowing for quick re-adaptation in case of changing atmospheric conditions. The graphical user interface allows the user to control the parameters of the optimization process. Therefore, the search can be adjusted in real time. The module was coded in a way to allow easily the addition of new constraints, and thus ensure its compatibility with different instruments. For now, the application runs as a plug-in to the observation preparation tool called New Short Term Scheduler, which is used on three spectrographs dedicated to the exoplanets search: HARPS at the La Silla observatory, HARPS North at the La Palma observatory and SOPHIE at the Observatoire de Haute-Provence.

  10. Preliminary flight evaluation of an engine performance optimization algorithm

    NASA Technical Reports Server (NTRS)

    Lambert, H. H.; Gilyard, G. B.; Chisholm, J. D.; Kerr, L. J.

    1991-01-01

    A performance seeking control (PSC) algorithm has undergone initial flight test evaluation in subsonic operation of a PW 1128 engined F-15. This algorithm is designed to optimize the quasi-steady performance of an engine for three primary modes: (1) minimum fuel consumption; (2) minimum fan turbine inlet temperature (FTIT); and (3) maximum thrust. The flight test results have verified a thrust specific fuel consumption reduction of 1 pct., up to 100 R decreases in FTIT, and increases of as much as 12 pct. in maximum thrust. PSC technology promises to be of value in next generation tactical and transport aircraft.

  11. Preliminary flight evaluation of an engine performance optimization algorithm

    NASA Technical Reports Server (NTRS)

    Lambert, H. H.; Gilyard, G. B.; Chisholm, J. D.; Kerr, L. J.

    1991-01-01

    A performance-seeking control (PSC) algorithm has undergone initial flight test evaluation in subsonic operation of a PW 1128-engined F-15; this algorithm is designed to optimize the quasi-steady performance of an engine for three primary modes: (1) minimum fuel consumption, (2) minimum fan-turbine inlet temperature (FTIT), and (3) maximum thrust. The flight test results have verified a thrust-specific fuel consumption reduction of 1 percent, up to 100 R decreases in FTIT, and increases of as much as 12 percent in maximum thrust. PSC technology promises to be of value in next-generation tactical and transport aircraft.

  12. Approximating convex Pareto surfaces in multiobjective radiotherapy planning

    SciTech Connect

    Craft, David L.; Halabi, Tarek F.; Shih, Helen A.; Bortfeld, Thomas R.

    2006-09-15

    Radiotherapy planning involves inherent tradeoffs: the primary mission, to treat the tumor with a high, uniform dose, is in conflict with normal tissue sparing. We seek to understand these tradeoffs on a case-to-case basis, by computing for each patient a database of Pareto optimal plans. A treatment plan is Pareto optimal if there does not exist another plan which is better in every measurable dimension. The set of all such plans is called the Pareto optimal surface. This article presents an algorithm for computing well distributed points on the (convex) Pareto optimal surface of a multiobjective programming problem. The algorithm is applied to intensity-modulated radiation therapy inverse planning problems, and results of a prostate case and a skull base case are presented, in three and four dimensions, investigating tradeoffs between tumor coverage and critical organ sparing.

  13. NEW LOWER BOUNDS FOR CONVEX HULL PROBLEMS IN ODD DIMENSIONS

    E-print Network

    Erickson, Jeff

    . In 1970, Chand and Ka- pur 13] described a "gift-wrapping" algorithm that constructs convex hulls in arNEW LOWER BOUNDS FOR CONVEX HULL PROBLEMS IN ODD DIMENSIONS JEFF ERICKSONy Abstract. We show that in the worst case, (ndd=2e;1 +n logn) sidedness queries are required to determine whether the convex hull of n

  14. Convex Hulls (3D) O'Rourke, Chapter 4

    E-print Network

    Kazhdan, Michael

    to the convex hull. #12;Incremental Algorithm Incremental( ): ­ Hull( 0 , 1 , 2 , 3 ) ­ For [4, ): · MarkConvex Hulls (3D) O'Rourke, Chapter 4 #12;Gift Wrapping GiftWrap( ): ­ HullTriangle( ) ­ { 1 to the convex hull. #12;Gift Wrapping As in 2D, use the fact that all the points must be to the left

  15. Byzantine Convex Consensus: Preliminary Version Lewis Tseng1,3

    E-print Network

    Vaidya, Nitin

    in the convex hull of the input vectors at the fault-free nodes [8, 12]. The d-dimensional vectors can polytope is within the convex hull of the input vectors at the fault-free nodes. We name this problem as Byzantine convex consensus (BCC), and present an asynchronous approximate BCC algorithm with op- timal fault

  16. Computing Small Hitting Sets for Convex Ranges. Stefan Langerman

    E-print Network

    Goldman, William

    Computing Small Hitting Sets for Convex Ranges. Stefan Langerman Mudassir Shabbir William Steiger comprise a hitting set of size two for such convex ranges. This algorithm can then be used to construct (i for S, every convex set of size > 2n/3 MUST contain z. A centerpoint may thus be said to "hit" all

  17. Reaction Path Optimization without NEB Springs or Interpolation Algorithms.

    PubMed

    Plessow, P

    2013-03-12

    This letter describes a chain-of-states method that optimizes reaction paths under the sole constraint of equally spaced structures. In contrast to NEB and string methods, it requires no spring forces, interpolation algorithms, or other heuristics to control structure distribution. Rigorous use of a quadratic PES allows calculation of an optimization step with a predefined distribution in Cartesian space. The method is a formal extension of single-structure quasi-Newton methods. An initial guess can be evolved, as in the growing string method. PMID:26587592

  18. A Nature-Inspired Firefly Algorithm Based Approach for Nanoscale Leakage Optimal RTL Structure

    E-print Network

    Mohanty, Saraju P.

    A Nature-Inspired Firefly Algorithm Based Approach for Nanoscale Leakage Optimal RTL Structure and binding. The optimization approach uses a nature-inspired firefly algorithm so that large digital integrated circuits can be effectively handled without convergence issues. The firefly algorithm optimizes

  19. An algorithm for optimal centralized landing location: rectilinear yarding operations on flat

    E-print Network

    Greulich, Francis E.

    An algorithm for optimal centralized landing location: rectilinear yarding operations on flat uniform terrain1 Francis E. Greulich Abstract: An algorithm is developed for the optimal location an algorithm that optimizes landing placement for the most basic case of rectilinear yarding to a single

  20. A Honey-bee Mating Optimization Algorithm for Educational Timetabling Problems

    E-print Network

    Qu, Rong

    1 A Honey-bee Mating Optimization Algorithm for Educational Timetabling Problems Nasser R. Sabar1 of the Honey-bee Mating Optimization Algorithm for solv- ing educational timetabling problems. The honey-bee algorithm is a nature inspired algorithm which sim- ulates the process of real honey-bees mating

  1. Improvements to a Newton-Krylov Adjoint Algorithm for Aerodynamic Optimization

    E-print Network

    Zingg, David W.

    Improvements to a Newton-Krylov Adjoint Algorithm for Aerodynamic Optimization David W. Zingg-based algorithm for aerodynamic optimization. A Newton-Krylov algorithm is used to solve the compressible Navier of the improvements on the performance of the algorithm is presented. I. Introduction Numerical aerodynamic shape

  2. Optimization of experimental design in fMRI: a general framework using a genetic algorithm

    E-print Network

    Optimization of experimental design in fMRI: a general framework using a genetic algorithm Tor D uses a genetic algorithm (GA), a class of flexible search algorithms that optimize designs with respect genetic algorithms may be applied to experimental design for fMRI, and we use the framework to explore

  3. Genetic algorithms used for the optimization of light-emitting diodes and solar thermal collectors

    E-print Network

    Mayer, Alexandre

    Genetic algorithms used for the optimization of light-emitting diodes and solar thermal collectors of Namur, Rempart de la Vierge 8, 5000 Namur, Belgium ABSTRACT We present a genetic algorithm (GA) we algorithms for addressing complex problems in physics. Keywords: genetic algorithm, optimization, light

  4. GMG - A guaranteed global optimization algorithm: Application to remote sensing

    SciTech Connect

    D'Helon, Cassius; Protopopescu, Vladimir A; Wells, Jack C; Barhen, Jacob

    2007-01-01

    We investigate the role of additional information in reducing the computational complexity of the global optimization problem (GOP). Following this approach, we develop GMG -- an algorithm to find the Global Minimum with a Guarantee. The new algorithm breaks up an originally continuous GOP into a discrete (grid) search problem followed by a descent problem. The discrete search identifies the basin of attraction of the global minimum after which the actual location of the minimizer is found upon applying a descent algorithm. The algorithm is first applied to the golf course problem, which serves as a litmus test for its performance in the presence of both complete and degraded additional information. GMG is further assessed on a set of standard benchmark functions. We then illustrate the performance of the the validated algorithm on a simple realization of the monocular passive ranging (MPR) problem in remote sensing, which consists of identifying the range of an airborne target (missile, plane, etc.) from its observed radiance. This inverse problem is set as a GOP whereby the difference between the observed and model predicted radiances is minimized over the possible ranges and atmospheric conditions. We solve the GOP using GMG and report on the performance of the algorithm.

  5. Genetic Algorithm Application in Optimization of Wireless Sensor Networks

    PubMed Central

    Norouzi, Ali; Zaim, A. Halim

    2014-01-01

    There are several applications known for wireless sensor networks (WSN), and such variety demands improvement of the currently available protocols and the specific parameters. Some notable parameters are lifetime of network and energy consumption for routing which play key role in every application. Genetic algorithm is one of the nonlinear optimization methods and relatively better option thanks to its efficiency for large scale applications and that the final formula can be modified by operators. The present survey tries to exert a comprehensive improvement in all operational stages of a WSN including node placement, network coverage, clustering, and data aggregation and achieve an ideal set of parameters of routing and application based WSN. Using genetic algorithm and based on the results of simulations in NS, a specific fitness function was achieved, optimized, and customized for all the operational stages of WSNs. PMID:24693235

  6. Parallel Algorithms for Graph Optimization using Tree Decompositions

    SciTech Connect

    Sullivan, Blair D; Weerapurage, Dinesh P; Groer, Christopher S

    2012-06-01

    Although many $\\cal{NP}$-hard graph optimization problems can be solved in polynomial time on graphs of bounded tree-width, the adoption of these techniques into mainstream scientific computation has been limited due to the high memory requirements of the necessary dynamic programming tables and excessive runtimes of sequential implementations. This work addresses both challenges by proposing a set of new parallel algorithms for all steps of a tree decomposition-based approach to solve the maximum weighted independent set problem. A hybrid OpenMP/MPI implementation includes a highly scalable parallel dynamic programming algorithm leveraging the MADNESS task-based runtime, and computational results demonstrate scaling. This work enables a significant expansion of the scale of graphs on which exact solutions to maximum weighted independent set can be obtained, and forms a framework for solving additional graph optimization problems with similar techniques.

  7. Parallel Algorithms for Graph Optimization using Tree Decompositions

    SciTech Connect

    Weerapurage, Dinesh P; Sullivan, Blair D; Groer, Christopher S

    2013-01-01

    Although many NP-hard graph optimization problems can be solved in polynomial time on graphs of bounded tree-width, the adoption of these techniques into mainstream scientific computation has been limited due to the high memory requirements of required dynamic programming tables and excessive running times of sequential implementations. This work addresses both challenges by proposing a set of new parallel algorithms for all steps of a tree-decomposition based approach to solve maximum weighted independent set. A hybrid OpenMP/MPI implementation includes a highly scalable parallel dynamic programming algorithm leveraging the MADNESS task-based runtime, and computational results demonstrate scaling. This work enables a significant expansion of the scale of graphs on which exact solutions to maximum weighted independent set can be obtained, and forms a framework for solving additional graph optimization problems with similar techniques.

  8. Operational Optimal Ship Routing Using a Hybrid Parallel Genetic Algorithm

    E-print Network

    O. T. Kosmas; D. S. Vlachos

    2009-05-04

    Optimization of ship routing depends on several parameters, like ship and cargo characteristics, environmental factors, topography, international navigation rules, crew comfort etc. The complex nature of the problem leads to oversimplifications in analytical techniques, while stochastic methods like simulated annealing can be both time consuming and sensitive to local minima. In this work, a hybrid parallel genetic algorithm - estimation of distribution algorithm is developed in the island model, to operationally calculate the optimal ship routing. The technique, which is applicable not only to clusters but to grids as well, is very fast and has been applied to very difficult environments, like the Greek seas with thousands of islands and extreme micro-climate conditions.

  9. Optimizing SRF Gun Cavity Profiles in a Genetic Algorithm Framework

    SciTech Connect

    Alicia Hofler, Pavel Evtushenko, Frank Marhauser

    2009-09-01

    Automation of DC photoinjector designs using a genetic algorithm (GA) based optimization is an accepted practice in accelerator physics. Allowing the gun cavity field profile shape to be varied can extend the utility of this optimization methodology to superconducting and normal conducting radio frequency (SRF/RF) gun based injectors. Finding optimal field and cavity geometry configurations can provide guidance for cavity design choices and verify existing designs. We have considered two approaches for varying the electric field profile. The first is to determine the optimal field profile shape that should be used independent of the cavity geometry, and the other is to vary the geometry of the gun cavity structure to produce an optimal field profile. The first method can provide a theoretical optimal and can illuminate where possible gains can be made in field shaping. The second method can produce more realistically achievable designs that can be compared to existing designs. In this paper, we discuss the design and implementation for these two methods for generating field profiles for SRF/RF guns in a GA based injector optimization scheme and provide preliminary results.

  10. What Does Digital Straightness Tell About Digital Convexity ?

    E-print Network

    Sivignon, Isabelle

    without any ex- tra cost: the hull of each convex or concave part as well as the Bezout points of each edge of those hulls. The proposed algorithm involves well- understood algorithms: adding a point-time algorithm is introduced for the decomposition of a digital boundary into convex and concave parts

  11. Optimizing phase-estimation algorithms for diamond spin magnetometry

    NASA Astrophysics Data System (ADS)

    Nusran, N. M.; Dutt, M. V. Gurudev

    2014-07-01

    We present a detailed theoretical and numerical study discussing the application and optimization of phase-estimation algorithms (PEAs) to diamond spin magnetometry. We compare standard Ramsey magnetometry, the nonadaptive PEA (NAPEA), and quantum PEA (QPEA) incorporating error checking. Our results show that the NAPEA requires lower measurement fidelity, has better dynamic range, and greater consistency in sensitivity. We elucidate the importance of dynamic range to Ramsey magnetic imaging with diamond spins, and introduce the application of PEAs to time-dependent magnetometry.

  12. Stochastic search in structural optimization - Genetic algorithms and simulated annealing

    NASA Technical Reports Server (NTRS)

    Hajela, Prabhat

    1993-01-01

    An account is given of illustrative applications of genetic algorithms and simulated annealing methods in structural optimization. The advantages of such stochastic search methods over traditional mathematical programming strategies are emphasized; it is noted that these methods offer a significantly higher probability of locating the global optimum in a multimodal design space. Both genetic-search and simulated annealing can be effectively used in problems with a mix of continuous, discrete, and integer design variables.

  13. Constrained Multi-Level Algorithm for Trajectory Optimization

    NASA Astrophysics Data System (ADS)

    Adimurthy, V.; Tandon, S. R.; Jessy, Antony; Kumar, C. Ravi

    The emphasis on low cost access to space inspired many recent developments in the methodology of trajectory optimization. Ref.1 uses a spectral patching method for optimization, where global orthogonal polynomials are used to describe the dynamical constraints. A two-tier approach of optimization is used in Ref.2 for a missile mid-course trajectory optimization. A hybrid analytical/numerical approach is described in Ref.3, where an initial analytical vacuum solution is taken and gradually atmospheric effects are introduced. Ref.4 emphasizes the fact that the nonlinear constraints which occur in the initial and middle portions of the trajectory behave very nonlinearly with respect the variables making the optimization very difficult to solve in the direct and indirect shooting methods. The problem is further made complex when different phases of the trajectory have different objectives of optimization and also have different path constraints. Such problems can be effectively addressed by multi-level optimization. In the multi-level methods reported so far, optimization is first done in identified sub-level problems, where some coordination variables are kept fixed for global iteration. After all the sub optimizations are completed, higher-level optimization iteration with all the coordination and main variables is done. This is followed by further sub system optimizations with new coordination variables. This process is continued until convergence. In this paper we use a multi-level constrained optimization algorithm which avoids the repeated local sub system optimizations and which also removes the problem of non-linear sensitivity inherent in the single step approaches. Fall-zone constraints, structural load constraints and thermal constraints are considered. In this algorithm, there is only a single multi-level sequence of state and multiplier updates in a framework of an augmented Lagrangian. Han Tapia multiplier updates are used in view of their special role in diagonalised methods, being the only single update with quadratic convergence. For a single level, the diagonalised multiplier method (DMM) is described in Ref.5. The main advantage of the two-level analogue of the DMM approach is that it avoids the inner loop optimizations required in the other methods. The scheme also introduces a gradient change measure to reduce the computational time needed to calculate the gradients. It is demonstrated that the new multi-level scheme leads to a robust procedure to handle the sensitivity of the constraints, and the multiple objectives of different trajectory phases. Ref. 1. Fahroo, F and Ross, M., " A Spectral Patching Method for Direct Trajectory Optimization" The Journal of the Astronautical Sciences, Vol.48, 2000, pp.269-286 Ref. 2. Phililps, C.A. and Drake, J.C., "Trajectory Optimization for a Missile using a Multitier Approach" Journal of Spacecraft and Rockets, Vol.37, 2000, pp.663-669 Ref. 3. Gath, P.F., and Calise, A.J., " Optimization of Launch Vehicle Ascent Trajectories with Path Constraints and Coast Arcs", Journal of Guidance, Control, and Dynamics, Vol. 24, 2001, pp.296-304 Ref. 4. Betts, J.T., " Survey of Numerical Methods for Trajectory Optimization", Journal of Guidance, Control, and Dynamics, Vol.21, 1998, pp. 193-207 Ref. 5. Adimurthy, V., " Launch Vehicle Trajectory Optimization", Acta Astronautica, Vol.15, 1987, pp.845-850.

  14. Gradient gravitational search: An efficient metaheuristic algorithm for global optimization.

    PubMed

    Dash, Tirtharaj; Sahu, Prabhat K

    2015-05-30

    The adaptation of novel techniques developed in the field of computational chemistry to solve the concerned problems for large and flexible molecules is taking the center stage with regard to efficient algorithm, computational cost and accuracy. In this article, the gradient-based gravitational search (GGS) algorithm, using analytical gradients for a fast minimization to the next local minimum has been reported. Its efficiency as metaheuristic approach has also been compared with Gradient Tabu Search and others like: Gravitational Search, Cuckoo Search, and Back Tracking Search algorithms for global optimization. Moreover, the GGS approach has also been applied to computational chemistry problems for finding the minimal value potential energy of two-dimensional and three-dimensional off-lattice protein models. The simulation results reveal the relative stability and physical accuracy of protein models with efficient computational cost. PMID:25779670

  15. Autonomous Distributed Optimization Algorithm for Intelligent Lighting System

    NASA Astrophysics Data System (ADS)

    Ono, Keiko; Miki, Mitsunori; Yonezawa, Motoi

    In recent years, various types of equipment have become more intelligent. In this research, we propose an intelligent lighting system for providing required illuminance to specified locations, and develop autonomous distributed optimization algorithm which enables advanced lighting control. This system consists of multiple intelligent lighting fixtures, multiple movable illumination sensors and a power meter connected to a network. There is no central unit, therefore, the system has high robustness against the malfunction. We propose a new algorithm which provides rapid convergence to the target illumination by using a correlation of the illuminance and the luminance. We constructed with a dimmer experimental system, that is comprised of 15 fluorescent lights, and several movable illuminance sensors. The verification tests were carried out in the different environments using the proposed control method. We confirmed that the algorithm can provide good performance to environmental change and it is effective to energy saving.

  16. Optimization of a statistical algorithm for objective comparison of toolmarks.

    PubMed

    Spotts, Ryan; Chumbley, L Scott; Ekstrand, Laura; Zhang, Song; Kreiser, James

    2015-03-01

    Due to historical legal challenges, there is a driving force for the development of objective methods of forensic toolmark identification. This study utilizes an algorithm to separate matching and nonmatching shear cut toolmarks created using fifty sequentially manufactured pliers. Unlike previously analyzed striated screwdriver marks, shear cut marks contain discontinuous groups of striations, posing a more difficult test of algorithm applicability. The algorithm compares correlation between optical 3D toolmark topography data, producing a Wilcoxon rank sum test statistic. Relative magnitude of this metric separates the matching and nonmatching toolmarks. Results show a high degree of statistical separation between matching and nonmatching distributions. Further separation is achieved with optimized input parameters and implementation of a "leash" preventing a previous source of outliers--however complete statistical separation was not achieved. This paper represents further development of objective methods of toolmark identification and further validation of the assumption that toolmarks are identifiably unique. PMID:25425426

  17. A Genetic Algorithm to Optimize a Tweet for Retweetability

    E-print Network

    Hochreiter, Ronald

    2014-01-01

    Twitter is a popular microblogging platform. When users send out messages, other users have the ability to forward these messages to their own subgraph. Most research focuses on increasing retweetability from a node's perspective. Here, we center on improving message style to increase the chance of a message being forwarded. To this end, we simulate an artificial Twitter-like network with nodes deciding deterministically on retweeting a message or not. A genetic algorithm is used to optimize message composition, so that the reach of a message is increased. When analyzing the algorithm's runtime behavior across a set of different node types, we find that the algorithm consistently succeeds in significantly improving the retweetability of a message.

  18. Managing and learning with multiple models: Objectives and optimization algorithms

    USGS Publications Warehouse

    Probert, William J. M.; Hauser, C.E.; McDonald-Madden, E.; Runge, M.C.; Baxter, P.W.J.; Possingham, H.P.

    2011-01-01

    The quality of environmental decisions should be gauged according to managers' objectives. Management objectives generally seek to maximize quantifiable measures of system benefit, for instance population growth rate. Reaching these goals often requires a certain degree of learning about the system. Learning can occur by using management action in combination with a monitoring system. Furthermore, actions can be chosen strategically to obtain specific kinds of information. Formal decision making tools can choose actions to favor such learning in two ways: implicitly via the optimization algorithm that is used when there is a management objective (for instance, when using adaptive management), or explicitly by quantifying knowledge and using it as the fundamental project objective, an approach new to conservation.This paper outlines three conservation project objectives - a pure management objective, a pure learning objective, and an objective that is a weighted mixture of these two. We use eight optimization algorithms to choose actions that meet project objectives and illustrate them in a simulated conservation project. The algorithms provide a taxonomy of decision making tools in conservation management when there is uncertainty surrounding competing models of system function. The algorithms build upon each other such that their differences are highlighted and practitioners may see where their decision making tools can be improved. ?? 2010 Elsevier Ltd.

  19. The genealogy of convex solids

    E-print Network

    Domokos, Gabor; Szab, Timea

    2012-01-01

    The shape of homogeneous, smooth convex bodies as described by the Euclidean distance from the center of gravity represents a rather restricted class M_C of Morse-Smale functions on S^2. Here we show that even M_C exhibits the complexity known for general Morse-Smale functions on S^2 by exhausting all combinatorial possibilities: every 2-colored quadrangulation of the sphere is isomorphic to a suitably represented Morse-Smale complex associated with a function in M_C (and vice versa). We prove our claim by an inductive algorithm, starting from the path graph P_2 and generating convex bodies corresponding to quadrangulations with increasing number of vertices by performing each combinatorially possible vertex splitting by a convexity- preserving local manipulation of the surface. Since convex bodies carrying Morse-Smale complexes isomorphic to P_2 exist, this algorithm not only proves our claim but also defines a hierarchical order among convex solids and general- izes the known classification scheme in [35], ...

  20. An Accelerated Particle Swarm Optimization Algorithm on Parametric Optimization of WEDM of Die-Steel

    NASA Astrophysics Data System (ADS)

    Muthukumar, V.; Suresh Babu, A.; Venkatasamy, R.; Senthil Kumar, N.

    2015-01-01

    This study employed Accelerated Particle Swarm Optimization (APSO) algorithm to optimize the machining parameters that lead to a maximum Material Removal Rate (MRR), minimum surface roughness and minimum kerf width values for Wire Electrical Discharge Machining (WEDM) of AISI D3 die-steel. Four machining parameters that are optimized using APSO algorithm include Pulse on-time, Pulse off-time, Gap voltage, Wire feed. The machining parameters are evaluated by Taguchi's L9 Orthogonal Array (OA). Experiments are conducted on a CNC WEDM and output responses such as material removal rate, surface roughness and kerf width are determined. The empirical relationship between control factors and output responses are established by using linear regression models using Minitab software. Finally, APSO algorithm, a nature inspired metaheuristic technique, is used to optimize the WEDM machining parameters for higher material removal rate and lower kerf width with surface roughness as constraint. The confirmation experiments carried out with the optimum conditions show that the proposed algorithm was found to be potential in finding numerous optimal input machining parameters which can fulfill wide requirements of a process engineer working in WEDM industry.

  1. Logic-Based Outer Approximation for Globally Optimal Synthesis of Process Networks

    E-print Network

    Grossmann, Ignacio E.

    disjunction with its big-M or its convex hull reformulation (Lee and Grossmann, 2000). Major methods for MINLP the convex hull relaxation of the remaining disjunctions. Trkay and Grossmann (1996) proposed a Logic. A new deterministic algorithm for the global optimization of process networks is presented in this work

  2. Semi-deterministic and genetic algorithms for global optimization of microfluidic protein folding

    E-print Network

    Santiago, Juan G.

    Semi-deterministic and genetic algorithms for global optimization of microfluidic protein folding - In this paper we reformulate global optimization problems in terms of boundary value problems (BVP). This allows algorithm. Keywords: Shape optimization, Global optimization, Dynamical systems, Boundary value problem

  3. Optimal Robust Motion Controller Design Using Multiobjective Genetic Algorithm

    PubMed Central

    Sve?ko, Rajko

    2014-01-01

    This paper describes the use of a multiobjective genetic algorithm for robust motion controller design. Motion controller structure is based on a disturbance observer in an RIC framework. The RIC approach is presented in the form with internal and external feedback loops, in which an internal disturbance rejection controller and an external performance controller must be synthesised. This paper involves novel objectives for robustness and performance assessments for such an approach. Objective functions for the robustness property of RIC are based on simple even polynomials with nonnegativity conditions. Regional pole placement method is presented with the aims of controllers' structures simplification and their additional arbitrary selection. Regional pole placement involves arbitrary selection of central polynomials for both loops, with additional admissible region of the optimized pole location. Polynomial deviation between selected and optimized polynomials is measured with derived performance objective functions. A multiobjective function is composed of different unrelated criteria such as robust stability, controllers' stability, and time-performance indexes of closed loops. The design of controllers and multiobjective optimization procedure involve a set of the objectives, which are optimized simultaneously with a genetic algorithmdifferential evolution. PMID:24987749

  4. Gravitational Lens Modeling with Genetic Algorithms and Particle Swarm Optimizers

    E-print Network

    Rogers, Adam

    2011-01-01

    Strong gravitational lensing of an extended object is described by a mapping from source to image coordinates that is nonlinear and cannot generally be inverted analytically. Determining the structure of the source intensity distribution also requires a description of the blurring effect due to a point spread function. This initial study uses an iterative gravitational lens modeling scheme based on the semilinear method to determine the linear parameters (source intensity profile) of a strongly lensed system. Our 'matrix-free' approach avoids construction of the lens and blurring operators while retaining the least squares formulation of the problem. The parameters of an analytical lens model are found through nonlinear optimization by an advanced genetic algorithm (GA) and particle swarm optimizer (PSO). These global optimization routines are designed to explore the parameter space thoroughly, mapping model degeneracies in detail. We develop a novel method that determines the L-curve for each solution automa...

  5. A heterogeneous algorithm for PDT dose optimization for prostate

    NASA Astrophysics Data System (ADS)

    Altschuler, Martin D.; Zhu, Timothy C.; Hu, Yida; Finlay, Jarod C.; Dimofte, Andreea; Wang, Ken; Li, Jun; Cengel, Keith; Malkowicz, S. B.; Hahn, Stephen M.

    2009-02-01

    The object of this study is to develop optimization procedures that account for both the optical heterogeneity as well as photosensitizer (PS) drug distribution of the patient prostate and thereby enable delivery of uniform photodynamic dose to that gland. We use the heterogeneous optical properties measured for a patient prostate to calculate a light fluence kernel (table). PS distribution is then multiplied with the light fluence kernel to form the PDT dose kernel. The Cimmino feasibility algorithm, which is fast, linear, and always converges reliably, is applied as a search tool to choose the weights of the light sources to optimize PDT dose. Maximum and minimum PDT dose limits chosen for sample points in the prostate constrain the solution for the source strengths of the cylindrical diffuser fibers (CDF). We tested the Cimmino optimization procedures using the light fluence kernel generated for heterogeneous optical properties, and compared the optimized treatment plans with those obtained using homogeneous optical properties. To study how different photosensitizer distributions in the prostate affect optimization, comparisons of light fluence rate and PDT dose distributions were made with three distributions of photosensitizer: uniform, linear spatial distribution, and the measured PS distribution. The study shows that optimization of individual light source positions and intensities are feasible for the heterogeneous prostate during PDT.

  6. AN ASSOCIATIVE DYNAMIC CONVEX HULL MAHER M. ATWAH JOHNNIE W. BAKER

    E-print Network

    Potter, Jerry L.

    AN ASSOCIATIVE DYNAMIC CONVEX HULL ALGORITHM MAHER M. ATWAH JOHNNIE W. BAKER Mathematics a new parallel algorithm for the dynamic convex hull problem. This algorithm is a parallel adaptation The convex hull of a nite set of a set S of n planar points is an important geometric concept. It can be de

  7. Efficiency Improvements to the Displacement Based Multilevel Structural Optimization Algorithm

    NASA Technical Reports Server (NTRS)

    Plunkett, C. L.; Striz, A. G.; Sobieszczanski-Sobieski, J.

    2001-01-01

    Multilevel Structural Optimization (MSO) continues to be an area of research interest in engineering optimization. In the present project, the weight optimization of beams and trusses using Displacement based Multilevel Structural Optimization (DMSO), a member of the MSO set of methodologies, is investigated. In the DMSO approach, the optimization task is subdivided into a single system and multiple subsystems level optimizations. The system level optimization minimizes the load unbalance resulting from the use of displacement functions to approximate the structural displacements. The function coefficients are then the design variables. Alternately, the system level optimization can be solved using the displacements themselves as design variables, as was shown in previous research. Both approaches ensure that the calculated loads match the applied loads. In the subsystems level, the weight of the structure is minimized using the element dimensions as design variables. The approach is expected to be very efficient for large structures, since parallel computing can be utilized in the different levels of the problem. In this paper, the method is applied to a one-dimensional beam and a large three-dimensional truss. The beam was tested to study possible simplifications to the system level optimization. In previous research, polynomials were used to approximate the global nodal displacements. The number of coefficients of the polynomials equally matched the number of degrees of freedom of the problem. Here it was desired to see if it is possible to only match a subset of the degrees of freedom in the system level. This would lead to a simplification of the system level, with a resulting increase in overall efficiency. However, the methods tested for this type of system level simplification did not yield positive results. The large truss was utilized to test further improvements in the efficiency of DMSO. In previous work, parallel processing was applied to the subsystems level, where the derivative verification feature of the optimizer NPSOL had been utilized in the optimizations. This resulted in large runtimes. In this paper, the optimizations were repeated without using the derivative verification, and the results are compared to those from the previous work. Also, the optimizations were run on both, a network of SUN workstations using the MPICH implementation of the Message Passing Interface (MPI) and on the faster Beowulf cluster at ICASE, NASA Langley Research Center, using the LAM implementation of UP]. The results on both systems were consistent and showed that it is not necessary to verify the derivatives and that this gives a large increase in efficiency of the DMSO algorithm.

  8. Swarm algorithms for single- and multi-objective optimization problems incorporating sensitivity analysis

    NASA Astrophysics Data System (ADS)

    Izui, K.; Nishiwaki, S.; Yoshimura, M.

    2007-12-01

    Swarm algorithms such as particle swarm optimization (PSO) are non-gradient probabilistic optimization algorithms that have been successfully applied for global searches in complex problems such as multi-peak problems. However, application of these algorithms to structural and mechanical optimization problems still remains a complex matter since local optimization capability is still inferior to general numerical optimization methods. This article discusses new swarm metaphors that incorporate design sensitivities concerning objective and constraint functions and are applicable to structural and mechanical design optimization problems. Single- and multi-objective optimization techniques using swarm algorithms are combined with a gradient-based method. In the proposed techniques, swarm optimization algorithms and a sequential linear programming (SLP) method are conducted simultaneously. Finally, truss structure design optimization problems are solved by the proposed hybrid method to verify the optimization efficiency.

  9. Bracketing to speed convergence illustrated on the von Newmann algorithm for finding a feasible solution to a linear program with a convexity contraint. Technical report

    SciTech Connect

    Dantzig, G.B.

    1992-10-01

    Analogous to gunners firing trial shots to bracket a target in order to adjust direction and distance, we demonstate that it is sometimes faster not to apply an algorithm directly, but to roughly approximately solve several perturbations of the problem and then combine these rough approximations to get an exact solution. To find a feasible solution to an m-equation linear program with a convexity constraint, the von Neumann Algorithm generates a sequence of approximate solutions which converge very slowly to the right hand side b{sup 0}. However, it can be redirected so that in the first few iterations it is guaranteed to move rapidly towards the neighborhood of one of m + 1 perturbed right hand sides {cflx b}{sup i}, then redirected in turn to the next {cflx b}{sup i}. Once within the neighborhood of each {cflx b}{sup i}, a weighted sum of the approximate solutions. {bar x}{sup i} yields the exact solution of the unperturbed problem where the weights are found by solving a system of m + 1 equations in m + 1 unknowns. It is assumed an r > 0 is given for which the problem is feasible for all right hand sides b whose distance {parallel}b - b{sup 0}{parallel}{sub 2} {le} r. The feasible solution is found in less than 4(m+ 1){sup 3}/r{sup 2} iterations. The work per iteration is {delta}mn + 2m + n + 9 multiplications plus {delta}mn + m + n + 9 additions or comparisons where {delta} is the density of nonzero coeffients in the matrix.

  10. Bracketing to speed convergence illustrated on the von Newmann algorithm for finding a feasible solution to a linear program with a convexity contraint

    SciTech Connect

    Dantzig, G.B.

    1992-10-01

    Analogous to gunners firing trial shots to bracket a target in order to adjust direction and distance, we demonstate that it is sometimes faster not to apply an algorithm directly, but to roughly approximately solve several perturbations of the problem and then combine these rough approximations to get an exact solution. To find a feasible solution to an m-equation linear program with a convexity constraint, the von Neumann Algorithm generates a sequence of approximate solutions which converge very slowly to the right hand side b[sup 0]. However, it can be redirected so that in the first few iterations it is guaranteed to move rapidly towards the neighborhood of one of m + 1 perturbed right hand sides [cflx b][sup i], then redirected in turn to the next [cflx b][sup i]. Once within the neighborhood of each [cflx b][sup i], a weighted sum of the approximate solutions. [bar x][sup i] yields the exact solution of the unperturbed problem where the weights are found by solving a system of m + 1 equations in m + 1 unknowns. It is assumed an r > 0 is given for which the problem is feasible for all right hand sides b whose distance [parallel]b - b[sup 0][parallel][sub 2] [le] r. The feasible solution is found in less than 4(m+ 1)[sup 3]/r[sup 2] iterations. The work per iteration is [delta]mn + 2m + n + 9 multiplications plus [delta]mn + m + n + 9 additions or comparisons where [delta] is the density of nonzero coeffients in the matrix.

  11. Award DE-FG02-04ER52655 Final Technical Report: Interior Point Algorithms for Optimization Problems

    SciTech Connect

    O'Leary, Dianne P.; Tits, Andre

    2014-04-03

    Over the period of this award we developed an algorithmic framework for constraint reduction in linear programming (LP) and convex quadratic programming (QP), proved convergence of our algorithms, and applied them to a variety of applications, including entropy-based moment closure in gas dynamics.

  12. Optimized Algorithms for Prediction Within Robotic Tele-Operative Interfaces

    NASA Technical Reports Server (NTRS)

    Martin, Rodney A.; Wheeler, Kevin R.; Allan, Mark B.; SunSpiral, Vytas

    2010-01-01

    Robonaut, the humanoid robot developed at the Dexterous Robotics Labo ratory at NASA Johnson Space Center serves as a testbed for human-rob ot collaboration research and development efforts. One of the recent efforts investigates how adjustable autonomy can provide for a safe a nd more effective completion of manipulation-based tasks. A predictiv e algorithm developed in previous work was deployed as part of a soft ware interface that can be used for long-distance tele-operation. In this work, Hidden Markov Models (HMM?s) were trained on data recorded during tele-operation of basic tasks. In this paper we provide the d etails of this algorithm, how to improve upon the methods via optimization, and also present viable alternatives to the original algorithmi c approach. We show that all of the algorithms presented can be optim ized to meet the specifications of the metrics shown as being useful for measuring the performance of the predictive methods. 1

  13. Optimal design of link systems using successive zooming genetic algorithm

    NASA Astrophysics Data System (ADS)

    Kwon, Young-Doo; Sohn, Chang-hyun; Kwon, Soon-Bum; Lim, Jae-gyoo

    2009-07-01

    Link-systems have been around for a long time and are still used to control motion in diverse applications such as automobiles, robots and industrial machinery. This study presents a procedure involving the use of a genetic algorithm for the optimal design of single four-bar link systems and a double four-bar link system used in diesel engine. We adopted the Successive Zooming Genetic Algorithm (SZGA), which has one of the most rapid convergence rates among global search algorithms. The results are verified by experiment and the Recurdyn dynamic motion analysis package. During the optimal design of single four-bar link systems, we found in the case of identical input/output (IO) angles that the initial and final configurations show certain symmetry. For the double link system, we introduced weighting factors for the multi-objective functions, which minimize the difference between output angles, providing balanced engine performance, as well as the difference between final output angle and the desired magnitudes of final output angle. We adopted a graphical method to select a proper ratio between the weighting factors.

  14. Scope of Gradient and Genetic Algorithms in Multivariable Function Optimization

    NASA Technical Reports Server (NTRS)

    Shaykhian, Gholam Ali; Sen, S. K.

    2007-01-01

    Global optimization of a multivariable function - constrained by bounds specified on each variable and also unconstrained - is an important problem with several real world applications. Deterministic methods such as the gradient algorithms as well as the randomized methods such as the genetic algorithms may be employed to solve these problems. In fact, there are optimization problems where a genetic algorithm/an evolutionary approach is preferable at least from the quality (accuracy) of the results point of view. From cost (complexity) point of view, both gradient and genetic approaches are usually polynomial-time; there are no serious differences in this regard, i.e., the computational complexity point of view. However, for certain types of problems, such as those with unacceptably erroneous numerical partial derivatives and those with physically amplified analytical partial derivatives whose numerical evaluation involves undesirable errors and/or is messy, a genetic (stochastic) approach should be a better choice. We have presented here the pros and cons of both the approaches so that the concerned reader/user can decide which approach is most suited for the problem at hand. Also for the function which is known in a tabular form, instead of an analytical form, as is often the case in an experimental environment, we attempt to provide an insight into the approaches focusing our attention toward accuracy. Such an insight will help one to decide which method, out of several available methods, should be employed to obtain the best (least error) output. *

  15. Tractable fitting with convex polynomials via sum-of-squares Alessandro Magnani

    E-print Network

    . This technique is extended to enforce convexity of f only on a specified region. Also, an algorithm to fit the convex hull of a set of points with a convex sub-level set of a polynomial is presented. This problemTractable fitting with convex polynomials via sum-of-squares Alessandro Magnani Department

  16. Genetic algorithm optimized triply compensated pulses in NMR spectroscopy

    NASA Astrophysics Data System (ADS)

    Manu, V. S.; Veglia, Gianluigi

    2015-11-01

    Sensitivity and resolution in NMR experiments are affected by magnetic field inhomogeneities (of both external and RF), errors in pulse calibration, and offset effects due to finite length of RF pulses. To remedy these problems, built-in compensation mechanisms for these experimental imperfections are often necessary. Here, we propose a new family of phase-modulated constant-amplitude broadband pulses with high compensation for RF inhomogeneity and heteronuclear coupling evolution. These pulses were optimized using a genetic algorithm (GA), which consists in a global optimization method inspired by Nature's evolutionary processes. The newly designed ? and ? / 2 pulses belong to the 'type A' (or general rotors) symmetric composite pulses. These GA-optimized pulses are relatively short compared to other general rotors and can be used for excitation and inversion, as well as refocusing pulses in spin-echo experiments. The performance of the GA-optimized pulses was assessed in Magic Angle Spinning (MAS) solid-state NMR experiments using a crystalline U-13C, 15N NAVL peptide as well as U-13C, 15N microcrystalline ubiquitin. GA optimization of NMR pulse sequences opens a window for improving current experiments and designing new robust pulse sequences.

  17. Application of genetic algorithm on optimization of laser beam shaping.

    PubMed

    Tsai, Cheng-Mu; Fang, Yi-Chin; Lin, Chia-Te

    2015-06-15

    This study proposes a newly developed optimization method for an aspherical lens system employed in a refractive laser beam shaping system, which performs transformations on laser spots such that they are transformed into flat-tops of any size. In this paper, a genetic algorithm (GA) with multipoint search is proposed as the optimization method, together with macro language in optical simulation software, in order to search for ideal and optimized parameters. In comparison to a traditional two-dimensional (2D) computational method, using the one-dimensional (1D) computation for laser beam shaping can search for the optimal solution approximately twice as fast (after experiments). The optimal results show that when the laser spot shrinks from 3 mm to 1.07 mm, 88% uniformity is achieved, and when the laser spot increases from 3 mm to 5.273 mm, 90% uniformity is achieved. The distances between the lenses for both systems described above are even smaller than the thickness for the first lens, enabling us to conclude that our design objectives of extra light and slimness in the system are achieved. PMID:26193566

  18. Multivariable optimization of liquid rocket engines using particle swarm algorithms

    NASA Astrophysics Data System (ADS)

    Jones, Daniel Ray

    Liquid rocket engines are highly reliable, controllable, and efficient compared to other conventional forms of rocket propulsion. As such, they have seen wide use in the space industry and have become the standard propulsion system for launch vehicles, orbit insertion, and orbital maneuvering. Though these systems are well understood, historical optimization techniques are often inadequate due to the highly non-linear nature of the engine performance problem. In this thesis, a Particle Swarm Optimization (PSO) variant was applied to maximize the specific impulse of a finite-area combustion chamber (FAC) equilibrium flow rocket performance model by controlling the engine's oxidizer-to-fuel ratio and de Laval nozzle expansion and contraction ratios. In addition to the PSO-controlled parameters, engine performance was calculated based on propellant chemistry, combustion chamber pressure, and ambient pressure, which are provided as inputs to the program. The performance code was validated by comparison with NASA's Chemical Equilibrium with Applications (CEA) and the commercially available Rocket Propulsion Analysis (RPA) tool. Similarly, the PSO algorithm was validated by comparison with brute-force optimization, which calculates all possible solutions and subsequently determines which is the optimum. Particle Swarm Optimization was shown to be an effective optimizer capable of quick and reliable convergence for complex functions of multiple non-linear variables.

  19. An algorithm for constrained one-step inversion of spectral CT data

    E-print Network

    Barber, Rina Foygel; Schmidt, Taly Gilat; Pan, Xiaochuan

    2015-01-01

    We develop a primal-dual algorithm that allows for one-step inversion of spectral CT transmission photon counts data to a basis map decomposition. The algorithm allows for image constraints to be enforced on the basis maps during the inversion. The derivation of the algorithm makes use of a local upper bounding quadratic approximation to generate descent steps for non-convex spectral CT data discrepancy terms, combined with a new convex-concave optimization algorithm. Convergence of the algorithm is demonstrated on simulated spectral CT data. Simulations with noise and anthropomorphic phantoms show examples of how to employ the constrained one-step algorithm for spectral CT data.

  20. ABCluster: the artificial bee colony algorithm for cluster global optimization.

    PubMed

    Zhang, Jun; Dolg, Michael

    2015-10-01

    Global optimization of cluster geometries is of fundamental importance in chemistry and an interesting problem in applied mathematics. In this work, we introduce a relatively new swarm intelligence algorithm, i.e. the artificial bee colony (ABC) algorithm proposed in 2005, to this field. It is inspired by the foraging behavior of a bee colony, and only three parameters are needed to control it. We applied it to several potential functions of quite different nature, i.e., the Coulomb-Born-Mayer, Lennard-Jones, Morse, Z and Gupta potentials. The benchmarks reveal that for long-ranged potentials the ABC algorithm is very efficient in locating the global minimum, while for short-ranged ones it is sometimes trapped into a local minimum funnel on a potential energy surface of large clusters. We have released an efficient, user-friendly, and free program "ABCluster" to realize the ABC algorithm. It is a black-box program for non-experts as well as experts and might become a useful tool for chemists to study clusters. PMID:26327507

  1. Evolutionary pattern search algorithms for unconstrained and linearly constrained optimization

    SciTech Connect

    HART,WILLIAM E.

    2000-06-01

    The authors describe a convergence theory for evolutionary pattern search algorithms (EPSAs) on a broad class of unconstrained and linearly constrained problems. EPSAs adaptively modify the step size of the mutation operator in response to the success of previous optimization steps. The design of EPSAs is inspired by recent analyses of pattern search methods. The analysis significantly extends the previous convergence theory for EPSAs. The analysis applies to a broader class of EPSAs,and it applies to problems that are nonsmooth, have unbounded objective functions, and which are linearly constrained. Further, they describe a modest change to the algorithmic framework of EPSAs for which a non-probabilistic convergence theory applies. These analyses are also noteworthy because they are considerably simpler than previous analyses of EPSAs.

  2. Optimizing Optical Quantum Logic Gates using Genetic Algorithms

    E-print Network

    Zhanghan Wu; Sean D. Huver; Dmitry Uskov; Hwang Lee; Jonathan P. Dowling

    2007-09-04

    We introduce the method of using an annealing genetic algorithm to the numerically complex problem of looking for quantum logic gates which simultaneously have highest fidelity and highest success probability. We first use the linear optical quantum nonlinear sign (NS) gate as an example to illustrate the efficiency of this method. We show that by appropriately choosing the annealing parameters, we can reach the theoretical maximum success probability (1/4 for NS) for each attempt. We then examine the controlled-z (CZ) gate as the first new problem to be solved. We show results that agree with the highest known maximum success probability for a CZ gate (2/27) while maintaining a fidelity of 0.9997. Since the purpose of our algorithm is to optimize a unitary matrix for quantum transformations, it could easily be applied to other areas of interest such as quantum optics and quantum sensors.

  3. An inflationary differential evolution algorithm for space trajectory optimization

    E-print Network

    Massimiliano Vasile; Edmondo Minisci; Marco Locatelli

    2011-04-25

    In this paper we define a discrete dynamical system that governs the evolution of a population of agents. From the dynamical system, a variant of Differential Evolution is derived. It is then demonstrated that, under some assumptions on the differential mutation strategy and on the local structure of the objective function, the proposed dynamical system has fixed points towards which it converges with probability one for an infinite number of generations. This property is used to derive an algorithm that performs better than standard Differential Evolution on some space trajectory optimization problems. The novel algorithm is then extended with a guided restart procedure that further increases the performance, reducing the probability of stagnation in deceptive local minima.

  4. An inflationary differential evolution algorithm for space trajectory optimization

    E-print Network

    Vasile, Massimiliano; Locatelli, Marco

    2011-01-01

    In this paper we define a discrete dynamical system that governs the evolution of a population of agents. From the dynamical system, a variant of Differential Evolution is derived. It is then demonstrated that, under some assumptions on the differential mutation strategy and on the local structure of the objective function, the proposed dynamical system has fixed points towards which it converges with probability one for an infinite number of generations. This property is used to derive an algorithm that performs better than standard Differential Evolution on some space trajectory optimization problems. The novel algorithm is then extended with a guided restart procedure that further increases the performance, reducing the probability of stagnation in deceptive local minima.

  5. Robust Optimization Design Algorithm for High-Frequency TWTs

    NASA Technical Reports Server (NTRS)

    Wilson, Jeffrey D.; Chevalier, Christine T.

    2010-01-01

    Traveling-wave tubes (TWTs), such as the Ka-band (26-GHz) model recently developed for the Lunar Reconnaissance Orbiter, are essential as communication amplifiers in spacecraft for virtually all near- and deep-space missions. This innovation is a computational design algorithm that, for the first time, optimizes the efficiency and output power of a TWT while taking into account the effects of dimensional tolerance variations. Because they are primary power consumers and power generation is very expensive in space, much effort has been exerted over the last 30 years to increase the power efficiency of TWTs. However, at frequencies higher than about 60 GHz, efficiencies of TWTs are still quite low. A major reason is that at higher frequencies, dimensional tolerance variations from conventional micromachining techniques become relatively large with respect to the circuit dimensions. When this is the case, conventional design- optimization procedures, which ignore dimensional variations, provide inaccurate designs for which the actual amplifier performance substantially under-performs that of the design. Thus, this new, robust TWT optimization design algorithm was created to take account of and ameliorate the deleterious effects of dimensional variations and to increase efficiency, power, and yield of high-frequency TWTs. This design algorithm can help extend the use of TWTs into the terahertz frequency regime of 300-3000 GHz. Currently, these frequencies are under-utilized because of the lack of efficient amplifiers, thus this regime is known as the "terahertz gap." The development of an efficient terahertz TWT amplifier could enable breakthrough applications in space science molecular spectroscopy, remote sensing, nondestructive testing, high-resolution "through-the-wall" imaging, biomedical imaging, and detection of explosives and toxic biochemical agents.

  6. Model-Robust Optimal Designs: A Genetic Algorithm Approach

    SciTech Connect

    Heredia-Langner, Alejandro; Montgomery, Douglas C.; Carlyle, W M.; Borror, Connie M.

    2004-07-01

    A model-robust design is an experimental design that has high efficiency with respect to a particular criterion for every member of a set of candidate models that are of interest to the experimenter. We present a technique to construct model-robust alphabetically optimal designs using genetic algorithms. The technique is useful in situations where computer-generated designs are most likely to be employed, particularly experiments with mixtures and response surface experiments in constrained regions. Examples illustrating the procedure are provided.

  7. Control optimization, stabilization and computer algorithms for aircraft applications

    NASA Technical Reports Server (NTRS)

    Athans, M. (editor); Willsky, A. S. (editor)

    1982-01-01

    The analysis and design of complex multivariable reliable control systems are considered. High performance and fault tolerant aircraft systems are the objectives. A preliminary feasibility study of the design of a lateral control system for a VTOL aircraft that is to land on a DD963 class destroyer under high sea state conditions is provided. Progress in the following areas is summarized: (1) VTOL control system design studies; (2) robust multivariable control system synthesis; (3) adaptive control systems; (4) failure detection algorithms; and (5) fault tolerant optimal control theory.

  8. Design and global optimization of high-efficiency thermophotovoltaic

    E-print Network

    Design and global optimization of high-efficiency thermophotovoltaic systems Peter Bermel,1 function evaluation and global optimization algorithms. Both are applied to two example systems: improved, PhC-based designs present a set of non-convex optimization problems requiring efficient objective

  9. Genetic Algorithm Optimization of a Cost Competitive Hybrid Rocket Booster

    NASA Technical Reports Server (NTRS)

    Story, George

    2015-01-01

    Performance, reliability and cost have always been drivers in the rocket business. Hybrid rockets have been late entries into the launch business due to substantial early development work on liquid rockets and solid rockets. Slowly the technology readiness level of hybrids has been increasing due to various large scale testing and flight tests of hybrid rockets. One remaining issue is the cost of hybrids versus the existing launch propulsion systems. This paper will review the known state-of-the-art hybrid development work to date and incorporate it into a genetic algorithm to optimize the configuration based on various parameters. A cost module will be incorporated to the code based on the weights of the components. The design will be optimized on meeting the performance requirements at the lowest cost.

  10. Nature-Inspired Particle Mechanics Algorithm for Multi-Objective Optimization

    E-print Network

    Lau, Francis C.M.

    , significant bio-inspired approaches such as genetic algorithm (GA) (1975) [5], ant colony optimization (ACONature-Inspired Particle Mechanics Algorithm for Multi-Objective Optimization Xiang Feng. This chapter proposes a new computational algorithm whose design is inspired by par- ticle mechanics in physics

  11. Superscattering of light optimized by a genetic algorithm Ali Mirzaei,a)

    E-print Network

    Superscattering of light optimized by a genetic algorithm Ali Mirzaei,a) Andrey E. Miroshnichenko nanowires and employ a genetic algorithm for optimizing the scattering cross section. We apply the mode-expansion method using experimental data for material parameters to demonstrate that our genetic algorithm allows

  12. Optimizing a Model for Siting Offshore Wind Farms using a Genetic Algorithm

    E-print Network

    Mountziaris, T. J.

    Optimizing a Model for Siting Offshore Wind Farms using a Genetic Algorithm *Michael Ameckson environmental impacts [4]. Genetic Algorithms have been used for numerous state of the art modeling placements as a portfolio. Background Apply a Genetic Algorithm to the existing model to analyze the optimal

  13. Optimal high speed CMOS inverter design using craziness based Particle Swarm Optimization Algorithm

    NASA Astrophysics Data System (ADS)

    De, Bishnu P.; Kar, Rajib; Mandal, Durbadal; Ghoshal, Sakti P.

    2015-07-01

    The inverter is the most fundamental logic gate that performs a Boolean operation on a single input variable. In this paper, an optimal design of CMOS inverter using an improved version of particle swarm optimization technique called Craziness based Particle Swarm Optimization (CRPSO) is proposed. CRPSO is very simple in concept, easy to implement and computationally efficient algorithm with two main advantages: it has fast, nearglobal convergence, and it uses nearly robust control parameters. The performance of PSO depends on its control parameters and may be influenced by premature convergence and stagnation problems. To overcome these problems the PSO algorithm has been modiffed to CRPSO in this paper and is used for CMOS inverter design. In birds' flocking or ffsh schooling, a bird or a ffsh often changes direction suddenly. In the proposed technique, the sudden change of velocity is modelled by a direction reversal factor associated with the previous velocity and a "craziness" velocity factor associated with another direction reversal factor. The second condition is introduced depending on a predeffned craziness probability to maintain the diversity of particles. The performance of CRPSO is compared with real code.gnetic algorithm (RGA), and conventional PSO reported in the recent literature. CRPSO based design results are also compared with the PSPICE based results. The simulation results show that the CRPSO is superior to the other algorithms for the examples considered and can be efficiently used for the CMOS inverter design.

  14. Genetic Algorithm Optimization of Artificial Neural Networks for Hydrological Modelling

    NASA Astrophysics Data System (ADS)

    Abrahart, R. J.

    2004-05-01

    This paper will consider the case for genetic algorithm optimization in the development of an artificial neural network model. It will provide a methodological evaluation of reported investigations with respect to hydrological forecasting and prediction. The intention in such operations is to develop a superior modelling solution that will be: \\begin{itemize} more accurate in terms of output precision and model estimation skill; more tractable in terms of personal requirements and end-user control; and/or more robust in terms of conceptual and mechanical power with respect to adverse conditions. The genetic algorithm optimization toolbox could be used to perform a number of specific roles or purposes and it is the harmonious and supportive relationship between neural networks and genetic algorithms that will be highlighted and assessed. There are several neural network mechanisms and procedures that could be enhanced and potential benefits are possible at different stages in the design and construction of an operational hydrological model e.g. division of inputs; identification of structure; initialization of connection weights; calibration of connection weights; breeding operations between successful models; and output fusion associated with the development of ensemble solutions. Each set of opportunities will be discussed and evaluated. Two strategic questions will also be considered: [i] should optimization be conducted as a set of small individual procedures or as one large holistic operation; [ii] what specific function or set of weighted vectors should be optimized in a complex software product e.g. timings, volumes, or quintessential hydrological attributes related to the 'problem situation' - that might require the development flood forecasting, drought estimation, or record infilling applications. The paper will conclude with a consideration of hydrological forecasting solutions developed on the combined methodologies of co-operative co-evolution and operational specialization. The standard approach to neural-evolution is at the network level such that a population of working solutions is manipulated until the fittest member is found. SANE [Symbiotic Adaptive Neuro-Evolution]1 source code offers an alternative method based on co-operative co-evolution in which a population of hidden neurons is evolved. The task of each hidden neuron is to establish appropriate connections that will provide: [i] a functional solution and [ii] performance improvements. Each member of the population attempts to optimize one particular aspect of the overall modelling process and evolution can lead to several different forms of specialization. This method of adaptive evolution also facilitates the creation of symbiotic relationships in which individual members must co-operate with others - who must be present - to permit survival. 1http://www.cs.utexas.edu/users/nn/pages/software/abstracts.html#sane-c

  15. GRAVITATIONAL LENS MODELING WITH GENETIC ALGORITHMS AND PARTICLE SWARM OPTIMIZERS

    SciTech Connect

    Rogers, Adam; Fiege, Jason D.

    2011-02-01

    Strong gravitational lensing of an extended object is described by a mapping from source to image coordinates that is nonlinear and cannot generally be inverted analytically. Determining the structure of the source intensity distribution also requires a description of the blurring effect due to a point-spread function. This initial study uses an iterative gravitational lens modeling scheme based on the semilinear method to determine the linear parameters (source intensity profile) of a strongly lensed system. Our 'matrix-free' approach avoids construction of the lens and blurring operators while retaining the least-squares formulation of the problem. The parameters of an analytical lens model are found through nonlinear optimization by an advanced genetic algorithm (GA) and particle swarm optimizer (PSO). These global optimization routines are designed to explore the parameter space thoroughly, mapping model degeneracies in detail. We develop a novel method that determines the L-curve for each solution automatically, which represents the trade-off between the image {chi}{sup 2} and regularization effects, and allows an estimate of the optimally regularized solution for each lens parameter set. In the final step of the optimization procedure, the lens model with the lowest {chi}{sup 2} is used while the global optimizer solves for the source intensity distribution directly. This allows us to accurately determine the number of degrees of freedom in the problem to facilitate comparison between lens models and enforce positivity on the source profile. In practice, we find that the GA conducts a more thorough search of the parameter space than the PSO.

  16. Gravitational Lens Modeling with Genetic Algorithms and Particle Swarm Optimizers

    NASA Astrophysics Data System (ADS)

    Rogers, Adam; Fiege, Jason D.

    2011-02-01

    Strong gravitational lensing of an extended object is described by a mapping from source to image coordinates that is nonlinear and cannot generally be inverted analytically. Determining the structure of the source intensity distribution also requires a description of the blurring effect due to a point-spread function. This initial study uses an iterative gravitational lens modeling scheme based on the semilinear method to determine the linear parameters (source intensity profile) of a strongly lensed system. Our "matrix-free" approach avoids construction of the lens and blurring operators while retaining the least-squares formulation of the problem. The parameters of an analytical lens model are found through nonlinear optimization by an advanced genetic algorithm (GA) and particle swarm optimizer (PSO). These global optimization routines are designed to explore the parameter space thoroughly, mapping model degeneracies in detail. We develop a novel method that determines the L-curve for each solution automatically, which represents the trade-off between the image ?2 and regularization effects, and allows an estimate of the optimally regularized solution for each lens parameter set. In the final step of the optimization procedure, the lens model with the lowest ?2 is used while the global optimizer solves for the source intensity distribution directly. This allows us to accurately determine the number of degrees of freedom in the problem to facilitate comparison between lens models and enforce positivity on the source profile. In practice, we find that the GA conducts a more thorough search of the parameter space than the PSO.

  17. Genetic Algorithm (GA)-Based Inclinometer Layout Optimization

    PubMed Central

    Liang, Weijie; Zhang, Ping; Chen, Xianping; Cai, Miao; Yang, Daoguo

    2015-01-01

    This paper presents numerical simulation results of an airflow inclinometer with sensitivity studies and thermal optimization of the printed circuit board (PCB) layout for an airflow inclinometer based on a genetic algorithm (GA). Due to the working principle of the gas sensor, the changes of the ambient temperature may cause dramatic voltage drifts of sensors. Therefore, eliminating the influence of the external environment for the airflow is essential for the performance and reliability of an airflow inclinometer. In this paper, the mechanism of an airflow inclinometer and the influence of different ambient temperatures on the sensitivity of the inclinometer will be examined by the ANSYS-FLOTRAN CFD program. The results show that with changes of the ambient temperature on the sensing element, the sensitivity of the airflow inclinometer is inversely proportional to the ambient temperature and decreases when the ambient temperature increases. GA is used to optimize the PCB thermal layout of the inclinometer. The finite-element simulation method (ANSYS) is introduced to simulate and verify the results of our optimal thermal layout, and the results indicate that the optimal PCB layout greatly improves (by more than 50%) the sensitivity of the inclinometer. The study may be useful in the design of PCB layouts that are related to sensitivity improvement of gas sensors. PMID:25897500

  18. Clustering PPI Data Based on Bacteria Foraging Optimization Algorithm Xiujuan Lei*1

    E-print Network

    Buffalo, State University of New York

    Clustering PPI Data Based on Bacteria Foraging Optimization Algorithm Xiujuan Lei*1 Shuang Wu2@buffalo.edu * Corresponding author Abstract--This paper proposed a novel method using Bacteria Foraging Optimization, but also automatically determined the cluster number. Keywords-bacteria foraging optimization algorithm

  19. Optimal Path Planning in Complex Cost Spaces with Sampling-based Algorithms

    E-print Network

    Kavraki, Lydia E.

    1 Optimal Path Planning in Complex Cost Spaces with Sampling-based Algorithms Didier Devaurs, Thierry Simeon, and Juan Cortes Abstract--Sampling-based algorithms for path planning, such as RRT, have with optimal path planning: they ensure convergence toward the optimal path, with respect to a given path

  20. Comment on: An Accelerated Learning Algorithm for Multilayer Perceptrons: Optimization Layer by

    E-print Network

    van Milligen, Boudewijn

    1 Comment on: An Accelerated Learning Algorithm for Multilayer Perceptrons: Optimization Layer iteration the weights of each layer are optimized by solving a set of linear equa- tions. The algorithm analyzes the performance of the neural network training method known as Optimization Layer by Layer 1 . We

  1. Global Optimization Using the DIRECT Algorithm in Mattias Bjorkman and Kenneth Holmstrom

    E-print Network

    Neumaier, Arnold

    Global Optimization Using the DIRECT Algorithm in Matlab Mattias Bj¨orkman and Kenneth Holmstr standard test problems for global optimization. In fifteen out of eighteen runs the results is to the favor until recently been no routine to handle global optimization problems. Therefore the DIRECT algorithm

  2. Global Optimization Algorithms for Semi-Infinite and Generalized Semi-Infinite Programs

    E-print Network

    Global Optimization Algorithms for Semi-Infinite and Generalized Semi-Infinite Programs by . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . William M. Deen Chairman, Department Committee on Graduate Students #12;2 #12;Global Optimization are the development of global optimization algorithms for semi- infinite and generalized semi-infinite programs

  3. On a Multiplicative Algorithm for Computing Bayesian D-optimal Designs

    E-print Network

    Yu, Yaming

    On a Multiplicative Algorithm for Computing Bayesian D-optimal Designs Yaming Yu Department for computing Bayesian D-optimal designs. This proves a conjecture of Dette, Pepelyshev and Zhigljavsky (2008 the speed of the multiplicative algorithm. Keywords: Bayesian D-optimality; experimental design; MM

  4. A Fast Sequential Linear Quadratic Algorithm for Solving Unconstrained Nonlinear Optimal Control Problems

    E-print Network

    Bobrow, James E.

    A Fast Sequential Linear Quadratic Algorithm for Solving Unconstrained Nonlinear Optimal Control a quadratic performance measure. We formulate the optimal control problem in discrete-time, but many-known necessary conditions for the optimal control. We also show that the algorithm is a Gauss-Newton method

  5. : Convex Hull Construction via Star-Shaped Polyhedron in 3D Mingcen Gao Thanh-Tung Cao Tiow-Seng Tan Zhiyong Huang

    E-print Network

    Tan, Tiow Seng

    -shaped Polyhedron 4 ffHull: 3D convex hull algorithm 3 Flip-Flop: a novel flip algorithm 6 Correctness of Flip to transform any star-shaped polyhedron to its convex hull. ffHull: an algorithm to construct 3D convex hull: Convex Hull Construction via Star-Shaped Polyhedron in 3D Mingcen Gao Thanh-Tung Cao Tiow

  6. Design Optimization and Performance Evaluation of the Relaying Algorithms, Relays and Protective Systems Using Advanced Testing Tools

    E-print Network

    Design Optimization and Performance Evaluation of the Relaying Algorithms, Relays and Protective quality measures for designing, optimizing, setting and evaluating the protective relaying algorithms and equipment. The paper starts with evaluation of digital measuring algorithms, and gradually introduces

  7. In-Space Radiator Shape Optimization using Genetic Algorithms

    NASA Technical Reports Server (NTRS)

    Hull, Patrick V.; Kittredge, Ken; Tinker, Michael; SanSoucie, Michael

    2006-01-01

    Future space exploration missions will require the development of more advanced in-space radiators. These radiators should be highly efficient and lightweight, deployable heat rejection systems. Typical radiators for in-space heat mitigation commonly comprise a substantial portion of the total vehicle mass. A small mass savings of even 5-10% can greatly improve vehicle performance. The objective of this paper is to present the development of detailed tools for the analysis and design of in-space radiators using evolutionary computation techniques. The optimality criterion is defined as a two-dimensional radiator with a shape demonstrating the smallest mass for the greatest overall heat transfer, thus the end result is a set of highly functional radiator designs. This cross-disciplinary work combines topology optimization and thermal analysis design by means of a genetic algorithm The proposed design tool consists of the following steps; design parameterization based on the exterior boundary of the radiator, objective function definition (mass minimization and heat loss maximization), objective function evaluation via finite element analysis (thermal radiation analysis) and optimization based on evolutionary algorithms. The radiator design problem is defined as follows: the input force is a driving temperature and the output reaction is heat loss. Appropriate modeling of the space environment is added to capture its effect on the radiator. The design parameters chosen for this radiator shape optimization problem fall into two classes, variable height along the width of the radiator and a spline curve defining the -material boundary of the radiator. The implementation of multiple design parameter schemes allows the user to have more confidence in the radiator optimization tool upon demonstration of convergence between the two design parameter schemes. This tool easily allows the user to manipulate the driving temperature regions thus permitting detailed design of in-space radiators for unique situations. Preliminary results indicate an optimized shape following that of the temperature distribution regions in the "cooler" portions of the radiator. The results closely follow the expected radiator shape.

  8. Efficient Convex Relaxation for Stochastic Optimal Distributed Control Problem Abdulrahman Kalbat, Ramtin Madani, Ghazal Fazelnia, and Javad Lavaei

    E-print Network

    Lavaei, Javad

    [3], [4], [5], [6], [7], dynamically decoupled systems [8], [9], weakly coupled systems [10 an optimal structured controller for a dynamical system subject to input disturbance and measurement noise sparsity pattern. The proposed technique is always exact for the classical H2 optimal control problem (i

  9. A Convex Geometry-Based Blind Source Separation Method for Separating Nonnegative Sources.

    PubMed

    Yang, Zuyuan; Xiang, Yong; Rong, Yue; Xie, Kan

    2015-08-01

    This paper presents a convex geometry (CG)-based method for blind separation of nonnegative sources. First, the unaccessible source matrix is normalized to be column-sum-to-one by mapping the available observation matrix. Then, its zero-samples are found by searching the facets of the convex hull spanned by the mapped observations. Considering these zero-samples, a quadratic cost function with respect to each row of the unmixing matrix, together with a linear constraint in relation to the involved variables, is proposed. Upon which, an algorithm is presented to estimate the unmixing matrix by solving a classical convex optimization problem. Unlike the traditional blind source separation (BSS) methods, the CG-based method does not require the independence assumption, nor the uncorrelation assumption. Compared with the BSS methods that are specifically designed to distinguish between nonnegative sources, the proposed method requires a weaker sparsity condition. Provided simulation results illustrate the performance of our method. PMID:25203999

  10. Optimization of Electrical Energy Production by using Modified Differential Evolution Algorithm

    NASA Astrophysics Data System (ADS)

    Glotic, Arnel

    The dissertation addressed the optimization of electrical energy production from hydro power plants and thermal power plants. It refers to short-term optimization and presents a complex optimization problem. The complexity of the problem arises from an extensive number of co-dependent variables and power plant constraints. According to the complexity of the problem, the differential evolution algorithm known as the successful and robust optimization algorithm was selected as an appropriate algorithm for optimization. The performance of this differential evolution algorithm is closely connected with a control parameters' set and its capabilities being inter alia improved by the algorithm's parallelization. The capabilities of achieving a global optimal solution within the optimization of electrical energy production are improved by the proposed modified differential evolution algorithm with new parallelization mode. This algorithm's performance is also improved by its proposed dynamic population size throughout the optimization process. In addition to achieving better optimization results in comparison with the classic differential evolution algorithm, the proposed dynamic population size reduces convergence time. The improvements of this algorithm presented in the dissertation, besides power plant models mostly used in scientific publications, were also tested on the power plant models represented by real parameters'. The optimization of electrical energy from hydro and thermal power plants is followed by certain criteria; satisfying system demand, minimizing usage of water quantity per produced electrical energy unit, minimizing or eliminating water spillage, satisfying the final reservoir states of hydro power plants and minimizing fuel costs and emissions of thermal power plants.

  11. GMG: A Guaranteed, Efficient Global Optimization Algorithm for Remote Sensing.

    SciTech Connect

    D'Helon, CD

    2004-08-18

    The monocular passive ranging (MPR) problem in remote sensing consists of identifying the precise range of an airborne target (missile, plane, etc.) from its observed radiance. This inverse problem may be set as a global optimization problem (GOP) whereby the difference between the observed and model predicted radiances is minimized over the possible ranges and atmospheric conditions. Using additional information about the error function between the predicted and observed radiances of the target, we developed GMG, a new algorithm to find the Global Minimum with a Guarantee. The new algorithm transforms the original continuous GOP into a discrete search problem, thereby guaranteeing to find the position of the global minimum in a reasonably short time. The algorithm is first applied to the golf course problem, which serves as a litmus test for its performance in the presence of both complete and degraded additional information. GMG is further assessed on a set of standard benchmark functions and then applied to various realizations of the MPR problem.

  12. An Improved Search Algorithm for Optimal Multiple-Sequence Alignment

    E-print Network

    Schroedl, S

    2011-01-01

    Multiple sequence alignment (MSA) is a ubiquitous problem in computational biology. Although it is NP-hard to find an optimal solution for an arbitrary number of sequences, due to the importance of this problem researchers are trying to push the limits of exact algorithms further. Since MSA can be cast as a classical path finding problem, it is attracting a growing number of AI researchers interested in heuristic search algorithms as a challenge with actual practical relevance. In this paper, we first review two previous, complementary lines of research. Based on Hirschbergs algorithm, Dynamic Programming needs O(kN^(k-1)) space to store both the search frontier and the nodes needed to reconstruct the solution path, for k sequences of length N. Best first search, on the other hand, has the advantage of bounding the search space that has to be explored using a heuristic. However, it is necessary to maintain all explored nodes up to the final solution in order to prevent the search from re-expanding them at hig...

  13. OPTIMAL SAMPLING IN A NOISY GENETIC ALGORITHM FOR RISK-BASED REMEDIATION DESIGN

    E-print Network

    Minsker, Barbara S.

    OPTIMAL SAMPLING IN A NOISY GENETIC ALGORITHM FOR RISK-BASED REMEDIATION DESIGN BY GAYATHRI a noisy genetic algorithm to identify promising risk-based corrective action designs [Smalley et al, 2000]. Noisy genetic algorithms are simple genetic algorithms that operate in noisy environments. The noisy

  14. Using Genetic Algorithms for Data Mining Optimization in an Educational Web-based System

    E-print Network

    Using Genetic Algorithms for Data Mining Optimization in an Educational Web-based System Behrouz Minaei-Bidgoli1 , William F. Punch III 1 1 Genetic Algorithms Research and Applications Group (GARAGe to the learner as to how to best proceed. 2 Map the problem to Genetic Algorithm Genetic Algorithms have been

  15. New knowledge-based genetic algorithm for excavator boom structural optimization

    NASA Astrophysics Data System (ADS)

    Hua, Haiyan; Lin, Shuwen

    2014-03-01

    Due to the insufficiency of utilizing knowledge to guide the complex optimal searching, existing genetic algorithms fail to effectively solve excavator boom structural optimization problem. To improve the optimization efficiency and quality, a new knowledge-based real-coded genetic algorithm is proposed. A dual evolution mechanism combining knowledge evolution with genetic algorithm is established to extract, handle and utilize the shallow and deep implicit constraint knowledge to guide the optimal searching of genetic algorithm circularly. Based on this dual evolution mechanism, knowledge evolution and population evolution can be connected by knowledge influence operators to improve the configurability of knowledge and genetic operators. Then, the new knowledge-based selection operator, crossover operator and mutation operator are proposed to integrate the optimal process knowledge and domain culture to guide the excavator boom structural optimization. Eight kinds of testing algorithms, which include different genetic operators, are taken as examples to solve the structural optimization of a medium-sized excavator boom. By comparing the results of optimization, it is shown that the algorithm including all the new knowledge-based genetic operators can more remarkably improve the evolutionary rate and searching ability than other testing algorithms, which demonstrates the effectiveness of knowledge for guiding optimal searching. The proposed knowledge-based genetic algorithm by combining multi-level knowledge evolution with numerical optimization provides a new effective method for solving the complex engineering optimization problem.

  16. A Modified Genetic Algorithm Applied to Horizontal Well Placement Optimization in Gas Condensate Reservoirs

    E-print Network

    Morales, Adrian

    2011-02-22

    horizontal well placement problem is optimized by using a modified Genetic Algorithm. The algorithm presented has been modified specifically for gas condensate reservoirs. Unlike oil reservoirs, the cumulative production in gas reservoirs does not vary...

  17. Fast-kick-off monotonically convergent algorithm for searching optimal control fields

    E-print Network

    Liao, Sheng-Lun; Ho, Tak-San; Chu, Shih-I; Rabitz, Herschel

    2011-09-07

    This Rapid Communication presents a fast-kick-off search algorithm for quickly finding optimal control fields in the state-to-state transition probability control problems, especially those with poorly chosen initial control fields. The algorithm...

  18. A partially inexact bundle method for convex semi-infinite minmax problems

    NASA Astrophysics Data System (ADS)

    Fuduli, Antonio; Gaudioso, Manlio; Giallombardo, Giovanni; Miglionico, Giovanna

    2015-04-01

    We present a bundle method for solving convex semi-infinite minmax problems which allows inexact solution of the inner maximization. The method is of the partially inexact oracle type, and it is aimed at reducing the occurrence of null steps and at improving bundle handling with respect to existing methods. Termination of the algorithm is proved at a point satisfying an approximate optimality criterion, and the results of some numerical experiments are also reported.

  19. Structural optimization of Pt-Pd alloy nanoparticles using an improved discrete particle swarm optimization algorithm

    NASA Astrophysics Data System (ADS)

    Shao, Gui-Fang; Wang, Ting-Na; Liu, Tun-Dong; Chen, Jun-Ren; Zheng, Ji-Wen; Wen, Yu-Hua

    2015-01-01

    Pt-Pd alloy nanoparticles, as potential catalyst candidates for new-energy resources such as fuel cells and lithium ion batteries owing to their excellent reactivity and selectivity, have aroused growing attention in the past years. Since structure determines physical and chemical properties of nanoparticles, the development of a reliable method for searching the stable structures of Pt-Pd alloy nanoparticles has become of increasing importance to exploring the origination of their properties. In this article, we have employed the particle swarm optimization algorithm to investigate the stable structures of alloy nanoparticles with fixed shape and atomic proportion. An improved discrete particle swarm optimization algorithm has been proposed and the corresponding scheme has been presented. Subsequently, the swap operator and swap sequence have been applied to reduce the probability of premature convergence to the local optima. Furthermore, the parameters of the exchange probability and the 'particle' size have also been considered in this article. Finally, tetrahexahedral Pt-Pd alloy nanoparticles has been used to test the effectiveness of the proposed method. The calculated results verify that the improved particle swarm optimization algorithm has superior convergence and stability compared with the traditional one.

  20. Integrated network design and scheduling problems : optimization algorithms and applications.

    SciTech Connect

    Nurre, Sarah G.; Carlson, Jeffrey J.

    2014-01-01

    We consider the class of integrated network design and scheduling problems. These problems focus on selecting and scheduling operations that will change the characteristics of a network, while being speci cally concerned with the performance of the network over time. Motivating applications of INDS problems include infrastructure restoration after extreme events and building humanitarian distribution supply chains. While similar models have been proposed, no one has performed an extensive review of INDS problems from their complexity, network and scheduling characteristics, information, and solution methods. We examine INDS problems under a parallel identical machine scheduling environment where the performance of the network is evaluated by solving classic network optimization problems. We classify that all considered INDS problems as NP-Hard and propose a novel heuristic dispatching rule algorithm that selects and schedules sets of arcs based on their interactions in the network. We present computational analysis based on realistic data sets representing the infrastructures of coastal New Hanover County, North Carolina, lower Manhattan, New York, and a realistic arti cial community CLARC County. These tests demonstrate the importance of a dispatching rule to arrive at near-optimal solutions during real-time decision making activities. We extend INDS problems to incorporate release dates which represent the earliest an operation can be performed and exible release dates through the introduction of specialized machine(s) that can perform work to move the release date earlier in time. An online optimization setting is explored where the release date of a component is not known.

  1. Efficient algorithms for the computational design of optimal tiling arrays.

    PubMed

    Schliep, Alexander; Krause, Roland

    2008-01-01

    The representation of a genome by oligonucleotide probes is a prerequisite for the analysis of many of its basic properties, such as transcription factor binding sites, chromosomal breakpoints, gene expression of known genes and detection of novel genes, in particular those coding for small RNAs. An ideal representation would consist of a high density set of oligonucleotides with similar melting temperatures that do not cross-hybridize with other regions of the genome and are equidistantly spaced. The implementation of such design is typically called a tiling array or genome array. We formulate the minimal cost tiling path problem for the selection of oligonucleotides from a set of candidates. Computing the selection of probes requires multi-criterion optimization, which we cast into a shortest path problem. Standard algorithms running in linear time allow us to compute globally optimal tiling paths from millions of candidate oligonucleotides on a standard desktop computer for most problem variants. The solutions to this multi-criterion optimization are spatially adaptive to the problem instance. Our formulation incorporates experimental constraints with respect to specific regions of interest and trade offs between hybridization parameters, probe quality and tiling density easily. A web application is available at http://tileomatic.org. PMID:18989043

  2. Algebraic and algorithmic frameworks for optimized quantum measurements

    NASA Astrophysics Data System (ADS)

    Laghaout, Amine; Andersen, Ulrik L.

    2015-10-01

    von Neumann projections are the main operations by which information can be extracted from the quantum to the classical realm. They are, however, static processes that do not adapt to the states they measure. Advances in the field of adaptive measurement have shown that this limitation can be overcome by "wrapping" the von Neumann projectors in a higher-dimensional circuit which exploits the interplay between measurement outcomes and measurement settings. Unfortunately, the design of adaptive measurement has often been ad hoc and setup specific. We shall here develop a unified framework for designing optimized measurements. Our approach is twofold: The first is algebraic and formulates the problem of measurement as a simple matrix diagonalization problem. The second is algorithmic and models the optimal interaction between measurement outcomes and measurement settings as a cascaded network of conditional probabilities. Finally, we demonstrate that several figures of merit, such as Bell factors, can be improved by optimized measurements. This leads us to the promising observation that measurement detectors whichtaken individuallyhave a low quantum efficiency can be arranged into circuits where, collectively, the limitations of inefficiency are compensated for.

  3. Algebraic and algorithmic frameworks for optimized quantum measurements

    E-print Network

    Amine Laghaout; Ulrik L. Andersen

    2015-07-08

    Von Neumann projections are the main operations by which information can be extracted from the quantum to the classical realm. They are however static processes that do not adapt to the states they measure. Advances in the field of adaptive measurement have shown that this limitation can be overcome by "wrapping" the von Neumann projectors in a higher-dimensional circuit which exploits the interplay between measurement outcomes and measurement settings. Unfortunately, the design of adaptive measurement has often been ad hoc and setup-specific. We shall here develop a unified framework for designing optimized measurements. Our approach is two-fold: The first is algebraic and formulates the problem of measurement as a simple matrix diagonalization problem. The second is algorithmic and models the optimal interaction between measurement outcomes and measurement settings as a cascaded network of conditional probabilities. Finally, we demonstrate that several figures of merit, such as Bell factors, can be improved by optimized measurements. This leads us to the promising observation that measurement detectors which---taken individually---have a low quantum efficiency can be be arranged into circuits where, collectively, the limitations of inefficiency are compensated for.

  4. Convex Hull Covering of Polygonal Scenes for Accurate Collision Detection in Games

    E-print Network

    Zhang, Richard "Hao"

    covering computed by our algorithm. Figure 1: A result of convex hull covering. (a) A complex building mesh requirement. The original model has 14,608 polygons and the algorithm returned 3,137 convex hulls. AlthoughConvex Hull Covering of Polygonal Scenes for Accurate Collision Detection in Games Rong Liu

  5. NEW LOWER BOUNDS FOR CONVEX HULL PROBLEMS IN ODD DIMENSIONS \\Lambda

    E-print Network

    Erickson, Jeff

    , 44, 47, 48]. Over twenty years ago, Graham described an algorithm that constructs the convex hull­wrapping'' algorithm that constructs convex hulls in ar­ bitrary dimensions in time O(nf ); see also [47]. SeidelNEW LOWER BOUNDS FOR CONVEX HULL PROBLEMS IN ODD DIMENSIONS \\Lambda JEFF ERICKSON y Abstract. We

  6. New Lower Bounds for Convex Hull Problems in Odd Dimensions \\Lambda

    E-print Network

    Erickson, Jeff

    an algorithm that constructs the convex hull of n points in the plane in O(n log n) time [15]. The same running­ sions [10, 8]. Chazelle [7] describes an algorithm for constructing convex hulls in IR d in time O(n bdNew Lower Bounds for Convex Hull Problems in Odd Dimensions \\Lambda Jeff Erickson Computer Science

  7. Well Control Optimization using Derivative-Free Algorithms and a Multiscale Approach

    E-print Network

    Wang, Xiang; Feng, Qihong

    2015-01-01

    In this paper, we use numerical optimization algorithms and a multiscale approach in order to find an optimal well management strategy over the life of the reservoir. The large number of well rates for each control step make the optimization problem more difficult and at a high risk of achieving a suboptimal solution. Moreover, the optimal number of adjustments is not known a priori. Adjusting well controls too frequently will increase unnecessary well management and operation cost, and an excessively low number of control adjustments may not be enough to obtain a good yield. We investigate three derivative-free optimization algorithms, chosen for their robust and parallel nature, to determine optimal well control strategies. The algorithms chosen include generalized pattern search (GPS), particle swarm optimization (PSO) and covariance matrix adaptation evolution strategy (CMA-ES). These three algorithms encompass the breadth of available black-box optimization strategies: deterministic local search, stochas...

  8. GenMin: An enhanced genetic algorithm for global optimization

    NASA Astrophysics Data System (ADS)

    Tsoulos, Ioannis G.; Lagaris, I. E.

    2008-06-01

    A new method that employs grammatical evolution and a stopping rule for finding the global minimum of a continuous multidimensional, multimodal function is considered. The genetic algorithm used is a hybrid genetic algorithm in conjunction with a local search procedure. We list results from numerical experiments with a series of test functions and we compare with other established global optimization methods. The accompanying software accepts objective functions coded either in Fortran 77 or in C++. Program summaryProgram title: GenMin Catalogue identifier: AEAR_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEAR_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 35 810 No. of bytes in distributed program, including test data, etc.: 436 613 Distribution format: tar.gz Programming language: GNU-C++, GNU-C, GNU Fortran 77 Computer: The tool is designed to be portable in all systems running the GNU C++ compiler Operating system: The tool is designed to be portable in all systems running the GNU C++ compiler RAM: 200 KB Word size: 32 bits Classification: 4.9 Nature of problem: A multitude of problems in science and engineering are often reduced to minimizing a function of many variables. There are instances that a local optimum does not correspond to the desired physical solution and hence the search for a better solution is required. Local optimization techniques are frequently trapped in local minima. Global optimization is hence the appropriate tool. For example, solving a nonlinear system of equations via optimization, employing a least squares type of objective, one may encounter many local minima that do not correspond to solutions (i.e. they are far from zero). Solution method: Grammatical evolution and a stopping rule. Running time: Depending on the objective function. The test example given takes only a few seconds to run.

  9. Information-Theoretic Stochastic Optimal Control via Incremental Sampling-based Algorithms

    E-print Network

    Tsiotras, Panagiotis

    tsiotras@gatech.edu Abstract--This paper considers optimal control of dynamical systems which of stochastic optimal control. In addition, the authors derived the iterative path integral optimal control approach which leverages the RRT algorithm to solve stochastic optimal control problems for linear systems

  10. Chiral metamaterial design using optimized pixelated inclusions with genetic algorithm

    NASA Astrophysics Data System (ADS)

    Akturk, Cemal; Karaaslan, Muharrem; Ozdemir, Ersin; Ozkaner, Vedat; Dincer, Furkan; Bakir, Mehmet; Ozer, Zafer

    2015-03-01

    Chiral metamaterials have been a research area for many researchers due to their polarization rotation properties on electromagnetic waves. However, most of the proposed chiral metamaterials are designed depending on experience or time-consuming inefficient simulations. A method is investigated for designing a chiral metamaterial with a strong and natural chirality admittance by optimizing a grid of metallic pixels through both sides of a dielectric sheet placed perpendicular to the incident wave by using a genetic algorithm (GA) technique based on finite element method solver. The effective medium parameters are obtained by using constitutive equations and S parameters. The proposed methodology is very efficient for designing a chiral metamaterial with the desired effective medium parameters. By using GA-based topology, it is proven that a chiral metamaterial can be designed and manufactured more easily and with a low cost.

  11. An algorithmically optimized combinatorial library screened by digital imaging spectroscopy.

    PubMed

    Goldman, E R; Youvan, D C

    1992-12-01

    Combinatorial cassettes based on a phylogenetic "target set" were used to simultaneously mutagenize seven amino acid residues on one face of a transmembrane alpha helix comprising a bacteriochlorophyll binding site in the light harvesting II antenna of Rhodobacter capsulatus. This pigmented protein provides a model system for developing complex mutagenesis schemes, because simple absorption spectroscopy can be used to assay protein expression, structure, and function. Colony screening by Digital Imaging Spectroscopy showed that 6% of the optimized library bound bacteriochlorophyll in two distinct spectroscopic classes. This is approximately 200 times the throughput (ca. 0.03%) of conventional combinatorial cassette mutagenesis using [NN(G/C)]. "Doping" algorithms evaluated in this model system are generally applicable and should enable simultaneous mutagenesis at more positions in a protein than currently possible, or alternatively, decrease the screening size of combinatorial libraries. PMID:1369205

  12. An optimization-based iterative algorithm for recovering fluorophore location

    NASA Astrophysics Data System (ADS)

    Yi, Huangjian; Peng, Jinye; Jin, Chen; He, Xiaowei

    2015-10-01

    Fluorescence molecular tomography (FMT) is a non-invasive technique that allows three-dimensional visualization of fluorophore in vivo in small animals. In practical applications of FMT, however, there are challenges in the image reconstruction since it is a highly ill-posed problem due to the diffusive behaviour of light transportation in tissue and the limited measurement data. In this paper, we presented an iterative algorithm based on an optimization problem for three dimensional reconstruction of fluorescent target. This method alternates weighted algebraic reconstruction technique (WART) with steepest descent method (SDM) for image reconstruction. Numerical simulations experiments and physical phantom experiment are performed to validate our method. Furthermore, compared to conjugate gradient method, the proposed method provides a better three-dimensional (3D) localization of fluorescent target.

  13. Optimization and implementation of piezoelectric radiators using the genetic algorithm

    NASA Astrophysics Data System (ADS)

    Bai, Mingsian R.; Huang, Chinghong

    2003-06-01

    Very thin and small (45 mm35 mm0.35 mm) piezoelectric radiators have been developed in this research. The system is modeled by using the energy method in conjunction with the assumed-modes method. Electrical system, mechanical system, and acoustic loading have all been accounted for during the modeling stage. On the basis of the simulation model, the genetic algorithm (GA) is employed to optimize the overall configurations for a low resonance frequency and a large gain. The resulting designs are then implemented and evaluated experimentally. Performance indices for the experimental evaluation include the frequency response, the directional response, the sensitivity, and the efficiency. It is found in the experimental results that the piezoelectric radiators are able to produce comparable acoustical output with significantly less electrical input than the voice-coil panel speakers.

  14. Incremental algorithms An incremental algorithm inserts the input objects one by one, and after each in

    E-print Network

    Matousek, Jiri

    of the convex hull of points p 1 ; : : : ; p n , an incremental algorithm successively computes the convex hulls to compute (a suitable rep­ resentation of) their convex hull. If the reader has seen no such algorithm yet, we recommend him very strongly to design at least one planar convex hull algorithm by himself before

  15. Particle swarm optimization algorithm based low cost magnetometer calibration

    NASA Astrophysics Data System (ADS)

    Ali, A. S.; Siddharth, S., Syed, Z., El-Sheimy, N.

    2011-12-01

    Inertial Navigation Systems (INS) consist of accelerometers, gyroscopes and a microprocessor provide inertial digital data from which position and orientation is obtained by integrating the specific forces and rotation rates. In addition to the accelerometers and gyroscopes, magnetometers can be used to derive the absolute user heading based on Earth's magnetic field. Unfortunately, the measurements of the magnetic field obtained with low cost sensors are corrupted by several errors including manufacturing defects and external electro-magnetic fields. Consequently, proper calibration of the magnetometer is required to achieve high accuracy heading measurements. In this paper, a Particle Swarm Optimization (PSO) based calibration algorithm is presented to estimate the values of the bias and scale factor of low cost magnetometer. The main advantage of this technique is the use of the artificial intelligence which does not need any error modeling or awareness of the nonlinearity. The estimated bias and scale factor errors from the proposed algorithm improve the heading accuracy and the results are also statistically significant. Also, it can help in the development of the Pedestrian Navigation Devices (PNDs) when combined with the INS and GPS/Wi-Fi especially in the indoor environments

  16. Gradient projection algorithm for relaxation methods

    SciTech Connect

    Mohammed, J.L.; Hummel, R.A.; Zucker, S.W.

    1983-05-01

    This paper examines a particular problem which arises when applying the method of gradient projection for solving constrained optimization and finite dimensional variational inequalities on the convex set formed by the convex hull of the standard basis unit vectors. The method is especially important for relaxation labeling techniques applied to problems in artificial intelligence. Zoutendijk's method for finding feasible directions, which is relatively complicated in general situations, yields a very simple finite algorithm for this problem. The authors present an extremely simple algorithm for performing the gradient projection and an independent verification of its correctness. 8 references.

  17. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 6, NO. 1, JANUARY 2007 1 Probabilistic Convex Hull Queries over

    E-print Network

    Ng, Wilfred Siu Hung

    to verify the efficiency of our algorithms for answering PCH queries. Index Terms--Convex hull, uncertain have been proposed for convex hull computation, such as Andrew's Monotone Chain algorithm [6], which finds the convex hull of a set of 2D points in O(n log n) time. Existing algorithms assume that data

  18. University of Konstanz Design and Analysis of Algorithms Department of Computer & Information Science WS 2014/2015

    E-print Network

    Brandes, Ulrik

    of two convex sets remains convex. Problem 2: Convex Hull 5 Points Show how to compute the convex hull of a simple polygon in linear time. Problem 3: Chan's Algorithm 6 Points We are given a convex polygon P = (p1.r.t. Convex Hull 5 Points In the online convex-hull problem, we

  19. A universal optimization strategy for ant colony optimization algorithms based on the Physarum-inspired mathematical model.

    PubMed

    Zhang, Zili; Gao, Chao; Liu, Yuxin; Qian, Tao

    2014-09-01

    Ant colony optimization (ACO) algorithms often fall into the local optimal solution and have lower search efficiency for solving the travelling salesman problem (TSP). According to these shortcomings, this paper proposes a universal optimization strategy for updating the pheromone matrix in the ACO algorithms. The new optimization strategy takes advantages of the unique feature of critical paths reserved in the process of evolving adaptive networks of the Physarum-inspired mathematical model (PMM). The optimized algorithms, denoted as PMACO algorithms, can enhance the amount of pheromone in the critical paths and promote the exploitation of the optimal solution. Experimental results in synthetic and real networks show that the PMACO algorithms are more efficient and robust than the traditional ACO algorithms, which are adaptable to solve the TSP with single or multiple objectives. Meanwhile, we further analyse the influence of parameters on the performance of the PMACO algorithms. Based on these analyses, the best values of these parameters are worked out for the TSP. PMID:24613939

  20. A computer algorithm to optimize the scheduling of strategic sealift

    E-print Network

    Lambert, Garrett Randall

    1995-01-01

    Operation Desert Shield. A mathematical model for the problem is proposed and an algorithm is developed and applied to solve the scheduling problem. Results of the algorithm are compared with randomly generated schedules to determine algorithm effectiveness....

  1. A fully polynomial approximations cutting plane algorithm for integer programs represented by a separation oracle and related results

    SciTech Connect

    Boyd, A.

    1994-12-31

    A cutting plane algorithm for solving integer programs represented by a separation oracle is presented, and it is demonstrated that when properly implemented the algorithm is a fully polynomial approximation scheme. Related results are presented, including a fully polynomial approximation variant of Dantzig/Wolfe decomposition, a fully polynomial approximation algorithm for linear optimization on a convex body, and a polynomial time cutting plane algorithm for the cardinality versions of many well-known combinatorial optimization problems.

  2. Bicriteria Optimization of Technological Parameters in Compact Algorithm for Designing Soft Magnetic Composites

    E-print Network

    Sokalski, Krzysztof; ?lusarek, Barbara

    2015-01-01

    The paper presents a novel algorithm for designing technological parameters by which one optimize power losses and induction in SMC. The advantage of the presented algorithm consists in the bicriteria optimization: minimization of losses and maximization of induction. The crucial role in the presented algotithm plays scaling.

  3. Effect of Global Parallelism on the Behavior of a Steady State Genetic Algorithm for Design Optimization

    E-print Network

    Davison, Brian D.

    applied global parallelism to GADO (Genetic Algorithm for Design Optimization) be- cause among experi- ments conducted in several design optimization domains in order to examine the effect of globalEffect of Global Parallelism on the Behavior of a Steady State Genetic Algorithm for Design

  4. PGMS: Pseudo-optimal Greedy Media Streaming Algorithm for Heterogeneous Wireless Networks

    E-print Network

    Sreenan, Cormac J.

    PGMS: Pseudo-optimal Greedy Media Streaming Algorithm for Heterogeneous Wireless Networks Ahmed H and users. In this paper, we propose a Pseudo-optimal greedy media streaming (PGMS) algorithm to reduce ubiquitous services such as gaming, con- ferencing, and media streaming. These applications span a wide

  5. An algorithm to select the optimal program based on rough sets and fuzzy soft sets.

    PubMed

    Wenjun, Liu; Qingguo, Li

    2014-01-01

    Combining rough sets and fuzzy soft sets, we propose an algorithm to obtain the optimal decision program. In this algorithm, firstly, according to fuzzy soft sets, we build up information systems; secondly, we compute the significance of each parameter according to rough set theory; thirdly, combining subjective bias, we give an algorithm to obtain the comprehensive weight of each parameter; at last, we put forward a method to choose the optimal program. Example shows that the optimal algorithm is effective and rational. PMID:25243212

  6. IEEE TRANSACTIONS ON INFORhlATION THEORY, VOL. IT-31, NO. 4, JULY 1985 509 On the Convex Layers of a Planar Set

    E-print Network

    Chazelle, Bernard

    , Indeed, considering the various algorithms known for computing the convex hull of a set of points, one of S are the convex polygons obtained by iterating on the following procedure: compute the convex hull of S and remove for comput- ing the convex layers of S. The algorithm runs in O( n log n) time and requires O(n) space. Also

  7. Comparison and optimization of two AGC algorithms for Quadrature Ampliture Modulation

    E-print Network

    Kimura, Mitsunobu

    1998-01-01

    examines and compares the two algorithms for 16, 32, and 64-QAM systems. For each QAM system, the two AGC algorithms were optimized and simulated with different amplitude ranges. The results singled out several characteristics of the two algorithms for QAM....

  8. "Offshore Wind farm layout optimization using a Genetic Algorithm" Michael Ameckson

    E-print Network

    Mountziaris, T. J.

    "Offshore Wind farm layout optimization using a Genetic Algorithm" Michael Ameckson Faculty Mentor a Genetic Algorithm. The principle behind Genetic Algorithms is the Darwinian concept of an adaptation procedure based on the mechanics of natural genetics and natural selection. The best fit individual within

  9. A Distributed Genetic Algorithm for Parameters Optimization to Detect Microcalcifications in

    E-print Network

    Lanconelli, Nico

    A Distributed Genetic Algorithm for Parameters Optimization to Detect Microcalcifications obtained by applying a distributed genetic algorithm to a problem of parameter op- timization in medical the performance of our system. A distributed genetic algorithm supervising this process allowed to improve of some

  10. An Adaptive Hybrid Algorithm Based on Particle Swarm Optimization and Differential Evolution for Global Optimization

    PubMed Central

    Yu, Xiaobing; Cao, Jie; Shan, Haiyan; Zhu, Li; Guo, Jun

    2014-01-01

    Particle swarm optimization (PSO) and differential evolution (DE) are both efficient and powerful population-based stochastic search techniques for solving optimization problems, which have been widely applied in many scientific and engineering fields. Unfortunately, both of them can easily fly into local optima and lack the ability of jumping out of local optima. A novel adaptive hybrid algorithm based on PSO and DE (HPSO-DE) is formulated by developing a balanced parameter between PSO and DE. Adaptive mutation is carried out on current population when the population clusters around local optima. The HPSO-DE enjoys the advantages of PSO and DE and maintains diversity of the population. Compared with PSO, DE, and their variants, the performance of HPSO-DE is competitive. The balanced parameter sensitivity is discussed in detail. PMID:24688370

  11. A mesh optimization algorithm to decrease the maximum error in finite element computations.

    SciTech Connect

    Knupp, Patrick Michael; Hetmaniuk, Ulrich L.

    2008-06-01

    We present a mesh optimization algorithm for adaptively improving the finite element interpolation of a function of interest. The algorithm minimizes an objective function by swapping edges and moving nodes. Numerical experiments are performed on model problems. The results illustrate that the mesh optimization algorithm can reduce the W{sup 1,{infinity}} semi-norm of the interpolation error. For these examples, the L{sup 2}, L{sup {infinity}}, and H{sup 1} norms decreased also.

  12. Aerodynamic Shape Optimization Using A Real-Number-Encoded Genetic Algorithm

    NASA Technical Reports Server (NTRS)

    Holst, Terry L.; Pulliam, Thomas H.

    2001-01-01

    A new method for aerodynamic shape optimization using a genetic algorithm with real number encoding is presented. The algorithm is used to optimize three different problems, a simple hill climbing problem, a quasi-one-dimensional nozzle problem using an Euler equation solver and a three-dimensional transonic wing problem using a nonlinear potential solver. Results indicate that the genetic algorithm is easy to implement and extremely reliable, being relatively insensitive to design space noise.

  13. Rate distortion optimization for H.264 interframe coding: a general framework and algorithms.

    PubMed

    Yang, En-Hui; Yu, Xiang

    2007-07-01

    Rate distortion (RD) optimization for H.264 interframe coding with complete baseline decoding compatibility is investigated on a frame basis. Using soft decision quantization (SDQ) rather than the standard hard decision quantization, we first establish a general framework in which motion estimation, quantization, and entropy coding (in H.264) for the current frame can be jointly designed to minimize a true RD cost given previously coded reference frames. We then propose three RD optimization algorithms--a graph-based algorithm for near optimal SDQ in H.264 baseline encoding given motion estimation and quantization step sizes, an algorithm for near optimal residual coding in H.264 baseline encoding given motion estimation, and an iterative overall algorithm to optimize H.264 baseline encoding for each individual frame given previously coded reference frames-with them embedded in the indicated order. The graph-based algorithm for near optimal SDQ is the core; given motion estimation and quantization step sizes, it is guaranteed to perform optimal SDQ if the weak adjacent block dependency utilized in the context adaptive variable length coding of H.264 is ignored for optimization. The proposed algorithms have been implemented based on the reference encoder JM82 of H.264 with complete compatibility to the baseline profile. Experiments show that for a set of typical video testing sequences, the graph-based algorithm for near optimal SDQ, the algorithm for near optimal residual coding, and the overall algorithm achieve on average, 6%, 8%, and 12%, respectively, rate reduction at the same PSNR (ranging from 30 to 38 dB) when compared with the RD optimization method implemented in the H.264 reference software. PMID:17605376

  14. An Improved Quantum-Behaved Particle Swarm Optimization Algorithm with Elitist Breeding for Unconstrained Optimization

    PubMed Central

    Yang, Zhen-Lun; Wu, Angus; Min, Hua-Qing

    2015-01-01

    An improved quantum-behaved particle swarm optimization with elitist breeding (EB-QPSO) for unconstrained optimization is presented and empirically studied in this paper. In EB-QPSO, the novel elitist breeding strategy acts on the elitists of the swarm to escape from the likely local optima and guide the swarm to perform more efficient search. During the iterative optimization process of EB-QPSO, when criteria met, the personal best of each particle and the global best of the swarm are used to generate new diverse individuals through the transposon operators. The new generated individuals with better fitness are selected to be the new personal best particles and global best particle to guide the swarm for further solution exploration. A comprehensive simulation study is conducted on a set of twelve benchmark functions. Compared with five state-of-the-art quantum-behaved particle swarm optimization algorithms, the proposed EB-QPSO performs more competitively in all of the benchmark functions in terms of better global search capability and faster convergence rate. PMID:26064085

  15. Optimal design of multichannel fiber Bragg grating filters using Pareto multi-objective optimization algorithm

    NASA Astrophysics Data System (ADS)

    Chen, Jing; Liu, Tundong; Jiang, Hao

    2016-01-01

    A Pareto-based multi-objective optimization approach is proposed to design multichannel FBG filters. Instead of defining a single optimal objective, the proposed method establishes the multi-objective model by taking two design objectives into account, which are minimizing the maximum index modulation and minimizing the mean dispersion error. To address this optimization problem, we develop a two-stage evolutionary computation approach integrating an elitist non-dominated sorting genetic algorithm (NSGA-II) and technique for order preference by similarity to ideal solution (TOPSIS). NSGA-II is utilized to search for the candidate solutions in terms of both objectives. The obtained results are provided as Pareto front. Subsequently, the best compromise solution is determined by the TOPSIS method from the Pareto front according to the decision maker's preference. The design results show that the proposed approach yields a remarkable reduction of the maximum index modulation and the performance of dispersion spectra of the designed filter can be optimized simultaneously.

  16. Disciplined Convex Programming Michael Grant1, Stephen Boyd1, and Yinyu Ye12

    E-print Network

    optimization models called disciplined convex programming is introduced. The methodology enforces a setDisciplined Convex Programming Michael Grant1, Stephen Boyd1, and Yinyu Ye12 Department Science and Engineering, Stanford University Summary. A new methodology for constructingconvex

  17. Ultra-fast fluence optimization for beam angle selection algorithms

    NASA Astrophysics Data System (ADS)

    Bangert, M.; Ziegenhein, P.; Oelfke, U.

    2014-03-01

    Beam angle selection (BAS) including fluence optimization (FO) is among the most extensive computational tasks in radiotherapy. Precomputed dose influence data (DID) of all considered beam orientations (up to 100 GB for complex cases) has to be handled in the main memory and repeated FOs are required for different beam ensembles. In this paper, the authors describe concepts accelerating FO for BAS algorithms using off-the-shelf multiprocessor workstations. The FO runtime is not dominated by the arithmetic load of the CPUs but by the transportation of DID from the RAM to the CPUs. On multiprocessor workstations, however, the speed of data transportation from the main memory to the CPUs is non-uniform across the RAM; every CPU has a dedicated memory location (node) with minimum access time. We apply a thread node binding strategy to ensure that CPUs only access DID from their preferred node. Ideal load balancing for arbitrary beam ensembles is guaranteed by distributing the DID of every candidate beam equally to all nodes. Furthermore we use a custom sorting scheme of the DID to minimize the overall data transportation. The framework is implemented on an AMD Opteron workstation. One FO iteration comprising dose, objective function, and gradient calculation takes between 0.010 s (9 beams, skull, 0.23 GB DID) and 0.070 s (9 beams, abdomen, 1.50 GB DID). Our overall FO time is < 1 s for small cases, larger cases take ~ 4 s. BAS runs including FOs for 1000 different beam ensembles take ~ 15-70 min, depending on the treatment site. This enables an efficient clinical evaluation of different BAS algorithms.

  18. Optimized Uncertainty Quantification Algorithm Within a Dynamic Event Tree Framework

    SciTech Connect

    J. W. Nielsen; Akira Tokuhiro; Robert Hiromoto

    2014-06-01

    Methods for developing Phenomenological Identification and Ranking Tables (PIRT) for nuclear power plants have been a useful tool in providing insight into modelling aspects that are important to safety. These methods have involved expert knowledge with regards to reactor plant transients and thermal-hydraulic codes to identify are of highest importance. Quantified PIRT provides for rigorous method for quantifying the phenomena that can have the greatest impact. The transients that are evaluated and the timing of those events are typically developed in collaboration with the Probabilistic Risk Analysis. Though quite effective in evaluating risk, traditional PRA methods lack the capability to evaluate complex dynamic systems where end states may vary as a function of transition time from physical state to physical state . Dynamic PRA (DPRA) methods provide a more rigorous analysis of complex dynamic systems. A limitation of DPRA is its potential for state or combinatorial explosion that grows as a function of the number of components; as well as, the sampling of transition times from state-to-state of the entire system. This paper presents a method for performing QPIRT within a dynamic event tree framework such that timing events which result in the highest probabilities of failure are captured and a QPIRT is performed simultaneously while performing a discrete dynamic event tree evaluation. The resulting simulation results in a formal QPIRT for each end state. The use of dynamic event trees results in state explosion as the number of possible component states increases. This paper utilizes a branch and bound algorithm to optimize the solution of the dynamic event trees. The paper summarizes the methods used to implement the branch-and-bound algorithm in solving the discrete dynamic event trees.

  19. The optimal extraction of feature algorithm based on KAZE

    NASA Astrophysics Data System (ADS)

    Yao, Zheyi; Gu, Guohua; Qian, Weixian; Wang, Pengcheng

    2015-10-01

    As a novel method of 2D features extraction algorithm over the nonlinear scale space, KAZE provide a special method. However, the computation of nonlinear scale space and the construction of KAZE feature vectors are more expensive than the SIFT and SURF significantly. In this paper, the given image is used to build the nonlinear space up to a maximum evolution time through the efficient Additive Operator Splitting (AOS) techniques and the variable conductance diffusion. Changing the parameter can improve the construction of nonlinear scale space and simplify the image conductivities for each dimension space, with the predigest computation. Then, the detection for points of interest can exhibit a maxima of the scale-normalized determinant with the Hessian response in the nonlinear scale space. At the same time, the detection of feature vectors is optimized by the Wavelet Transform method, which can avoid the second Gaussian smoothing in the KAZE Features and cut down the complexity of the algorithm distinctly in the building and describing vectors steps. In this way, the dominant orientation is obtained, similar to SURF, by summing the responses within a sliding circle segment covering an angle of ?/3 in the circular area of radius 6? with a sampling step of size ? one by one. Finally, the extraction in the multidimensional patch at the given scale, centered over the points of interest and rotated to align its dominant orientation to a canonical direction, is able to simplify the description of feature by reducing the description dimensions, just as the PCA-SIFT method. Even though the features are somewhat more expensive to compute than SIFT due to the construction of nonlinear scale space, but compared to SURF, the result revels a step forward in performance in detection, description and application against the previous ways by the following contrast experiments.

  20. Towards enhancement of performance of K-means clustering using nature-inspired optimization algorithms.

    PubMed

    Fong, Simon; Deb, Suash; Yang, Xin-She; Zhuang, Yan

    2014-01-01

    Traditional K-means clustering algorithms have the drawback of getting stuck at local optima that depend on the random values of initial centroids. Optimization algorithms have their advantages in guiding iterative computation to search for global optima while avoiding local optima. The algorithms help speed up the clustering process by converging into a global optimum early with multiple search agents in action. Inspired by nature, some contemporary optimization algorithms which include Ant, Bat, Cuckoo, Firefly, and Wolf search algorithms mimic the swarming behavior allowing them to cooperatively steer towards an optimal objective within a reasonable time. It is known that these so-called nature-inspired optimization algorithms have their own characteristics as well as pros and cons in different applications. When these algorithms are combined with K-means clustering mechanism for the sake of enhancing its clustering quality by avoiding local optima and finding global optima, the new hybrids are anticipated to produce unprecedented performance. In this paper, we report the results of our evaluation experiments on the integration of nature-inspired optimization methods into K-means algorithms. In addition to the standard evaluation metrics in evaluating clustering quality, the extended K-means algorithms that are empowered by nature-inspired optimization methods are applied on image segmentation as a case study of application scenario. PMID:25202730