WorldWideScience

Sample records for nonlinear optimization set

  1. Nonlinearly-constrained optimization using asynchronous parallel generating set search.

    Energy Technology Data Exchange (ETDEWEB)

    Griffin, Joshua D.; Kolda, Tamara Gibson

    2007-05-01

    Many optimization problems in computational science and engineering (CS&E) are characterized by expensive objective and/or constraint function evaluations paired with a lack of derivative information. Direct search methods such as generating set search (GSS) are well understood and efficient for derivative-free optimization of unconstrained and linearly-constrained problems. This paper addresses the more difficult problem of general nonlinear programming where derivatives for objective or constraint functions are unavailable, which is the case for many CS&E applications. We focus on penalty methods that use GSS to solve the linearly-constrained problems, comparing different penalty functions. A classical choice for penalizing constraint violations is {ell}{sub 2}{sup 2}, the squared {ell}{sub 2} norm, which has advantages for derivative-based optimization methods. In our numerical tests, however, we show that exact penalty functions based on the {ell}{sub 1}, {ell}{sub 2}, and {ell}{sub {infinity}} norms converge to good approximate solutions more quickly and thus are attractive alternatives. Unfortunately, exact penalty functions are discontinuous and consequently introduce theoretical problems that degrade the final solution accuracy, so we also consider smoothed variants. Smoothed-exact penalty functions are theoretically attractive because they retain the differentiability of the original problem. Numerically, they are a compromise between exact and {ell}{sub 2}{sup 2}, i.e., they converge to a good solution somewhat quickly without sacrificing much solution accuracy. Moreover, the smoothing is parameterized and can potentially be adjusted to balance the two considerations. Since many CS&E optimization problems are characterized by expensive function evaluations, reducing the number of function evaluations is paramount, and the results of this paper show that exact and smoothed-exact penalty functions are well-suited to this task.

  2. Schwartz' distributions in nonlinear setting: Applications to differential equations, filtering and optimal control

    Directory of Open Access Journals (Sweden)

    Y. Orlov

    2002-01-01

    Full Text Available The paper is intended to be of tutorial value for Schwartz' distributions theory in nonlinear setting. Mathematical models are presented for nonlinear systems which admit both standard and impulsive inputs. These models are governed by differential equations in distributions whose meaning is generalized to involve nonlinear, non single-valued operating over distributions. The set of generalized solutions of these differential equations is defined via closure, in a certain topology, of the set of the conventional solutions corresponding to standard integrable inputs. The theory is exemplified by mechanical systems with impulsive phenomena, optimal impulsive feedback synthesis, sampled-data filtering of stochastic and deterministic dynamic systems.

  3. Pushing the Boundaries: Level-set Methods and Geometrical Nonlinearities in Structural Topology Optimization

    NARCIS (Netherlands)

    Van Dijk, N.P.

    2012-01-01

    This thesis aims at understanding and improving topology optimization techniques focusing on density-based level-set methods and geometrical nonlinearities. Central in this work are the numerical modeling of the mechanical response of a design and the consistency of the optimization process itself.

  4. Nonlinear optimization

    CERN Document Server

    Ruszczynski, Andrzej

    2011-01-01

    Optimization is one of the most important areas of modern applied mathematics, with applications in fields from engineering and economics to finance, statistics, management science, and medicine. While many books have addressed its various aspects, Nonlinear Optimization is the first comprehensive treatment that will allow graduate students and researchers to understand its modern ideas, principles, and methods within a reasonable time, but without sacrificing mathematical precision. Andrzej Ruszczynski, a leading expert in the optimization of nonlinear stochastic systems, integrates t

  5. Optimization under Nonlinear Constraints

    OpenAIRE

    1982-01-01

    In this paper a timesaving method is proposed for maximizing likelihood functions when the parameter space is subject to nonlinear constraints, expressible as second order polynomials. The suggested approach is especially attractive when dealing with systems with many parameters.

  6. Nonlinear Optimization with Financial Applications

    CERN Document Server

    Bartholomew-Biggs, Michael

    2005-01-01

    The book introduces the key ideas behind practical nonlinear optimization. Computational finance - an increasingly popular area of mathematics degree programs - is combined here with the study of an important class of numerical techniques. The financial content of the book is designed to be relevant and interesting to specialists. However, this material - which occupies about one-third of the text - is also sufficiently accessible to allow the book to be used on optimization courses of a more general nature. The essentials of most currently popular algorithms are described, and their performan

  7. Tailoring the nonlinear response of MEMS resonators using shape optimization

    DEFF Research Database (Denmark)

    Li, Lily L.; Polunin, Pavel M.; Dou, Suguang

    2017-01-01

    We demonstrate systematic control of mechanical nonlinearities in micro-electromechanical (MEMS) resonators using shape optimization methods. This approach generates beams with non-uniform profiles, which have nonlinearities and frequencies that differ from uniform beams. A set of bridge-type mic......We demonstrate systematic control of mechanical nonlinearities in micro-electromechanical (MEMS) resonators using shape optimization methods. This approach generates beams with non-uniform profiles, which have nonlinearities and frequencies that differ from uniform beams. A set of bridge...

  8. Formal Proofs for Nonlinear Optimization

    Directory of Open Access Journals (Sweden)

    Victor Magron

    2015-01-01

    Full Text Available We present a formally verified global optimization framework. Given a semialgebraic or transcendental function f and a compact semialgebraic domain K, we use the nonlinear maxplus template approximation algorithm to provide a certified lower bound of f over K.This method allows to bound in a modular way some of the constituents of f by suprema of quadratic forms with a well chosen curvature. Thus, we reduce the initial goal to a hierarchy of semialgebraic optimization problems, solved by sums of squares relaxations. Our implementation tool interleaves  semialgebraic approximations with sums of squares witnesses to form certificates. It is interfaced with Coq and thus benefits from the trusted arithmetic available inside the proof assistant. This feature is used to produce, from the certificates, both valid underestimators and lower bounds for each approximated constituent.The application range for such a tool is widespread; for instance Hales' proof of Kepler's conjecture yields thousands of multivariate transcendental inequalities. We illustrate the performance of our formal framework on some of these inequalities as well as on examples from the global optimization literature.

  9. Nonlinear Differential Systems with Prescribed Invariant Sets

    DEFF Research Database (Denmark)

    Sandqvist, Allan

    1999-01-01

    We present a class of nonlinear differential systems for which invariant sets can be prescribed.Moreover,we show that a system in this class can be explicitly solved if a certain associated linear homogeneous system can be solved.As a simple application we construct a plane autonomous system having...

  10. Optimal design for nonlinear response models

    CERN Document Server

    Fedorov, Valerii V

    2013-01-01

    Optimal Design for Nonlinear Response Models discusses the theory and applications of model-based experimental design with a strong emphasis on biopharmaceutical studies. The book draws on the authors' many years of experience in academia and the pharmaceutical industry. While the focus is on nonlinear models, the book begins with an explanation of the key ideas, using linear models as examples. Applying the linearization in the parameter space, it then covers nonlinear models and locally optimal designs as well as minimax, optimal on average, and Bayesian designs. The authors also discuss ada

  11. Introduction to Nonlinear and Global Optimization

    NARCIS (Netherlands)

    Hendrix, E.M.T.; Tóth, B.

    2010-01-01

    This self-contained text provides a solid introduction to global and nonlinear optimization, providing students of mathematics and interdisciplinary sciences with a strong foundation in applied optimization techniques. The book offers a unique hands-on and critical approach to applied optimization

  12. Parallel Nonlinear Optimization for Astrodynamic Navigation Project

    Data.gov (United States)

    National Aeronautics and Space Administration — CU Aerospace proposes the development of a new parallel nonlinear program (NLP) solver software package. NLPs allow the solution of complex optimization problems,...

  13. Structural optimization for nonlinear dynamic response.

    Science.gov (United States)

    Dou, Suguang; Strachan, B Scott; Shaw, Steven W; Jensen, Jakob S

    2015-09-28

    Much is known about the nonlinear resonant response of mechanical systems, but methods for the systematic design of structures that optimize aspects of these responses have received little attention. Progress in this area is particularly important in the area of micro-systems, where nonlinear resonant behaviour is being used for a variety of applications in sensing and signal conditioning. In this work, we describe a computational method that provides a systematic means for manipulating and optimizing features of nonlinear resonant responses of mechanical structures that are described by a single vibrating mode, or by a pair of internally resonant modes. The approach combines techniques from nonlinear dynamics, computational mechanics and optimization, and it allows one to relate the geometric and material properties of structural elements to terms in the normal form for a given resonance condition, thereby providing a means for tailoring its nonlinear response. The method is applied to the fundamental nonlinear resonance of a clamped-clamped beam and to the coupled mode response of a frame structure, and the results show that one can modify essential normal form coefficients by an order of magnitude by relatively simple changes in the shape of these elements. We expect the proposed approach, and its extensions, to be useful for the design of systems used for fundamental studies of nonlinear behaviour as well as for the development of commercial devices that exploit nonlinear behaviour.

  14. Galerkin approximations of nonlinear optimal control problems in Hilbert spaces

    Directory of Open Access Journals (Sweden)

    Mickael D. Chekroun

    2017-07-01

    Full Text Available Nonlinear optimal control problems in Hilbert spaces are considered for which we derive approximation theorems for Galerkin approximations. Approximation theorems are available in the literature. The originality of our approach relies on the identification of a set of natural assumptions that allows us to deal with a broad class of nonlinear evolution equations and cost functionals for which we derive convergence of the value functions associated with the optimal control problem of the Galerkin approximations. This convergence result holds for a broad class of nonlinear control strategies as well. In particular, we show that the framework applies to the optimal control of semilinear heat equations posed on a general compact manifold without boundary. The framework is then shown to apply to geoengineering and mitigation of greenhouse gas emissions formulated here in terms of optimal control of energy balance climate models posed on the sphere $\\mathbb{S}^2$.

  15. Structural optimization for nonlinear dynamic response

    DEFF Research Database (Denmark)

    Dou, Suguang; Strachan, B. Scott; Shaw, Steven W.

    2015-01-01

    condition, thereby providing a means for tailoring its nonlinear response. The method is applied to the fundamental nonlinear resonance of a clamped–clamped beam and to the coupled mode response of a frame structure, and the results show that one can modify essential normal form coefficients by an order...... resonant behaviour is being used for a variety of applications in sensing and signal conditioning. In this work, we describe a computational method that provides a systematic means for manipulating and optimizing features of nonlinear resonant responses of mechanical structures that are described...... by a single vibrating mode, or by a pair of internally resonant modes. The approach combines techniques from nonlinear dynamics, computational mechanics and optimization, and it allows one to relate the geometric and material properties of structural elements to terms in the normal form for a given resonance...

  16. Mode matching for optimal plasmonic nonlinear generation

    Science.gov (United States)

    O'Brien, Kevin; Suchowski, Haim; Rho, Jun Suk; Kante, Boubacar; Yin, Xiaobo; Zhang, Xiang

    2013-03-01

    Nanostructures and metamaterials have attracted interest in the nonlinear optics community due to the possibility of engineering their nonlinear responses; however, the underlying physics to describe nonlinear light generation in nanostructures and the design rules to maximize the emission are still under debate. We study the geometry dependence of the second harmonic and third harmonic emission from gold nanostructures, by designing arrays of nanostructures whose geometry varies from bars to split ring resonators. We fix the length (and volume) of the nanostructure on one axis, and change the morphology from a split ring resonator on the other axis. We observed that the optimal second harmonic generation does not occur at the morphology indicated by a nonlinear oscillator model with parameters derived from the far field transmission and is not maximized by a spectral overlap of the plasmonic modes; however, we find a near field overlap integral and mode matching considerations accurately predict the optimal geometry.

  17. Nonlinear optimization of beam lines

    CERN Document Server

    Tomás Garcia, Rogelio

    2006-01-01

    The current final focus systems of linear colliders have been designed based on the local compensation scheme proposed by P. Raimondi and A. Seryi [1]. However, there exist remaining aberrations that deteriorate the performance of the system. This paper develops a general algorithm for the optimization of beam lines based on the computation of the high orders of the transfer map using MAD-X [2] and PTC [3]. The algorithm is applied to the CLIC [4] Beam Delivery System (BDS).

  18. Optimality conditions in smooth nonlinear programming

    NARCIS (Netherlands)

    Still, G.; Streng, M.

    1996-01-01

    This survey is concerned with necessary and sufficient optimality conditions for smooth nonlinear programming problems with inequality and equality constraints. These conditions deal with strict local minimizers of order one and two and with isolated minimizers. In most results, no constraint qualif

  19. Approximation of Reachable Sets using Optimal Control Algorithms

    OpenAIRE

    Baier, Robert; Gerdts, Matthias; Xausa, Ilaria

    2013-01-01

    To appear; International audience; Numerical experiences with a method for the approximation of reachable sets of nonlinear control systems are reported. The method is based on the formulation of suitable optimal control problems with varying objective functions, whose discretization by Euler's method lead to finite dimensional non-convex nonlinear programs. These are solved by a sequential quadratic programming method. An efficient adjoint method for gradient computation is used to reduce th...

  20. Nonlinear analysis approximation theory, optimization and applications

    CERN Document Server

    2014-01-01

    Many of our daily-life problems can be written in the form of an optimization problem. Therefore, solution methods are needed to solve such problems. Due to the complexity of the problems, it is not always easy to find the exact solution. However, approximate solutions can be found. The theory of the best approximation is applicable in a variety of problems arising in nonlinear functional analysis and optimization. This book highlights interesting aspects of nonlinear analysis and optimization together with many applications in the areas of physical and social sciences including engineering. It is immensely helpful for young graduates and researchers who are pursuing research in this field, as it provides abundant research resources for researchers and post-doctoral fellows. This will be a valuable addition to the library of anyone who works in the field of applied mathematics, economics and engineering.

  1. Optimized spectral estimation for nonlinear synchronizing systems.

    Science.gov (United States)

    Sommerlade, Linda; Mader, Malenka; Mader, Wolfgang; Timmer, Jens; Thiel, Marco; Grebogi, Celso; Schelter, Björn

    2014-03-01

    In many fields of research nonlinear dynamical systems are investigated. When more than one process is measured, besides the distinct properties of the individual processes, their interactions are of interest. Often linear methods such as coherence are used for the analysis. The estimation of coherence can lead to false conclusions when applied without fulfilling several key assumptions. We introduce a data driven method to optimize the choice of the parameters for spectral estimation. Its applicability is demonstrated based on analytical calculations and exemplified in a simulation study. We complete our investigation with an application to nonlinear tremor signals in Parkinson's disease. In particular, we analyze electroencephalogram and electromyogram data.

  2. Optimal Parametric Feedback Excitation of Nonlinear Oscillators

    Science.gov (United States)

    Braun, David J.

    2016-01-01

    An optimal parametric feedback excitation principle is sought, found, and investigated. The principle is shown to provide an adaptive resonance condition that enables unprecedentedly robust movement generation in a large class of oscillatory dynamical systems. Experimental demonstration of the theory is provided by a nonlinear electronic circuit that realizes self-adaptive parametric excitation without model information, signal processing, and control computation. The observed behavior dramatically differs from the one achievable using classical parametric modulation, which is fundamentally limited by uncertainties in model information and nonlinear effects inevitably present in real world applications.

  3. Vector optimization set-valued and variational analysis

    CERN Document Server

    Chen, Guang-ya; Yang, Xiaogi

    2005-01-01

    This book is devoted to vector or multiple criteria approaches in optimization. Topics covered include: vector optimization, vector variational inequalities, vector variational principles, vector minmax inequalities and vector equilibrium problems. In particular, problems with variable ordering relations and set-valued mappings are treated. The nonlinear scalarization method is extensively used throughout the book to deal with various vector-related problems. The results presented are original and should be interesting to researchers and graduates in applied mathematics and operations research

  4. Multiple optimal solutions to a sort of nonlinear optimization problem

    Institute of Scientific and Technical Information of China (English)

    Xue Shengjia

    2007-01-01

    The optimization problem is considered in which the objective function is pseudolinear(both pseudoconvex and pseudoconcave) and the constraints are linear. The general expression for the optimal solutions to the problem is derived with the representation theorem of polyhedral sets, and the uniqueness condition of the optimal solution and the computational procedures to determine all optimal solutions ( ifthe uniqueness condition is not satisfied ) are provided. Finally, an illustrative example is also given.

  5. THE OPTIMALITY CONDITIONS OF NONCONVEX SET-VALUED VECTOR OPTIMIZATION

    Institute of Scientific and Technical Information of China (English)

    盛保怀; 刘三阳

    2002-01-01

    The concepts of α-order Clarke's derivative, α-order Adjacent derivative and α-order G.Bouligand derivative of set-valued mappings are introduced, their properties are studied, with which the Fritz John optimality condition of set-valued vector optimization is established. Finally, under the assumption of pseudoconvexity, the optimality condition is proved to be sufficient.

  6. Optimal non-linear health insurance.

    Science.gov (United States)

    Blomqvist, A

    1997-06-01

    Most theoretical and empirical work on efficient health insurance has been based on models with linear insurance schedules (a constant co-insurance parameter). In this paper, dynamic optimization techniques are used to analyse the properties of optimal non-linear insurance schedules in a model similar to one originally considered by Spence and Zeckhauser (American Economic Review, 1971, 61, 380-387) and reminiscent of those that have been used in the literature on optimal income taxation. The results of a preliminary numerical example suggest that the welfare losses from the implicit subsidy to employer-financed health insurance under US tax law may be a good deal smaller than previously estimated using linear models.

  7. Critical sets in parametric optimization

    NARCIS (Netherlands)

    Jongen, H.Th.; Jonker, P.; Twilt, F.

    1986-01-01

    We deal with one-parameter families of optimization problems in finite dimensions. The constraints are both of equality and inequality type. The concept of a ‘generalized critical point’ (g.c. point) is introduced. In particular, every local minimum, Kuhn-Tucker point, and point of Fritz John type i

  8. Optimal Variational Method for Truly Nonlinear Oscillators

    Directory of Open Access Journals (Sweden)

    Vasile Marinca

    2013-01-01

    Full Text Available The Optimal Variational Method (OVM is introduced and applied for calculating approximate periodic solutions of “truly nonlinear oscillators”. The main advantage of this procedure consists in that it provides a convenient way to control the convergence of approximate solutions in a very rigorous way and allows adjustment of convergence regions where necessary. This approach does not depend upon any small or large parameters. A very good agreement was found between approximate and numerical solution, which proves that OVM is very efficient and accurate.

  9. Simulation-based optimal Bayesian experimental design for nonlinear systems

    KAUST Repository

    Huan, Xun

    2013-01-01

    The optimal selection of experimental conditions is essential to maximizing the value of data for inference and prediction, particularly in situations where experiments are time-consuming and expensive to conduct. We propose a general mathematical framework and an algorithmic approach for optimal experimental design with nonlinear simulation-based models; in particular, we focus on finding sets of experiments that provide the most information about targeted sets of parameters.Our framework employs a Bayesian statistical setting, which provides a foundation for inference from noisy, indirect, and incomplete data, and a natural mechanism for incorporating heterogeneous sources of information. An objective function is constructed from information theoretic measures, reflecting expected information gain from proposed combinations of experiments. Polynomial chaos approximations and a two-stage Monte Carlo sampling method are used to evaluate the expected information gain. Stochastic approximation algorithms are then used to make optimization feasible in computationally intensive and high-dimensional settings. These algorithms are demonstrated on model problems and on nonlinear parameter inference problems arising in detailed combustion kinetics. © 2012 Elsevier Inc.

  10. Nonlinear optimization in electrical engineering with applications in Matlab

    CERN Document Server

    Bakr, Mohamed

    2013-01-01

    Nonlinear Optimization in Electrical Engineering with Applications in MATLAB® provides an introductory course on nonlinear optimization in electrical engineering, with a focus on applications such as the design of electric, microwave, and photonic circuits, wireless communications, and digital filter design. Basic concepts are introduced using a step-by-step approach and illustrated with MATLAB® codes that the reader can use and adapt. Topics covered include: classical optimization methods; one dimensional optimization; unconstrained and constrained optimization; global optimization; space map

  11. Nonlinear Dynamics and Optimization of Spur Gears

    Science.gov (United States)

    Pellicano, Francesco; Bonori, Giorgio; Faggioni, Marcello; Scagliarini, Giorgio

    In the present study a single degree of freedom oscillator with clearance type non-linearity is considered. Such oscillator represents the simplest model able to analyze a single teeth gear pair, neglecting: bearings and shafts stiffness and multi mesh interactions. One of the test cases considered in the present work represents an actual gear pair that is part of a gear box of an agricultural vehicle; such gear pair gave rise to noise problems. The main gear pair characteristics (mesh stiffness and inertia) are evaluated after an accurate geometrical modelling. The meshing stiffness of the gear pair is piecewise linear and time varying (in particular periodic); it is evaluated numerically using nonlinear finite element analysis (with contact mechanics) for different positions along one mesh cycle, then it is expanded in Fourier series. A direct numerical integration approach and a smoothing technique have been considered to obtain the dynamic scenario. Bifurcation diagrams of Poincaré maps are plotted according to some sample case study from literature. Optimization procedures are proposed, in order to find optimal involute modifications that reduce gears vibration.

  12. Fitting Nonlinear Curves by use of Optimization Techniques

    Science.gov (United States)

    Hill, Scott A.

    2005-01-01

    MULTIVAR is a FORTRAN 77 computer program that fits one of the members of a set of six multivariable mathematical models (five of which are nonlinear) to a multivariable set of data. The inputs to MULTIVAR include the data for the independent and dependent variables plus the user s choice of one of the models, one of the three optimization engines, and convergence criteria. By use of the chosen optimization engine, MULTIVAR finds values for the parameters of the chosen model so as to minimize the sum of squares of the residuals. One of the optimization engines implements a routine, developed in 1982, that utilizes the Broydon-Fletcher-Goldfarb-Shanno (BFGS) variable-metric method for unconstrained minimization in conjunction with a one-dimensional search technique that finds the minimum of an unconstrained function by polynomial interpolation and extrapolation without first finding bounds on the solution. The second optimization engine is a faster and more robust commercially available code, denoted Design Optimization Tool, that also uses the BFGS method. The third optimization engine is a robust and relatively fast routine that implements the Levenberg-Marquardt algorithm.

  13. A hybrid nonlinear programming method for design optimization

    Science.gov (United States)

    Rajan, S. D.

    1986-01-01

    Solutions to engineering design problems formulated as nonlinear programming (NLP) problems usually require the use of more than one optimization technique. Moreover, the interaction between the user (analysis/synthesis) program and the NLP system can lead to interface, scaling, or convergence problems. An NLP solution system is presented that seeks to solve these problems by providing a programming system to ease the user-system interface. A simple set of rules is used to select an optimization technique or to switch from one technique to another in an attempt to detect, diagnose, and solve some potential problems. Numerical examples involving finite element based optimal design of space trusses and rotor bearing systems are used to illustrate the applicability of the proposed methodology.

  14. A Projected Lagrangian Algorithm for Nonlinear Minimax Optimization.

    Science.gov (United States)

    1979-11-01

    T Problem 5: Charalambous and Bandler (1976) # 1. f 1(x ) 2- + _ f3(x) = 2 exp(-x+ X2) Starting Pointz xO (1,..1)T 61 Problem 6: Rosen and Suzuki...Charalambous and Bandler ,#l) 2 3 1 6 6 6 (Rosen and Suzuki) 4 4 2 7 10 The results demonstrate that at least on a limited set of test problems the...and Numerical Methods for Stiff Differential Equations. Charalambous, C. and J.W. Bandler (1974). Nonlinear minimax optimization as a sequence of least

  15. COMPARISON OF NONLINEAR DYNAMICS OPTIMIZATION METHODS FOR APS-U

    Energy Technology Data Exchange (ETDEWEB)

    Sun, Y.; Borland, Michael

    2017-06-25

    Many different objectives and genetic algorithms have been proposed for storage ring nonlinear dynamics performance optimization. These optimization objectives include nonlinear chromaticities and driving/detuning terms, on-momentum and off-momentum dynamic acceptance, chromatic detuning, local momentum acceptance, variation of transverse invariant, Touschek lifetime, etc. In this paper, the effectiveness of several different optimization methods and objectives are compared for the nonlinear beam dynamics optimization of the Advanced Photon Source upgrade (APS-U) lattice. The optimized solutions from these different methods are preliminarily compared in terms of the dynamic acceptance, local momentum acceptance, chromatic detuning, and other performance measures.

  16. Constrained optimization for image restoration using nonlinear programming

    Science.gov (United States)

    Yeh, C.-L.; Chin, R. T.

    1985-01-01

    The constrained optimization problem for image restoration, utilizing incomplete information and partial constraints, is formulated using nonlinear proramming techniques. This method restores a distorted image by optimizing a chosen object function subject to available constraints. The penalty function method of nonlinear programming is used. Both linear or nonlinear object function, and linear or nonlinear constraint functions can be incorporated in the formulation. This formulation provides a generalized approach to solve constrained optimization problems for image restoration. Experiments using this scheme have been performed. The results are compared with those obtained from other restoration methods and the comparative study is presented.

  17. Topology optimization of nonlinear optical devices

    DEFF Research Database (Denmark)

    Jensen, Jakob Søndergaard

    2011-01-01

    This paper considers the design of nonlinear photonic devices. The nonlinearity stems from a nonlinear material model with a permittivity that depends on the local time-averaged intensity of the electric field. A finite element model is developed for time-harmonic wave propagation and an incremen......This paper considers the design of nonlinear photonic devices. The nonlinearity stems from a nonlinear material model with a permittivity that depends on the local time-averaged intensity of the electric field. A finite element model is developed for time-harmonic wave propagation...

  18. Localization and identification of structural nonlinearities using cascaded optimization and neural networks

    Science.gov (United States)

    Koyuncu, A.; Cigeroglu, E.; Özgüven, H. N.

    2017-10-01

    In this study, a new approach is proposed for identification of structural nonlinearities by employing cascaded optimization and neural networks. Linear finite element model of the system and frequency response functions measured at arbitrary locations of the system are used in this approach. Using the finite element model, a training data set is created, which appropriately spans the possible nonlinear configurations space of the system. A classification neural network trained on these data sets then localizes and determines the types of all nonlinearities associated with the nonlinear degrees of freedom in the system. A new training data set spanning the parametric space associated with the determined nonlinearities is created to facilitate parametric identification. Utilizing this data set, initially, a feed forward regression neural network is trained, which parametrically identifies the classified nonlinearities. Then, the results obtained are further improved by carrying out an optimization which uses network identified values as starting points. Unlike identification methods available in literature, the proposed approach does not require data collection from the degrees of freedoms where nonlinear elements are attached, and furthermore, it is sufficiently accurate even in the presence of measurement noise. The application of the proposed approach is demonstrated on an example system with nonlinear elements and on a real life experimental setup with a local nonlinearity.

  19. Optimal second order sliding mode control for nonlinear uncertain systems.

    Science.gov (United States)

    Das, Madhulika; Mahanta, Chitralekha

    2014-07-01

    In this paper, a chattering free optimal second order sliding mode control (OSOSMC) method is proposed to stabilize nonlinear systems affected by uncertainties. The nonlinear optimal control strategy is based on the control Lyapunov function (CLF). For ensuring robustness of the optimal controller in the presence of parametric uncertainty and external disturbances, a sliding mode control scheme is realized by combining an integral and a terminal sliding surface. The resulting second order sliding mode can effectively reduce chattering in the control input. Simulation results confirm the supremacy of the proposed optimal second order sliding mode control over some existing sliding mode controllers in controlling nonlinear systems affected by uncertainty.

  20. Nonlinear Galerkin Optimal Truncated Low—dimensional Dynamical Systems

    Institute of Scientific and Technical Information of China (English)

    ChuijieWU

    1996-01-01

    In this paper,a new theory of constructing nonlinear Galerkin optimal truncated Low-Dimensional Dynamical Systems(LDDSs) directly from partial differential equations has been developed.Applying the new theory to the nonlinear Burgers' equation,it is shown that a nearly perfect LDDS can be gotten,and the initial-boundary conditions are automatically included in the optimal bases.The nonlinear Galerkin method does not have advantages within the optimization process,but it can significantly improve the results,after the Galerkin optimal bases have been gotten.

  1. An hp symplectic pseudospectral method for nonlinear optimal control

    Science.gov (United States)

    Peng, Haijun; Wang, Xinwei; Li, Mingwu; Chen, Biaosong

    2017-01-01

    An adaptive symplectic pseudospectral method based on the dual variational principle is proposed and is successfully applied to solving nonlinear optimal control problems in this paper. The proposed method satisfies the first order necessary conditions of continuous optimal control problems, also the symplectic property of the original continuous Hamiltonian system is preserved. The original optimal control problem is transferred into a set of nonlinear equations which can be solved easily by Newton-Raphson iterations, and the Jacobian matrix is found to be sparse and symmetric. The proposed method, on one hand, exhibits exponent convergence rates when the number of collocation points are increasing with the fixed number of sub-intervals; on the other hand, exhibits linear convergence rates when the number of sub-intervals is increasing with the fixed number of collocation points. Furthermore, combining with the hp method based on the residual error of dynamic constraints, the proposed method can achieve given precisions in a few iterations. Five examples highlight the high precision and high computational efficiency of the proposed method.

  2. Mixed Nonlinear Complementarity Problems via Nonlinear Optimization: Numerical Results on Multi-Rigid-Body Contact Problems with Friction

    Science.gov (United States)

    Andreani, Roberto; Friedlander, Ana; Mello, Margarida P.; Santos, Sandra A.

    2005-06-01

    In this work we show that the mixed nonlinear complementarity problem may be formulated as an equivalent nonlinear bound-constrained optimization problem that preserves the smoothness of the original data. One may thus take advantage of existing codes for bound-constrained optimization. This approach is implemented and tested by means of an extensive set of numerical experiments, showing promising results. The mixed nonlinear complementarity problems considered in the tests arise from the discretization of a motion planning problem concerning a set of rigid 3D bodies in contact in the presence of friction. We solve the complementarity problem associated with a single time frame, thus calculating the contact forces and accelerations of the bodies involved.

  3. A new topology optimization scheme for nonlinear structures

    Energy Technology Data Exchange (ETDEWEB)

    Eim, Young Sup; Han, Seog Young [Hanyang University, Seoul (Korea, Republic of)

    2014-07-15

    A new topology optimization algorithm based on artificial bee colony algorithm (ABCA) was developed and applied to geometrically nonlinear structures. A finite element method and the Newton-Raphson technique were adopted for the nonlinear topology optimization. The distribution of material is expressed by the density of each element and a filter scheme was implemented to prevent a checkerboard pattern in the optimized layouts. In the application of ABCA for long structures or structures with small volume constraints, optimized topologies may be obtained differently for the same problem at each trial. The calculation speed is also very slow since topology optimization based on the roulette-wheel method requires many finite element analyses. To improve the calculation speed and stability of ABCA, a rank-based method was used. By optimizing several examples, it was verified that the developed topology scheme based on ABCA is very effective and applicable in geometrically nonlinear topology optimization problems.

  4. A Numerical Embedding Method for Solving the Nonlinear Optimization Problem

    Institute of Scientific and Technical Information of China (English)

    田保锋; 戴云仙; 孟泽红; 张建军

    2003-01-01

    A numerical embedding method was proposed for solving the nonlinear optimization problem. By using the nonsmooth theory, the existence and the continuation of the following path for the corresponding homotopy equations were proved. Therefore the basic theory for the algorithm of the numerical embedding method for solving the non-linear optimization problem was established. Based on the theoretical results, a numerical embedding algorithm was designed for solving the nonlinear optimization problem, and prove its convergence carefully. Numerical experiments show that the algorithm is effective.

  5. On a Highly Nonlinear Self-Obstacle Optimal Control Problem

    Energy Technology Data Exchange (ETDEWEB)

    Di Donato, Daniela, E-mail: daniela.didonato@unitn.it [University of Trento, Department of Mathematics (Italy); Mugnai, Dimitri, E-mail: dimitri.mugnai@unipg.it [Università di Perugia, Dipartimento di Matematica e Informatica (Italy)

    2015-10-15

    We consider a non-quadratic optimal control problem associated to a nonlinear elliptic variational inequality, where the obstacle is the control itself. We show that, fixed a desired profile, there exists an optimal solution which is not far from it. Detailed characterizations of the optimal solution are given, also in terms of approximating problems.

  6. Lyapunov optimal feedback control of a nonlinear inverted pendulum

    Science.gov (United States)

    Grantham, W. J.; Anderson, M. J.

    1989-01-01

    Liapunov optimal feedback control is applied to a nonlinear inverted pendulum in which the control torque was constrained to be less than the nonlinear gravity torque in the model. This necessitates a control algorithm which 'rocks' the pendulum out of its potential wells, in order to stabilize it at a unique vertical position. Simulation results indicate that a preliminary Liapunov feedback controller can successfully overcome the nonlinearity and bring almost all trajectories to the target.

  7. Lyapunov optimal feedback control of a nonlinear inverted pendulum

    Science.gov (United States)

    Grantham, W. J.; Anderson, M. J.

    1989-01-01

    Liapunov optimal feedback control is applied to a nonlinear inverted pendulum in which the control torque was constrained to be less than the nonlinear gravity torque in the model. This necessitates a control algorithm which 'rocks' the pendulum out of its potential wells, in order to stabilize it at a unique vertical position. Simulation results indicate that a preliminary Liapunov feedback controller can successfully overcome the nonlinearity and bring almost all trajectories to the target.

  8. Fuzzy set applications in engineering optimization: Multilevel fuzzy optimization

    Science.gov (United States)

    Diaz, Alejandro R.

    1989-01-01

    A formulation for multilevel optimization with fuzzy objective functions is presented. With few exceptions, formulations for fuzzy optimization have dealt with a one-level problem in which the objective is the membership function of a fuzzy set formed by the fuzzy intersection of other sets. In the problem examined here, the goal set G is defined in a more general way, using an aggregation operator H that allows arbitrary combinations of set operations (union, intersection, addition) on the individual sets Gi. This is a straightforward extension of the standard form, but one that makes possible the modeling of interesting evaluation strategies. A second, more important departure from the standard form will be the construction of a multilevel problem analogous to the design decomposition problem in optimization. This arrangement facilitates the simulation of a system design process in which different components of the system are designed by different teams, and different levels of design detail become relevant at different time stages in the process: global design features early, local features later in the process.

  9. Remarks on a benchmark nonlinear constrained optimization problem

    Institute of Scientific and Technical Information of China (English)

    Luo Yazhong; Lei Yongjun; Tang Guojin

    2006-01-01

    Remarks on a benchmark nonlinear constrained optimization problem are made. Due to a citation error, two absolutely different results for the benchmark problem are obtained by independent researchers. Parallel simulated annealing using simplex method is employed in our study to solve the benchmark nonlinear constrained problem with mistaken formula and the best-known solution is obtained, whose optimality is testified by the Kuhn-Tucker conditions.

  10. Optimization of nonlinear controller with an enhanced biogeography approach

    Directory of Open Access Journals (Sweden)

    Mohammed Salem

    2014-07-01

    Full Text Available This paper is dedicated to the optimization of nonlinear controllers basing of an enhanced Biogeography Based Optimization (BBO approach. Indeed, The BBO is combined to a predator and prey model where several predators are used with introduction of a modified migration operator to increase the diversification along the optimization process so as to avoid local optima and reach the optimal solution quickly. The proposed approach is used in tuning the gains of PID controller for nonlinear systems. Simulations are carried out over a Mass spring damper and an inverted pendulum and has given remarkable results when compared to genetic algorithm and BBO.

  11. Discrete-time inverse optimal control for nonlinear systems

    CERN Document Server

    Sanchez, Edgar N

    2013-01-01

    Discrete-Time Inverse Optimal Control for Nonlinear Systems proposes a novel inverse optimal control scheme for stabilization and trajectory tracking of discrete-time nonlinear systems. This avoids the need to solve the associated Hamilton-Jacobi-Bellman equation and minimizes a cost functional, resulting in a more efficient controller. Design More Efficient Controllers for Stabilization and Trajectory Tracking of Discrete-Time Nonlinear Systems The book presents two approaches for controller synthesis: the first based on passivity theory and the second on a control Lyapunov function (CLF). Th

  12. Spike-layer solutions to nonlinear fractional Schrodinger equations with almost optimal nonlinearities

    Directory of Open Access Journals (Sweden)

    Jinmyoung Seok

    2015-07-01

    Full Text Available In this article, we are interested in singularly perturbed nonlinear elliptic problems involving a fractional Laplacian. Under a class of nonlinearity which is believed to be almost optimal, we construct a positive solution which exhibits multiple spikes near any given local minimum components of an exterior potential of the problem.

  13. Aircraft nonlinear optimal control using fuzzy gain scheduling

    Science.gov (United States)

    Nusyirwan, I. F.; Kung, Z. Y.

    2016-10-01

    Fuzzy gain scheduling is a common solution for nonlinear flight control. The highly nonlinear region of flight dynamics is determined throughout the examination of eigenvalues and the irregular pattern of root locus plots that show the nonlinear characteristic. By using the optimal control for command tracking, the pitch rate stability augmented system is constructed and the longitudinal flight control system is established. The outputs of optimal control for 21 linear systems are fed into the fuzzy gain scheduler. This research explores the capability in using both optimal control and fuzzy gain scheduling to improve the efficiency in finding the optimal control gains and to achieve Level 1 flying qualities. The numerical simulation work is carried out to determine the effectiveness and performance of the entire flight control system. The simulation results show that the fuzzy gain scheduling technique is able to perform in real time to find near optimal control law in various flying conditions.

  14. Optimal Transmission Power in a Nonlinear VLC System

    Institute of Scientific and Technical Information of China (English)

    ZHAO Shuang; CAI Sunzeng; KANG Kai; QIAN Hua

    2016-01-01

    In a visible light communication (VLC) system, the light emitting diode (LED) is nonlinear for large signals, which limits the trans⁃mission power or equivalently the coverage of the VLC system. When the input signal amplitude is large, the nonlinear distortion creates harmonic and intermodulation distortion, which degrades the transmission error vector magnitude (EVM). To evaluate the impact of nonlinearity on system performance, the signal to noise and distortion ratio (SNDR) is applied, defined as the linear sig⁃nal power over the thermal noise plus the front end nonlinear distortion. At a given noise level, the optimal system performance can be achieved by maximizing the SNDR, which results in high transmission rate or long transmission range for the VLC system. In this paper, we provide theoretical analysis on the optimization of SNDR with a nonlinear Hammerstein model of LED. Simula⁃tion results and lab experiments validate the theoretical analysis.

  15. Optimal sets of measurement data for profile reconstruction in scatterometry

    Science.gov (United States)

    Gross, H.; Rathsfeld, A.; Scholze, F.; Bär, M.; Dersch, U.

    2007-06-01

    We discuss numerical algorithms for the determination of periodic surface structures from light diffraction patterns. With decreasing feature sizes of lithography masks, increasing demands on metrology techniques arise. Scatterometry as a non-imaging indirect optical method is applied to simple periodic line structures in order to determine parameters like side-wall angles, heights, top and bottom widths and to evaluate the quality of the manufacturing process. The numerical simulation of diffraction is based on the finite element solution of the Helmholtz equation. The inverse problem seeks to reconstruct the grating geometry from measured diffraction patterns. Restricting the class of gratings and the set of measurements, this inverse problem can be reformulated as a non-linear operator equation in Euclidean spaces. The operator maps the grating parameters to special efficiencies of diffracted plane wave modes. We employ a Gauss-Newton type iterative method to solve this operator equation. The reconstruction properties and the convergence of the algorithm, however, is controlled by the local conditioning of the non-linear mapping. To improve reconstruction and convergence, we determine optimal sets of efficiencies optimizing the condition numbers of the corresponding Jacobians. Numerical examples are presented for "chrome on glass" masks under the wavelength 632.8 nm and for EUV masks.

  16. RF Circuit linearity optimization using a general weak nonlinearity model

    NARCIS (Netherlands)

    Cheng, W.; Oude Alink, M.S.; Annema, Anne J.; Croon, Jeroen A.; Nauta, Bram

    2012-01-01

    This paper focuses on optimizing the linearity in known RF circuits, by exploring the circuit design space that is usually available in today’s deep submicron CMOS technologies. Instead of using brute force numerical optimizers we apply a generalized weak nonlinearity model that only involves AC

  17. Reliability-based design optimization for nonlinear energy harvesters

    Science.gov (United States)

    Seong, Sumin; Lee, Soobum; Hu, Chao

    2015-03-01

    The power output of a vibration energy harvesting device is highly sensitive to uncertainties in materials, manufacturing, and operating conditions. Although the use of a nonlinear spring (e.g., snap-through mechanism) in energy harvesting device has been reported to reduce the sensitivity of power output with respect to the excitation frequency, the nonlinear spring characteristic remains significantly sensitive and it causes unreliable power generation. In this paper, we present a reliability-based design optimization (RBDO) study of vibration energy harvesters. For a nonlinear harvester, a purely mechanical nonlinear spring design implemented in the middle of cantilever beam harvester is considered in the study. This design has the curved section in the center of beam that causes bi-stable configuration. When vibrating, the inertia of the tip mass activates the curved shell to cause snap-through buckling and make the nature of vibration nonlinear. In this paper, deterministic optimization (DO) is performed to obtain deterministic optimum of linear and nonlinear energy harvester configuration. As a result of the deterministic optimization, an optimum bi-stable vibration configuration of nonlinear harvester can be obtained for reliable power generation despite uncertainty on input vibration condition. For the linear harvester, RBDO is additionally performed to find the optimum design that satisfies a target reliability on power generation, while accounting for uncertainty in material properties and geometric parameters.

  18. Newtonian Nonlinear Dynamics for Complex Linear and Optimization Problems

    CERN Document Server

    Vázquez, Luis

    2013-01-01

    Newtonian Nonlinear Dynamics for Complex Linear and Optimization Problems explores how Newton's equation for the motion of one particle in classical mechanics combined with finite difference methods allows creation of a mechanical scenario to solve basic problems in linear algebra and programming. The authors present a novel, unified numerical and mechanical approach and an important analysis method of optimization. This book also: Presents mechanical method for determining matrix singularity or non-independence of dimension and complexity Illustrates novel mathematical applications of classical Newton’s law Offers a new approach and insight to basic, standard problems Includes numerous examples and applications Newtonian Nonlinear Dynamics for Complex Linear and Optimization Problems is an ideal book for undergraduate and graduate students as well as researchers interested in linear problems and optimization, and nonlinear dynamics.      

  19. Optimal Nonlinear Filter for INS Alignment

    Institute of Scientific and Technical Information of China (English)

    赵瑞; 顾启泰

    2002-01-01

    All the methods to handle the inertial navigation system (INS) alignment were sub-optimal in the past. In this paper, particle filtering (PF) as an optimal method is used for solving the problem of INS alignment. A sub-optimal two-step filtering algorithm is presented to improve the real-time performance of PF. The approach combines particle filtering with Kalman filtering (KF). Simulation results illustrate the superior performance of these approaches when compared with extended Kalman filtering (EKF).

  20. Optimized Set of RST Moment Invariants

    Directory of Open Access Journals (Sweden)

    Khalid M. Hosny

    2008-01-01

    Full Text Available Moment invariants are widely used in image processing, pattern recognition and computer vision. Several methods and algorithms have been proposed for fast and efficient calculation of moment's invariants where numerical approximation errors are involved in most of these methods. In this paper, an optimized set of moment invariants with respect to rotation, scaling and translation is presented. An accurate method is used for exact computation of moment invariants for gray level images. A fast algorithm is applied to accelerate the process of computation. Error analysis is presented and a comparison with other conventional methods is performed. The obtained results explain the superiority of the proposed method.

  1. Introduction to the theory of nonlinear optimization

    CERN Document Server

    Jahn, Johannes

    2007-01-01

    This book serves as an introductory text to optimization theory in normed spaces. The topics of this book are existence results, various differentiability notions together with optimality conditions, the contingent cone, a generalization of the Lagrange multiplier rule, duality theory, extended semidefinite optimization, and the investigation of linear quadratic and time minimal control problems. This textbook presents fundamentals with particular emphasis on the application to problems in the calculus of variations, approximation and optimal control theory. The reader is expected to have a ba

  2. Optimization-Based Robust Nonlinear Control

    Science.gov (United States)

    2006-08-01

    IEEE Transactions on Automatic Control , vol. 51, no. 4, pp. 661...systems with two time scales", A.R. Teel, L. Moreau and D. Nesic, IEEE Transactions on Automatic Control , vol. 48, no. 9, pp. 1526-1544, September 2003...Turner, L. Zaccarian, IEEE Transactions on Automatic Control , vol. 48, no. 9, pp. 1509- 1525, September 2003. 5. "Nonlinear Scheduled anti-windup

  3. A new optimization algotithm with application to nonlinear MPC

    Directory of Open Access Journals (Sweden)

    Frode Martinsen

    2005-01-01

    Full Text Available This paper investigates application of SQP optimization algorithm to nonlinear model predictive control. It considers feasible vs. infeasible path methods, sequential vs. simultaneous methods and reduced vs full space methods. A new optimization algorithm coined rFOPT which remains feasibile with respect to inequality constraints is introduced. The suitable choices between these various strategies are assessed informally through a small CSTR case study. The case study also considers the effect various discretization methods have on the optimization problem.

  4. Optimal beamforming in MIMO systems with HPA nonlinearity

    KAUST Repository

    Qi, Jian

    2010-09-01

    In this paper, multiple-input multiple-output (MIMO) transmit beamforming (TB) systems under the consideration of nonlinear high-power amplifiers (HPAs) are investigated. The optimal beamforming scheme, with the optimal beamforming weight vector and combining vector, is proposed for MIMO systems with HPA nonlinearity. The performance of the proposed MIMO beamforming scheme in the presence of HPA nonlinearity is evaluated in terms of average symbol error probability (SEP), outage probability and system capacity, considering transmission over uncorrelated quasi-static frequency-flat Rayleigh fading channels. Numerical results are provided and show the effects of several system parameters, namely, parameters of nonlinear HPA, numbers of transmit and receive antennas, and modulation order of phase-shift keying (PSK), on performance. ©2010 IEEE.

  5. Nonlinear model predictive control based on collective neurodynamic optimization.

    Science.gov (United States)

    Yan, Zheng; Wang, Jun

    2015-04-01

    In general, nonlinear model predictive control (NMPC) entails solving a sequential global optimization problem with a nonconvex cost function or constraints. This paper presents a novel collective neurodynamic optimization approach to NMPC without linearization. Utilizing a group of recurrent neural networks (RNNs), the proposed collective neurodynamic optimization approach searches for optimal solutions to global optimization problems by emulating brainstorming. Each RNN is guaranteed to converge to a candidate solution by performing constrained local search. By exchanging information and iteratively improving the starting and restarting points of each RNN using the information of local and global best known solutions in a framework of particle swarm optimization, the group of RNNs is able to reach global optimal solutions to global optimization problems. The essence of the proposed collective neurodynamic optimization approach lies in the integration of capabilities of global search and precise local search. The simulation results of many cases are discussed to substantiate the effectiveness and the characteristics of the proposed approach.

  6. A TRUST-REGION ALGORITHM FOR NONLINEAR INEQUALITY CONSTRAINED OPTIMIZATION

    Institute of Scientific and Technical Information of China (English)

    Xiaojiao Tong; Shuzi Zhou

    2003-01-01

    This paper presents a new trust-region algorithm for n-dimension nonlinear optimization subject to m nonlinear inequality constraints. Equivalent KKT conditions are derived,which is the basis for constructing the new algorithm. Global convergence of the algorithm to a first-order KKT point is established under mild conditions on the trial steps, local quadratic convergence theorem is proved for nondegenerate minimizer point. Numerical experiment is presented to show the effectiveness of our approach.

  7. Conference on High Performance Software for Nonlinear Optimization

    CERN Document Server

    Murli, Almerico; Pardalos, Panos; Toraldo, Gerardo

    1998-01-01

    This book contains a selection of papers presented at the conference on High Performance Software for Nonlinear Optimization (HPSN097) which was held in Ischia, Italy, in June 1997. The rapid progress of computer technologies, including new parallel architec­ tures, has stimulated a large amount of research devoted to building software environments and defining algorithms able to fully exploit this new computa­ tional power. In some sense, numerical analysis has to conform itself to the new tools. The impact of parallel computing in nonlinear optimization, which had a slow start at the beginning, seems now to increase at a fast rate, and it is reasonable to expect an even greater acceleration in the future. As with the first HPSNO conference, the goal of the HPSN097 conference was to supply a broad overview of the more recent developments and trends in nonlinear optimization, emphasizing the algorithmic and high performance software aspects. Bringing together new computational methodologies with theoretical...

  8. Nonlinear optimization of load allocation in a manufacturing system

    Institute of Scientific and Technical Information of China (English)

    GUO Cai-fen; WANG Ning-sheng

    2006-01-01

    Based on the queuing theory, a nonlinear optimization model is proposed in this paper. A novel transformation of optimization variables is devised and the constraints are properly combined so as to make this model into a convex one, from which the Lagrangian function and the KKT conditions are derived. The interiorpoint method for convex optimization is presented here as a computationally efficient tool. Finally, this model is evaluated on a real example, from which such conclusions are drawn that the optimum result can ensure the full utilization of machines and the least amount of WIP in manufacturing systems; the interior-point method for convex optimization needs fewer iterations with significant computational savings. It appears that many non-linear optimization problems in the industrial engineering field would be amenable to this method of solution.

  9. Novel Approach to Nonlinear PID Parameter Optimization Using Ant Colony Optimization Algorithm

    Institute of Scientific and Technical Information of China (English)

    Duan Hai-bin; Wang Dao-bo; Yu Xiu-fen

    2006-01-01

    This paper presents an application of an Ant Colony Optimization (ACO) algorithm to optimize the parameters in the design of a type of nonlinear PID controller. The ACO algorithm is a novel heuristic bionic algorithm, which is based on the behaviour of real ants in nature searching for food. In order to optimize the parameters of the nonlinear PID controller using ACO algorithm,an objective function based on position tracing error was constructed, and elitist strategy was adopted in the improved ACO algorithm. Detailed simulation steps are presented. This nonlinear PID controller using the ACO algorithm has high precision of control and quick response.

  10. Nonlinear Non-convex Optimization of Hydraulic Networks

    DEFF Research Database (Denmark)

    Tahavori, Maryamsadat; Kallesøe, Carsten; Leth, John-Josef

    2013-01-01

    Pressure management in water supply systems is an effective way to reduce the leakage in a system. In this paper, the pressure management and the reduction of power consumption of a water supply system is formulated as an optimization problem. The problem is to minimize the power consumption...... in pumps and also to regulate the pressure at the end-user valves to a desired value. The optimization problem which is solved is a nonlinear and non-convex optimization. The barrier method is used to solve this problem. The modeling framework and the optimization technique which are used are general...

  11. Asynchronous parallel pattern search for nonlinear optimization

    Energy Technology Data Exchange (ETDEWEB)

    P. D. Hough; T. G. Kolda; V. J. Torczon

    2000-01-01

    Parallel pattern search (PPS) can be quite useful for engineering optimization problems characterized by a small number of variables (say 10--50) and by expensive objective function evaluations such as complex simulations that take from minutes to hours to run. However, PPS, which was originally designed for execution on homogeneous and tightly-coupled parallel machine, is not well suited to the more heterogeneous, loosely-coupled, and even fault-prone parallel systems available today. Specifically, PPS is hindered by synchronization penalties and cannot recover in the event of a failure. The authors introduce a new asynchronous and fault tolerant parallel pattern search (AAPS) method and demonstrate its effectiveness on both simple test problems as well as some engineering optimization problems

  12. Modified constrained differential evolution for solving nonlinear global optimization problems

    OpenAIRE

    2013-01-01

    Nonlinear optimization problems introduce the possibility of multiple local optima. The task of global optimization is to find a point where the objective function obtains its most extreme value while satisfying the constraints. Some methods try to make the solution feasible by using penalty function methods, but the performance is not always satisfactory since the selection of the penalty parameters for the problem at hand is not a straightforward issue. Differential evolut...

  13. Optimal state discrimination and unstructured search in nonlinear quantum mechanics

    Science.gov (United States)

    Childs, Andrew M.; Young, Joshua

    2016-02-01

    Nonlinear variants of quantum mechanics can solve tasks that are impossible in standard quantum theory, such as perfectly distinguishing nonorthogonal states. Here we derive the optimal protocol for distinguishing two states of a qubit using the Gross-Pitaevskii equation, a model of nonlinear quantum mechanics that arises as an effective description of Bose-Einstein condensates. Using this protocol, we present an algorithm for unstructured search in the Gross-Pitaevskii model, obtaining an exponential improvement over a previous algorithm of Meyer and Wong. This result establishes a limitation on the effectiveness of the Gross-Pitaevskii approximation. More generally, we demonstrate similar behavior under a family of related nonlinearities, giving evidence that the ability to quickly discriminate nonorthogonal states and thereby solve unstructured search is a generic feature of nonlinear quantum mechanics.

  14. Optimal Variational Asymptotic Method for Nonlinear Fractional Partial Differential Equations.

    Science.gov (United States)

    Baranwal, Vipul K; Pandey, Ram K; Singh, Om P

    2014-01-01

    We propose optimal variational asymptotic method to solve time fractional nonlinear partial differential equations. In the proposed method, an arbitrary number of auxiliary parameters γ 0, γ 1, γ 2,… and auxiliary functions H 0(x), H 1(x), H 2(x),… are introduced in the correction functional of the standard variational iteration method. The optimal values of these parameters are obtained by minimizing the square residual error. To test the method, we apply it to solve two important classes of nonlinear partial differential equations: (1) the fractional advection-diffusion equation with nonlinear source term and (2) the fractional Swift-Hohenberg equation. Only few iterations are required to achieve fairly accurate solutions of both the first and second problems.

  15. Special section on analysis, design and optimization of nonlinear circuits

    Science.gov (United States)

    Okumura, Kohshi

    Nonlinear theory plays an indispensable role in analysis, design and optimization of electric/electronic circuits because almost all circuits in the real world are modeled by nonlinear systems. Also, as the scale and complexity of circuits increase, more effective and systematic methods for the analysis, design and optimization are desired. The goal of this special section is to bring together research results from a variety of perspectives and academic disciplines related to nonlinear electric/electronic circuits.This special section includes three invited papers and six regular papers. The first invited paper by Kennedy entitled “Recent advances in the analysis, design and optimization of digital delta-sigma modulators” gives an overview of digital delta-sigma modulators and some techniques for improving their efficiency. The second invited paper by Trajkovic entitled “DC operating points of transistor circuits” surveys main theoretical results on the analysis of DC operating points of transistor circuits and discusses numerical methods for calculating them. The third invited paper by Nishi et al. entitled “Some properties of solution curves of a class of nonlinear equations and the number of solutions” gives several new theorems concerning solution curves of a class of nonlinear equations which is closely related to DC operating point analysis of nonlinear circuits. The six regular papers cover a wide range of areas such as memristors, chaos circuits, filters, sigma-delta modulators, energy harvesting systems and analog circuits for solving optimization problems.The guest editor would like to express his sincere thanks to the authors who submitted their papers to this special section. He also thanks the reviewers and the editorial committee members of this special section for their support during the review process. Last, but not least, he would also like to acknowledge the editorial staff of the NOLTA journal for their continuous support of this

  16. A nonlinear optimization approach for UPFC power flow control and voltage security

    Science.gov (United States)

    Kalyani, Radha Padma

    This dissertation provides a nonlinear optimization algorithm for the long term control of Unified Power Flow Controller (UPFC) to remove overloads and voltage violations by optimized control of power flows and voltages in the power network. It provides a control strategy for finding the long term control settings of one or more UPFCs by considering all the possible settings and all the (N-1) topologies of a power network. Also, a simple evolutionary algorithm (EA) has been proposed for the placement of more than one UPFC in large power systems. In this publication dissertation, Paper 1 proposes the algorithm and provides the mathematical and empirical evidence. Paper 2 focuses on comparing the proposed algorithm with Linear Programming (LP) based corrective method proposed in literature recently and mitigating cascading failures in larger power systems. EA for placement along with preliminary results of the nonlinear optimization is given in Paper 3.

  17. Route Monopolie and Optimal Nonlinear Pricing

    Science.gov (United States)

    Tournut, Jacques

    2003-01-01

    To cope with air traffic growth and congested airports, two solutions are apparent on the supply side: 1) use larger aircraft in the hub and spoke system; or 2) develop new routes through secondary airports. An enlarged route system through secondary airports may increase the proportion of route monopolies in the air transport market.The monopoly optimal non linear pricing policy is well known in the case of one dimension (one instrument, one characteristic) but not in the case of several dimensions. This paper explores the robustness of the one dimensional screening model with respect to increasing the number of instruments and the number of characteristics. The objective of this paper is then to link and fill the gap in both literatures. One of the merits of the screening model has been to show that a great varieD" of economic questions (non linear pricing, product line choice, auction design, income taxation, regulation...) could be handled within the same framework.VCe study a case of non linear pricing (2 instruments (2 routes on which the airline pro_ddes customers with services), 2 characteristics (demand of services on these routes) and two values per characteristic (low and high demand of services on these routes)) and we show that none of the conclusions of the one dimensional analysis remain valid. In particular, upward incentive compatibility constraint may be binding at the optimum. As a consequence, they may be distortion at the top of the distribution. In addition to this, we show that the optimal solution often requires a kind of form of bundling, we explain explicitly distortions and show that it is sometimes optimal for the monopolist to only produce one good (instead of two) or to exclude some buyers from the market. Actually, this means that the monopolist cannot fully apply his monopoly power and is better off selling both goods independently.We then define all the possible solutions in the case of a quadratic cost function for a uniform

  18. Fully localised nonlinear energy growth optimals in pipe flow

    CERN Document Server

    Pringle, Chris C T; Kerswell, Rich R

    2014-01-01

    A new, fully-localised, energy growth optimal is found over large times and in long pipe domains at a given mass flow rate. This optimal emerges at a threshold disturbance energy below which a nonlinear version of the known (streamwise-independent) linear optimal (Schmid \\& Henningson 1994) is selected, and appears to remain the optimal up until the critical energy at which transition is triggered. The form of this optimal is similar to that found in short pipes (Pringle et al.\\ 2012) albeit now with full localisation in the streamwise direction. This fully-localised optimal perturbation represents the best approximation yet of the {\\em minimal seed} (the smallest perturbation capable of triggering a turbulent episode) for `real' (laboratory) pipe flows.

  19. Optimization of optical nonlinearities in quantum cascade lasers

    Science.gov (United States)

    Bai, Jing

    Nonlinearities in quantum cascade lasers (QCL's) have wide applications in wavelength tunability and ultra-short pulse generation. In this thesis, optical nonlinearities in InGaAs/AlInAs-based mid-infrared (MIR) QCL's with quadruple resonant levels are investigated. Design optimization for the second-harmonic generation (SHG) of the device is presented. Performance characteristics associated with the third-order nonlinearities are also analyzed. The design optimization for SHG efficiency is obtained utilizing techniques from supersymmetric quantum mechanics (SUSYQM) with both material-dependent effective mass and band nonparabolicity. Current flow and power output of the structure are analyzed by self-consistently solving rate equations for the carriers and photons. Nonunity pumping efficiency from one period of the QCL to the next is taken into account by including all relevant electron-electron (e-e) and longitudinal (LO) phonon scattering mechanisms between the injector/collector and active regions. Two-photon absorption processes are analyzed for the resonant cascading triple levels designed for enhancing SHG. Both sequential and simultaneous two-photon absorption processes are included in the rate-equation model. The current output characteristics for both the original and optimized structures are analyzed and compared. Stronger resonant tunneling in the optimized structure is manifested by enhanced negative differential resistance. Current-dependent linear optical output power is derived based on the steady-state photon populations in the active region. The second-harmonic (SH) power is derived from the Maxwell equations with the phase mismatch included. Due to stronger coupling between lasing levels, the optimized structure has both higher linear and nonlinear output powers. Phase mismatch effects are significant for both structures leading to a substantial reduction of the linear-to-nonlinear conversion efficiency. The optimized structure can be fabricated

  20. Optimal Control Of Nonlinear Wave Energy Point Converters

    DEFF Research Database (Denmark)

    Nielsen, Søren R.K.; Zhou, Qiang; Kramer, Morten

    2013-01-01

    In this paper the optimal control law for a single nonlinear point absorber in irregular sea-states is derived, and proven to be a closed-loop controller with feedback from measured displacement, velocity and acceleration of the floater. However, a non-causal integral control component dependent...... idea behind the control strategy is to enforce the stationary velocity response of the absorber into phase with the wave excitation force at any time. The controller is optimal under monochromatic wave excitation. It is demonstrated that the devised causal controller, in plane irregular sea states......, absorbs almost the same power as the optimal controller....

  1. GENERATION OF COMPLEX NONLINEAR BENCHMARK FUNCTIONS FOR OPTIMIZATION USING FUZZY SETS AND CLASSICAL TEST FUNCTIONS GENERACIÓN DE FUNCIONES BENCHMARK COMPLEJAS NO LINEALES PARA OPTIMIZACIÓN USANDO CONJUNTOS DIFUSOS Y FUNCIONES DE PRUEBA CLÁSICAS

    Directory of Open Access Journals (Sweden)

    Eddy Mesa

    2011-12-01

    Full Text Available In this paper, we present a novel methodology to generate complex functions using two-dimensional fuzzy sets as weights for combining classical benchmark functions. These new functions have different characteristics from original ones, but the minimum, borders and geometry characteristics of the functions are still known. Three different combinations of two functions (Rosenbrock and Bukin's F4 are used to exemplify the method and its potential to generate specific test functions to study and improve optimization methods.En este artículo se presenta una metodología novedosa para generar funciones complejas usando conjuntos borrosos bidimensionales como pesos para combinar funciones clásicas de prueba. Estas nuevas funciones tienen características diferentes pero el mínimo, los bordes y la geometría de las nuevas funciones se conoce. Tres combinaciones diferentes de dos funciones (Rosenbrock y F4 de Bukin se utilizan para ejemplificar el método y su potencial como generador de funciones de prueba para estudiar y mejorar métodos de optimización.

  2. A level-set based topology optimization using the element connectivity parameterization method

    NARCIS (Netherlands)

    Van Dijk, N.P.; Yoon, G.H.; Van Keulen, F.; Langelaar, M.

    2010-01-01

    This contribution presents a novel and versatile approach to geometrically nonlinear topology optimization by combining the level-set method with the element connectivity parameterization method or ECP. The combined advantages of both methods open up the possibility to treat a wide range of optimiza

  3. Optimal nonlinear feedback control of quasi-Hamiltonian systems

    Institute of Scientific and Technical Information of China (English)

    朱位秋; 应祖光

    1999-01-01

    An innovative strategy for optimal nonlinear feedback control of linear or nonlinear stochastic dynamic systems is proposed based on the stochastic averaging method for quasi-Hamiltonian systems and stochastic dynamic programming principle. Feedback control forces of a system are divided into conservative parts and dissipative parts. The conservative parts are so selected that the energy distribution in the controlled system is as requested as possible. Then the response of the system with known conservative control forces is reduced to a controlled diffusion process by using the stochastic averaging method. The dissipative parts of control forces are obtained from solving the stochastic dynamic programming equation.

  4. Properties of solutions of optimization problems for set functions

    Directory of Open Access Journals (Sweden)

    Slawomir Dorosiewicz

    2001-01-01

    Full Text Available A definition of a special class of optimization problems with set functions is given. The existence of optimal solutions and first-order optimality conditions are proved. This case of optimal problems can be transformed to standard mixed problems of mathematical programming in Euclidean space. It makes possible the applications of various algorithms for these optimization problems for finding conditional extrema of set functions.

  5. Nonlinear Non-convex Optimization of Hydraulic Networks

    DEFF Research Database (Denmark)

    Tahavori, Maryamsadat; Kallesøe, Carsten; Leth, John-Josef

    2013-01-01

    Pressure management in water supply systems is an effective way to reduce the leakage in a system. In this paper, the pressure management and the reduction of power consumption of a water supply system is formulated as an optimization problem. The problem is to minimize the power consumption...... in pumps and also to regulate the pressure at the end-user valves to a desired value. The optimization problem which is solved is a nonlinear and non-convex optimization. The barrier method is used to solve this problem. The modeling framework and the optimization technique which are used are general....... They can be used for a general hydraulic networks to optimize the leakage and energy consumption and to satisfy the demands at the end-users. The results in this paper show that the power consumption of the pumps is reduced....

  6. A MIT-Based Nonlinear Adaptive Set-Membership Filter for the Ellipsoidal Estimation of Mobile Robots’ States

    Directory of Open Access Journals (Sweden)

    Dalei Song

    2012-10-01

    Full Text Available The adaptive extended set‐membership filter (AESMF for nonlinear ellipsoidal estimation suffers a mismatch between real process noise and its set boundaries, which may result in unstable estimation. In this paper, a MIT method‐based adaptive set‐membership filter, for the optimization of the set boundaries of process noise, is developed and applied to the nonlinear joint estimation of both time‐varying states and parameters. As a result of using the proposed MIT‐AESMF, the estimation effectiveness and boundary accuracy of traditional AESMF are substantially improved. Simulation results have shown the efficiency and robustness of the proposed method.

  7. The design of predictive control with characterized set of initial condition for constrained switched nonlinear system

    Institute of Scientific and Technical Information of China (English)

    SU BaiLi; LI ShaoYuan; ZHU QuanMin

    2009-01-01

    Stabilization of the constrained switched nonlinear systems is an attractive research subject. Predictive control can handle variable constraints well and make the system stable. Its stability is typically based on an assumption of initial feasibility of the optimization problem; however the set of initial conditions, starting from where a given predictive formulation is guaranteed to be feasible, is not explicitly char-acterized. In this paper, a hybrid predictive control method is proposed for a class of switched nonlin-ear systems with input constraints and un-measurable states. The main idea is to design a mixed con-troller using Lyapunov functions and a state observer, which switches appropriately between a bounded feedback controller and a predictive controller, and to give an explicitly characterized set of initial conditions to stabilize each closed-loop subsystem. For the whole switched nonlinear system, a suitable switched law based on the state estimation is designed to orchestrate the transitions between the consistituent modes and their respective controllers, and to ensure the whole closed-loop system's stability. The simulation results for a chemical process show the validity of the controller proposed in this paper.

  8. The design of predictive control with characterized set of initial condition for constrained switched nonlinear system

    Institute of Scientific and Technical Information of China (English)

    2009-01-01

    Stabilization of the constrained switched nonlinear systems is an attractive research subject. Predictive control can handle variable constraints well and make the system stable. Its stability is typically based on an assumption of initial feasibility of the optimization problem; however the set of initial conditions, starting from where a given predictive formulation is guaranteed to be feasible, is not explicitly characterized. In this paper, a hybrid predictive control method is proposed for a class of switched nonlinear systems with input constraints and un-measurable states. The main idea is to design a mixed controller using Lyapunov functions and a state observer, which switches appropriately between a bounded feedback controller and a predictive controller, and to give an explicitly characterized set of initial conditions to stabilize each closed-loop subsystem. For the whole switched nonlinear system, a suitable switched law based on the state estimation is designed to orchestrate the transitions between the consistituent modes and their respective controllers, and to ensure the whole closed-loop system’s stability. The simulation results for a chemical process show the validity of the controller proposed in this paper.

  9. Non-linear DSGE Models and The Optimized Particle Filter

    DEFF Research Database (Denmark)

    Andreasen, Martin Møller

    This paper improves the accuracy and speed of particle filtering for non-linear DSGE models with potentially non-normal shocks. This is done by introducing a new proposal distribution which i) incorporates information from new observables and ii) has a small optimization step that minimizes...... the distance to the optimal proposal distribution. A particle filter with this proposal distribution is shown to deliver a high level of accuracy even with relatively few particles, and this filter is therefore much more efficient than the standard particle filter....

  10. On super efficiency in set-valued optimization

    Institute of Scientific and Technical Information of China (English)

    LI Tai-yong; XU Yi-hong

    2009-01-01

    The set-valued optimization problem with constraints is considered in the sense of super efficiency in locally convex linear topological spaces. Under the assumption of iccone-convexlikeness, by applying the seperation theorem, Kuhn-Tucker's, Lagrange's and saddle points optimality conditions, the necessary conditions are obtained for the set-valued optimization problem to attain its super efficient solutions. Also, the sufficient conditions for Kuhn-Tucker's, Lagrange's and saddle points optimality conditions are derived.

  11. Application of Optimization Techniques to a Nonlinear Problem of Communication Network Design With Nonlinear Constraints

    Science.gov (United States)

    2002-06-01

    IEEE TRANSACTIONS ON AUTOMATIC CONTROL , VOL. 47, NO. 6, JUNE 2002 1033 Application of Optimization Techniques to a Nonlinear Problem of Communication... IEEE TRANSACTIONS ON AUTOMATIC CONTROL , VOL. 47, NO. 6, JUNE 2002 We consider J source-destination pairs, each of which is assigned a fixed multihop...blocking probabilities are at the maximum permitted value. IEEE TRANSACTIONS ON AUTOMATIC CONTROL , VOL. 47, NO. 6, JUNE

  12. Structural Optimization for Reliability Using Nonlinear Goal Programming

    Science.gov (United States)

    El-Sayed, Mohamed E.

    1999-01-01

    This report details the development of a reliability based multi-objective design tool for solving structural optimization problems. Based on two different optimization techniques, namely sequential unconstrained minimization and nonlinear goal programming, the developed design method has the capability to take into account the effects of variability on the proposed design through a user specified reliability design criterion. In its sequential unconstrained minimization mode, the developed design tool uses a composite objective function, in conjunction with weight ordered design objectives, in order to take into account conflicting and multiple design criteria. Multiple design criteria of interest including structural weight, load induced stress and deflection, and mechanical reliability. The nonlinear goal programming mode, on the other hand, provides for a design method that eliminates the difficulty of having to define an objective function and constraints, while at the same time has the capability of handling rank ordered design objectives or goals. For simulation purposes the design of a pressure vessel cover plate was undertaken as a test bed for the newly developed design tool. The formulation of this structural optimization problem into sequential unconstrained minimization and goal programming form is presented. The resulting optimization problem was solved using: (i) the linear extended interior penalty function method algorithm; and (ii) Powell's conjugate directions method. Both single and multi-objective numerical test cases are included demonstrating the design tool's capabilities as it applies to this design problem.

  13. A new method for nonlinear optimization - experimental results

    Energy Technology Data Exchange (ETDEWEB)

    Loskovska, S.; Percinkova, B.

    1994-12-31

    In this paper an application of a new method for nonlinear optimization problems suggested and presented by B. Percinkova is performed. The method is originally developed and applicated on nonlinear systems. Basis of the method is following: A system of n-nonlinear equations gives as F{sub i}(x{sub 1}, x{sub 2}, x{sub 3}, ..., x{sub n}) = 0; 1 = 1, 2, ..., n and solution domain x{sub pi} {<=} x{sub i} {<=} x{sub ki} i = 1, 2, ..., n is modified by introducing a new variable z. The new system is given by: F{sub i}(x{sub 1}, x{sub 2}, x{sub 3}, ..., x{sub n}) = z; i = 1, 2, ..., n. The system defines a curve in (n + 1) dimensional space. System`s point X = (x{sub i}, x{sub 2}, x{sub 3}, ..., x{sub n}, z) that, the solution of the system is obtained using an interative procedure moving along the curve until the point with z = 0 is reached. In order to applicate method on optimization problems, a basic optimization model given with (min, max)F{sub i}(x{sub 1}, x{sub 2}, x{sub 3}, ..., x{sub n}) with the following optimization space: F{sub i}(x{sub 1}, x{sub 2}, x{sub 3}, ..., x{sub n}) ({<=}{>=})0 : i = 1, 2, ..., n is transformed into a system equivalent to system (2) by (dF/dx{sub i}) = z; i - 1, 2, ..., n. The main purpose of this work is to make relevant evaluation of the method by standard test problems.

  14. Spin glasses and nonlinear constraints in portfolio optimization

    Energy Technology Data Exchange (ETDEWEB)

    Andrecut, M., E-mail: mircea.andrecut@gmail.com

    2014-01-17

    We discuss the portfolio optimization problem with the obligatory deposits constraint. Recently it has been shown that as a consequence of this nonlinear constraint, the solution consists of an exponentially large number of optimal portfolios, completely different from each other, and extremely sensitive to any changes in the input parameters of the problem, making the concept of rational decision making questionable. Here we reformulate the problem using a quadratic obligatory deposits constraint, and we show that from the physics point of view, finding an optimal portfolio amounts to calculating the mean-field magnetizations of a random Ising model with the constraint of a constant magnetization norm. We show that the model reduces to an eigenproblem, with 2N solutions, where N is the number of assets defining the portfolio. Also, in order to illustrate our results, we present a detailed numerical example of a portfolio of several risky common stocks traded on the Nasdaq Market.

  15. Spin glasses and nonlinear constraints in portfolio optimization

    Science.gov (United States)

    Andrecut, M.

    2014-01-01

    We discuss the portfolio optimization problem with the obligatory deposits constraint. Recently it has been shown that as a consequence of this nonlinear constraint, the solution consists of an exponentially large number of optimal portfolios, completely different from each other, and extremely sensitive to any changes in the input parameters of the problem, making the concept of rational decision making questionable. Here we reformulate the problem using a quadratic obligatory deposits constraint, and we show that from the physics point of view, finding an optimal portfolio amounts to calculating the mean-field magnetizations of a random Ising model with the constraint of a constant magnetization norm. We show that the model reduces to an eigenproblem, with 2N solutions, where N is the number of assets defining the portfolio. Also, in order to illustrate our results, we present a detailed numerical example of a portfolio of several risky common stocks traded on the Nasdaq Market.

  16. Fully Nonlinear Boussinesq-Type Equations with Optimized Parameters for Water Wave Propagation

    Institute of Scientific and Technical Information of China (English)

    荆海晓; 刘长根; 龙文; 陶建华

    2015-01-01

    For simulating water wave propagation in coastal areas, various Boussinesq-type equations with improved properties in intermediate or deep water have been presented in the past several decades. How to choose proper Boussinesq-type equations has been a practical problem for engineers. In this paper, approaches of improving the characteristics of the equations, i.e. linear dispersion, shoaling gradient and nonlinearity, are reviewed and the advantages and disadvantages of several different Boussinesq-type equations are compared for the applications of these Boussinesq-type equations in coastal engineering with relatively large sea areas. Then for improving the properties of Boussinesq-type equations, a new set of fully nonlinear Boussinseq-type equations with modified representative velocity are derived, which can be used for better linear dispersion and nonlinearity. Based on the method of minimizing the overall error in different ranges of applications, sets of parameters are determined with optimized linear dispersion, linear shoaling and nonlinearity, respectively. Finally, a test example is given for validating the results of this study. Both results show that the equations with optimized parameters display better characteristics than the ones obtained by matching with padé approximation.

  17. Fully nonlinear Boussinesq-type equations with optimized parameters for water wave propagation

    Science.gov (United States)

    Jing, Hai-xiao; Liu, Chang-gen; Long, Wen; Tao, Jian-hua

    2015-06-01

    For simulating water wave propagation in coastal areas, various Boussinesq-type equations with improved properties in intermediate or deep water have been presented in the past several decades. How to choose proper Boussinesq-type equations has been a practical problem for engineers. In this paper, approaches of improving the characteristics of the equations, i.e. linear dispersion, shoaling gradient and nonlinearity, are reviewed and the advantages and disadvantages of several different Boussinesq-type equations are compared for the applications of these Boussinesq-type equations in coastal engineering with relatively large sea areas. Then for improving the properties of Boussinesq-type equations, a new set of fully nonlinear Boussinseq-type equations with modified representative velocity are derived, which can be used for better linear dispersion and nonlinearity. Based on the method of minimizing the overall error in different ranges of applications, sets of parameters are determined with optimized linear dispersion, linear shoaling and nonlinearity, respectively. Finally, a test example is given for validating the results of this study. Both results show that the equations with optimized parameters display better characteristics than the ones obtained by matching with padé approximation.

  18. Use of nonlinear programming to optimize performance response to energy density in broiler feed formulation.

    Science.gov (United States)

    Guevara, V R

    2004-02-01

    A nonlinear programming optimization model was developed to maximize margin over feed cost in broiler feed formulation and is described in this paper. The model identifies the optimal feed mix that maximizes profit margin. Optimum metabolizable energy level and performance were found by using Excel Solver nonlinear programming. Data from an energy density study with broilers were fitted to quadratic equations to express weight gain, feed consumption, and the objective function income over feed cost in terms of energy density. Nutrient:energy ratio constraints were transformed into equivalent linear constraints. National Research Council nutrient requirements and feeding program were used for examining changes in variables. The nonlinear programming feed formulation method was used to illustrate the effects of changes in different variables on the optimum energy density, performance, and profitability and was compared with conventional linear programming. To demonstrate the capabilities of the model, I determined the impact of variation in prices. Prices for broiler, corn, fish meal, and soybean meal were increased and decreased by 25%. Formulations were identical in all other respects. Energy density, margin, and diet cost changed compared with conventional linear programming formulation. This study suggests that nonlinear programming can be more useful than conventional linear programming to optimize performance response to energy density in broiler feed formulation because an energy level does not need to be set.

  19. Confidence sets for optimal factor levels of a response surface.

    Science.gov (United States)

    Wan, Fang; Liu, Wei; Bretz, Frank; Han, Yang

    2016-12-01

    Construction of confidence sets for the optimal factor levels is an important topic in response surfaces methodology. In Wan et al. (2015), an exact (1-α) confidence set has been provided for a maximum or minimum point (i.e., an optimal factor level) of a univariate polynomial function in a given interval. In this article, the method has been extended to construct an exact (1-α) confidence set for the optimal factor levels of response surfaces. The construction method is readily applied to many parametric and semiparametric regression models involving a quadratic function. A conservative confidence set has been provided as an intermediate step in the construction of the exact confidence set. Two examples are given to illustrate the application of the confidence sets. The comparison between confidence sets indicates that our exact confidence set is better than the only other confidence set available in the statistical literature that guarantees the (1-α) confidence level. © 2016, The International Biometric Society.

  20. Digital set point control of nonlinear stochastic systems

    Science.gov (United States)

    Moose, R. L.; Vanlandingham, H. F.; Zwicke, P. E.

    1978-01-01

    A technique for digital control of nonlinear stochastic plants is presented. The development achieves a practical digital algorithm with which the closed-loop system behaves in a classical Type I manner even with gross nonlinearities in the plant structure and low signal-to-noise power ratios. The design procedure is explained in detail and illustrated by an example whose simulated responses testify to the practicality of the approach.

  1. A LEVEL SET METHOD FOR STRUCTURAL TOPOLOGY OPTIMIZATION WITH MULTI-CONSTRAINTS AND MULTI-MATERIALS

    Institute of Scientific and Technical Information of China (English)

    MEI Yulin; WANG Xiaoming

    2004-01-01

    Combining the vector level set model, the shape sensitivity analysis theory with the gradient projection technique, a level set method for topology optimization with multi-constraints and multi-materials is presented in this paper. The method implicitly describes structural material interfaces by the vector level set and achieves the optimal shape and topology through the continuous evolution of the material interfaces in the structure. In order to increase computational efficiency for a fast convergence, an appropriate nonlinear speed mapping is established in the tangential space of the active constraints. Meanwhile, in order to overcome the numerical instability of general topology optimization problems, the regularization with the mean curvature flow is utilized to maintain the interface smoothness during the optimization process. The numerical examples demonstrate that the approach possesses a good flexibility in handling topological changes and gives an interface representation in a high fidelity, compared with other methods based on explicit boundary variations in the literature.

  2. Global Optimization of Nonlinear Blend-Scheduling Problems

    Directory of Open Access Journals (Sweden)

    Pedro A. Castillo Castillo

    2017-04-01

    Full Text Available The scheduling of gasoline-blending operations is an important problem in the oil refining industry. This problem not only exhibits the combinatorial nature that is intrinsic to scheduling problems, but also non-convex nonlinear behavior, due to the blending of various materials with different quality properties. In this work, a global optimization algorithm is proposed to solve a previously published continuous-time mixed-integer nonlinear scheduling model for gasoline blending. The model includes blend recipe optimization, the distribution problem, and several important operational features and constraints. The algorithm employs piecewise McCormick relaxation (PMCR and normalized multiparametric disaggregation technique (NMDT to compute estimates of the global optimum. These techniques partition the domain of one of the variables in a bilinear term and generate convex relaxations for each partition. By increasing the number of partitions and reducing the domain of the variables, the algorithm is able to refine the estimates of the global solution. The algorithm is compared to two commercial global solvers and two heuristic methods by solving four examples from the literature. Results show that the proposed global optimization algorithm performs on par with commercial solvers but is not as fast as heuristic approaches.

  3. On the estimation of the attainability set of nonlinear control systems

    Energy Technology Data Exchange (ETDEWEB)

    Ekimov, A.V.; Balykina, Yu.E.; Svirkin, M.V. [Saint Petersburg State University, 198504, Universitetskii pr., 35, Saint Petersburg (Russian Federation)

    2015-03-10

    Analysis of the attainability set and construction of its estimates greatly facilitates the solution of a variety of problems in mathematical control theory. In the paper, the problem of boundedness of the integral funnel of nonlinear controlled system is considered. Some estimates of the attainability sets for a nonlinear controlled system are presented. Theorems on the boundedness of considered integral funnels are proved.

  4. Nonlinear Identification Using Orthogonal Forward Regression With Nested Optimal Regularization.

    Science.gov (United States)

    Hong, Xia; Chen, Sheng; Gao, Junbin; Harris, Chris J

    2015-12-01

    An efficient data based-modeling algorithm for nonlinear system identification is introduced for radial basis function (RBF) neural networks with the aim of maximizing generalization capability based on the concept of leave-one-out (LOO) cross validation. Each of the RBF kernels has its own kernel width parameter and the basic idea is to optimize the multiple pairs of regularization parameters and kernel widths, each of which is associated with a kernel, one at a time within the orthogonal forward regression (OFR) procedure. Thus, each OFR step consists of one model term selection based on the LOO mean square error (LOOMSE), followed by the optimization of the associated kernel width and regularization parameter, also based on the LOOMSE. Since like our previous state-of-the-art local regularization assisted orthogonal least squares (LROLS) algorithm, the same LOOMSE is adopted for model selection, our proposed new OFR algorithm is also capable of producing a very sparse RBF model with excellent generalization performance. Unlike our previous LROLS algorithm which requires an additional iterative loop to optimize the regularization parameters as well as an additional procedure to optimize the kernel width, the proposed new OFR algorithm optimizes both the kernel widths and regularization parameters within the single OFR procedure, and consequently the required computational complexity is dramatically reduced. Nonlinear system identification examples are included to demonstrate the effectiveness of this new approach in comparison to the well-known approaches of support vector machine and least absolute shrinkage and selection operator as well as the LROLS algorithm.

  5. LEVEL SET METHOD FOR TOPOLOGICAL OPTIMIZATION APPLYING TO STRUCTURE,MECHANISM AND MATERIAL DESIGNS

    Institute of Scientific and Technical Information of China (English)

    Mei Yulin; Wang Xiaoming

    2004-01-01

    Based on a level set model,a topology optimization method has been suggested recently.It uses a level set to express the moving structural boundary,which can flexibly handle complex topological changes.By combining vector level set models with gradient projection technology,the level set method for topological optimization is extended to a topological optimization problem with multi-constraints,multi-materials and multi-load cases.Meanwhile,an appropriate nonlinear speed mapping is established in the tangential space of the active constraints for a fast convergence.Then the method is applied to structure designs,mechanism and material designs by a number of benchmark examples.Finally,in order to further improve computational efficiency and overcome the difficulty that the level set method cannot generate new material interfaces during the optimization process,the topological derivative analysis is incorporated into the level set method for topological optimization,and a topological derivative and level set algorithm for topological optimization is proposed.

  6. Non-linear theory of elasticity and optimal design

    CERN Document Server

    Ratner, LW

    2003-01-01

    In order to select an optimal structure among possible similar structures, one needs to compare the elastic behavior of the structures. A new criterion that describes elastic behavior is the rate of change of deformation. Using this criterion, the safe dimensions of a structure that are required by the stress distributed in a structure can be calculated. The new non-linear theory of elasticity allows one to determine the actual individual limit of elasticity/failure of a structure using a simple non-destructive method of measurement of deformation on the model of a structure while presently it

  7. Optimized interpolations and nonlinearity in numerical studies of woodwind instruments

    CERN Document Server

    Skouroupathis, A

    2005-01-01

    We study the impedance spectra of woodwind instruments with arbitrary axisymmetric geometry. We perform piecewise interpolations of the instruments' profile, using interpolating functions amenable to analytic solutions of the Webster equation. Our algorithm optimizes on the choice of such functions, while ensuring compatibility of wavefronts at the joining points. Employing a standard mathematical model of a single-reed mouthpiece as well as the time-domain reflection function, which we derive from our impedance results, we solve the Schumacher equation for the pressure evolution in time. We make analytic checks that, despite the nonlinearity in the reed model and in the evolution equation, solutions are unique and singularity-free.

  8. Transmitter and Precoding Order Optimization for Nonlinear Downlink Beamforming

    CERN Document Server

    Michel, Thomas

    2007-01-01

    The downlink of a multiple-input multiple output (MIMO) broadcast channel (BC) is considered, where each receiver is equipped with a single antenna and the transmitter performs nonlinear Dirty-Paper Coding (DPC). We present an efficient algorithm that finds the optimum transmit filters and power allocation as well as the optimum precoding order(s) possibly affording time-sharing between individual DPC orders. Subsequently necessary and sufficient conditions for the optimality of an arbitrary precoding order are derived. Based on these we propose a suboptimal algorithm showing excellent performance and having low complexity.

  9. Policy Iteration for H∞ Optimal Control of Polynomial Nonlinear Systems via Sum of Squares Programming.

    Science.gov (United States)

    Zhu, Yuanheng; Zhao, Dongbin; Yang, Xiong; Zhang, Qichao

    2017-01-10

    Sum of squares (SOS) polynomials have provided a computationally tractable way to deal with inequality constraints appearing in many control problems. It can also act as an approximator in the framework of adaptive dynamic programming. In this paper, an approximate solution to the H∞ optimal control of polynomial nonlinear systems is proposed. Under a given attenuation coefficient, the Hamilton-Jacobi-Isaacs equation is relaxed to an optimization problem with a set of inequalities. After applying the policy iteration technique and constraining inequalities to SOS, the optimization problem is divided into a sequence of feasible semidefinite programming problems. With the converged solution, the attenuation coefficient is further minimized to a lower value. After iterations, approximate solutions to the smallest L₂-gain and the associated H∞ optimal controller are obtained. Four examples are employed to verify the effectiveness of the proposed algorithm.

  10. Choosing Markovian Credit Migration Matrices by Nonlinear Optimization

    Directory of Open Access Journals (Sweden)

    Maximilian Hughes

    2016-08-01

    Full Text Available Transition matrices, containing credit risk information in the form of ratings based on discrete observations, are published annually by rating agencies. A substantial issue arises, as for higher rating classes practically no defaults are observed yielding default probabilities of zero. This does not always reflect reality. To circumvent this shortcoming, estimation techniques in continuous-time can be applied. However, raw default data may not be available at all or not in the desired granularity, leaving the practitioner to rely on given one-year transition matrices. Then, it becomes necessary to transform the one-year transition matrix to a generator matrix. This is known as the embedding problem and can be formulated as a nonlinear optimization problem, minimizing the distance between the exponential of a potential generator matrix and the annual transition matrix. So far, in credit risk-related literature, solving this problem directly has been avoided, but approximations have been preferred instead. In this paper, we show that this problem can be solved numerically with sufficient accuracy, thus rendering approximations unnecessary. Our direct approach via nonlinear optimization allows one to consider further credit risk-relevant constraints. We demonstrate that it is thus possible to choose a proper generator matrix with additional structural properties.

  11. Non-linear and signal energy optimal asymptotic filter design

    Directory of Open Access Journals (Sweden)

    Josef Hrusak

    2003-10-01

    Full Text Available The paper studies some connections between the main results of the well known Wiener-Kalman-Bucy stochastic approach to filtering problems based mainly on the linear stochastic estimation theory and emphasizing the optimality aspects of the achieved results and the classical deterministic frequency domain linear filters such as Chebyshev, Butterworth, Bessel, etc. A new non-stochastic but not necessarily deterministic (possibly non-linear alternative approach called asymptotic filtering based mainly on the concepts of signal power, signal energy and a system equivalence relation plays an important role in the presentation. Filtering error invariance and convergence aspects are emphasized in the approach. It is shown that introducing the signal power as the quantitative measure of energy dissipation makes it possible to achieve reasonable results from the optimality point of view as well. The property of structural energy dissipativeness is one of the most important and fundamental features of resulting filters. Therefore, it is natural to call them asymptotic filters. The notion of the asymptotic filter is carried in the paper as a proper tool in order to unify stochastic and non-stochastic, linear and nonlinear approaches to signal filtering.

  12. Noise and nonlinear estimation with optimal schemes in DTI.

    Science.gov (United States)

    Özcan, Alpay

    2010-11-01

    In general, the estimation of the diffusion properties for diffusion tensor experiments (DTI) is accomplished via least squares estimation (LSE). The technique requires applying the logarithm to the measurements, which causes bad propagation of errors. Moreover, the way noise is injected to the equations invalidates the least squares estimate as the best linear unbiased estimate. Nonlinear estimation (NE), despite its longer computation time, does not possess any of these problems. However, all of the conditions and optimization methods developed in the past are based on the coefficient matrix obtained in a LSE setup. In this article, NE for DTI is analyzed to demonstrate that any result obtained relatively easily in a linear algebra setup about the coefficient matrix can be applied to the more complicated NE framework. The data, obtained using non-optimal and optimized diffusion gradient schemes, are processed with NE. In comparison with LSE, the results show significant improvements, especially for the optimization criterion. However, NE does not resolve the existing conflicts and ambiguities displayed with LSE methods.

  13. An optimization approach for analysing nonlinear stability with transition to turbulence in fluids as an exemplar.

    Science.gov (United States)

    Kerswell, R R; Pringle, C C T; Willis, A P

    2014-08-01

    This article introduces and reviews recent work using a simple optimization technique for analysing the nonlinear stability of a state in a dynamical system. The technique can be used to identify the most efficient way to disturb a system such that it transits from one stable state to another. The key idea is introduced within the framework of a finite-dimensional set of ordinary differential equations (ODEs) and then illustrated for a very simple system of two ODEs which possesses bistability. Then the transition to turbulence problem in fluid mechanics is used to show how the technique can be formulated for a spatially-extended system described by a set of partial differential equations (the well-known Navier-Stokes equations). Within that context, the optimization technique bridges the gap between (linear) optimal perturbation theory and the (nonlinear) dynamical systems approach to fluid flows. The fact that the technique has now been recently shown to work in this very high dimensional setting augurs well for its utility in other physical systems.

  14. Multiplex protein pattern unmixing using a non-linear variable-weighted support vector machine as optimized by a particle swarm optimization algorithm.

    Science.gov (United States)

    Yang, Qin; Zou, Hong-Yan; Zhang, Yan; Tang, Li-Juan; Shen, Guo-Li; Jiang, Jian-Hui; Yu, Ru-Qin

    2016-01-15

    Most of the proteins locate more than one organelle in a cell. Unmixing the localization patterns of proteins is critical for understanding the protein functions and other vital cellular processes. Herein, non-linear machine learning technique is proposed for the first time upon protein pattern unmixing. Variable-weighted support vector machine (VW-SVM) is a demonstrated robust modeling technique with flexible and rational variable selection. As optimized by a global stochastic optimization technique, particle swarm optimization (PSO) algorithm, it makes VW-SVM to be an adaptive parameter-free method for automated unmixing of protein subcellular patterns. Results obtained by pattern unmixing of a set of fluorescence microscope images of cells indicate VW-SVM as optimized by PSO is able to extract useful pattern features by optimally rescaling each variable for non-linear SVM modeling, consequently leading to improved performances in multiplex protein pattern unmixing compared with conventional SVM and other exiting pattern unmixing methods.

  15. Nonlinear Burn Control and Operating Point Optimization in ITER

    Science.gov (United States)

    Boyer, Mark; Schuster, Eugenio

    2013-10-01

    Control of the fusion power through regulation of the plasma density and temperature will be essential for achieving and maintaining desired operating points in fusion reactors and burning plasma experiments like ITER. In this work, a volume averaged model for the evolution of the density of energy, deuterium and tritium fuel ions, alpha-particles, and impurity ions is used to synthesize a multi-input multi-output nonlinear feedback controller for stabilizing and modulating the burn condition. Adaptive control techniques are used to account for uncertainty in model parameters, including particle confinement times and recycling rates. The control approach makes use of the different possible methods for altering the fusion power, including adjusting the temperature through auxiliary heating, modulating the density and isotopic mix through fueling, and altering the impurity density through impurity injection. Furthermore, a model-based optimization scheme is proposed to drive the system as close as possible to desired fusion power and temperature references. Constraints are considered in the optimization scheme to ensure that, for example, density and beta limits are avoided, and that optimal operation is achieved even when actuators reach saturation. Supported by the NSF CAREER award program (ECCS-0645086).

  16. Design optimization of a twist compliant mechanism with nonlinear stiffness

    Science.gov (United States)

    Tummala, Y.; Frecker, M. I.; Wissa, A. A.; Hubbard, J. E., Jr.

    2014-10-01

    A contact-aided compliant mechanism called a twist compliant mechanism (TCM) is presented in this paper. This mechanism has nonlinear stiffness when it is twisted in both directions along its axis. The inner core of the mechanism is primarily responsible for its flexibility in one twisting direction. The contact surfaces of the cross-members and compliant sectors are primarily responsible for its high stiffness in the opposite direction. A desired twist angle in a given direction can be achieved by tailoring the stiffness of a TCM. The stiffness of a compliant twist mechanism can be tailored by varying thickness of its cross-members, thickness of the core and thickness of its sectors. A multi-objective optimization problem with three objective functions is proposed in this paper, and used to design an optimal TCM with desired twist angle. The objective functions are to minimize the mass and maximum von-Mises stress observed, while minimizing or maximizing the twist angles under specific loading conditions. The multi-objective optimization problem proposed in this paper is solved for an ornithopter flight research platform as a case study, with the goal of using the TCM to achieve passive twisting of the wing during upstroke, while keeping the wing fully extended and rigid during the downstroke. Prototype TCMs have been fabricated using 3D printing and tested. Testing results are also presented in this paper.

  17. Robust Homography Estimation Based on Nonlinear Least Squares Optimization

    Directory of Open Access Journals (Sweden)

    Wei Mou

    2014-01-01

    Full Text Available The homography between image pairs is normally estimated by minimizing a suitable cost function given 2D keypoint correspondences. The correspondences are typically established using descriptor distance of keypoints. However, the correspondences are often incorrect due to ambiguous descriptors which can introduce errors into following homography computing step. There have been numerous attempts to filter out these erroneous correspondences, but it is unlikely to always achieve perfect matching. To deal with this problem, we propose a nonlinear least squares optimization approach to compute homography such that false matches have no or little effect on computed homography. Unlike normal homography computation algorithms, our method formulates not only the keypoints’ geometric relationship but also their descriptor similarity into cost function. Moreover, the cost function is parametrized in such a way that incorrect correspondences can be simultaneously identified while the homography is computed. Experiments show that the proposed approach can perform well even with the presence of a large number of outliers.

  18. Indoor Wireless Localization-hybrid and Unconstrained Nonlinear Optimization Approach

    Directory of Open Access Journals (Sweden)

    R. Jayabharathy

    2013-07-01

    Full Text Available In this study, a hybrid TOA/RSSI wireless localization is proposed for accurate positioning in indoor UWB systems. The major problem in indoor localization is the effect of Non-Line of Sight (NLOS propagation. To mitigate the NLOS effects, an unconstrained nonlinear optimization approach is utilized to process Time-of-Arrival (TOA and Received Signal Strength (RSS in the location system.TOA range measurements and path loss model are used to discriminate LOS and NLOS conditions. The weighting factors assigned by hypothesis testing, is used for solving the objective function in the proposed approach. This approach is used for describing the credibility of the TOA range measurement. Performance of the proposed technique is done based on MATLAB simulation. The result shows that the proposed technique performs well and achieves improved positioning under severe NLOS conditions.

  19. Robust C subroutines for non-linear optimization

    DEFF Research Database (Denmark)

    Brock, Pernille; Madsen, Kaj; Nielsen, Hans Bruun

    2004-01-01

    This report presents a package of robust and easy-to-use C subroutines for solving unconstrained and constrained non-linear optimization problems. The intention is that the routines should use the currently best algorithms available. All routines have standardized calls, and the user does not have...... by changing 1 to 0. The present report is a new and updated version of a previous report NI-91-03 with the same title, [16]. Both the previous and the present report describe a collection of subroutines, which have been translated from Fortran to C. The reason for writing the present report is that some...... of the C subroutines have been replaced by more effective and robust versions translated from the original Fortran subroutines to C by the Bandler Group, see [1]. Also the test examples have been modi ed to some extent. For a description of the original Fortran subroutines see the report [17]. The software...

  20. Optimal operating points of oscillators using nonlinear resonators.

    Science.gov (United States)

    Kenig, Eyal; Cross, M C; Villanueva, L G; Karabalin, R B; Matheny, M H; Lifshitz, Ron; Roukes, M L

    2012-11-01

    We demonstrate an analytical method for calculating the phase sensitivity of a class of oscillators whose phase does not affect the time evolution of the other dynamic variables. We show that such oscillators possess the possibility for complete phase noise elimination. We apply the method to a feedback oscillator which employs a high Q weakly nonlinear resonator and provide explicit parameter values for which the feedback phase noise is completely eliminated and others for which there is no amplitude-phase noise conversion. We then establish an operational mode of the oscillator which optimizes its performance by diminishing the feedback noise in both quadratures, thermal noise, and quality factor fluctuations. We also study the spectrum of the oscillator and provide specific results for the case of 1/f noise sources.

  1. Improved simple optimization (SOPT algorithm for unconstrained non-linear optimization problems

    Directory of Open Access Journals (Sweden)

    J. Thomas

    2016-09-01

    Full Text Available In the recent years, population based meta-heuristic are developed to solve non-linear optimization problems. These problems are difficult to solve using traditional methods. Simple optimization (SOPT algorithm is one of the simple and efficient meta-heuristic techniques to solve the non-linear optimization problems. In this paper, SOPT is compared with some of the well-known meta-heuristic techniques viz. Artificial Bee Colony algorithm (ABC, Particle Swarm Optimization (PSO, Genetic Algorithm (GA and Differential Evolutions (DE. For comparison, SOPT algorithm is coded in MATLAB and 25 standard test functions for unconstrained optimization having different characteristics are run for 30 times each. The results of experiments are compared with previously reported results of other algorithms. Promising and comparable results are obtained for most of the test problems. To improve the performance of SOPT, an improvement in the algorithm is proposed which helps it to come out of local optima when algorithm gets trapped in it. In almost all the test problems, improved SOPT is able to get the actual solution at least once in 30 runs.

  2. Optimal Set-Point Synthesis in HVAC Systems

    DEFF Research Database (Denmark)

    Komareji, Mohammad; Stoustrup, Jakob; Rasmussen, Henrik

    2007-01-01

    components, encompassing fans, primary/secondary pump, tertiary pump, and air-to-air heat exchanger wheel; and a fraction of thermal power used by the HVAC system. The goals that have to be achieved by the HVAC system appear as constraints in the optimization problem. To solve the optimization problem......This paper presents optimal set-point synthesis for a heating, ventilating, and air-conditioning (HVAC) system. This HVAC system is made of two heat exchangers: an air-to-air heat exchanger and a water-to-air heat exchanger. The objective function is composed of the electrical power for different......, a steady state model of the HVAC system is derived while different supplying hydronic circuits are studied for the water-to-air heat exchanger. Finally, the optimal set-points and the optimal supplying hydronic circuit are resulted....

  3. Nonlinear optimal control of bypass transition in a boundary layer flow

    Science.gov (United States)

    Xiao, Dandan; Papadakis, George

    2017-05-01

    The central aim of the paper is to apply and assess a nonlinear optimal control strategy to suppress bypass transition, due to bimodal interactions [T. A. Zaki and P. A. Durbin, "Mode interaction and the bypass route to transition," J. Fluid Mech. 531, 85 (2005)] in a zero-pressure-gradient boundary layer. To this end, a Lagrange variational formulation is employed that results in a set of adjoint equations. The optimal wall actuation (blowing and suction from a control slot) is found by solving iteratively the nonlinear Navier-Stokes and the adjoint equations in a forward/backward loop using direct numerical simulation. The optimization is performed in a finite time horizon. Large values of optimization horizon result in the instability of the adjoint equations. The control slot is located exactly in the region of transition. The results show that the control is able to significantly reduce the objective function, which is defined as the spatial and temporal integral of the quadratic deviation from the Blasius profile plus a term that quantifies the control cost. The physical mechanism with which the actuation interacts with the flow field is investigated and analysed in relation to the objective function employed. Examination of the joint probability density function shows that the control velocity is correlated with the streamwise velocity in the near wall region but this correlation is reduced as time elapses. The spanwise averaged velocity is distorted by the control action, resulting in a significant reduction of the skin friction coefficient. Results are presented with and without zero-net mass flow constraint of the actuation velocity. The skin friction coefficient drops below the laminar value if there is no mass constraint; it remains however larger than laminar when this constraint is imposed. Results are also compared with uniform blowing using the same time-average velocity obtained from the nonlinear optimal algorithm.

  4. Solution of nonlinear finite difference ocean models by optimization methods with sensitivity and observational strategy analysis

    Science.gov (United States)

    Schroeter, Jens; Wunsch, Carl

    1986-01-01

    The paper studies with finite difference nonlinear circulation models the uncertainties in interesting flow properties, such as western boundary current transport, potential and kinetic energy, owing to the uncertainty in the driving surface boundary condition. The procedure is based upon nonlinear optimization methods. The same calculations permit quantitative study of the importance of new information as a function of type, region of measurement and accuracy, providing a method to study various observing strategies. Uncertainty in a model parameter, the bottom friction coefficient, is studied in conjunction with uncertain measurements. The model is free to adjust the bottom friction coefficient such that an objective function is minimized while fitting a set of data to within prescribed bounds. The relative importance of the accuracy of the knowledge about the friction coefficient with respect to various kinds of observations is then quantified, and the possible range of the friction coefficients is calculated.

  5. Optimization of nonlinear structural resonance using the incremental harmonic balance method

    DEFF Research Database (Denmark)

    Dou, Suguang; Jensen, Jakob Søndergaard

    2015-01-01

    We present an optimization procedure for tailoring the nonlinear structural resonant response with time-harmonic loads. A nonlinear finite element method is used for modeling beam structures with a geometric nonlinearity and the incremental harmonic balance method is applied for accurate nonlinea...

  6. Weighted Optimization-Based Distributed Kalman Filter for Nonlinear Target Tracking in Collaborative Sensor Networks.

    Science.gov (United States)

    Chen, Jie; Li, Jiahong; Yang, Shuanghua; Deng, Fang

    2016-07-21

    The identification of the nonlinearity and coupling is crucial in nonlinear target tracking problem in collaborative sensor networks. According to the adaptive Kalman filtering (KF) method, the nonlinearity and coupling can be regarded as the model noise covariance, and estimated by minimizing the innovation or residual errors of the states. However, the method requires large time window of data to achieve reliable covariance measurement, making it impractical for nonlinear systems which are rapidly changing. To deal with the problem, a weighted optimization-based distributed KF algorithm (WODKF) is proposed in this paper. The algorithm enlarges the data size of each sensor by the received measurements and state estimates from its connected sensors instead of the time window. A new cost function is set as the weighted sum of the bias and oscillation of the state to estimate the "best" estimate of the model noise covariance. The bias and oscillation of the state of each sensor are estimated by polynomial fitting a time window of state estimates and measurements of the sensor and its neighbors weighted by the measurement noise covariance. The best estimate of the model noise covariance is computed by minimizing the weighted cost function using the exhaustive method. The sensor selection method is in addition to the algorithm to decrease the computation load of the filter and increase the scalability of the sensor network. The existence, suboptimality and stability analysis of the algorithm are given. The local probability data association method is used in the proposed algorithm for the multitarget tracking case. The algorithm is demonstrated in simulations on tracking examples for a random signal, one nonlinear target, and four nonlinear targets. Results show the feasibility and superiority of WODKF against other filtering algorithms for a large class of systems.

  7. Geometry Optimization of a Segmented Thermoelectric Generator Based on Multi-parameter and Nonlinear Optimization Method

    Science.gov (United States)

    Cai, Lanlan; Li, Peng; Luo, Qi; Zhai, Pengcheng; Zhang, Qingjie

    2017-03-01

    As no single thermoelectric material has presented a high figure-of-merit (ZT) over a very wide temperature range, segmented thermoelectric generators (STEGs), where the p- and n-legs are formed of different thermoelectric material segments joined in series, have been developed to improve the performance of thermoelectric generators. A crucial but difficult problem in a STEG design is to determine the optimal values of the geometrical parameters, like the relative lengths of each segment and the cross-sectional area ratio of the n- and p-legs. Herein, a multi-parameter and nonlinear optimization method, based on the Improved Powell Algorithm in conjunction with the discrete numerical model, was implemented to solve the STEG's geometrical optimization problem. The multi-parameter optimal results were validated by comparison with the optimal outcomes obtained from the single-parameter optimization method. Finally, the effect of the hot- and cold-junction temperatures on the geometry optimization was investigated. Results show that the optimal geometry parameters for maximizing the specific output power of a STEG are different from those for maximizing the conversion efficiency. Data also suggest that the optimal geometry parameters and the interfacial temperatures of the adjacent segments optimized for maximum specific output power or conversion efficiency vary with changing hot- and cold-junction temperatures. Through the geometry optimization, the CoSb3/Bi2Te3-based STEG can obtain a maximum specific output power up to 1725.3 W/kg and a maximum efficiency of 13.4% when operating at a hot-junction temperature of 823 K and a cold-junction temperature of 298 K.

  8. Structural Identification of Nonlinear Static System on Basis of Analysis Sector Sets

    Directory of Open Access Journals (Sweden)

    Nikolay Karabutov

    2013-12-01

    Full Text Available Methods of structural identification of static systems with a vector input and several nonlinearities in the conditions of uncertainty are considered. We consider inputs irregular. The concept of structural space is introduced. In this space special structures (virtual portraits are analyzed. The Holder condition is applied to construction of sector set, to which belongs a virtual portrait of system of identification. Criteria of decision-making on a class of nonlinear functions on the basis of the analysis of proximity of sector sets are described. Procedures of an estimation of structural parameters of two classes of nonlinearities are stated: power and a hysteresis.

  9. Optimal Energy Measurement in Nonlinear Systems: An Application of Differential Geometry

    Science.gov (United States)

    Fixsen, Dale J.; Moseley, S. H.; Gerrits, T.; Lita, A.; Nam, S. W.

    2014-01-01

    Design of TES microcalorimeters requires a tradeoff between resolution and dynamic range. Often, experimenters will require linearity for the highest energy signals, which requires additional heat capacity be added to the detector. This results in a reduction of low energy resolution in the detector. We derive and demonstrate an algorithm that allows operation far into the nonlinear regime with little loss in spectral resolution. We use a least squares optimal filter that varies with photon energy to accommodate the nonlinearity of the detector and the non-stationarity of the noise. The fitting process we use can be seen as an application of differential geometry. This recognition provides a set of well-developed tools to extend our work to more complex situations. The proper calibration of a nonlinear microcalorimeter requires a source with densely spaced narrow lines. A pulsed laser multi-photon source is used here, and is seen to be a powerful tool for allowing us to develop practical systems with significant detector nonlinearity. The combination of our analysis techniques and the multi-photon laser source create a powerful tool for increasing the performance of future TES microcalorimeters.

  10. Modified Lagrangian and Least Root Approaches for General Nonlinear Optimization Problems

    Institute of Scientific and Technical Information of China (English)

    W. Oettli; X.Q. Yang

    2002-01-01

    In this paper we study nonlinear Lagrangian methods for optimization problems with side constraints.Nonlinear Lagrangian dual problems are introduced and their relations with the original problem are established.Moreover, a least root approach is investigated for these optimization problems.

  11. Identifying the preferred subset of enzymatic profiles in nonlinear kinetic metabolic models via multiobjective global optimization and Pareto filters.

    Directory of Open Access Journals (Sweden)

    Carlos Pozo

    Full Text Available Optimization models in metabolic engineering and systems biology focus typically on optimizing a unique criterion, usually the synthesis rate of a metabolite of interest or the rate of growth. Connectivity and non-linear regulatory effects, however, make it necessary to consider multiple objectives in order to identify useful strategies that balance out different metabolic issues. This is a fundamental aspect, as optimization of maximum yield in a given condition may involve unrealistic values in other key processes. Due to the difficulties associated with detailed non-linear models, analysis using stoichiometric descriptions and linear optimization methods have become rather popular in systems biology. However, despite being useful, these approaches fail in capturing the intrinsic nonlinear nature of the underlying metabolic systems and the regulatory signals involved. Targeting more complex biological systems requires the application of global optimization methods to non-linear representations. In this work we address the multi-objective global optimization of metabolic networks that are described by a special class of models based on the power-law formalism: the generalized mass action (GMA representation. Our goal is to develop global optimization methods capable of efficiently dealing with several biological criteria simultaneously. In order to overcome the numerical difficulties of dealing with multiple criteria in the optimization, we propose a heuristic approach based on the epsilon constraint method that reduces the computational burden of generating a set of Pareto optimal alternatives, each achieving a unique combination of objectives values. To facilitate the post-optimal analysis of these solutions and narrow down their number prior to being tested in the laboratory, we explore the use of Pareto filters that identify the preferred subset of enzymatic profiles. We demonstrate the usefulness of our approach by means of a case study

  12. Identifying the preferred subset of enzymatic profiles in nonlinear kinetic metabolic models via multiobjective global optimization and Pareto filters.

    Science.gov (United States)

    Pozo, Carlos; Guillén-Gosálbez, Gonzalo; Sorribas, Albert; Jiménez, Laureano

    2012-01-01

    Optimization models in metabolic engineering and systems biology focus typically on optimizing a unique criterion, usually the synthesis rate of a metabolite of interest or the rate of growth. Connectivity and non-linear regulatory effects, however, make it necessary to consider multiple objectives in order to identify useful strategies that balance out different metabolic issues. This is a fundamental aspect, as optimization of maximum yield in a given condition may involve unrealistic values in other key processes. Due to the difficulties associated with detailed non-linear models, analysis using stoichiometric descriptions and linear optimization methods have become rather popular in systems biology. However, despite being useful, these approaches fail in capturing the intrinsic nonlinear nature of the underlying metabolic systems and the regulatory signals involved. Targeting more complex biological systems requires the application of global optimization methods to non-linear representations. In this work we address the multi-objective global optimization of metabolic networks that are described by a special class of models based on the power-law formalism: the generalized mass action (GMA) representation. Our goal is to develop global optimization methods capable of efficiently dealing with several biological criteria simultaneously. In order to overcome the numerical difficulties of dealing with multiple criteria in the optimization, we propose a heuristic approach based on the epsilon constraint method that reduces the computational burden of generating a set of Pareto optimal alternatives, each achieving a unique combination of objectives values. To facilitate the post-optimal analysis of these solutions and narrow down their number prior to being tested in the laboratory, we explore the use of Pareto filters that identify the preferred subset of enzymatic profiles. We demonstrate the usefulness of our approach by means of a case study that optimizes the

  13. Optimization Formulations for the Maximum Nonlinear Buckling Load of Composite Structures

    DEFF Research Database (Denmark)

    Lindgaard, Esben; Lund, Erik

    2011-01-01

    , benchmarked on a number of numerical examples of laminated composite structures for the maximization of the buckling load considering fiber angle design variables. The optimization formulations are based on either linear or geometrically nonlinear analysis and formulated as mathematical programming problems...... solved using gradient based techniques. The developed local criterion is formulated such it captures nonlinear effects upon loading and proves useful for both analysis purposes and as a criterion for use in nonlinear buckling optimization. © 2010 Springer-Verlag....

  14. Programmable Nonlinear ADC Using Optimal-Sized ROM

    OpenAIRE

    K Dinesh; Anvekar, *; Sonde, BE

    1991-01-01

    A new programmable successive approximation ADC useful for realizing nonlinear transfer characteristics often required in instrumentation and communications is presented. This nonlinear ADC (NADC) requires a much smaller sized ROM than an NADC reported earlier

  15. Set optimization and applications the state of the art : from set relations to set-valued risk measures

    CERN Document Server

    Heyde, Frank; Löhne, Andreas; Rudloff, Birgit; Schrage, Carola

    2015-01-01

    This volume presents five surveys with extensive bibliographies and six original contributions on set optimization and its applications in mathematical finance and game theory. The topics range from more conventional approaches that look for minimal/maximal elements with respect to vector orders or set relations, to the new complete-lattice approach that comprises a coherent solution concept for set optimization problems, along with existence results, duality theorems, optimality conditions, variational inequalities and theoretical foundations for algorithms. Modern approaches to scalarization methods can be found as well as a fundamental contribution to conditional analysis. The theory is tailor-made for financial applications, in particular risk evaluation and [super-]hedging for market models with transaction costs, but it also provides a refreshing new perspective on vector optimization. There is no comparable volume on the market, making the book an invaluable resource for researchers working in vector o...

  16. Optimal Route Selection Method Based on Vague Sets

    Institute of Scientific and Technical Information of China (English)

    GUO Rui; DU Li min; WANG Chun

    2015-01-01

    Optimal route selection is an important function of vehicle trac flow guidance system. Its core is to determine the index weight for measuring the route merits and to determine the evaluation method for selecting route. In this paper, subjective weighting method which relies on driver preference is used to determine the weight and the paper proposes the multi-criteria weighted decision method based on vague sets for selecting the optimal route. Examples show that, the usage of vague sets to describe route index value can provide more decision-making information for route selection.

  17. Nonlinear Modeling, Dynamic Analysis, and Optimal Design and Operation of Electromechanical Valve Systems

    Science.gov (United States)

    Naseradinmousavi, Peiman

    In this dissertation, the actuator-valve systems as a critical part of the automation system are analyzed. Using physics-based high fidelity modeling, this research provides a set of tools to help understand, predict, optimize, and control the real performance of these complex systems. The work carried out is expected to add to the suite of analytical and numerical tools that are essential for the development of highly automated ship systems. We present an accurate dynamic model, perform nonlinear analysis, and develop optimal design and operation for electromechanical valve systems. The mathematical model derived includes electromagnetics, fluid mechanics, and mechanical dynamics. Nondimensionalization has been carried out in order to reduce the large number of parameters to a few critical independent sets to help carry out a parametric analysis. The system stability analysis is then carried out with the aid of the tools from nonlinear dynamic analysis. This reveals that the system is unstable in a certain region of the parameter space. The system is also shown to exhibit crisis and transient chaotic responses. Smart valves are often operated under local power supply (for various mission-critical reasons) and need to consume as little energy as possible in order to ensure continued operability. The Simulated Annealing (SA) algorithm is utilized to optimize the actuation subsystem yielding the most efficient configuration from the point of view of energy consumption for two sets of design variables. The optimization is particularly important when the smart valves are used in a distributed network. Another aspect of optimality is more subtle and concerns optimal operation given a designed system. Optimal operation comes after the optimal design process to explore if there is any particular method of the valve operation that would yield the minimum possible energy used. The results of our model developed are also validated with the aid of an experimental setup

  18. Solving Nonlinear Optimization Problems of Real Functions in Complex Variables by Complex-Valued Iterative Methods.

    Science.gov (United States)

    Zhang, Songchuan; Xia, Youshen

    2016-12-28

    Much research has been devoted to complex-variable optimization problems due to their engineering applications. However, the complex-valued optimization method for solving complex-variable optimization problems is still an active research area. This paper proposes two efficient complex-valued optimization methods for solving constrained nonlinear optimization problems of real functions in complex variables, respectively. One solves the complex-valued nonlinear programming problem with linear equality constraints. Another solves the complex-valued nonlinear programming problem with both linear equality constraints and an ℓ₁-norm constraint. Theoretically, we prove the global convergence of the proposed two complex-valued optimization algorithms under mild conditions. The proposed two algorithms can solve the complex-valued optimization problem completely in the complex domain and significantly extend existing complex-valued optimization algorithms. Numerical results further show that the proposed two algorithms have a faster speed than several conventional real-valued optimization algorithms.

  19. Gradient-based optimization in nonlinear structural dynamics

    DEFF Research Database (Denmark)

    Dou, Suguang

    The intrinsic nonlinearity of mechanical structures can give rise to rich nonlinear dynamics. Recently, nonlinear dynamics of micro-mechanical structures have contributed to developing new Micro-Electro-Mechanical Systems (MEMS), for example, atomic force microscope, passive frequency divider, fr...

  20. Global Optimization for Transport Network Expansion and Signal Setting

    Directory of Open Access Journals (Sweden)

    Haoxiang Liu

    2015-01-01

    Full Text Available This paper proposes a model to address an urban transport planning problem involving combined network design and signal setting in a saturated network. Conventional transport planning models usually deal with the network design problem and signal setting problem separately. However, the fact that network capacity design and capacity allocation determined by network signal setting combine to govern the transport network performance requires the optimal transport planning to consider the two problems simultaneously. In this study, a combined network capacity expansion and signal setting model with consideration of vehicle queuing on approaching legs of intersection is developed to consider their mutual interactions so that best transport network performance can be guaranteed. We formulate the model as a bilevel program and design an approximated global optimization solution method based on mixed-integer linearization approach to solve the problem, which is inherently nnonlinear and nonconvex. Numerical experiments are conducted to demonstrate the model application and the efficiency of solution algorithm.

  1. Landmark Optimization Using Local Curvature for Point-Based Nonlinear Rodent Brain Image Registration

    Directory of Open Access Journals (Sweden)

    Yutong Liu

    2012-01-01

    Full Text Available Purpose. To develop a technique to automate landmark selection for point-based interpolating transformations for nonlinear medical image registration. Materials and Methods. Interpolating transformations were calculated from homologous point landmarks on the source (image to be transformed and target (reference image. Point landmarks are placed at regular intervals on contours of anatomical features, and their positions are optimized along the contour surface by a function composed of curvature similarity and displacements of the homologous landmarks. The method was evaluated in two cases (=5 each. In one, MRI was registered to histological sections; in the second, geometric distortions in EPI MRI were corrected. Normalized mutual information and target registration error were calculated to compare the registration accuracy of the automatically and manually generated landmarks. Results. Statistical analyses demonstrated significant improvement (<0.05 in registration accuracy by landmark optimization in most data sets and trends towards improvement (<0.1 in others as compared to manual landmark selection.

  2. Ensemble prediction experiments using conditional nonlinear optimal perturbation

    Institute of Scientific and Technical Information of China (English)

    2009-01-01

    Two methods for initialization of ensemble forecasts are compared, namely, singular vector (SV) and conditional nonlinear optimal perturbation (CNOP). The comparison is done for forecast lengths of up to 10 days with a three-level quasi-geostrophic (QG) atmospheric model in a perfect model scenario. Ten cases are randomly selected from 1982/1983 winter to 1993/1994 winter (from December to the following February). Anomaly correlation coefficient (ACC) is adopted as a tool to measure the quality of the predicted ensembles on the Northern Hemisphere 500 hPa geopotential height. The results show that the forecast quality of ensemble samples in which the first SV is replaced by CNOP is higher than that of samples composed of only SVs in the medium range, based on the occurrence of weather re-gime transitions in Northern Hemisphere after about four days. Besides, the reliability of ensemble forecasts is evaluated by the Rank Histograms. The above conclusions confirm and extend those reached earlier by the authors, which stated that the introduction of CNOP improves the forecast skill under the condition that the analysis error belongs to a kind of fast-growing error by using a barotropic QG model.

  3. Ensemble prediction experiments using conditional nonlinear optimal perturbation

    Institute of Scientific and Technical Information of China (English)

    JIANG ZhiNa; MU Mu; WANG DongHai

    2009-01-01

    Two methods for initialization of ensemble forecasts are compared, namely, singular vector (SV) and conditional nonlinear optimal perturbation (CNOP). The comparison is done for forecast lengths of up to 10 days with a three-level quasi-geostrophic (QG) atmospheric model in a perfect model scenario. Ten cases are randomly selected from 1982/1983 winter to 1993/1994 winter (from 12 to the following February). Anomaly correlation coefficient (ACC) is adopted as a tool to measure the quality of the predicted ensembles on the Northern Hemisphere 500 hPa geopotential height. The results show that the forecast quality of ensemble samples in which the first SV is replaced by CNOP is higher than that of samples composed of only SVs in the medium range, based on the occurrence of weather re-gime transitions in Northern Hemisphere after about four days. Besides, the reliability of ensemble forecasts is evaluated by the Rank Histograms. The above conclusions confirm .and extend those reached earlier by the authors, which stated that the introduction of CNOP improves the forecast skill under the condition that the analysis error belongs to a kind of fast-growing error by using a barotropic QG model.

  4. Particle Swarm Optimization-Proximal Point Algorithm for Nonlinear Complementarity Problems

    OpenAIRE

    Chai Jun-Feng; Wang Shu-Yan

    2013-01-01

    A new algorithm is presented for solving the nonlinear complementarity problem by combining the particle swarm and proximal point algorithm, which is called the particle swarm optimization-proximal point algorithm. The algorithm mainly transforms nonlinear complementarity problems into unconstrained optimization problems of smooth functions using the maximum entropy function and then optimizes the problem using the proximal point algorithm as the outer algorithm and particle swarm algorithm a...

  5. A new method of determining the optimal embedding dimension based on nonlinear prediction

    Institute of Scientific and Technical Information of China (English)

    Meng Qing-Fang; Peng Yu-Hua; Xue Pei-Jun

    2007-01-01

    A new method is proposed to determine the optimal embedding dimension from a scalar time series in this paper. This method determines the optimal embedding dimension by optimizing the nonlinear autoregressive prediction model parameterized by the embedding dimension and the nonlinear degree. Simulation results show the effectiveness of this method. And this method is applicable to a short time series, stable to noise, computationally efficient, and without any purposely introduced parameters.

  6. Pareto optimal calibration of highly nonlinear reactive transport groundwater models using particle swarm optimization

    Science.gov (United States)

    Siade, A. J.; Prommer, H.; Welter, D.

    2014-12-01

    Groundwater management and remediation requires the implementation of numerical models in order to evaluate the potential anthropogenic impacts on aquifer systems. In many situations, the numerical model must, not only be able to simulate groundwater flow and transport, but also geochemical and biological processes. Each process being simulated carries with it a set of parameters that must be identified, along with differing potential sources of model-structure error. Various data types are often collected in the field and then used to calibrate the numerical model; however, these data types can represent very different processes and can subsequently be sensitive to the model parameters in extremely complex ways. Therefore, developing an appropriate weighting strategy to address the contributions of each data type to the overall least-squares objective function is not straightforward. This is further compounded by the presence of potential sources of model-structure errors that manifest themselves differently for each observation data type. Finally, reactive transport models are highly nonlinear, which can lead to convergence failure for algorithms operating on the assumption of local linearity. In this study, we propose a variation of the popular, particle swarm optimization algorithm to address trade-offs associated with the calibration of one data type over another. This method removes the need to specify weights between observation groups and instead, produces a multi-dimensional Pareto front that illustrates the trade-offs between data types. We use the PEST++ run manager, along with the standard PEST input/output structure, to implement parallel programming across multiple desktop computers using TCP/IP communications. This allows for very large swarms of particles without the need of a supercomputing facility. The method was applied to a case study in which modeling was used to gain insight into the mobilization of arsenic at a deepwell injection site

  7. System design optimization for a Mars-roving vehicle and perturbed-optimal solutions in nonlinear programming

    Science.gov (United States)

    Pavarini, C.

    1974-01-01

    Work in two somewhat distinct areas is presented. First, the optimal system design problem for a Mars-roving vehicle is attacked by creating static system models and a system evaluation function and optimizing via nonlinear programming techniques. The second area concerns the problem of perturbed-optimal solutions. Given an initial perturbation in an element of the solution to a nonlinear programming problem, a linear method is determined to approximate the optimal readjustments of the other elements of the solution. Then, the sensitivity of the Mars rover designs is described by application of this method.

  8. Optimization of hardening/softening behavior of plane frame structures using nonlinear normal modes

    DEFF Research Database (Denmark)

    Dou, Suguang; Jensen, Jakob Søndergaard

    2016-01-01

    /softening behavior of nonlinear mechanical systems. The iterative optimization procedure consists of calculation of nonlinear normal modes, solving an adjoint equation system for sensitivity analysis and an update of design variables using a mathematical programming tool. We demonstrate the method with examples......Devices that exploit essential nonlinear behavior such as hardening/softening and inter-modal coupling effects are increasingly used in engineering and fundamental studies. Based on nonlinear normal modes, we present a gradient-based structural optimization method for tailoring the hardening...

  9. Micro CT settings for caries detection: how to optimize.

    Directory of Open Access Journals (Sweden)

    Chaiben CL

    2015-11-01

    Full Text Available Some important items that can influence micro CT image were reviewed in this study. Different settings were optimized for the assessment of early caries lesions. There are several researches on bone using micro CT but not too much on dental hard tissues when assessing mineral loss. Different kinds of micro CT devices and technologies are taking place today, each requiring unique settings, and this consists one of the greatest obstacles for the use of micro CT on dental hard tissues. Achieving the settings for an ideal dental image is therefore a challenge. The purpose of this study was to evaluate different micro CT settings to optimize the assessment of early caries lesions aiming the integrity of the dental specimen thus, making possible to reuse it for further studies. Three teeth with early caries lesions were submitted to different micro CT settings and different reconstruction settings, aiming a better image. The final image was compared visually through different densities and attenuation coefficients. The best setting for teeth tissues was achieved regarding contrast, definition, noise reduction and the larger difference between sound enamel and early lesions attenuation coefficient.

  10. Level-Set Topology Optimization with Aeroelastic Constraints

    Science.gov (United States)

    Dunning, Peter D.; Stanford, Bret K.; Kim, H. Alicia

    2015-01-01

    Level-set topology optimization is used to design a wing considering skin buckling under static aeroelastic trim loading, as well as dynamic aeroelastic stability (flutter). The level-set function is defined over the entire 3D volume of a transport aircraft wing box. Therefore, the approach is not limited by any predefined structure and can explore novel configurations. The Sequential Linear Programming (SLP) level-set method is used to solve the constrained optimization problems. The proposed method is demonstrated using three problems with mass, linear buckling and flutter objective and/or constraints. A constraint aggregation method is used to handle multiple buckling constraints in the wing skins. A continuous flutter constraint formulation is used to handle difficulties arising from discontinuities in the design space caused by a switching of the critical flutter mode.

  11. Nanoplasmonics simulations at the basis set limit through completeness-optimized, local numerical basis sets

    Energy Technology Data Exchange (ETDEWEB)

    Rossi, Tuomas P., E-mail: tuomas.rossi@alumni.aalto.fi; Sakko, Arto; Puska, Martti J. [COMP Centre of Excellence, Department of Applied Physics, Aalto University School of Science, P.O. Box 11100, FI-00076 Aalto (Finland); Lehtola, Susi, E-mail: susi.lehtola@alumni.helsinki.fi [COMP Centre of Excellence, Department of Applied Physics, Aalto University School of Science, P.O. Box 11100, FI-00076 Aalto (Finland); Chemical Sciences Division, Lawrence Berkeley National Laboratory, Berkeley, California 94720 (United States); Nieminen, Risto M. [COMP Centre of Excellence, Department of Applied Physics, Aalto University School of Science, P.O. Box 11100, FI-00076 Aalto (Finland); Dean’s Office, Aalto University School of Science, P.O. Box 11000, FI-00076 Aalto (Finland)

    2015-03-07

    We present an approach for generating local numerical basis sets of improving accuracy for first-principles nanoplasmonics simulations within time-dependent density functional theory. The method is demonstrated for copper, silver, and gold nanoparticles that are of experimental interest but computationally demanding due to the semi-core d-electrons that affect their plasmonic response. The basis sets are constructed by augmenting numerical atomic orbital basis sets by truncated Gaussian-type orbitals generated by the completeness-optimization scheme, which is applied to the photoabsorption spectra of homoatomic metal atom dimers. We obtain basis sets of improving accuracy up to the complete basis set limit and demonstrate that the performance of the basis sets transfers to simulations of larger nanoparticles and nanoalloys as well as to calculations with various exchange-correlation functionals. This work promotes the use of the local basis set approach of controllable accuracy in first-principles nanoplasmonics simulations and beyond.

  12. Combination of anti-optimization and fuzzy-set-based analysis for structural optimization under uncertainty

    Directory of Open Access Journals (Sweden)

    J. Fang

    1998-01-01

    Full Text Available An approach to the optimum design of structures, in which uncertainties with a fuzzy nature in the magnitude of the loads are considered, is proposed in this study. The optimization process under fuzzy loads is transformed into a fuzzy optimization problem based on the notion of Werners' maximizing set by defining membership functions of the objective function and constraints. In this paper, Werner's maximizing set is defined using the results obtained by first conducting an optimization through anti-optimization modeling of the uncertain loads. An example of a ten-bar truss is used to illustrate the present optimization process. The results are compared with those yielded by other optimization methods.

  13. From Nonlinear Optimization to Convex Optimization through Firefly Algorithm and Indirect Approach with Applications to CAD/CAM

    Directory of Open Access Journals (Sweden)

    Akemi Gálvez

    2013-01-01

    Full Text Available Fitting spline curves to data points is a very important issue in many applied fields. It is also challenging, because these curves typically depend on many continuous variables in a highly interrelated nonlinear way. In general, it is not possible to compute these parameters analytically, so the problem is formulated as a continuous nonlinear optimization problem, for which traditional optimization techniques usually fail. This paper presents a new bioinspired method to tackle this issue. In this method, optimization is performed through a combination of two techniques. Firstly, we apply the indirect approach to the knots, in which they are not initially the subject of optimization but precomputed with a coarse approximation scheme. Secondly, a powerful bioinspired metaheuristic technique, the firefly algorithm, is applied to optimization of data parameterization; then, the knot vector is refined by using De Boor’s method, thus yielding a better approximation to the optimal knot vector. This scheme converts the original nonlinear continuous optimization problem into a convex optimization problem, solved by singular value decomposition. Our method is applied to some illustrative real-world examples from the CAD/CAM field. Our experimental results show that the proposed scheme can solve the original continuous nonlinear optimization problem very efficiently.

  14. Solution of transient optimization problems by using an algorithm based on nonlinear programming

    Science.gov (United States)

    Teren, F.

    1977-01-01

    A new algorithm is presented for solution of dynamic optimization problems which are nonlinear in the state variables and linear in the control variables. It is shown that the optimal control is bang-bang. A nominal bang-bang solution is found which satisfies the system equations and constraints, and influence functions are generated which check the optimality of the solution. Nonlinear optimization (gradient search) techniques are used to find the optimal solution. The algorithm is used to find a minimum time acceleration for a turbofan engine.

  15. Solution of transient optimization problems by using an algorithm based on nonlinear programming

    Science.gov (United States)

    Teren, F.

    1977-01-01

    A new algorithm is presented for solution of dynamic optimization problems which are nonlinear in the state variables and linear in the control variables. It is shown that the optimal control is bang-bang. A nominal bang-bang solution is found which satisfies the system equations and constraints, and influence functions are generated which check the optimality of the solution. Nonlinear optimization (gradient search) techniques are used to find the optimal solution. The algorithm is used to find a minimum time acceleration for a turbofan engine.

  16. Optimization-Based Drift Prevention for Learning Control of Underdetermined Linear and Weakly Nonlinear Time-Varying Systems

    Energy Technology Data Exchange (ETDEWEB)

    DRIESSEN,BRIAN JAMES; SADEGH,NADER; KWOK,KWAN S.

    2000-10-20

    In this paper an optimization-based method of drift prevention is presented for learning control of underdetermined linear and weakly nonlinear time-varying dynamic systems. By defining a fictitious cost function and the associated model-based sub-optimality conditions, a new set of equations results, whose solution is unique, thus preventing large drifts from the initial input. Moreover, in the limiting case where the modeling error approaches zero, the input that the proposed method converges to is the unique feasible (zero error) input that minimizes the fictitious cost function, in the linear case, and locally minimizes it in the (weakly) nonlinear case. Otherwise, under mild restrictions on the modeling error, the method converges to a feasible sub-optimal input.

  17. Multiobjective Optimization of Steering Mechanism for Rotary Steering System Using Modified NSGA-II and Fuzzy Set Theory

    Directory of Open Access Journals (Sweden)

    Hongtao Li

    2015-01-01

    Full Text Available Due to the complicated design process of gear train, optimization is a significant approach to improve design efficiency. However, the design of gear train is a complex multiobjective optimization with mixed continuous-discrete variables under numerous nonlinear constraints, and conventional optimization algorithms are not suitable to deal with such optimization problems. In this paper, based on the established dynamic model of steering mechanism for rotary steering system, the key component of which is a planetary gear set with teeth number difference, the optimization problem of steering mechanism is formulated to achieve minimum dynamic responses and outer diameter by optimizing structural parameters under geometric, kinematic, and strength constraints. An optimization procedure based on modified NSGA-II by incorporating dynamic crowding distance strategies and fuzzy set theory is applied to the multiobjective optimization. For comparative purpose, NSGA-II is also employed to obtain Pareto optimal set, and dynamic responses of original and optimized designs are compared. The results show the optimized design has better dynamic responses with minimum outer diameter and the response decay decreases faster. The optimization procedure is feasible to the design of gear train, and this study can provide guidance for designer at the preliminary design phase of mechanical structures with gear train.

  18. A Nonlinear Physics-Based Optimal Control Method for Magnetostrictive Actuators

    Science.gov (United States)

    Smith, Ralph C.

    1998-01-01

    This paper addresses the development of a nonlinear optimal control methodology for magnetostrictive actuators. At moderate to high drive levels, the output from these actuators is highly nonlinear and contains significant magnetic and magnetomechanical hysteresis. These dynamics must be accommodated by models and control laws to utilize the full capabilities of the actuators. A characterization based upon ferromagnetic mean field theory provides a model which accurately quantifies both transient and steady state actuator dynamics under a variety of operating conditions. The control method consists of a linear perturbation feedback law used in combination with an optimal open loop nonlinear control. The nonlinear control incorporates the hysteresis and nonlinearities inherent to the transducer and can be computed offline. The feedback control is constructed through linearization of the perturbed system about the optimal system and is efficient for online implementation. As demonstrated through numerical examples, the combined hybrid control is robust and can be readily implemented in linear PDE-based structural models.

  19. Set-membership fuzzy filtering for nonlinear discrete-time systems.

    Science.gov (United States)

    Yang, Fuwen; Li, Yongmin

    2010-02-01

    This paper is concerned with the set-membership filtering (SMF) problem for discrete-time nonlinear systems. We employ the Takagi-Sugeno (T-S) fuzzy model to approximate the nonlinear systems over the true value of state and to overcome the difficulty with the linearization over a state estimate set rather than a state estimate point in the set-membership framework. Based on the T-S fuzzy model, we develop a new nonlinear SMF estimation method by using the fuzzy modeling approach and the S-procedure technique to determine a state estimation ellipsoid that is a set of states compatible with the measurements, the unknown-but-bounded process and measurement noises, and the modeling approximation errors. A recursive algorithm is derived for computing the ellipsoid that guarantees to contain the true state. A smallest possible estimate set is recursively computed by solving the semidefinite programming problem. An illustrative example shows the effectiveness of the proposed method for a class of discrete-time nonlinear systems via fuzzy switch.

  20. A hybrid particle swarm optimization approach with neural network and set pair analysis for transmission network planning

    Institute of Scientific and Technical Information of China (English)

    刘吉成; 颜苏莉; 乞建勋

    2008-01-01

    Transmission network planning (TNP) is a large-scale, complex, with more non-linear discrete variables and the multi-objective constrained optimization problem. In the optimization process, the line investment, network reliability and the network loss are the main objective of transmission network planning. Combined with set pair analysis (SPA), particle swarm optimization (PSO), neural network (NN), a hybrid particle swarm optimization model was established with neural network and set pair analysis for transmission network planning (HPNS). Firstly, the contact degree of set pair analysis was introduced, the traditional goal set was converted into the collection of the three indicators including the identity degree, difference agree and contrary degree. On this bases, using shi(H), the three objective optimization problem was converted into single objective optimization problem. Secondly, using the fast and efficient search capabilities of PSO, the transmission network planning model based on set pair analysis was optimized. In the process of optimization, by improving the BP neural network constantly training so that the value of the fitness function of PSO becomes smaller in order to obtain the optimization program fitting the three objectives better. Finally, compared HPNS with PSO algorithm and the classic genetic algorithm, HPNS increased about 23% efficiency than THA, raised about 3.7% than PSO and improved about 2.96% than GA.

  1. Finite-horizon control-constrained nonlinear optimal control using single network adaptive critics.

    Science.gov (United States)

    Heydari, Ali; Balakrishnan, Sivasubramanya N

    2013-01-01

    To synthesize fixed-final-time control-constrained optimal controllers for discrete-time nonlinear control-affine systems, a single neural network (NN)-based controller called the Finite-horizon Single Network Adaptive Critic is developed in this paper. Inputs to the NN are the current system states and the time-to-go, and the network outputs are the costates that are used to compute optimal feedback control. Control constraints are handled through a nonquadratic cost function. Convergence proofs of: 1) the reinforcement learning-based training method to the optimal solution; 2) the training error; and 3) the network weights are provided. The resulting controller is shown to solve the associated time-varying Hamilton-Jacobi-Bellman equation and provide the fixed-final-time optimal solution. Performance of the new synthesis technique is demonstrated through different examples including an attitude control problem wherein a rigid spacecraft performs a finite-time attitude maneuver subject to control bounds. The new formulation has great potential for implementation since it consists of only one NN with single set of weights and it provides comprehensive feedback solutions online, though it is trained offline.

  2. An iterative symplectic pseudospectral method to solve nonlinear state-delayed optimal control problems

    Science.gov (United States)

    Peng, Haijun; Wang, Xinwei; Zhang, Sheng; Chen, Biaosong

    2017-07-01

    Nonlinear state-delayed optimal control problems have complex nonlinear characters. To solve this complex nonlinear problem, an iterative symplectic pseudospectral method based on quasilinearization techniques, the dual variational principle and pseudospectral methods is proposed in this paper. First, the proposed method transforms the original nonlinear optimal control problem into a series of linear quadratic optimal control problems. Then, a symplectic pseudospectral method is developed to solve these converted linear quadratic state-delayed optimal control problems. Coefficient matrices in the proposed method are sparse and symmetric since the dual variational principle is used, which makes the proposed method highly efficient. Converged numerical solutions with high precision can be obtained after a few iterations due to the benefit of the local pseudospectral method and quasilinearization techniques. In the numerical simulations, other numerical methods were used for comparisons. The numerical simulation results show that the proposed method is highly accurate, efficient and robust.

  3. AN SQP METHOD BASED ON SMOOTHING PENALTY FUNCTION FOR NONLINEAR OPTIMIZATION WITH INEQUALITY CONSTRAINT

    Institute of Scientific and Technical Information of China (English)

    ZHANG Juliang; ZHANG Xiangsun

    2001-01-01

    In this paper, we use the smoothing penalty function proposed in [1] as the merit function of SQP method for nonlinear optimization with inequality constraints. The global convergence of the method is obtained.

  4. A simulation test approach to the evaluation and comparison of unconstrained nonlinear optimization algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Hillstrom, K. E.

    1976-02-01

    A simulation test technique was developed to evaluate and compare unconstrained nonlinear optimization computer algorithms. Descriptions of the test technique, test problems, computer algorithms tested, and test results are provided. (auth)

  5. Optimal precursors triggering the Kuroshio Extension state transition obtained by the Conditional Nonlinear Optimal Perturbation approach

    Science.gov (United States)

    Zhang, Xing; Mu, Mu; Wang, Qiang; Pierini, Stefano

    2017-06-01

    In this study, the initial perturbations that are the easiest to trigger the Kuroshio Extension (KE) transition connecting a basic weak jet state and a strong, fairly stable meandering state, are investigated using a reduced-gravity shallow water ocean model and the CNOP (Conditional Nonlinear Optimal Perturbation) approach. This kind of initial perturbation is called an optimal precursor (OPR). The spatial structures and evolutionary processes of the OPRs are analyzed in detail. The results show that most of the OPRs are in the form of negative sea surface height (SSH) anomalies mainly located in a narrow band region south of the KE jet, in basic agreement with altimetric observations. These negative SSH anomalies reduce the meridional SSH gradient within the KE, thus weakening the strength of the jet. The KE jet then becomes more convoluted, with a high-frequency and large-amplitude variability corresponding to a high eddy kinetic energy level; this gradually strengthens the KE jet through an inverse energy cascade. Eventually, the KE reaches a high-energy state characterized by two well defined and fairly stable anticyclonic meanders. Moreover, sensitivity experiments indicate that the spatial structures of the OPRs are not sensitive to the model parameters and to the optimization times used in the analysis.

  6. THE WEAK BENSON PROPER EFFICIENT SUBGRADIENT AND THE OPTIMALITY CONDITIONS OF SET-VALUED OPTIMIZATION

    Institute of Scientific and Technical Information of China (English)

    SHENG Baohuai

    2002-01-01

    The subgradient, under the weak Benson proper efficiency, of a set-valued mapping in ordered Banach space is developed, and the weak Benson proper efficient HahnBanach theorem of a set-valued mapping is established, with which the existence of the subgradient is proved and the characterizations of weak Benson proper efficient elements of constrained (unconstrained) vector set-valued optimization problems are presented.

  7. Investigation of Utilizing a Secant Stiffness Matrix for 2D Nonlinear Shape Optimization and Sensitivity Analysis

    Directory of Open Access Journals (Sweden)

    Asghar Vatani Oskouie

    2016-12-01

    Full Text Available In this article the general non-symmetric parametric form of the incremental secant stiffness matrix for nonlinear analysis of solids have been investigated to present a semi analytical sensitivity analysis approach for geometric nonlinear shape optimization. To approach this aim the analytical formulas of secant stiffness matrix are presented. The models were validated and used to perform investigating different parameters affecting the shape optimization. Numerical examples utilized for this investigating sensitivity analysis with detailed discussions presented.

  8. A Composite Algorithm for Mixed Integer Constrained Nonlinear Optimization.

    Science.gov (United States)

    1980-01-01

    algorithm (FLEX) developed by Paviani and Himmelblau [53] is a direct search algorithm for constrained, nonlinear problems. It uses a variation on the...given in an appendix to Himmelblau [32]. Two changes were made to the program as listed in the rcference. Between card number 1340 and 1350 the...1972, pp. 293-308 (32] Himmelblau , D. M., Applied Nonlinear Programming, McGraw-Hill, 1972 (33] Himmelblau , D. M., "A Uniform Evaluation of Unconstrained

  9. Optimal Determination of Respiratory Airflow Patterns Using a Nonlinear Multicompartment Model for a Lung Mechanics System

    Directory of Open Access Journals (Sweden)

    Hancao Li

    2012-01-01

    Full Text Available We develop optimal respiratory airflow patterns using a nonlinear multicompartment model for a lung mechanics system. Specifically, we use classical calculus of variations minimization techniques to derive an optimal airflow pattern for inspiratory and expiratory breathing cycles. The physiological interpretation of the optimality criteria used involves the minimization of work of breathing and lung volume acceleration for the inspiratory phase, and the minimization of the elastic potential energy and rapid airflow rate changes for the expiratory phase. Finally, we numerically integrate the resulting nonlinear two-point boundary value problems to determine the optimal airflow patterns over the inspiratory and expiratory breathing cycles.

  10. Optimal determination of respiratory airflow patterns using a nonlinear multicompartment model for a lung mechanics system.

    Science.gov (United States)

    Li, Hancao; Haddad, Wassim M

    2012-01-01

    We develop optimal respiratory airflow patterns using a nonlinear multicompartment model for a lung mechanics system. Specifically, we use classical calculus of variations minimization techniques to derive an optimal airflow pattern for inspiratory and expiratory breathing cycles. The physiological interpretation of the optimality criteria used involves the minimization of work of breathing and lung volume acceleration for the inspiratory phase, and the minimization of the elastic potential energy and rapid airflow rate changes for the expiratory phase. Finally, we numerically integrate the resulting nonlinear two-point boundary value problems to determine the optimal airflow patterns over the inspiratory and expiratory breathing cycles.

  11. Distributed Optimization for a Class of Nonlinear Multiagent Systems With Disturbance Rejection.

    Science.gov (United States)

    Wang, Xinghu; Hong, Yiguang; Ji, Haibo

    2016-07-01

    The paper studies the distributed optimization problem for a class of nonlinear multiagent systems in the presence of external disturbances. To solve the problem, we need to achieve the optimal multiagent consensus based on local cost function information and neighboring information and meanwhile to reject local disturbance signals modeled by an exogenous system. With convex analysis and the internal model approach, we propose a distributed optimization controller for heterogeneous and nonlinear agents in the form of continuous-time minimum-phase systems with unity relative degree. We prove that the proposed design can solve the exact optimization problem with rejecting disturbances.

  12. Active Set Algorithm for Large-Scale Continuous Knapsack Problems with Application to Topology Optimization Problems

    CERN Document Server

    Tavakoli, Ruhollah

    2010-01-01

    The structure of many real-world optimization problems includes minimization of a nonlinear (or quadratic) functional subject to bound and singly linear constraints (in the form of either equality or bilateral inequality) which are commonly called as continuous knapsack problems. Since there are efficient methods to solve large-scale bound constrained nonlinear programs, it is desirable to adapt these methods to solve knapsack problems, while preserving their efficiency and convergence theories. The goal of this paper is to introduce a general framework to extend a box-constrained optimization solver to solve knapsack problems. This framework includes two main ingredients which are O(n) methods; in terms of the computational cost and required memory; for the projection onto the knapsack constrains and the null-space manipulation of the related linear constraint. The main focus of this work is on the extension of Hager-Zhang active set algorithm (SIAM J. Optim. 2006, pp. 526--557). The main reasons for this ch...

  13. Optimization of eigenstates and spectra for quasi-linear nonlinear optical systems

    CERN Document Server

    Lytel, Rick; Kuzyk, Mark G

    2015-01-01

    Quasi-one-dimensional quantum structures with spectra scaling faster than the square of the eigenmode number (superscaling) can generate intrinsic, off-resonant optical nonlinearities near the fundamental physical limits, independent of the details of the potential energy along the structure. The scaling of spectra is determined by the topology of the structure, while the magnitudes of the transition moments are set by the geometry of the structure. This paper presents a comprehensive study of the geometrical optimization of superscaling quasi-one-dimensional structures and provides heuristics for designing molecules to maximize intrinsic response. A main result is that designers of conjugated structures should attach short side groups at least a third of the way along the bridge, not near its end as is conventionally done. A second result is that once a side group is properly placed, additional side groups do not further enhance the response.

  14. An algorithm of sequential systems of linear equations for nonlinear optimization problems with arbitrary initial point

    Institute of Scientific and Technical Information of China (English)

    高自友; 贺国平; 吴方

    1997-01-01

    For current sequential quadratic programming (SQP) type algorithms, there exist two problems; (i) in order to obtain a search direction, one must solve one or more quadratic programming subproblems per iteration, and the computation amount of this algorithm is very large. So they are not suitable for the large-scale problems; (ii) the SQP algorithms require that the related quadratic programming subproblems be solvable per iteration, but it is difficult to be satisfied. By using e-active set procedure with a special penalty function as the merit function, a new algorithm of sequential systems of linear equations for general nonlinear optimization problems with arbitrary initial point is presented This new algorithm only needs to solve three systems of linear equations having the same coefficient matrix per iteration, and has global convergence and local superlinear convergence. To some extent, the new algorithm can overcome the shortcomings of the SQP algorithms mentioned above.

  15. Optimal Set Anode Potentials Vary in Bioelectrochemical Systems

    KAUST Repository

    Wagner, Rachel C.

    2010-08-15

    In bioelectrochemical systems (BESs), the anode potential can be set to a fixed voltage using a potentiostat, but there is no accepted method for defining an optimal potential. Microbes can theoretically gain more energy by reducing a terminal electron acceptor with a more positive potential, for example oxygen compared to nitrate. Therefore, more positive anode potentials should allow microbes to gain more energy per electron transferred than a lower potential, but this can only occur if the microbe has metabolic pathways capable of capturing the available energy. Our review of the literature shows that there is a general trend of improved performance using more positive potentials, but there are several notable cases where biofilm growth and current generation improved or only occurred at more negative potentials. This suggests that even with diverse microbial communities, it is primarily the potential of the terminal respiratory proteins used by certain exoelectrogenic bacteria, and to a lesser extent the anode potential, that determines the optimal growth conditions in the reactor. Our analysis suggests that additional bioelectrochemical investigations of both pure and mixed cultures, over a wide range of potentials, are needed to better understand how to set and evaluate optimal anode potentials for improving BES performance. © 2010 American Chemical Society.

  16. Subcritical transition scenarios via linear and nonlinear localized optimal perturbations in plane Poiseuille flow

    Science.gov (United States)

    Farano, Mirko; Cherubini, Stefania; Robinet, Jean-Christophe; De Palma, Pietro

    2016-12-01

    Subcritical transition in plane Poiseuille flow is investigated by means of a Lagrange-multiplier direct-adjoint optimization procedure with the aim of finding localized three-dimensional perturbations optimally growing in a given time interval (target time). Space localization of these optimal perturbations (OPs) is achieved by choosing as objective function either a p-norm (with p\\gg 1) of the perturbation energy density in a linear framework; or the classical (1-norm) perturbation energy, including nonlinear effects. This work aims at analyzing the structure of linear and nonlinear localized OPs for Poiseuille flow, and comparing their transition thresholds and scenarios. The nonlinear optimization approach provides three types of solutions: a weakly nonlinear, a hairpin-like and a highly nonlinear optimal perturbation, depending on the value of the initial energy and the target time. The former shows localization only in the wall-normal direction, whereas the latter appears much more localized and breaks the spanwise symmetry found at lower target times. Both solutions show spanwise inclined vortices and large values of the streamwise component of velocity already at the initial time. On the other hand, p-norm optimal perturbations, although being strongly localized in space, keep a shape similar to linear 1-norm optimal perturbations, showing streamwise-aligned vortices characterized by low values of the streamwise velocity component. When used for initializing direct numerical simulations, in most of the cases nonlinear OPs provide the most efficient route to transition in terms of time to transition and initial energy, even when they are less localized in space than the p-norm OP. The p-norm OP follows a transition path similar to the oblique transition scenario, with slightly oscillating streaks which saturate and eventually experience secondary instability. On the other hand, the nonlinear OP rapidly forms large-amplitude bent streaks and skips the phases

  17. Optimization of Passive and Active Non-Linear Vibration Mounting Systems Based on Vibratory Power Transmission

    Science.gov (United States)

    Royston, T. J.; Singh, R.

    1996-07-01

    While significant non-linear behavior has been observed in many vibration mounting applications, most design studies are typically based on the concept of linear system theory in terms of force or motion transmissibility. In this paper, an improved analytical strategy is presented for the design optimization of complex, active of passive, non-linear mounting systems. This strategy is built upon the computational Galerkin method of weighted residuals, and incorporates order reduction and numerical continuation in an iterative optimization scheme. The overall dynamic characteristics of the mounting system are considered and vibratory power transmission is minimized via adjustment of mount parameters by using both passive and active means. The method is first applied through a computational example case to the optimization of basic passive and active, non-linear isolation configurations. It is found that either active control or intentionally introduced non-linearity can improve the mount's performance; but a combination of both produces the greatest benefit. Next, a novel experimental, active, non-linear isolation system is studied. The effect of non-linearity on vibratory power transmission and active control are assessed via experimental measurements and the enhanced Galerkin method. Results show how harmonic excitation can result in multiharmonic vibratory power transmission. The proposed optimization strategy offers designers some flexibility in utilizing both passive and active means in combination with linear and non-linear components for improved vibration mounts.

  18. Robust Optimal Design of a Nonlinear Dynamic Vibration Absorber Combining Sensitivity Analysis

    Directory of Open Access Journals (Sweden)

    R.A. Borges

    2010-01-01

    Full Text Available Dynamic vibration absorbers are discrete devices developed in the beginning of the last century used to attenuate the vibrations of different engineering structures. They have been used in several engineering applications, such as ships, power lines, aeronautic structures, civil engineering constructions subjected to seismic induced excitations, compressor systems, etc. However, in the context of nonlinear dynamics, few works have been proposed regarding the robust optimal design of nonlinear dynamic vibration absorbers. In this paper, a robust optimization strategy combined with sensitivity analysis of systems incorporating nonlinear dynamic vibration absorbers is proposed. Although sensitivity analysis is a well known numerical technique, the main contribution intended for this study is its extension to nonlinear systems. Due to the numerical procedure used to solve the nonlinear equations, the sensitivities addressed herein are computed from the first-order finite-difference approximations. With the aim of increasing the efficiency of the nonlinear dynamic absorber into a frequency band of interest, and to augment the robustness of the optimal design, a robust optimization strategy combined with the previous sensitivities is addressed. After presenting the underlying theoretical foundations, the proposed robust design methodology is performed for a two degree-of-freedom system incorporating a nonlinear dynamic vibration absorber. Based on the obtained results, the usefulness of the proposed methodology is highlighted.

  19. Character Projection Mask Set Optimization for Enhancing Throughput of MCC Projection Systems

    Science.gov (United States)

    Sugihara, Makoto; Matsunaga, Yusuke; Murakami, Kazuaki

    Character projection (CP) lithography is utilized for maskless lithography and is a potential for the future photomask manufacture because it can project ICs much faster than point beam projection or variable-shaped beam (VSB) projection. In this paper, we first present a projection mask set development methodology for multi-column-cell (MCC) systems, in which column-cells can project patterns in parallel with the CP and VSB lithographies. Next, we present an INLP (integer nonlinear programming) model as well as an ILP (integer linear programming) model for optimizing a CP mask set of an MCC projection system so that projection time is reduced. The experimental results show that our optimization has achieved 33.4% less projection time in the best case than a naive CP mask development approach. The experimental results indicate that our CP mask set optimization method has virtually increased cell pattern objects on CP masks and has decreased VSB projection so that it has achieved higher projection throughput than just parallelizing two column-cells with conventional CP masks.

  20. Optimal control for unknown discrete-time nonlinear Markov jump systems using adaptive dynamic programming.

    Science.gov (United States)

    Zhong, Xiangnan; He, Haibo; Zhang, Huaguang; Wang, Zhanshan

    2014-12-01

    In this paper, we develop and analyze an optimal control method for a class of discrete-time nonlinear Markov jump systems (MJSs) with unknown system dynamics. Specifically, an identifier is established for the unknown systems to approximate system states, and an optimal control approach for nonlinear MJSs is developed to solve the Hamilton-Jacobi-Bellman equation based on the adaptive dynamic programming technique. We also develop detailed stability analysis of the control approach, including the convergence of the performance index function for nonlinear MJSs and the existence of the corresponding admissible control. Neural network techniques are used to approximate the proposed performance index function and the control law. To demonstrate the effectiveness of our approach, three simulation studies, one linear case, one nonlinear case, and one single link robot arm case, are used to validate the performance of the proposed optimal control method.

  1. Constructing Low-Dimensional Dynamical Systems of Nonlinear Partial Differential Equations Using Optimization

    Directory of Open Access Journals (Sweden)

    Jun Shuai

    2013-11-01

    Full Text Available A new approach using optimization technique for constructing low-dimensional dynamical systems of nonlinear partial differential equations (PDEs is presented. After the spatial basis functions of the nonlinear PDEs are chosen, spatial basis functions expansions combined with weighted residual methods are used for time/space separation and truncation to obtain a high-dimensional dynamical system. Secondly, modes of lower-dimensional dynamical systems are obtained by linear combination from the modes of the high-dimensional dynamical systems (ordinary differential equations of nonlinear PDEs. An error function for matrix of the linear combination coefficients is derived, and a simple algorithm to determine the optimal combination matrix is also introduced. A numerical example shows that the optimal dynamical system can use much smaller number of modes to capture the dynamics of nonlinear partial differential equations.

  2. Optimal Control Problems for Nonlinear Variational Evolution Inequalities

    Directory of Open Access Journals (Sweden)

    Eun-Young Ju

    2013-01-01

    Full Text Available We deal with optimal control problems governed by semilinear parabolic type equations and in particular described by variational inequalities. We will also characterize the optimal controls by giving necessary conditions for optimality by proving the Gâteaux differentiability of solution mapping on control variables.

  3. Reliability optimization of friction-damped systems using nonlinear modes

    Science.gov (United States)

    Krack, Malte; Tatzko, Sebastian; Panning-von Scheidt, Lars; Wallaschek, Jörg

    2014-06-01

    A novel probabilistic approach for the design of mechanical structures with friction interfaces is proposed. The objective function is defined as the probability that a specified performance measure of the forced vibration response is achieved subject to parameter uncertainties. The practicability of the approach regarding the extensive amount of required design evaluations is strictly related to the computational efficiency of the nonlinear dynamic analysis. Therefore, it is proposed to employ a recently developed parametric reduced order model (ROM) based on nonlinear modes of vibration, which can facilitate a decrease of the computational burden by several orders of magnitude.

  4. Optimization of the generator settings for endobiliary radiofrequency ablation

    Institute of Scientific and Technical Information of China (English)

    Maximilien; Barret; Sarah; Leblanc; Ariane; Vienne; Alexandre; Rouquette; Frederic; Beuvon; Stanislas; Chaussade; Frederic; Prat

    2015-01-01

    AIM:To determine the optimal generator settings for endobiliary radiofrequency ablation. METHODS:Endobiliary radiofrequency ablation was performed in live swine on the ampulla of Vater,the common bile duct and in the hepatic parenchyma. Radiofrequency ablation time,"effect",and power were allowed to vary. The animals were sacrificed two hours after the procedure. Histopathological assessment of the depth of the thermal lesions was performed. RESULTS:Twenty-five radiofrequency bursts were applied in three swine. In the ampulla of Vater(n = 3),necrosis of the duodenal wall was observed starting with an effect set at 8,power output set at 10 W,and a 30 s shot duration,whereas superficial mucosal damage of up to 350 μm in depth was recorded for an effect set at 8,power output set at 6 W and a 30 s shot duration. In the common bile duct(n = 4),a 1070 μm,safe and efficient ablation was obtained for an effect set at 8,a power output of 8 W,and an ablation time of 30 s. Within the hepatic parenchyma(n = 18),the depth of tissue damage varied from 1620 μm(effect = 8,power = 10 W,ablation time = 15 s) to 4480 μm(effect = 8,power = 8 W,ablation time = 90 s). CONCLUSION:The duration of the catheter application appeared to be the most important parameter influencing the depth of the thermal injury during endobiliary radiofrequency ablation. In healthy swine,the currently recommended settings of the generator may induce severe,supratherapeutic tissue damage in the biliary tree,especially in the high-risk area of the ampulla of Vater.

  5. φq-field theory for portfolio optimization: “fat tails” and nonlinear correlations

    Science.gov (United States)

    Sornette, D.; Simonetti, P.; Andersen, J. V.

    2000-08-01

    Physics and finance are both fundamentally based on the theory of random walks (and their generalizations to higher dimensions) and on the collective behavior of large numbers of correlated variables. The archetype examplifying this situation in finance is the portfolio optimization problem in which one desires to diversify on a set of possibly dependent assets to optimize the return and minimize the risks. The standard mean-variance solution introduced by Markovitz and its subsequent developments is basically a mean-field Gaussian solution. It has severe limitations for practical applications due to the strongly non-Gaussian structure of distributions and the nonlinear dependence between assets. Here, we present in details a general analytical characterization of the distribution of returns for a portfolio constituted of assets whose returns are described by an arbitrary joint multivariate distribution. In this goal, we introduce a non-linear transformation that maps the returns onto Gaussian variables whose covariance matrix provides a new measure of dependence between the non-normal returns, generalizing the covariance matrix into a nonlinear covariance matrix. This nonlinear covariance matrix is chiseled to the specific fat tail structure of the underlying marginal distributions, thus ensuring stability and good conditioning. The portfolio distribution is then obtained as the solution of a mapping to a so-called φq field theory in particle physics, of which we offer an extensive treatment using Feynman diagrammatic techniques and large deviation theory, that we illustrate in details for multivariate Weibull distributions. The interaction (non-mean field) structure in this field theory is a direct consequence of the non-Gaussian nature of the distribution of asset price returns. We find that minimizing the portfolio variance (i.e. the relatively “small” risks) may often increase the large risks, as measured by higher normalized cumulants. Extensive

  6. A Novel Nonlinear Programming Model for Distribution Protection Optimization

    NARCIS (Netherlands)

    Zambon, Eduardo; Bossois, Débora Z.; Garcia, Berilhes B.; Azeredo, Elias F.

    2009-01-01

    This paper presents a novel nonlinear binary programming model designed to improve the reliability indices of a distribution network. This model identifies the type and location of protection devices that should be installed in a distribution feeder and is a generalization of the classical optimizat

  7. Application of nonlinear optimization method to sensitivity analysis of numerical model

    Institute of Scientific and Technical Information of China (English)

    XU Hui; MU Mu; LUO Dehai

    2004-01-01

    A nonlinear optimization method is applied to sensitivity analysis of a numerical model. Theoretical analysis and numerical experiments indicate that this method can give not only a quantitative assessment whether the numerical model is able to simulate the observations or not, but also the initial field that yields the optimal simulation. In particular, when the simulation results are apparently satisfactory, and sometimes both model error and initial error are considerably large, the nonlinear optimization method, under some conditions, can identify the error that plays a dominant role.

  8. Construction of 1-Resilient Boolean Functions with Optimal Algebraic Immunity and Good Nonlinearity

    Institute of Scientific and Technical Information of China (English)

    Sen-Shan Pan; Xiao-Tong Fu; Wei-Guo Zhangx

    2011-01-01

    This paper presents a construction for a class of 1-resilient functions with optimal algebraic immunity on an even number of variables. The construction is based on the concatenation of two balanced functions in associative classes. For some n, a part of 1-resilient functions with maximum algebraic immunity constructed in the paper can achieve almost optimal nonlinearity. Apart from their high nonlinearity, the functions reach Siegenthaler's upper bound of algebraic degree. Also a class of 1-resilient functions on any number n > 2 of variables with at least sub-optimal algebraic immunity is provided.

  9. Lossless Convexification of Control Constraints for a Class of Nonlinear Optimal Control Problems

    Science.gov (United States)

    Blackmore, Lars; Acikmese, Behcet; Carson, John M.,III

    2012-01-01

    In this paper we consider a class of optimal control problems that have continuous-time nonlinear dynamics and nonconvex control constraints. We propose a convex relaxation of the nonconvex control constraints, and prove that the optimal solution to the relaxed problem is the globally optimal solution to the original problem with nonconvex control constraints. This lossless convexification enables a computationally simpler problem to be solved instead of the original problem. We demonstrate the approach in simulation with a planetary soft landing problem involving a nonlinear gravity field.

  10. A Novel Differential Evolution Invasive Weed Optimization Algorithm for Solving Nonlinear Equations Systems

    Directory of Open Access Journals (Sweden)

    Yongquan Zhou

    2013-01-01

    Full Text Available In view of the traditional numerical method to solve the nonlinear equations exist is sensitive to initial value and the higher accuracy of defects. This paper presents an invasive weed optimization (IWO algorithm which has population diversity with the heuristic global search of differential evolution (DE algorithm. In the iterative process, the global exploration ability of invasive weed optimization algorithm provides effective search area for differential evolution; at the same time, the heuristic search ability of differential evolution algorithm provides a reliable guide for invasive weed optimization. Based on the test of several typical nonlinear equations and a circle packing problem, the results show that the differential evolution invasive weed optimization (DEIWO algorithm has a higher accuracy and speed of convergence, which is an efficient and feasible algorithm for solving nonlinear systems of equations.

  11. SOME OPTIMALITY AND DUALITY RESULTS FOR AN EFFICIENT SOLUTION OF MULTIOBJECTIVE NONLINEAR FRACTIONAL PROGRAMMING PROBLEM

    Directory of Open Access Journals (Sweden)

    Paras Bhatnagar

    2012-10-01

    Full Text Available Kaul and Kaur [7] obtained necessary optimality conditions for a non-linear programming problem by taking the objective and constraint functions to be semilocally convex and their right differentials at a point to be lower semi-continuous. Suneja and Gupta [12] established the necessary optimality conditions without assuming the semilocal convexity of the objective and constraint functions but their right differentials at the optimal point to be convex. Suneja and Gupta [13] established necessary optimality conditions for an efficient solution of a multiobjective non-linear programming problem by taking the right differentials of the objective functions and constraintfunctions at the efficient point to be convex. In this paper we obtain some results for a properly efficient solution of a multiobjective non-linear fractional programming problem involving semilocally convex and related functions by assuming generalized Slater type constraint qualification.

  12. APPLICATIONS OF NONLINEAR OPTIMIZATION METHOD TO NUMERICAL STUDIES OF ATMOSPHERIC AND OCEANIC SCIENCES

    Institute of Scientific and Technical Information of China (English)

    DUAN Wan-suo; MU Mu

    2005-01-01

    Linear singular vector and linear singular value can only describe the evolution of sufficiently small perturbations during the period in which the tangent linear model is valid.With this in mind, the applications of nonlinear optimization methods to the atmospheric and oceanic sciences are introduced, which include nonlinear singular vector (NSV) and nonlinear singular value (NSVA), conditional nonlinear optimal perturbation (CNOP), and their applications to the studies of predictability in numerical weather and climate prediction.The results suggest that the nonlinear characteristics of the motions of atmosphere and oceans can be explored by NSV and CNOP. Also attentions are paid to the introduction of the classification of predictability problems, which are related to the maximum predictable time,the maximum prediction error, and the maximum allowing error of initial value and the parameters. All the information has the background of application to the evaluation of products of numerical weather and climate prediction. Furthermore the nonlinear optimization methods of the sensitivity analysis with numerical model are also introduced, which can give a quantitative assessment whether a numerical model is able to simulate the observations and find the initial field that yield the optimal simulation. Finally, the difficulties in the lack of ripe algorithms are also discussed, which leave future work to both computational mathematics and scientists in geophysics.

  13. The nurse scheduling problem: a goal programming and nonlinear optimization approaches

    Science.gov (United States)

    Hakim, L.; Bakhtiar, T.; Jaharuddin

    2017-01-01

    Nurses scheduling is an activity of allocating nurses to conduct a set of tasks at certain room at a hospital or health centre within a certain period. One of obstacles in the nurse scheduling is the lack of resources in order to fulfil the needs of the hospital. Nurse scheduling which is undertaken manually will be at risk of not fulfilling some nursing rules set by the hospital. Therefore, this study aimed to perform scheduling models that satisfy all the specific rules set by the management of Bogor State Hospital. We have developed three models to overcome the scheduling needs. Model 1 is designed to schedule nurses who are solely assigned to a certain inpatient unit and Model 2 is constructed to manage nurses who are assigned to an inpatient room as well as at Polyclinic room as conjunct nurses. As the assignment of nurses on each shift is uneven, then we propose Model 3 to minimize the variance of the workload in order to achieve equitable assignment on every shift. The first two models are formulated in goal programming framework, while the last model is in nonlinear optimization form.

  14. Systems of general nonlinear set-valued mixed variational inequalities problems in Hilbert spaces

    Directory of Open Access Journals (Sweden)

    Cho Yeol

    2011-01-01

    Full Text Available Abstract In this paper, the existing theorems and methods for finding solutions of systems of general nonlinear set-valued mixed variational inequalities problems in Hilbert spaces are studied. To overcome the difficulties, due to the presence of a proper convex lower semi-continuous function, φ and a mapping g, which appeared in the considered problem, we have used some applications of the resolvent operator technique. We would like to point out that although many authors have proved results for finding solutions of the systems of nonlinear set-valued (mixed variational inequalities problems, it is clear that it cannot be directly applied to the problems that we have considered in this paper because of φ and g. 2000 AMS Subject Classification: 47H05; 47H09; 47J25; 65J15.

  15. Fault Diagnosis of Nonlinear Systems Based on Hybrid PSOSA Optimization Algorithm

    Institute of Scientific and Technical Information of China (English)

    Ling-Lai Li; Dong-Hua Zhou; Ling Wang

    2007-01-01

    Fault diagnosis of nonlinear systems is of great importance in theory and practice, and the parameter estimation method is an effective strategy. Based on the framework of moving horizon estimation, fault parameters are identified by a proposed intelligent optimization algorithm called PSOSA, which could avoid premature convergence of standard particle swarm optimization (PSO) by introducing the probabilistic jumping property of simulated annealing (SA). Simulations on a three-tank system show the effectiveness of this optimization based fault diagnosis strategy.

  16. Nonlinear optimization of buoyancy-driven ventilation flow

    Science.gov (United States)

    Nabi, Saleh; Grover, Piyush; Caulfield, C. P.

    2016-11-01

    We consider the optimization of buoyancy-driven flows governed by Boussinesq equations using the Direct-Adjoint-Looping method. We use incompressible Reynolds-averaged Navier-Stokes (RANS) equations, derive the corresponding adjoint equations and solve the resulting sensitivity equations with respect to inlet conditions. For validation, we solve a series of inverse-design problems, for which we recover known globally optimal solutions. For a displacement ventilation scenario with a line source, the numerical results are compared with analytically obtained optimal inlet conditions available from classical plume theory. Our results show that depending on Archimedes number, defined as the ratio of the inlet Reynolds number to the Rayleigh number associated with the plume, qualitatively different optimal solutions are obtained. For steady and transient plumes, and subject to an enthalpy constraint on the incoming flow, we identify boundary conditions leading to 'optimal' temperature distributions in the occupied zone.

  17. Nonlinear Dynamic Characteristic Analysis of the Shaft System in Water Turbine Generator Set

    Institute of Scientific and Technical Information of China (English)

    MA Zhenyue; SONG Zhiqiang

    2009-01-01

    A 3D finite element vibration model of water turbine generator set is constructed considering the coupling with hydropower house foundation. The method of determining guide bearing dynamic characteristic coefficients according to the swing of the shaft is proposed, which can be used for studying the self-vibration characteristic and stability of the water turbine generator set. The method fully considers the complex supporting boundary and loading conditions; especially the nonlinear variation of guide bearing dynamic characteristic coefficients and the coupling effect of the whole power-house foundation. The swing and critical rotating speed of an actual generator set shaft system are calculated. The simulated results of the generator set indicate that the coupling vibration model and calculation method presented in this paper are suitable for stability analysis of the water turbine generator set.

  18. Trajectory optimization for vehicles using control vector parameterization and nonlinear programming

    Energy Technology Data Exchange (ETDEWEB)

    Spangelo, I.

    1994-12-31

    This thesis contains a study of optimal trajectories for vehicles. Highly constrained nonlinear optimal control problems have been solved numerically using control vector parameterization and nonlinear programming. Control vector parameterization with shooting has been described in detail to provide the reader with the theoretical background for the methods which have been implemented, and which are not available in standard text books. Theoretical contributions on accuracy analysis and gradient computations have also been presented. Optimal trajectories have been computed for underwater vehicles controlled in all six degrees of freedom by DC-motor driven thrusters. A class of nonlinear optimal control problems including energy-minimization, possibly combined with time minimization and obstacle avoidance, has been developed. A program system has been specially designed and written in the C language to solve this class of optimal control problems. Control vector parameterization with single shooting was used. This special implementation has made it possible to perform a detailed analysis, and to investigate numerical details of this class of optimization methods which would have been difficult using a general purpose CVP program system. The results show that this method for solving general optimal control problems is well suited for use in guidance and control of marine vehicles. Results from rocket trajectory optimization has been studied in this work to bring knowledge from this area into the new area of trajectory optimization of marine vehicles. 116 refs., 24 figs., 23 tabs.

  19. On optimal performance of nonlinear energy sinks in multiple-degree-of-freedom systems

    Science.gov (United States)

    Tripathi, Astitva; Grover, Piyush; Kalmár-Nagy, Tamás

    2017-02-01

    We study the problem of optimizing the performance of a nonlinear spring-mass-damper attached to a class of multiple-degree-of-freedom systems. We aim to maximize the rate of one-way energy transfer from primary system to the attachment, and focus on impulsive excitation of a two-degree-of-freedom primary system with an essentially nonlinear attachment. The nonlinear attachment is shown to be able to perform as a 'nonlinear energy sink' (NES) by taking away energy from the primary system irreversibly for some types of impulsive excitations. Using perturbation analysis and exploiting separation of time scales, we perform dimensionality reduction of this strongly nonlinear system. Our analysis shows that efficient energy transfer to nonlinear attachment in this system occurs for initial conditions close to homoclinic orbit of the slow time-scale undamped system, a phenomenon that has been previously observed for the case of single-degree-of-freedom primary systems. Analytical formulae for optimal parameters for given impulsive excitation input are derived. Generalization of this framework to systems with arbitrary number of degrees-of-freedom of the primary system is also discussed. The performance of both linear and nonlinear optimally tuned attachments is compared. While NES performance is sensitive to magnitude of the initial impulse, our results show that NES performance is more robust than linear tuned mass damper to several parametric perturbations. Hence, our work provides evidence that homoclinic orbits of the underlying Hamiltonian system play a crucial role in efficient nonlinear energy transfers, even in high dimensional systems, and gives new insight into robustness of systems with essential nonlinearity.

  20. An Efficient Pseudospectral Method for Solving a Class of Nonlinear Optimal Control Problems

    OpenAIRE

    Emran Tohidi; Atena Pasban; Kilicman, A.; S. Lotfi Noghabi

    2013-01-01

    This paper gives a robust pseudospectral scheme for solving a class of nonlinear optimal control problems (OCPs) governed by differential inclusions. The basic idea includes two major stages. At the first stage, we linearize the nonlinear dynamical system by an interesting technique which is called linear combination property of intervals. After this stage, the linearized dynamical system is transformed into a multi domain dynamical system via computational interval partitioning. Moreover,...

  1. Decentralized observers for optimal stabilization of large class of nonlinear interconnected systems

    OpenAIRE

    BEL HAJ FREJ, GHAZI; Thabet, Assem; Boutayeb, Mohamed; Aoun, Mohamed

    2016-01-01

    International audience; This paper focuses on the design of decentralized state observers based on optimal guaranteed cost control for a class of systems which are composed of linear subsystems coupled by non-linear time-varying interconnections. One of the main contributions lies in the use of the differential mean value theorem (DMVT) to simplify the design of estimation and control matrices gains. This has the advantage of introducing a general condition on the nonlinear time-varying inter...

  2. Optimality Condition and Wolfe Duality for Invex Interval-Valued Nonlinear Programming Problems

    Directory of Open Access Journals (Sweden)

    Jianke Zhang

    2013-01-01

    Full Text Available The concepts of preinvex and invex are extended to the interval-valued functions. Under the assumption of invexity, the Karush-Kuhn-Tucker optimality sufficient and necessary conditions for interval-valued nonlinear programming problems are derived. Based on the concepts of having no duality gap in weak and strong sense, the Wolfe duality theorems for the invex interval-valued nonlinear programming problems are proposed in this paper.

  3. Singular Value Decomposition-Based Method for Sliding Mode Control and Optimization of Nonlinear Neutral Systems

    OpenAIRE

    Heli Hu; Dan Zhao; Qingling Zhang

    2013-01-01

    The sliding mode control and optimization are investigated for a class of nonlinear neutral systems with the unmatched nonlinear term. In the framework of Lyapunov stability theory, the existence conditions for the designed sliding surface and the stability bound ${\\alpha }^{\\ast }$ are derived via twice transformations. The further results are to develop an efficient sliding mode control law with tuned parameters to attract the state trajectories onto the sliding surface in finit...

  4. Asynchronous parallel generating set search for linearly-constrained optimization.

    Energy Technology Data Exchange (ETDEWEB)

    Kolda, Tamara G.; Griffin, Joshua; Lewis, Robert Michael

    2007-04-01

    We describe an asynchronous parallel derivative-free algorithm for linearly-constrained optimization. Generating set search (GSS) is the basis of ourmethod. At each iteration, a GSS algorithm computes a set of search directionsand corresponding trial points and then evaluates the objective function valueat each trial point. Asynchronous versions of the algorithm have been developedin the unconstrained and bound-constrained cases which allow the iterations tocontinue (and new trial points to be generated and evaluated) as soon as anyother trial point completes. This enables better utilization of parallel resourcesand a reduction in overall runtime, especially for problems where the objec-tive function takes minutes or hours to compute. For linearly-constrained GSS,the convergence theory requires that the set of search directions conform to the3 nearby boundary. The complexity of developing the asynchronous algorithm forthe linearly-constrained case has to do with maintaining a suitable set of searchdirections as the search progresses and is the focus of this research. We describeour implementation in detail, including how to avoid function evaluations bycaching function values and using approximate look-ups. We test our imple-mentation on every CUTEr test problem with general linear constraints and upto 1000 variables. Without tuning to individual problems, our implementationwas able to solve 95% of the test problems with 10 or fewer variables, 75%of the problems with 11-100 variables, and nearly half of the problems with100-1000 variables. To the best of our knowledge, these are the best resultsthat have ever been achieved with a derivative-free method. Our asynchronousparallel implementation is freely available as part of the APPSPACK software.4

  5. Optimal Set-point Chasing of Position Moored Vessel

    DEFF Research Database (Denmark)

    Fang, Shaoji; Blanke, Mogens; Bernt, Leira

    2010-01-01

    Dynamic positioning of surface vessels moored to the seabed via a spread mooring system are referred to as position mooring (PM), the main objective of which is to keep the vessel within a small radius from a given position while preventing mooring line breakage. When environmental loads become...... high, position mooring systems apply thruster forces to protect mooring lines and position accuracy may need be relaxed. This paper suggests an new position chasing algorithm that works entirely online, is optimal according to a criterion and can protect any number of mooring lines simultaneously....... Tensions of all mooring lines are included in a cost function where the criticality for each mooring line determine individual weights. With this strategy, external environment effects are included directly by without needing predefined tabular settings of environmental loads as in earlier approaches...

  6. Performance characteristics and optimal analysis of a nonlinear diode refrigerator

    Institute of Scientific and Technical Information of China (English)

    Wang Xiu-Mei; He Ji-Zhou; Liang Hong-Ni

    2011-01-01

    This paper establishes a model of a nonlinear diode refrigerator consisting of two diodes switched in the opposite directions and located in two heat reservoirs with different temperatures. Based on the theory of thermal fluctuations, the expressions of the heat flux absorbed from the heat reservoirs are derived. After the heat leak between the two reservoirs is considered, the cooling rate and the coefficient of performance are obtained analytically. The influence of the heat leak and the temperature ratio on the performance characteristics of the refrigerator is analysed in detail.

  7. Optimal frequency conversion in the nonlinear stage of modulation instability

    CERN Document Server

    Bendahmane, A; Kudlinski, A; Szriftgiser, P; Conforti, M; Wabnitz, S; Trillo, S

    2015-01-01

    We investigate multi-wave mixing associated with the strongly pump depleted regime of induced modulation instability (MI) in optical fibers. For a complete transfer of pump power into the sideband modes, we theoretically and experimentally demonstrate that it is necessary to use a much lower seeding modulation frequency than the peak MI gain value. Our analysis shows that a record 95 % of the input pump power is frequency converted into the comb of sidebands, in good quantitative agreement with analytical predictions based on the simplest exact breather solution of the nonlinear Schr\\"odinger equation.

  8. A General Nonlinear Optimization Algorithm for Lower Bound Limit Analysis

    DEFF Research Database (Denmark)

    Krabbenhøft, Kristian; Damkilde, Lars

    2003-01-01

    The non-linear programming problem associated with the discrete lower bound limit analysis problem is treated by means of an algorithm where the need to linearize the yield criteria is avoided. The algorithm is an interior point method and is completely general in the sense that no particular...... finite element discretization or yield criterion is required. As with interior point methods for linear programming the number of iterations is affected only little by the problem size. Some practical implementation issues are discussed with reference to the special structure of the common lower bound...

  9. A Parameter Estimation Method for Nonlinear Systems Based on Improved Boundary Chicken Swarm Optimization

    Directory of Open Access Journals (Sweden)

    Shaolong Chen

    2016-01-01

    Full Text Available Parameter estimation is an important problem in nonlinear system modeling and control. Through constructing an appropriate fitness function, parameter estimation of system could be converted to a multidimensional parameter optimization problem. As a novel swarm intelligence algorithm, chicken swarm optimization (CSO has attracted much attention owing to its good global convergence and robustness. In this paper, a method based on improved boundary chicken swarm optimization (IBCSO is proposed for parameter estimation of nonlinear systems, demonstrated and tested by Lorenz system and a coupling motor system. Furthermore, we have analyzed the influence of time series on the estimation accuracy. Computer simulation results show it is feasible and with desirable performance for parameter estimation of nonlinear systems.

  10. On stochastic optimal control of partially observable nonlinear quasi Hamiltonian systems

    Institute of Scientific and Technical Information of China (English)

    朱位秋; 应祖光

    2004-01-01

    A stochastic optimal control strategy for partially observable nonlinear quasi Hamiltonian systems is proposed.The optimal control forces consist of two parts. The first part is determined by the conditions under which the stochastic optimal control problem of a partially observable nonlinear system is converted into that of a completely observable linear system. The second part is determined by solving the dynamical programming equation derived by applying the stochastic averaging method and stochastic dynamical programming principle to the completely observable linear control system. The response of the optimally controlled quasi Hamiltonian system is predicted by solving the averaged Fokker-Planck-Kolmogorov equation associated with the optimally controlled completely observable linear system and solving the Riccati equation for the estimated error of system states. An example is given to illustrate the procedure and effectiveness of the proposed control strategy.

  11. Science Letters:On stochastic optimal control of partially observable nonlinear quasi Hamiltonian systems

    Institute of Scientific and Technical Information of China (English)

    朱位秋; 应祖光

    2004-01-01

    A stochastic optimal control strategy for partially observable nonlinear quasi Hamiltonian systems is proposed. The optimal control forces consist of two parts. The first part is determined by the conditions under which the stochastic optimal control problem of a partially observable nonlinear system is converted into that of a completely observable linear system. The second part is determined by solving the dynamical programming equation derived by applying the stochastic averaging method and stochastic dynamical programming principle to the completely observable linear control system. The response of the optimally controlled quasi Hamiltonian system is predicted by solving the averaged Fokker-Planck-Kolmogorov equation associated with the optimally controlled completely observable linear system and solving the Riccati equation for the estimated error of system states. An example is given to illustrate the procedure and effectiveness of the proposed control strategy.

  12. hp-Pseudospectral method for solving continuous-time nonlinear optimal control problems

    Science.gov (United States)

    Darby, Christopher L.

    2011-12-01

    In this dissertation, a direct hp-pseudospectral method for approximating the solution to nonlinear optimal control problems is proposed. The hp-pseudospectral method utilizes a variable number of approximating intervals and variable-degree polynomial approximations of the state within each interval. Using the hp-discretization, the continuous-time optimal control problem is transcribed to a finite-dimensional nonlinear programming problem (NLP). The differential-algebraic constraints of the optimal control problem are enforced at a finite set of collocation points, where the collocation points are either the Legendre-Gauss or Legendre-Gauss-Radau quadrature points. These sets of points are chosen because they correspond to high-accuracy Gaussian quadrature rules for approximating the integral of a function. Moreover, Runge phenomenon for high-degree Lagrange polynomial approximations to the state is avoided by using these points. The key features of the hp-method include computational sparsity associated with low-order polynomial approximations and rapid convergence rates associated with higher-degree polynomials approximations. Consequently, the hp-method is both highly accurate and computationally efficient. Two hp-adaptive algorithms are developed that demonstrate the utility of the hp-approach. The algorithms are shown to accurately approximate the solution to general continuous-time optimal control problems in a computationally efficient manner without a priori knowledge of the solution structure. The hp-algorithms are compared empirically against local (h) and global (p) collocation methods over a wide range of problems and are found to be more efficient and more accurate. The hp-pseudospectral approach developed in this research not only provides a high-accuracy approximation to the state and control of an optimal control problem, but also provides high-accuracy approximations to the costate of the optimal control problem. The costate is approximated by

  13. Optimal control of nonlinear continuous-time systems in strict-feedback form.

    Science.gov (United States)

    Zargarzadeh, Hassan; Dierks, Travis; Jagannathan, Sarangapani

    2015-10-01

    This paper proposes a novel optimal tracking control scheme for nonlinear continuous-time systems in strict-feedback form with uncertain dynamics. The optimal tracking problem is transformed into an equivalent optimal regulation problem through a feedforward adaptive control input that is generated by modifying the standard backstepping technique. Subsequently, a neural network-based optimal control scheme is introduced to estimate the cost, or value function, over an infinite horizon for the resulting nonlinear continuous-time systems in affine form when the internal dynamics are unknown. The estimated cost function is then used to obtain the optimal feedback control input; therefore, the overall optimal control input for the nonlinear continuous-time system in strict-feedback form includes the feedforward plus the optimal feedback terms. It is shown that the estimated cost function minimizes the Hamilton-Jacobi-Bellman estimation error in a forward-in-time manner without using any value or policy iterations. Finally, optimal output feedback control is introduced through the design of a suitable observer. Lyapunov theory is utilized to show the overall stability of the proposed schemes without requiring an initial admissible controller. Simulation examples are provided to validate the theoretical results.

  14. A BPTT-like Min-Max Optimal Control Algorithm for Nonlinear Systems

    Science.gov (United States)

    Milić, Vladimir; Kasać, Josip; Majetić, Dubravko; Šitum, Željko

    2010-09-01

    This paper presents a conjugate gradient-based algorithm for feedback min-max optimal control of nonlinear systems. The algorithm has a backward-in-time recurrent structure similar to the back propagation through time (BPTT) algorithm. The control law is given as the output of the one-layer neural network. Main contribution of the paper includes the integration of BPTT techniques, conjugate gradient methods, Adams method for solving ODEs and automatic differentiation (AD), to provide an effective, novel algorithm for solving numerically optimally min-max control problems. The proposed algorithm is applied to the rotational/translational actuator (RTAC) nonlinear benchmark problem with control and state vector constraints.

  15. A new SQP algorithm and numerical experiments for nonlinear inequality constrained optimization problem

    Directory of Open Access Journals (Sweden)

    Mahdi Sohrabi-Haghighat

    2014-06-01

    Full Text Available In this paper, a new algorithm based on SQP method is presented to solve the nonlinear inequality constrained optimization problem. As compared with the other existing SQP methods, per single iteration, the basic feasible descent direction is computed by solving at most two equality constrained quadratic programming. Furthermore, there is no need for any auxiliary problem to obtain the coefficients and update the parameters. Under some suitable conditions, the global and superlinear convergence are shown. Keywords: Global convergence, Inequality constrained optimization, Nonlinear programming problem, SQP method, Superlinear convergence rate.

  16. STOCHASTIC OPTIMAL VIBRATION CONTROL OF PARTIALLY OBSERVABLE NONLINEAR QUASI HAMILTONIAN SYSTEMS WITH ACTUATOR SATURATION

    Institute of Scientific and Technical Information of China (English)

    Ronghua Huan; Lincong Chen; Weiliang Jin; Weiqiu Zhu

    2009-01-01

    An optimal vibration control strategy for partially observable nonlinear quasi Hamil-tonian systems with actuator saturation is proposed. First, a controlled partially observable non-linear system is converted into a completely observable linear control system of finite dimension based on the theorem due to Charalambous and Elliott. Then the partially averaged Ito stochas-tic differential equations and dynamical programming equation associated with the completely observable linear system are derived by using the stochastic averaging method and stochastic dynamical programming principle, respectively. The optimal control law is obtained from solving the final dynamical programming equation. The results show that the proposed control strategy has high control effectiveness and control efficiency.

  17. Methods for optimizing over the efficient and weakly efficient sets of an affine fractional vector optimization program

    DEFF Research Database (Denmark)

    Le, T.H.A.; Pham, D. T.; Canh, Nam Nguyen;

    2010-01-01

    Both the efficient and weakly efficient sets of an affine fractional vector optimization problem, in general, are neither convex nor given explicitly. Optimization problems over one of these sets are thus nonconvex. We propose two methods for optimizing a real-valued function over the efficient a...

  18. Optimal gate-width setting for passive neutrons multiplicity counting

    Energy Technology Data Exchange (ETDEWEB)

    Croft, Stephen [Los Alamos National Laboratory; Evans, Louise G [Los Alamos National Laboratory; Schear, Melissa A [Los Alamos National Laboratory

    2010-01-01

    When setting up a passive neutron coincidence counter it is natural to ask what coincidence gate settings should be used to optimize the counting precision. If the gate width is too short then signal is lost and the precision is compromised because in a given period only a few coincidence events will be observed. On the other hand if the gate is too large the signal will be maximized but it will also be compromised by the high level of random pile-up or Accidental coincidence events which must be subtracted. In the case of shift register electronics connected to an assay chamber with an exponential dieaway profile operating in the regime where the Accidentals rate dominates the Reals coincidence rate but where dead-time is not a concern, simple arguments allow one to show that the relative precision on the net Reals rate is minimized when the coincidence gate is set to about 1.2 times the lie dieaway time of the system. In this work we show that making the same assumptions it is easy to show that the relative precision on the Triples rates is also at a minimum when the relative precision of the Doubles (or Reals) is at a minimum. Although the analysis is straightforward to our knowledge such a discussion has not been documented in the literature before. Actual measurement systems do not always behave in the ideal we choose to model them. Fortunately however the variation in the relative precision as a function of gate width is rather flat for traditional safeguards counters and so the performance is somewhat forgiving of the exact choice. The derivation further serves to delineate the important parameters which determine the relative counting precision of the Doubles and Triples rates under the regime considered. To illustrate the similarities and differences we consider the relative standard deviation that might be anticipated for a passive correlation count of an axial section of a spent nuclear fuel assembly under practically achievable conditions.

  19. Optimization of Nonlinear Transport-Production Task of Medical Waste

    Science.gov (United States)

    Michlowicz, Edward

    2012-09-01

    The paper reflects on optimization of transportation - production tasks for the processing of medical waste. For the existing network of collection points and processing plants, according to its algorithm, the optimal allocation of tasks to the cost of transport to the respective plants has to be determined. It was assumed that the functions determining the processing costs are polynomials of the second degree. To solve the problem, a program written in MatLab environment equalization algorithm based on a marginal cost JCC was used.

  20. A monotonic method for solving nonlinear optimal control problems

    CERN Document Server

    Salomon, Julien

    2009-01-01

    Initially introduced in the framework of quantum control, the so-called monotonic algorithms have shown excellent numerical results when dealing with various bilinear optimal control problems. This paper aims at presenting a unified formulation of such procedures and the intrinsic assumptions they require. In this framework, we prove the feasibility of the general algorithm. Finally, we explain how these assumptions can be relaxed.

  1. Distributed Event-Based Set-Membership Filtering for a Class of Nonlinear Systems With Sensor Saturations Over Sensor Networks.

    Science.gov (United States)

    Ma, Lifeng; Wang, Zidong; Lam, Hak-Keung; Kyriakoulis, Nikos

    2016-07-07

    In this paper, the distributed set-membership filtering problem is investigated for a class of discrete time-varying system with an event-based communication mechanism over sensor networks. The system under consideration is subject to sector-bounded nonlinearity, unknown but bounded noises and sensor saturations. Each intelligent sensing node transmits the data to its neighbors only when certain triggering condition is violated. By means of a set of recursive matrix inequalities, sufficient conditions are derived for the existence of the desired distributed event-based filter which is capable of confining the system state in certain ellipsoidal regions centered at the estimates. Within the established theoretical framework, two additional optimization problems are formulated: one is to seek the minimal ellipsoids (in the sense of matrix trace) for the best filtering performance, and the other is to maximize the triggering threshold so as to reduce the triggering frequency with satisfactory filtering performance. A numerically attractive chaos algorithm is employed to solve the optimization problems. Finally, an illustrative example is presented to demonstrate the effectiveness and applicability of the proposed algorithm.

  2. Modeling and Optimization of Vehicle Suspension Employing a Nonlinear Fluid Inerter

    Directory of Open Access Journals (Sweden)

    Yujie Shen

    2016-01-01

    Full Text Available An ideal inerter has been applied to various vibration engineering fields because of its superior vibration isolation performance. This paper proposes a new type of fluid inerter and analyzes the nonlinearities including friction and nonlinear damping force caused by the viscosity of fluid. The nonlinear model of fluid inerter is demonstrated by the experiments analysis. Furthermore, the full-car dynamic model involving the nonlinear fluid inerter is established. It has been detected that the performance of the vehicle suspension may be influenced by the nonlinearities of inerter. So, parameters of the suspension system including the spring stiffness and the damping coefficient are optimized by means of QGA (quantum genetic algorithm, which combines the genetic algorithm and quantum computing. Results indicate that, compared with the original nonlinear suspension system, the RMS (root-mean-square of vertical body acceleration of optimized suspension has decreased by 9.0%, the RMS of pitch angular acceleration has decreased by 19.9%, and the RMS of roll angular acceleration has decreased by 9.6%.

  3. Nonlinear stochastic optimal bounded control of hysteretic systems with actuator saturation

    Institute of Scientific and Technical Information of China (English)

    Rong-hua HUAN; Wei-qiu ZHU; Yong-jun WU

    2008-01-01

    A modified nonlinear stochastic optimal bounded control strategy for random excited hysteretic systems with actuator saturation is proposed. First, a controlled hysteretic system is converted into an equivalent nonlinear nonhysteretic stochastic system. Then, the partially averaged It6 stochastic differential equation and dynamical programming equation are established, respectively, by using the stochastic averaging method for quasi non-integrable Hamiltonian systems and stochastic dynamical programming principle, from which the optimal control law consisting of optimal unbounded control and bang-bang control is derived. Finally, the response of optimally controlled system is predicted by solving the Fokker-Planck-Kolmogorov (FPK) equation associated with the fully averaged It6 equation. Numerical results show that the proposed control strategy has high control effectiveness and efficiency.

  4. Nonlinear Systems Feedback Linearization Optimal Zero-State-Error Control Under Disturbances Compensation

    Directory of Open Access Journals (Sweden)

    Gao Dexin

    2012-10-01

    Full Text Available This paper concentrates on the solution of state feedback exact linearization zero steady-state error optimal control problem for nonlinear systems affected by external disturbances. Firstly, the nonlinear system model with external disturbances is converted to quasi-linear system model by differential homeomorphism. Using Internal Model Optional Control (IMOC, the disturbances compensator is designed, which exactly offset the impact of external disturbances on the system. Taking the  system and the disturbances compensator in series, a new augmented system is obtained. Then the zero steady-state error optimal control problem is transformed into the optimal regulator design problem of an augmented system, and the optimal static error feedback control law is designed according to the different quadratic performance index. At last, the simulation results show the effectiveness of the method.

  5. Stochastic optimal control of partially observable nonlinear quasi-integrable Hamiltonian systems

    Institute of Scientific and Technical Information of China (English)

    2010-01-01

    The stochastic optimal control of partially observable nonlinear quasi-integrable Hamiltonian systems is investigated. First, the stochastic optimal control problem of a partially observable nonlinear quasi-integrable Hamiltonian system is converted into that of a completely observable linear system based on a theorem due to Charalambous and Elliot. Then, the converted stochastic optimal control problem is solved by applying the stochastic averaging method and the stochastic dynamical programming principle. The response of the controlled quasi Hamiltonian system is predicted by solving the averaged Fokker-Planck-Kolmogorov equation and the Riccati equation for the estimated error of system states. As an example to illustrate the procedure and effectiveness of the proposed method, the stochastic optimal control problem of a partially observable two-degree-of-freedom quasi-integrable Hamiltonian system is worked out in detail.

  6. STOCHASTIC OPTIMAL CONTROL OF STRONGLY NONLINEAR SYSTEMS UNDER WIDE-BAND RANDOM EXCITATION WITH ACTUATOR SATURATION

    Institute of Scientific and Technical Information of China (English)

    Changshui Feng; Weiqiu Zhu

    2008-01-01

    A bounded optimal control strategy for strongly non-linear systems under non-white wide-band random excitation with actuator saturation is proposed. First, the stochastic averaging method is introduced for controlled strongly non-linear systems under wide-band random excitation using generalized harmonic functions. Then, the dynamical programming equation for the saturated control problem is formulated from the partially averaged Ito equation based on the dynamical programming principle. The optimal control consisting of the unbounded optimal control and the bounded bang-bang control is determined by solving the dynamical programming equation. Finally, the response of the optimally controlled system is predicted by solving the reduced Fokker-Planck-Kolmogorov (FPK) equation associated with the completed averaged Ito equation. An example is given to illustrate the proposed control strategy. Numerical results show that the proposed control strategy has high control effectiveness and efficiency and the chattering is reduced significantly comparing with the bang-bang control strategy.

  7. Nonlinear Control of an Autonomous Quadrotor Unmanned Aerial Vehicle using Backstepping Controller Optimized by Particle Swarm Optimization

    Directory of Open Access Journals (Sweden)

    Mohd Ariffanan Mohd Basri

    2015-09-01

    Full Text Available Quadrotor unmanned aerial vehicle (UAV is an unstable nonlinear control system. Therefore, the development of a high performance controller for such a multi-input and multi-output (MIMO system is important. The backstepping controller (BC has been successfully applied to control a variety of nonlinear systems. Conventionally, control parameters of a BC are usually chosen arbitrarily. The problems in this method are the adjustment is time demanding and a designer can never tell exactly what are the optimal control parameters should be selected. In this paper, the contribution is focused on an optimal control design for stabilization and trajectory tracking of a quadrotor UAV. Firstly, a dynamic model of the aerial vehicle is mathematically formulated. Then, an optimal backstepping controller (OBC is proposed. The particle swarm optimization (PSO algorithm is used to compute control parameters of the OBC. Finally, simulation results of a highly nonlinear quadrotor system are presented to demonstrate the effectiveness of the proposed control method. From the simulation results it is observed that the OBC tuned by PSO provides a high control performance of an autonomous quadrotor UAV.

  8. Efficient Output Solution for Nonlinear Stochastic Optimal Control Problem with Model-Reality Differences

    Directory of Open Access Journals (Sweden)

    Sie Long Kek

    2015-01-01

    Full Text Available A computational approach is proposed for solving the discrete time nonlinear stochastic optimal control problem. Our aim is to obtain the optimal output solution of the original optimal control problem through solving the simplified model-based optimal control problem iteratively. In our approach, the adjusted parameters are introduced into the model used such that the differences between the real system and the model used can be computed. Particularly, system optimization and parameter estimation are integrated interactively. On the other hand, the output is measured from the real plant and is fed back into the parameter estimation problem to establish a matching scheme. During the calculation procedure, the iterative solution is updated in order to approximate the true optimal solution of the original optimal control problem despite model-reality differences. For illustration, a wastewater treatment problem is studied and the results show the efficiency of the approach proposed.

  9. OPTIMIZING TERRESTRIAL LASER SCANNING MEASUREMENT SET-UP

    Directory of Open Access Journals (Sweden)

    S. Soudarissanane

    2012-09-01

    Full Text Available One of the main applications of the terrestrial laser scanner is the visualization, modeling and monitoring of man-made structures like buildings. Especially surveying applications require on one hand a quickly obtainable, high resolution point cloud but also need observations with a known and well described quality. To obtain a 3D point cloud, the scene is scanned from different positions around the considered object. The scanning geometry plays an important role in the quality of the resulting point cloud. The ideal set-up for scanning a surface of an object is to position the laser scanner in such a way that the laser beam is near perpendicular to the surface. Due to scanning conditions, such an ideal set-up is in practice not possible. The different incidence angles and ranges of the laser beam on the surface result in 3D points of varying quality. The stand-point of the scanner that gives the best accuracy is generally not known. Using an optimal stand-point of the laser scanner on a scene will improve the quality of individual point measurements and results in a more uniform registered point cloud. The design of an optimum measurement setup is defined such that the optimum stand-points are identified to fulfill predefined quality requirements and to ensure a complete spatial coverage. The additional incidence angle and range constraints on the visibility from a view point ensure that individual scans are not affected by bad scanning geometry effects. A complex and large room that would normally require five view point to be fully covered, would require nineteen view points to obtain full coverage under the range and incidence angle constraints.

  10. Nonlinear optimal filter technique for analyzing energy depositions in TES sensors driven into saturation

    Directory of Open Access Journals (Sweden)

    B. Shank

    2014-11-01

    Full Text Available We present a detailed thermal and electrical model of superconducting transition edge sensors (TESs connected to quasiparticle (qp traps, such as the W TESs connected to Al qp traps used for CDMS (Cryogenic Dark Matter Search Ge and Si detectors. We show that this improved model, together with a straightforward time-domain optimal filter, can be used to analyze pulses well into the nonlinear saturation region and reconstruct absorbed energies with optimal energy resolution.

  11. Nonlinear program based optimization of boost and buck-boost converter designs

    Science.gov (United States)

    Rahman, S.; Lee, F. C.

    1981-01-01

    The facility of an Augmented Lagrangian (ALAG) multiplier based nonlinear programming technique is demonstrated for minimum-weight design optimizations of boost and buck-boost power converters. Certain important features of ALAG are presented in the framework of a comprehensive design example for buck-boost power converter design optimization. The study provides refreshing design insight of power converters and presents such information as weight and loss profiles of various semiconductor components and magnetics as a function of the switching frequency.

  12. Nonlinear Optimal Filter Technique For Analyzing Energy Depositions In TES Sensors Driven Into Saturation

    CERN Document Server

    Shank, B; Cabrera, B; Kreikebaum, J M; Moffatt, R; Redl, P; Young, B A; Brink, P L; Cherry, M; Tomada, A

    2014-01-01

    We present a detailed thermal and electrical model of superconducting transition edge sensors (TESs) connected to quasiparticle (qp) traps, such as the W TESs connected to Al qp traps used for CDMS (Cryogenic Dark Matter Search) Ge and Si detectors. We show that this improved model, together with a straightforward time-domain optimal filter, can be used to analyze pulses well into the nonlinear saturation region and reconstruct absorbed energies with optimal energy resolution.

  13. Adaptive set-point tracking of the Lorenz chaotic system using non-linear feedback

    Energy Technology Data Exchange (ETDEWEB)

    Haghighatdar, F. [Department of Electronic Engineering, University of Isfahan, Hezar-Jerib St., Postal code: 8174673441, Isfahan (Iran, Islamic Republic of)], E-mail: fr_haghighat@yahoo.com; Ataei, M. [Department of Electronic Engineering, University of Isfahan, Hezar-Jerib St., Postal code: 8174673441, Isfahan (Iran, Islamic Republic of)], E-mail: mataei1971@yahoo.com

    2009-05-30

    In this paper, an adaptive control method for set-point tracking of the Lorenz chaotic system by using non-linear feedback is proposed. The design procedure of the proposed controller is accomplished in two steps. At the first step, using Lyapunov's direct method, a non-linear state feedback is selected so that without any need to apply identification techniques, in despite of the uncertain parameters existence in the system state equations, the asymptotic stability of the general Lorenz system is guaranteed in a stochastic point of the manifold containing general system equilibrium points. At the second step, a linear state feedback with adaptive gain is added to the prior controller to eliminate the tracking error. In order to guarantee the system asymptotic stability at desired set-point, the indirect Lyapunov's method is used. Finally, to show the effectiveness of the proposed methodology, the simulation results of different experiments including system parameters changes and set-point variation are provided.

  14. RCLED Optimization and Nonlinearity Compensation in a Polymer Optical Fiber DMT System

    Directory of Open Access Journals (Sweden)

    Pu Miao

    2016-09-01

    Full Text Available In polymer optical fiber (POF systems, the nonlinear transfer function of the resonant cavity light emitting diode (RCLED drastically degrades the communication performance. After investigating the characteristics of the RCLED nonlinear behavior, an improved digital look-up-table (LUT pre-distorter, based on an adaptive iterative algorithm, is proposed. Additionally, the system parameters, including the bias current, the average electrical power, the LUT size and the step factor are also jointly optimized to achieve a trade-off between the system linearity, reliability and the computational complexity. With the proposed methodology, both the operating point and efficiency of RCLED are enhanced. Moreover, in the practical 50 m POF communication system with the discrete multi-tone (DMT modulation, the bit error rate performance is improved by over 12 dB when RCLED is operating in the nonlinear region. Therefore, the proposed pre-distorter can both resist the nonlinearity and improve the operating point of RCLED.

  15. Parallel axes gear set optimization in two-parameter space

    Science.gov (United States)

    Theberge, Y.; Cardou, A.; Cloutier, L.

    1991-05-01

    This paper presents a method for optimal spur and helical gear transmission design that may be used in a computer aided design (CAD) approach. The design objective is generally taken as obtaining the most compact set for a given power input and gear ratio. A mixed design procedure is employed which relies both on heuristic considerations and computer capabilities. Strength and kinematic constraints are considered in order to define the domain of feasible designs. Constraints allowed include: pinion tooth bending strength, gear tooth bending strength, surface stress (resistance to pitting), scoring resistance, pinion involute interference, gear involute interference, minimum pinion tooth thickness, minimum gear tooth thickness, and profile or transverse contact ratio. A computer program was developed which allows the user to input the problem parameters, to select the calculation procedure, to see constraint curves in graphic display, to have an objective function level curve drawn through the design space, to point at a feasible design point and to have constraint values calculated at that point. The user can also modify some of the parameters during the design process.

  16. Algorithm for Finding Optimal Gene Sets in Microarray Prediction

    CERN Document Server

    Deutsch, J M

    2001-01-01

    Motivation: Microarray data has been recently been shown to be efficacious in distinguishing closely related cell types that often appear in the diagnosis of cancer. It is useful to determine the minimum number of genes needed to do such a diagnosis both for clinical use and to determine the importance of specific genes for cancer. Here a replication algorithm is used for this purpose. It evolves an ensemble of predictors, all using different combinations of genes to generate a set of optimal predictors. Results: We apply this method to the leukemia data of the Whitehead/MIT group that attempts to differentially diagnose two kinds of leukemia, and also to data of Khan et. al. to distinguish four different kinds of childhood cancers. In the latter case we were able to reduce the number of genes needed from 96 down to 15, while at the same time being able to perfectly classify all of their test data. Availability: http://stravinsky.ucsc.edu/josh/gesses/ Contact: josh@physics.ucsc.edu

  17. A Class of Parameter Estimation Methods for Nonlinear Muskingum Model Using Hybrid Invasive Weed Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    Aijia Ouyang

    2015-01-01

    Full Text Available Nonlinear Muskingum models are important tools in hydrological forecasting. In this paper, we have come up with a class of new discretization schemes including a parameter θ to approximate the nonlinear Muskingum model based on general trapezoid formulas. The accuracy of these schemes is second order, if θ≠1/3, but interestingly when θ=1/3, the accuracy of the presented scheme gets improved to third order. Then, the present schemes are transformed into an unconstrained optimization problem which can be solved by a hybrid invasive weed optimization (HIWO algorithm. Finally, a numerical example is provided to illustrate the effectiveness of the present methods. The numerical results substantiate the fact that the presented methods have better precision in estimating the parameters of nonlinear Muskingum models.

  18. Simple procedures for imposing constraints for nonlinear least squares optimization

    Energy Technology Data Exchange (ETDEWEB)

    Carvalho, R. [Petrobras, Rio de Janeiro (Brazil); Thompson, L.G.; Redner, R.; Reynolds, A.C. [Univ. of Tulsa, OK (United States)

    1995-12-31

    Nonlinear regression method (least squares, least absolute value, etc.) have gained acceptance as practical technology for analyzing well-test pressure data. Even for relatively simple problems, however, commonly used algorithms sometimes converge to nonfeasible parameter estimates (e.g., negative permeabilities) resulting in a failure of the method. The primary objective of this work is to present a new method for imaging the objective function across all boundaries imposed to satisfy physical constraints on the parameters. The algorithm is extremely simple and reliable. The method uses an equivalent unconstrained objective function to impose the physical constraints required in the original problem. Thus, it can be used with standard unconstrained least squares software without reprogramming and provides a viable alternative to penalty functions for imposing constraints when estimating well and reservoir parameters from pressure transient data. In this work, the authors also present two methods of implementing the penalty function approach for imposing parameter constraints in a general unconstrained least squares algorithm. Based on their experience, the new imaging method always converges to a feasible solution in less time than the penalty function methods.

  19. Optimal experimental design for non-linear models theory and applications

    CERN Document Server

    Kitsos, Christos P

    2013-01-01

    This book tackles the Optimal Non-Linear Experimental Design problem from an applications perspective. At the same time it offers extensive mathematical background material that avoids technicalities, making it accessible to non-mathematicians: Biologists, Medical Statisticians, Sociologists, Engineers, Chemists and Physicists will find new approaches to conducting their experiments. The book is recommended for Graduate Students and Researchers.

  20. Conditional nonlinear optimal perturbations of the double-gyre ocean circulation

    NARCIS (Netherlands)

    Terwisscha van Scheltinga, A.D.; Dijkstra, H.A.

    2008-01-01

    In this paper, we study the development of finite amplitude perturbations on linearly stable steady barotropic double-gyre flows in a rectangular basin using the concept of Conditional Nonlinear Optimal Perturbation (CNOP). The CNOPs depend on a time scale of evolution te and an initial perturbation

  1. Optimal Relay Power Allocation for Amplify-and-Forward Relay Networks with Non-linear Power Amplifiers

    OpenAIRE

    Zhang, Chao; Ren, Pinyi; Peng, Jingbo; Wei, Guo; Du, Qinghe; Wang, Yichen

    2011-01-01

    In this paper, we propose an optimal relay power allocation of an Amplify-and-Forward relay networks with non-linear power amplifiers. Based on Bussgang Linearization Theory, we depict the non-linear amplifying process into a linear system, which lets analyzing system performance easier. To obtain spatial diversity, we design a complete practical framework of a non-linear distortion aware receiver. Consider a total relay power constraint, we propose an optimal power allocation scheme to maxim...

  2. Nonlinear Thermodynamic Analysis and Optimization of a Carnot Engine Cycle

    Directory of Open Access Journals (Sweden)

    Michel Feidt

    2016-06-01

    Full Text Available As part of the efforts to unify the various branches of Irreversible Thermodynamics, the proposed work reconsiders the approach of the Carnot engine taking into account the finite physical dimensions (heat transfer conductances and the finite speed of the piston. The models introduce the irreversibility of the engine by two methods involving different constraints. The first method introduces the irreversibility by a so-called irreversibility ratio in the entropy balance applied to the cycle, while in the second method it is emphasized by the entropy generation rate. Various forms of heat transfer laws are analyzed, but most of the results are given for the case of the linear law. Also, individual cases are studied and reported in order to provide a simple analytical form of the results. The engine model developed allowed a formal optimization using the calculus of variations.

  3. Robust C subroutines for non-linear optimization

    DEFF Research Database (Denmark)

    Brock, Pernille; Madsen, Kaj; Nielsen, Hans Bruun

    2004-01-01

    to worry about special parameters controlling the iterations. For convenience we include an option for numerical checking of the user s implementation of the gradient. Note that another report [3] presents a collection of robust subroutines for both unconstrained and constrained optimization...... by changing 1 to 0. The present report is a new and updated version of a previous report NI-91-03 with the same title, [16]. Both the previous and the present report describe a collection of subroutines, which have been translated from Fortran to C. The reason for writing the present report is that some...... of the C subroutines have been replaced by more effective and robust versions translated from the original Fortran subroutines to C by the Bandler Group, see [1]. Also the test examples have been modi ed to some extent. For a description of the original Fortran subroutines see the report [17]. The software...

  4. ON THE GENERALIZED FRITZ JOHN OPTIMALITY CONDITIONS OF VECTOR OPTIMIZATION WITH SET-VALUED MAPS UNDER BENSON PROPER EFFICIENCY

    Institute of Scientific and Technical Information of China (English)

    盛宝怀; 刘三阳

    2002-01-01

    A kind of tangent derivative and the concepts of strong and weak *pseudoconvexity for a set-valued map are introduced. By the standard separation theorems ofthe convex sets and cones the optimality Fritz John condition of set-valued optimization underBenson proper efficiency is established, its sufficience is discussed. The form of theoptimality conditions obtained here completely tally with the classical results when the set-valued map is specialized to be a single-valued map.

  5. Optimization of massive countermeasure design in complex rockfall settings

    Science.gov (United States)

    Agliardi, Federico; Crosta, Giovanni B.

    2015-04-01

    Rockfall protection is a major need in areas impended by subvertical rockwalls with complex 3D morphology and little or no talus to provide natural rockfall attenuation. The design of massive embankments, usually required to ensure such protection, is particularly difficult in complex rockfall settings, due to: widespread occurrence of rockfall sources; difficult characterization of size distribution and location of unstable volumes; variability of failure mechanisms; spatial scattering of rockfall trajectories; high expected kinetic energies. Moreover, rockwalls in complex lithological and structural settings are often prone to mass falls related to rock mass sector collapses. All these issues may hamper a safe application of classic embankment analysis approaches, using empirical rules or 2D-based height/energy statistics, and point to the need of integrated analyses of rock slope instability and rockfall runout in 3D. We explore the potential of combining advanced rock mass characterisation techniques and 3D rockfall modelling to support challenging countermeasure design at a site near Lecco (Southern Alps, Italy). Here subvertical cliffs up to 600 m high impend on a narrow (flat land along the Como Lake shore. Rock is thickly bedded limestone (Dolomia Principale Fm) involved in a ENE-trending, S-verging kilometre-scale anticline fold. The spatial variability of bedding attitude and fracture intensity is strongly controlled by the geological structure, with individual block sizes varying in the range 0.2-15 m3. This results in spatially variable rockfall susceptibility and mechanisms, from single block falls to mass falls. Several rockfall events occurred between 1981 and 2010 motivated the design of slope benching and a massive embankment. To support reliable design verification and optimization we performed a 3D assessment of both rock slope instability and rockfall runout. We characterised fracture patterns and rock mass quality associated to different

  6. Nonlinear analysis of vehicle control actuations based on controlled invariant sets

    Directory of Open Access Journals (Sweden)

    Németh Balázs

    2016-03-01

    Full Text Available In the paper, an analysis method is applied to the lateral stabilization problem of vehicle systems. The aim is to find the largest state-space region in which the lateral stability of the vehicle can be guaranteed by the peak-bounded control input. In the analysis, the nonlinear polynomial sum-of-squares programming method is applied. A practical computation technique is developed to calculate the maximum controlled invariant set of the system. The method calculates the maximum controlled invariant sets of the steering and braking control systems at various velocities and road conditions. Illustration examples show that, depending on the environments, different vehicle dynamic regions can be reached and stabilized by these controllers. The results can be applied to the theoretical basis of their interventions into the vehicle control system.

  7. A theoretical and computational setting for a geometrically nonlinear gradient damage modelling framework

    Science.gov (United States)

    Nedjar, B.

    The present work deals with the extension to the geometrically nonlinear case of recently proposed ideas on elastic- and elastoplastic-damage modelling frameworks within the infinitesimal theory. The particularity of these models is that the damage part of the modelling involves the gradient of damage quantity which, together with the equations of motion, are ensuing from a new formulation of the principle of virtual power. It is shown how the thermodynamics of irreversible processes is crucial in the characterization of the dissipative phenomena and in setting the convenient forms for the constitutive relations. On the numerical side, we discuss the problem of numerically integrating these equations and the implementation within the context of the finite element method is described in detail. And finally, we present a set of representative numerical simulations to illustrate the effectiveness of the proposed framework.

  8. Adaptive optimal control of highly dissipative nonlinear spatially distributed processes with neuro-dynamic programming.

    Science.gov (United States)

    Luo, Biao; Wu, Huai-Ning; Li, Han-Xiong

    2015-04-01

    Highly dissipative nonlinear partial differential equations (PDEs) are widely employed to describe the system dynamics of industrial spatially distributed processes (SDPs). In this paper, we consider the optimal control problem of the general highly dissipative SDPs, and propose an adaptive optimal control approach based on neuro-dynamic programming (NDP). Initially, Karhunen-Loève decomposition is employed to compute empirical eigenfunctions (EEFs) of the SDP based on the method of snapshots. These EEFs together with singular perturbation technique are then used to obtain a finite-dimensional slow subsystem of ordinary differential equations that accurately describes the dominant dynamics of the PDE system. Subsequently, the optimal control problem is reformulated on the basis of the slow subsystem, which is further converted to solve a Hamilton-Jacobi-Bellman (HJB) equation. HJB equation is a nonlinear PDE that has proven to be impossible to solve analytically. Thus, an adaptive optimal control method is developed via NDP that solves the HJB equation online using neural network (NN) for approximating the value function; and an online NN weight tuning law is proposed without requiring an initial stabilizing control policy. Moreover, by involving the NN estimation error, we prove that the original closed-loop PDE system with the adaptive optimal control policy is semiglobally uniformly ultimately bounded. Finally, the developed method is tested on a nonlinear diffusion-convection-reaction process and applied to a temperature cooling fin of high-speed aerospace vehicle, and the achieved results show its effectiveness.

  9. Topology optimization problems with design-dependent sets of constraints

    DEFF Research Database (Denmark)

    Schou, Marie-Louise Højlund

    Topology optimization is a design tool which is used in numerous fields. It can be used whenever the design is driven by weight and strength considerations. The basic concept of topology optimization is the interpretation of partial differential equation coefficients as effective material...... structural topology optimization problems. For such problems a stress constraint for an element should only be present in the optimization problem when the structural design variable corresponding to this element has a value greater than zero. We model the stress constrained topology optimization problem...... using both discrete and continuous design variables. Using discrete design variables is the natural modeling frame. However, we cannot solve real-size problems with the technological limits of today. Using continuous design variables makes it possible to also study topology optimization problems...

  10. Nonlinear dynamics optimization with particle swarm and genetic algorithms for SPEAR3 emittance upgrade

    Energy Technology Data Exchange (ETDEWEB)

    Huang, Xiaobiao; Safranek, James

    2014-09-01

    Nonlinear dynamics optimization is carried out for a low emittance upgrade lattice of SPEAR3 in order to improve its dynamic aperture and Touschek lifetime. Two multi-objective optimization algorithms, a genetic algorithm and a particle swarm algorithm, are used for this study. The performance of the two algorithms are compared. The result shows that the particle swarm algorithm converges significantly faster to similar or better solutions than the genetic algorithm and it does not require seeding of good solutions in the initial population. These advantages of the particle swarm algorithm may make it more suitable for many accelerator optimization applications.

  11. Optimal detection of a change-set in a spatial Poisson process

    CERN Document Server

    Ivanoff, B Gail; 10.1214/09-AAP629

    2010-01-01

    We generalize the classic change-point problem to a "change-set" framework: a spatial Poisson process changes its intensity on an unobservable random set. Optimal detection of the set is defined by maximizing the expected value of a gain function. In the case that the unknown change-set is defined by a locally finite set of incomparable points, we present a sufficient condition for optimal detection of the set using multiparameter martingale techniques. Two examples are discussed.

  12. Optimal Parameter Tuning in a Predictive Nonlinear Control Method for a Mobile Robot

    Directory of Open Access Journals (Sweden)

    D. Hazry

    2006-01-01

    Full Text Available This study contributes to a new optimal parameter tuning in a predictive nonlinear control method for stable trajectory straight line tracking with a non-holonomic mobile robot. In this method, the focus lies in finding the optimal parameter estimation and to predict the path that the mobile robot will follow for stable trajectory straight line tracking system. The stability control contains three parameters: 1 deflection parameter for the traveling direction of the mobile robot 2 deflection parameter for the distance across traveling direction of the mobile robot and 3 deflection parameter for the steering angle of the mobile robot . Two hundred and seventy three experimental were performed and the results have been analyzed and described herewith. It is found that by using a new optimal parameter tuning in a predictive nonlinear control method derived from the extension of kinematics model, the movement of the mobile robot is stabilized and adhered to the reference posture

  13. Reinforcement learning for adaptive optimal control of unknown continuous-time nonlinear systems with input constraints

    Science.gov (United States)

    Yang, Xiong; Liu, Derong; Wang, Ding

    2014-03-01

    In this paper, an adaptive reinforcement learning-based solution is developed for the infinite-horizon optimal control problem of constrained-input continuous-time nonlinear systems in the presence of nonlinearities with unknown structures. Two different types of neural networks (NNs) are employed to approximate the Hamilton-Jacobi-Bellman equation. That is, an recurrent NN is constructed to identify the unknown dynamical system, and two feedforward NNs are used as the actor and the critic to approximate the optimal control and the optimal cost, respectively. Based on this framework, the action NN and the critic NN are tuned simultaneously, without the requirement for the knowledge of system drift dynamics. Moreover, by using Lyapunov's direct method, the weights of the action NN and the critic NN are guaranteed to be uniformly ultimately bounded, while keeping the closed-loop system stable. To demonstrate the effectiveness of the present approach, simulation results are illustrated.

  14. Evolution of optimal Hill coefficients in nonlinear public goods games.

    Science.gov (United States)

    Archetti, Marco; Scheuring, István

    2016-10-07

    In evolutionary game theory, the effect of public goods like diffusible molecules has been modelled using linear, concave, sigmoid and step functions. The observation that biological systems are often sigmoid input-output functions, as described by the Hill equation, suggests that a sigmoid function is more realistic. The Michaelis-Menten model of enzyme kinetics, however, predicts a concave function, and while mechanistic explanations of sigmoid kinetics exist, we lack an adaptive explanation: what is the evolutionary advantage of a sigmoid benefit function? We analyse public goods games in which the shape of the benefit function can evolve, in order to determine the optimal and evolutionarily stable Hill coefficients. We find that, while the dynamics depends on whether output is controlled at the level of the individual or the population, intermediate or high Hill coefficients often evolve, leading to sigmoid input-output functions that for some parameters are so steep to resemble a step function (an on-off switch). Our results suggest that, even when the shape of the benefit function is unknown, biological public goods should be modelled using a sigmoid or step function rather than a linear or concave function.

  15. Optimal Control for Multistage Nonlinear Dynamic System of Microbial Bioconversion in Batch Culture

    Directory of Open Access Journals (Sweden)

    Lei Wang

    2011-01-01

    Full Text Available In batch culture of glycerol biodissimilation to 1,3-propanediol (1,3-PD, the aim of adding glycerol is to obtain as much 1,3-PD as possible. Taking the yield intensity of 1,3-PD as the performance index and the initial concentration of biomass, glycerol, and terminal time as the control vector, we propose an optimal control model subject to a multistage nonlinear dynamical system and constraints of continuous state. A computational approach is constructed to seek the solution of the above model. Firstly, we transform the optimal control problem into the one with fixed terminal time. Secondly, we transcribe the optimal control model into an unconstrained one based on the penalty functions and an extension of the state space. Finally, by approximating the control function with simple functions, we transform the unconstrained optimal control problem into a sequence of nonlinear programming problems, which can be solved using gradient-based optimization techniques. The convergence analysis and optimality function of the algorithm are also investigated. Numerical results show that, by employing the optimal control, the concentration of 1,3-PD at the terminal time can be increased, compared with the previous results.

  16. Constrained Optimal Stochastic Control of Non-Linear Wave Energy Point Absorbers

    DEFF Research Database (Denmark)

    Sichani, Mahdi Teimouri; Chen, Jian-Bing; Kramer, Morten

    2014-01-01

    The paper deals with the stochastic optimal control of a wave energy point absorber with strong nonlinear buoyancy forces using the reactive force from the electric generator on the absorber as control force. The considered point absorber has only one degree of freedom, heave motion, which is used...... presented in the paper. The effect of nonlinear buoyancy force – in comparison to linear buoyancy force – and constraints of the controller on the power outtake of the device have been studied in details and supported by numerical simulations....

  17. On the algebraic representation of certain optimal non-linear binary codes

    CERN Document Server

    Greferath, Marcus

    2011-01-01

    This paper investigates some optimal non-linear codes, in particular cyclic codes, by considering them as (non-linear) codes over Z_4. We use the Fourier transform as well as subgroups of the unit group of a group ring to analyse these codes. In particular we find a presentation of Best's (10, 40, 4) code as a coset of a subgroup in the unit group of a ring, and derive a simple decoding algorithm from this presentation. We also apply this technique to analyse Julin's (12, 144, 4) code and the (12, 24, 12) Hadamard code, as well as to construct a (14, 56, 6) binary code.

  18. Efficient Genetic Algorithm sets for optimizing constrained building design problem

    National Research Council Canada - National Science Library

    Wright, Jonathan; Alajmi, Ali

    2016-01-01

    .... This requires trying large possible solutions which need heuristic optimization algorithms. A comparison between several heuristic optimization algorithms showed that Genetic Algorithm (GA) is robust on getting the optimum(s) simulation ( Wetter and Wright, 2004; Brownlee et al., 2011; Bichiou and Krarti, 2011; Sahu et al., 2012 ) while the building simulat...

  19. Topology optimization problems with design-dependent sets of constraints

    DEFF Research Database (Denmark)

    Schou, Marie-Louise Højlund

    Topology optimization is a design tool which is used in numerous fields. It can be used whenever the design is driven by weight and strength considerations. The basic concept of topology optimization is the interpretation of partial differential equation coefficients as effective material...... properties and designing through changing these coefficients. For example, consider a continuous structure. Then the basic concept is to represent this structure by small pieces of material that are coinciding with the elements of a finite element model of the structure. This thesis treats stress constrained...... structural topology optimization problems. For such problems a stress constraint for an element should only be present in the optimization problem when the structural design variable corresponding to this element has a value greater than zero. We model the stress constrained topology optimization problem...

  20. Multi-parameter Sensitivity Analysis and Application Research in the Robust Optimization Design for Complex Nonlinear System

    Institute of Scientific and Technical Information of China (English)

    MA Tao; ZHANG Weigang; ZHANG Yang; TANG Ting

    2015-01-01

    The current research of complex nonlinear system robust optimization mainly focuses on the features of design parameters, such as probability density functions, boundary conditions, etc. After parameters study, high-dimensional curve or robust control design is used to find an accurate robust solution. However, there may exist complex interaction between parameters and practical engineering system. With the increase of the number of parameters, it is getting hard to determine high-dimensional curves and robust control methods, thus it’s difficult to get the robust design solutions. In this paper, a method of global sensitivity analysis based on divided variables in groups is proposed. By making relevant variables in one group and keeping each other independent among sets of variables, global sensitivity analysis is conducted in grouped variables and the importance of parameters is evaluated by calculating the contribution value of each parameter to the total variance of system response. By ranking the importance of input parameters, relatively important parameters are chosen to conduct robust design analysis of the system. By applying this method to the robust optimization design of a real complex nonlinear system-a vehicle occupant restraint system with multi-parameter, good solution is gained and the response variance of the objective function is reduced to 0.01, which indicates that the robustness of the occupant restraint system is improved in a great degree and the method is effective and valuable for the robust design of complex nonlinear system. This research proposes a new method which can be used to obtain solutions for complex nonlinear system robust design.

  1. OPTIMIZED LOCAL TERNARY PATTERNS: A NEW TEXTURE MODEL WITH SET OF OPTIMAL PATTERNS FOR TEXTURE ANALYSIS

    Directory of Open Access Journals (Sweden)

    G. Madasamy Raja

    2013-01-01

    Full Text Available Texture analysis is one of the important as well as useful tasks in image processing applications. Many texture models have been developed over the past few years and Local Binary Patterns (LBP is one of the simple and efficient approach among them. A number of extensions to the LBP method have been also presented but the problem remains challenging in feature vector generation and comparison. As textures are oriented and scaled differently, a texture model should effectively handle grey-scale variation, rotation variation, illumination variation and noise. The length of the feature vector in a texture model also plays an important role in deciding the time complexity of the texture analysis. This study proposes a new texture model, called Optimized Local Ternary Patterns (OLTP in the spatial methods of texture analysis. The proposed texture model is based on Local Ternary Patterns (LTP, which in turn is based on LBP. A new concept called “Level of Optimality” to select the optimal set of patterns is discussed in this study. This proposed texture model uses only optimal patterns to extract the textural information from the digital images and thereby reducing the length of the feature vector. This proposed model is robust to image rotation, grey-scale transformation, histogram equalization and noise. The results are compared with other widely used texture models by applying classification tests to variety of texture images from the standard Brodatz texture database. Experimental results prove that the proposed texture model is robust to grey-scale variation, image rotation, histogram equalization and noise. Experimental results also show that the proposed texture model improves the classification accuracy and the speed of the classification process. In all tested tasks, the proposed method outperforms the earlier methods.

  2. Groundwater flow due to a nonlinear wave set-up on a permeable beach

    Directory of Open Access Journals (Sweden)

    Anna Przyborska

    2014-06-01

    Full Text Available Water flow through the beach body plays an important role in the biological status of the organisms inhabiting the beach sand. For tideless seas, the groundwater flow in shallow water is governed entirely by the surface wave dynamics on the beach. As waves propagate towards the shore, they become steeper owing to the decreasing water depth and at some depth, the waves lose their stability and start to break. When waves break, their energy is dissipated and the spatial changes of the radiation stress give rise to changes in the mean sea level, known as the set-up. The mean shore pressure gradient due to the wave set-up drives the groundwater circulation within the beach zone. This paper discusses the circulation of groundwater resulting from a nonlinear set-up. The circulation of flow is compared with the classic Longuet-Higgins (1983 solution and the time series of the set-up is considered for a 24 h storm. Water infiltrates into the coastal aquifer on the upper part of the beach near the maximum run-up and exfiltration occurs on the lower part of the beach face near the breaking point.

  3. Incorporation of Fixed Installation Costs into Optimization of Groundwater Remediation with a New Efficient Surrogate Nonlinear Mixed Integer Optimization Algorithm

    Science.gov (United States)

    Shoemaker, Christine; Wan, Ying

    2016-04-01

    Optimization of nonlinear water resources management issues which have a mixture of fixed (e.g. construction cost for a well) and variable (e.g. cost per gallon of water pumped) costs has been not well addressed because prior algorithms for the resulting nonlinear mixed integer problems have required many groundwater simulations (with different configurations of decision variable), especially when the solution space is multimodal. In particular heuristic methods like genetic algorithms have often been used in the water resources area, but they require so many groundwater simulations that only small systems have been solved. Hence there is a need to have a method that reduces the number of expensive groundwater simulations. A recently published algorithm for nonlinear mixed integer programming using surrogates was shown in this study to greatly reduce the computational effort for obtaining accurate answers to problems involving fixed costs for well construction as well as variable costs for pumping because of a substantial reduction in the number of groundwater simulations required to obtain an accurate answer. Results are presented for a US EPA hazardous waste site. The nonlinear mixed integer surrogate algorithm is general and can be used on other problems arising in hydrology with open source codes in Matlab and python ("pySOT" in Bitbucket).

  4. Simplex sliding mode control for nonlinear uncertain systems via chaos optimization

    Energy Technology Data Exchange (ETDEWEB)

    Lu, Zhao; Shieh, Leang-San; Chen, Guanrong; Coleman, Norman P

    2005-02-01

    As an emerging effective approach to nonlinear robust control, simplex sliding mode control demonstrates some attractive features not possessed by the conventional sliding mode control method, from both theoretical and practical points of view. However, no systematic approach is currently available for computing the simplex control vectors in nonlinear sliding mode control. In this paper, chaos-based optimization is exploited so as to develop a systematic approach to seeking the simplex control vectors; particularly, the flexibility of simplex control is enhanced by making the simplex control vectors dependent on the Euclidean norm of the sliding vector rather than being constant, which result in both reduction of the chattering and speedup of the convergence. Computer simulation on a nonlinear uncertain system is given to illustrate the effectiveness of the proposed control method.

  5. Model-based optimal design of experiments - semidefinite and nonlinear programming formulations.

    Science.gov (United States)

    Duarte, Belmiro P M; Wong, Weng Kee; Oliveira, Nuno M C

    2016-02-15

    We use mathematical programming tools, such as Semidefinite Programming (SDP) and Nonlinear Programming (NLP)-based formulations to find optimal designs for models used in chemistry and chemical engineering. In particular, we employ local design-based setups in linear models and a Bayesian setup in nonlinear models to find optimal designs. In the latter case, Gaussian Quadrature Formulas (GQFs) are used to evaluate the optimality criterion averaged over the prior distribution for the model parameters. Mathematical programming techniques are then applied to solve the optimization problems. Because such methods require the design space be discretized, we also evaluate the impact of the discretization scheme on the generated design. We demonstrate the techniques for finding D-, A- and E-optimal designs using design problems in biochemical engineering and show the method can also be directly applied to tackle additional issues, such as heteroscedasticity in the model. Our results show that the NLP formulation produces highly efficient D-optimal designs but is computationally less efficient than that required for the SDP formulation. The efficiencies of the generated designs from the two methods are generally very close and so we recommend the SDP formulation in practice.

  6. Nonlinear Dissipation Heat Devices in Finite-Time Thermodynamics: An Analysis of the Trade-Off Optimization

    Science.gov (United States)

    Lu, Can-can; Bai, Long

    2017-06-01

    The nonlinear dissipation heat devices are proposed by means of generalizing the low-dissipation heat devices to the quadratic order case. The dimensionless formulas of the output (input) power and the efficiency (coefficient of performance) for the nonlinear dissipation heat engines (refrigerators) are derived in terms of characteristic parameters for heat devices and the dimensional analysis. Based on the trade-off criterion, the optimal performance of the nonlinear dissipation heat devices is discussed in depth, and some system-specific properties for the nonlinear dissipation heat devices under the trade-off optimization are also uncovered. Our results may provide practical insight for designing actual heat engines and refrigerators.

  7. CONE-DIRECTED CONTINGENT DERIVATIVES AND GENERALIZED PREINVEX SET-VALUED OPTIMIZATION

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    By using cone-directed contingent derivatives, the unified necessary and sufficient optimality conditions are given for weakly and strongly minimal elements respectively in generalized preinvex set-valued optimization.

  8. An optimal approach to active damping of nonlinear vibrations in composite plates using piezoelectric patches

    Science.gov (United States)

    Saviz, M. R.

    2015-11-01

    In this paper a nonlinear approach to studying the vibration characteristic of laminated composite plate with surface-bonded piezoelectric layer/patch is formulated, based on the Green Lagrange type of strain-displacements relations, by incorporating higher-order terms arising from nonlinear relations of kinematics into mathematical formulations. The equations of motion are obtained through the energy method, based on Lagrange equations and by using higher-order shear deformation theories with von Karman-type nonlinearities, so that transverse shear strains vanish at the top and bottom surfaces of the plate. An isoparametric finite element model is provided to model the nonlinear dynamics of the smart plate with piezoelectric layer/ patch. Different boundary conditions are investigated. Optimal locations of piezoelectric patches are found using a genetic algorithm to maximize spatial controllability/observability and considering the effect of residual modes to reduce spillover effect. Active attenuation of vibration of laminated composite plate is achieved through an optimal control law with inequality constraint, which is related to the maximum and minimum values of allowable voltage in the piezoelectric elements. To keep the voltages of actuator pairs in an allowable limit, the Pontryagin’s minimum principle is implemented in a system with multi-inequality constraint of control inputs. The results are compared with similar ones, proving the accuracy of the model especially for the structures undergoing large deformations. The convergence is studied and nonlinear frequencies are obtained for different thickness ratios. The structural coupling between plate and piezoelectric actuators is analyzed. Some examples with new features are presented, indicating that the piezo-patches significantly improve the damping characteristics of the plate for suppressing the geometrically nonlinear transient vibrations.

  9. Design and regularization of neural networks: the optimal use of a validation set

    DEFF Research Database (Denmark)

    Larsen, Jan; Hansen, Lars Kai; Svarer, Claus;

    1996-01-01

    We derive novel algorithms for estimation of regularization parameters and for optimization of neural net architectures based on a validation set. Regularisation parameters are estimated using an iterative gradient descent scheme. Architecture optimization is performed by approximative combinator......We derive novel algorithms for estimation of regularization parameters and for optimization of neural net architectures based on a validation set. Regularisation parameters are estimated using an iterative gradient descent scheme. Architecture optimization is performed by approximative...

  10. Study on Rail Profile Optimization Based on the Nonlinear Relationship between Profile and Wear Rate

    Directory of Open Access Journals (Sweden)

    Jianxi Wang

    2017-01-01

    Full Text Available This paper proposes a rail profile optimization method that takes account of wear rate within design cycle so as to minimize rail wear at the curve in heavy haul railway and extend the service life of rail. Taking rail wear rate as the object function, the vertical coordinate of rail profile at range optimization as independent variable, and the geometric characteristics and grinding depth of rail profile as constraint conditions, the support vector machine regression theory was used to fit the nonlinear relationship between rail profile and its wear rate. Then, the profile optimization model was built. Based on the optimization principle of genetic algorithm, the profile optimization model was solved to achieve the optimal rail profile. A multibody dynamics model was used to check the dynamic performance of carriage running on optimal rail profile. The result showed that the average relative error of support vector machine regression model remained less than 10% after a number of training processes. The dynamic performance of carriage running on optimized rail profile met the requirements on safety index and stability. The wear rate of optimized profile was lower than that of standard profile by 5.8%; the allowable carrying gross weight increased by 12.7%.

  11. A Quadratic precision generalized nonlinear global optimization migration velocity inversion method

    Institute of Scientific and Technical Information of China (English)

    Zhao Taiyin; Hu Guangmin; He Zhenhua; Huang Deji

    2009-01-01

    An important research topic for prospecting seismology is to provide a fast accurate velocity model from pre-stack depth migration. Aiming at such a problem, we propose a quadratic precision generalized nonlinear global optimization migration velocity inversion. First we discard the assumption that there is a linear relationship between residual depth and residual velocity and propose a velocity model correction equation with quadratic precision which enables the velocity model from each iteration to approach the real model as quickly as possible. Second, we use a generalized nonlinear inversion to get the global optimal velocity perturbation model to all traces. This method can expedite the convergence speed and also can decrease the probability of falling into a local minimum during inversion. The synthetic data and Marmousi data examples show that our method has a higher precision and needs only a few iterations and consequently enhances the practicability and accuracy of migration velocity analysis (MVA) in complex areas.

  12. Infinite horizon self-learning optimal control of nonaffine discrete-time nonlinear systems.

    Science.gov (United States)

    Wei, Qinglai; Liu, Derong; Yang, Xiong

    2015-04-01

    In this paper, a novel iterative adaptive dynamic programming (ADP)-based infinite horizon self-learning optimal control algorithm, called generalized policy iteration algorithm, is developed for nonaffine discrete-time (DT) nonlinear systems. Generalized policy iteration algorithm is a general idea of interacting policy and value iteration algorithms of ADP. The developed generalized policy iteration algorithm permits an arbitrary positive semidefinite function to initialize the algorithm, where two iteration indices are used for policy improvement and policy evaluation, respectively. It is the first time that the convergence, admissibility, and optimality properties of the generalized policy iteration algorithm for DT nonlinear systems are analyzed. Neural networks are used to implement the developed algorithm. Finally, numerical examples are presented to illustrate the performance of the developed algorithm.

  13. Optimal filtering for uncertain systems with stochastic nonlinearities, correlated noises and missing measurements

    Institute of Scientific and Technical Information of China (English)

    Shuo Zhang,Yan Zhao,Min Li,; Jianhui Zhao

    2015-01-01

    The global y optimal recursive filtering problem is stu-died for a class of systems with random parameter matrices, stochastic nonlinearities, correlated noises and missing measure-ments. The stochastic nonlinearities are presented in the system model to reflect multiplicative random disturbances, and the addi-tive noises, process noise and measurement noise, are assumed to be one-step autocorrelated as wel as two-step cross-correlated. A series of random variables is introduced as the missing rates governing the intermittent measurement losses caused by un-favorable network conditions. The aim of the addressed filtering problem is to design an optimal recursive filter for the uncertain systems based on an innovation approach such that the filtering error is global y minimized at each sampling time. A numerical simulation example is provided to il ustrate the effectiveness and applicability of the proposed algorithm.

  14. Series-based approximate approach of optimal tracking control for nonlinear systems with time-delay

    Institute of Scientific and Technical Information of China (English)

    Gongyou Tang; Mingqu Fan

    2008-01-01

    The optimal output tracking control (OTC) problem for nonlinear systems with time-delay is considered.Using a series-based approx-imate approach,the original OTC problem is transformed into iteration solving linear two-point boundary value problems without time-delay.The OTC law obtained consists of analytical linear feedback and feedforward terms and a nonlinear compensation term with an infinite series of the adjoint vectors.By truncating a finite sum of the adjoint vector series,an approximate optimal tracking control law is obtained.A reduced-order reference input observer is constructed to make the feedforward term physically realizable.Simulation exam-pies are used to test the validity of the series-based approximate approach.

  15. Optimal tetrahedral mesh generation for three-dimensional point set

    Institute of Scientific and Technical Information of China (English)

    秦开怀; 吴边; 关右江; 葛振州

    1997-01-01

    Three-dimensional (3D) tnangulation is a basic topic in computer graphics. It is considered very difficult to obtain the global optimal 3D triangulatlon, such as the triangulation which satisfies the max-min solid angle criterion A new method called genetic tetrahedral mesh generation algorithm (GTMGA for short) is presented. GT-MGA is based on the principle of genetic algorithm and aims at the global optimal triangulation. With a multi-objective fitness function, GTMGA is able to perform optimizations for different requirements. New crossover operator and mutation operator, polyhedron crossover and polyhedron mutation, are used in GTMGA. It is shown by the experimental results that GTMGA works better than both the 3D Delaunay triangulation and the algorithm based on local transformations.

  16. Nonlinear Time Series Prediction Using LS-SVM with Chaotic Mutation Evolutionary Programming for Parameter Optimization

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    Nonlinear time series prediction is studied by using an improved least squares support vector machine (LSSVM) regression based on chaotic mutation evolutionary programming (CMEP) approach for parameter optimization.We analyze how the prediction error varies with different parameters (σ, γ) in LS-SVM. In order to select appropriate parameters for the prediction model, we employ CMEP algorithm. Finally, Nasdaq stock data are predicted by using this LS-SVM regression based on CMEP, and satisfactory results are obtained.

  17. A NONMONOTONE TRUST REGION ALGORITHM FOR NONLINEAR OPTIMIZATION SUBJECT TO GENERAL CONSTRAINTS

    Institute of Scientific and Technical Information of China (English)

    Hongchao Zhang

    2003-01-01

    In this paper we present a nonmonotone trust region algorithm for general nonlinear constrained optimization problems. The main idea of this paper is to combine Yuan's technique[1] with a nonmonotone method similar to Ke and Han [2]. This new algorithm may not only keep the robust properties of the algorithm given by Yuan, but also have some advantages led by the nonmonotone technique. Under very mild conditions, global convergence for the algorithm is given. Numerical experiments demonstrate the efficiency of the algorithm.

  18. Field computation in non-linear magnetic media using particle swarm optimization

    Energy Technology Data Exchange (ETDEWEB)

    Adly, A.A. E-mail: amradlya@intouch.com; Abd-El-Hafiz, S.K

    2004-05-01

    This paper presents an automated particle swarm optimization approach using which field computations may be carried out in devices involving non-linear magnetic media. Among the advantages of the proposed approach are its ability to handle complex geometries and its computational efficiency. The proposed approach has been implemented and computations were carried out for an electromagnet subject to different DC excitation conditions. These computations showed good agreement with the results obtained by the finite-element approach.

  19. A New Subspace Correction Method for Nonlinear Unconstrained Convex Optimization Problems

    Institute of Scientific and Technical Information of China (English)

    Rong-liang CHEN; Jin-ping ZENG

    2012-01-01

    This paper gives a new subspace correction algorithm for nonlinear unconstrained convex optimization problems based on the multigrid approach proposed by S.Nash in 2000 and the subspace correction algorithm proposed by X.Tai and J.Xu in 2001.Under some reasonable assumptions,we obtain the convergence as well as a convergence rate estimate for the algorithm.Numerical results show that the algorithm is effective.

  20. Active-Set Reduced-Space Methods with Nonlinear Elimination for Two-Phase Flow Problems in Porous Media

    KAUST Repository

    Yang, Haijian

    2016-07-26

    Fully implicit methods are drawing more attention in scientific and engineering applications due to the allowance of large time steps in extreme-scale simulations. When using a fully implicit method to solve two-phase flow problems in porous media, one major challenge is the solution of the resultant nonlinear system at each time step. To solve such nonlinear systems, traditional nonlinear iterative methods, such as the class of the Newton methods, often fail to achieve the desired convergent rate due to the high nonlinearity of the system and/or the violation of the boundedness requirement of the saturation. In the paper, we reformulate the two-phase model as a variational inequality that naturally ensures the physical feasibility of the saturation variable. The variational inequality is then solved by an active-set reduced-space method with a nonlinear elimination preconditioner to remove the high nonlinear components that often causes the failure of the nonlinear iteration for convergence. To validate the effectiveness of the proposed method, we compare it with the classical implicit pressure-explicit saturation method for two-phase flow problems with strong heterogeneity. The numerical results show that our nonlinear solver overcomes the often severe limits on the time step associated with existing methods, results in superior convergence performance, and achieves reduction in the total computing time by more than one order of magnitude.

  1. KUHN-TUCKER CONDITION AND WOLFE DUALITY OF PREINVEX SET-VALUED OPTIMIZATION

    Institute of Scientific and Technical Information of China (English)

    SHENG Bao-huai; LIU San-yang

    2006-01-01

    The optimality Kuhn-Tucker condition and the wolfe duality for the preinvex set-valued optimization are investigated. Firstly, the concepts of alpha-order G-invex set and the alpha-order S-preinvex set-valued function were introduced, from which the properties of the corresponding contingent cone and the alpha-order contingent derivative were studied. Finally, the optimality Kuhn-Tucker condition and the Wolfe duality theorem for the alpha-order S-preinvex set-valued optimization were presented with the help of the alpha-order contingent derivative.

  2. The solution of singular optimal control problems using direct collocation and nonlinear programming

    Science.gov (United States)

    Downey, James R.; Conway, Bruce A.

    1992-08-01

    This paper describes work on the determination of optimal rocket trajectories which may include singular arcs. In recent years direct collocation and nonlinear programming has proven to be a powerful method for solving optimal control problems. Difficulties in the application of this method can occur if the problem is singular. Techniques exist for solving singular problems indirectly using the associated adjoint formulation. Unfortunately, the adjoints are not a part of the direct formulation. It is shown how adjoint information can be obtained from the direct method to allow the solution of singular problems.

  3. Economic Optimization of Spray Dryer Operation using Nonlinear Model Predictive Control with State Estimation

    DEFF Research Database (Denmark)

    Petersen, Lars Norbert; Jørgensen, John Bagterp; Rawlings, James B.

    2015-01-01

    In this paper, we develop an economically optimizing Nonlinear Model Predictive Controller (E-NMPC) for a complete spray drying plant with multiple stages. In the E-NMPC the initial state is estimated by an extended Kalman Filter (EKF) with noise covariances estimated by an autocovariance least...... squares method (ALS). We present a model for the spray drying plant and use this model for simulation as well as for prediction in the E-NMPC. The open-loop optimal control problem in the E-NMPC is solved using the single-shooting method combined with a quasi-Newton Sequential Quadratic programming (SQP...

  4. Role of the conjugated spacer in the optimization of second-order nonlinear chromophores

    Science.gov (United States)

    Pérez-Moreno, Javier; Clays, Koen; Kuzyk, Mark G.

    2009-08-01

    We investigate the role of the conjugated spacer in the optimization of the first hyperpolarizability of organic chromophores. We propose a novel strategy for the optimization of the first hyperpolarizability that is based on the variation of the degree of conjugation for the bridge that separates the donor and acceptors at the end of push-pull type chromophores. The correlation between the type of conjugated spacer and the experimental nonlinear performance of the chromophores is investigated and interpreted in the context of the quantum limits.

  5. Approximate Optimal Control of Affine Nonlinear Continuous-Time Systems Using Event-Sampled Neurodynamic Programming.

    Science.gov (United States)

    Sahoo, Avimanyu; Xu, Hao; Jagannathan, Sarangapani

    2017-03-01

    This paper presents an approximate optimal control of nonlinear continuous-time systems in affine form by using the adaptive dynamic programming (ADP) with event-sampled state and input vectors. The knowledge of the system dynamics is relaxed by using a neural network (NN) identifier with event-sampled inputs. The value function, which becomes an approximate solution to the Hamilton-Jacobi-Bellman equation, is generated by using event-sampled NN approximator. Subsequently, the NN identifier and the approximated value function are utilized to obtain the optimal control policy. Both the identifier and value function approximator weights are tuned only at the event-sampled instants leading to an aperiodic update scheme. A novel adaptive event sampling condition is designed to determine the sampling instants, such that the approximation accuracy and the stability are maintained. A positive lower bound on the minimum inter-sample time is guaranteed to avoid accumulation point, and the dependence of inter-sample time upon the NN weight estimates is analyzed. A local ultimate boundedness of the resulting nonlinear impulsive dynamical closed-loop system is shown. Finally, a numerical example is utilized to evaluate the performance of the near-optimal design. The net result is the design of an event-sampled ADP-based controller for nonlinear continuous-time systems.

  6. Approximate optimal control for a class of nonlinear discrete-time systems with saturating actuators

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    In this paper, we solve the approximate optimal control problem for a class of nonlinear discrete-time systems with saturating actu- ators via greedy iterative Heuristic Dynamic Programming (GI-HDP) algorithm. In order to deal with the saturating problem of actu- ators, a novel nonquadratic functional is developed. Based on the nonquadratic functional, the GI-HDP algorithm is introduced to obtain the optimal saturated controller with a rigorous convergence analysis. For facilitating the implementation of the iterative algo- rithm, three neural networks are used to approximate the value function, compute the optimal control policy and model the unknown plant, respectively. An example is given to demonstrate the validity of the proposed optimal control scheme.

  7. A differentiable reformulation for E-optimal design of experiments in nonlinear dynamic biosystems.

    Science.gov (United States)

    Telen, Dries; Van Riet, Nick; Logist, Flip; Van Impe, Jan

    2015-06-01

    Informative experiments are highly valuable for estimating parameters in nonlinear dynamic bioprocesses. Techniques for optimal experiment design ensure the systematic design of such informative experiments. The E-criterion which can be used as objective function in optimal experiment design requires the maximization of the smallest eigenvalue of the Fisher information matrix. However, one problem with the minimal eigenvalue function is that it can be nondifferentiable. In addition, no closed form expression exists for the computation of eigenvalues of a matrix larger than a 4 by 4 one. As eigenvalues are normally computed with iterative methods, state-of-the-art optimal control solvers are not able to exploit automatic differentiation to compute the derivatives with respect to the decision variables. In the current paper a reformulation strategy from the field of convex optimization is suggested to circumvent these difficulties. This reformulation requires the inclusion of a matrix inequality constraint involving positive semidefiniteness. In this paper, this positive semidefiniteness constraint is imposed via Sylverster's criterion. As a result the maximization of the minimum eigenvalue function can be formulated in standard optimal control solvers through the addition of nonlinear constraints. The presented methodology is successfully illustrated with a case study from the field of predictive microbiology.

  8. Finding Bayesian Optimal Designs for Nonlinear Models: A Semidefinite Programming-Based Approach.

    Science.gov (United States)

    Duarte, Belmiro P M; Wong, Weng Kee

    2015-08-01

    This paper uses semidefinite programming (SDP) to construct Bayesian optimal design for nonlinear regression models. The setup here extends the formulation of the optimal designs problem as an SDP problem from linear to nonlinear models. Gaussian quadrature formulas (GQF) are used to compute the expectation in the Bayesian design criterion, such as D-, A- or E-optimality. As an illustrative example, we demonstrate the approach using the power-logistic model and compare results in the literature. Additionally, we investigate how the optimal design is impacted by different discretising schemes for the design space, different amounts of uncertainty in the parameter values, different choices of GQF and different prior distributions for the vector of model parameters, including normal priors with and without correlated components. Further applications to find Bayesian D-optimal designs with two regressors for a logistic model and a two-variable generalised linear model with a gamma distributed response are discussed, and some limitations of our approach are noted.

  9. Optimal control for nonlinear dynamical system of microbial fed-batch culture

    Science.gov (United States)

    Liu, Chongyang

    2009-10-01

    In fed-batch culture of glycerol bio-dissimilation to 1, 3-propanediol (1, 3-PD), the aim of adding glycerol is to obtain as much 1, 3-PD as possible. So a proper feeding rate is required during the process. Taking the concentration of 1, 3-PD at the terminal time as the performance index and the feeding rate of glycerol as the control function, we propose an optimal control model subject to a nonlinear dynamical system and constraints of continuous state and non-stationary control. A computational approach is constructed to seek the solution of the above model in two aspects. On the one hand we transcribe the optimal control model into an unconstrained one based on the penalty functions and an extension of the state space; on the other hand, by approximating the control function with simple functions, we transform the unconstrained optimal control problem into a sequence of nonlinear programming problems, which can be solved using gradient-based optimization techniques. The convergence analysis of this approximation is also investigated. Numerical results show that, by employing the optimal control policy, the concentration of 1, 3-PD at the terminal time can be increased considerably.

  10. A Space-Time Finite Element Model for Design and Control Optimization of Nonlinear Dynamic Response

    Directory of Open Access Journals (Sweden)

    P.P. Moita

    2008-01-01

    Full Text Available A design and control sensitivity analysis and multicriteria optimization formulation is derived for flexible mechanical systems. This formulation is implemented in an optimum design code and it is applied to the nonlinear dynamic response. By extending the spatial domain to the space-time domain and treating the design variables as control variables that do not change with time, the design space is included in the control space. Thus, one can unify in one single formulation the problems of optimum design and optimal control. Structural dimensions as well as lumped damping and stiffness parameters plus control driven forces, are considered as decision variables. The dynamic response and its sensitivity with respect to the design and control variables are discretized via space-time finite elements, and are integrated at-once, as it is traditionally used for static response. The adjoint system approach is used to determine the design sensitivities. Design optimization numerical examples are performed. Nonlinear programming and optimality criteria may be used for the optimization process. A normalized weighted bound formulation is used to handle multicriteria problems.

  11. Lessons from the quantum control landscape: Robust optimal control of quantum systems and optimal control of nonlinear Schrodinger equations

    Science.gov (United States)

    Hocker, David Lance

    The control of quantum systems occurs across a broad range of length and energy scales in modern science, and efforts have demonstrated that locating suitable controls to perform a range of objectives has been widely successful. The justification for this success arises from a favorable topology of a quantum control landscape, defined as a mapping of the controls to a cost function measuring the success of the operation. This is summarized in the landscape principle that no suboptimal extrema exist on the landscape for well-suited control problems, explaining a trend of successful optimizations in both theory and experiment. This dissertation explores what additional lessons may be gleaned from the quantum control landscape through numerical and theoretical studies. The first topic examines the experimentally relevant problem of assessing and reducing disturbances due to noise. The local curvature of the landscape is found to play an important role on noise effects in the control of targeted quantum unitary operations, and provides a conceptual framework for assessing robustness to noise. Software for assessing noise effects in quantum computing architectures was also developed and applied to survey the performance of current quantum control techniques for quantum computing. A lack of competition between robustness and perfect unitary control operation was discovered to fundamentally limit noise effects, and highlights a renewed focus upon system engineering for reducing noise. This convergent behavior generally arises for any secondary objective in the situation of high primary objective fidelity. The other dissertation topic examines the utility of quantum control for a class of nonlinear Hamiltonians not previously considered under the landscape principle. Nonlinear Schrodinger equations are commonly used to model the dynamics of Bose-Einstein condensates (BECs), one of the largest known quantum objects. Optimizations of BEC dynamics were performed in which the

  12. Optimal allocation of resources in a biomarker setting.

    Science.gov (United States)

    Rosner, Bernard; Hendrickson, Sara; Willett, Walter

    2015-01-30

    Nutrient intake is often measured with substantial error both in commonly used surrogate instruments such as a food frequency questionnaire (FFQ) and in gold standard-type instruments such as a diet record (DR). If there is a correlated error between the FFQ and DR, then standard measurement error correction methods based on regression calibration can produce biased estimates of the regression coefficient (λ) of true intake on surrogate intake. However, if a biomarker exists and the error in the biomarker is independent of the error in the FFQ and DR, then the method of triads can be used to obtain unbiased estimates of λ, provided that there are replicate biomarker data on at least a subsample of validation study subjects. Because biomarker measurements are expensive, for a fixed budget, one can use a either design where a large number of subjects have one biomarker measure and only a small subsample is replicated or a design that has a smaller number of subjects and has most or all subjects validated. The purpose of this paper is to optimize the proportion of subjects with replicated biomarker measures, where optimization is with respect to minimizing the variance of ln(λ̂). The methodology is illustrated using vitamin C intake data from the European Prospective Investigation into Cancer and Nutrition study where plasma vitamin C is the biomarker. In this example, the optimal validation study design is to have 21% of subjects with replicated biomarker measures.

  13. Infinite horizon optimal control of affine nonlinear discrete switched systems using two-stage approximate dynamic programming

    Science.gov (United States)

    Cao, Ning; Zhang, Huaguang; Luo, Yanhong; Feng, Dezhi

    2012-09-01

    In this article, a novel iteration algorithm named two-stage approximate dynamic programming (TSADP) is proposed to seek the solution of nonlinear switched optimal control problem. At each iteration of TSADP, a multivariate optimal control problem is transformed to be a certain number of univariate optimal control problems. It is shown that the value function at each iteration can be characterised pointwisely by a set of smooth functions recursively obtained from TSADP, and the associated control policy, continuous control and switching control law included, is explicitly provided in a state-feedback form. Moreover, the convergence and optimality of TSADP is strictly proven. To implement this algorithm efficiently, neural networks, critic and action networks, are utilised to approximate the value function and continuous control law, respectively. Thus, the value function is expressed by the weights of critic networks pointwise. Besides, redundant weights are ruled out at each iteration to simplify the exponentially increasing computation burden. Finally, a simulation example is provided to demonstrate its effectiveness.

  14. Optimal epsilon-biased sets with just a little randomness

    CERN Document Server

    Moore, Cristopher

    2012-01-01

    Subsets of F_2^n that are eps-biased, meaning that the parity of any set of bits is even or odd with probability eps close to 1/2, are useful tools in derandomization. A simple randomized construction shows that such sets exist of size O(n/eps^2), and known deterministic constructions achieve sets of size O(n/eps^3), O(n^2/eps^2), and O((n/eps^2)^{5/4}). Rather than derandomizing these sets completely in exchange for making them larger, we attempt a partial derandomization while keeping them small, constructing sets of size O(n/eps^2) with as few random bits as possible. The naive randomized construction requires O(n^2/eps^2) random bits. We show that this can be reduced to O(n log (n/eps)) random bits. Our construction uses the Legendre symbol and Weil sums, but in a different way than the construction of Alon, Goldreich, Haastad, and Peralta.

  15. Optimal explicit strong stability preserving Runge–Kutta methods with high linear order and optimal nonlinear order

    KAUST Repository

    Gottlieb, Sigal

    2015-04-10

    High order spatial discretizations with monotonicity properties are often desirable for the solution of hyperbolic PDEs. These methods can advantageously be coupled with high order strong stability preserving time discretizations. The search for high order strong stability time-stepping methods with large allowable strong stability coefficient has been an active area of research over the last two decades. This research has shown that explicit SSP Runge-Kutta methods exist only up to fourth order. However, if we restrict ourselves to solving only linear autonomous problems, the order conditions simplify and this order barrier is lifted: explicit SSP Runge-Kutta methods of any linear order exist. These methods reduce to second order when applied to nonlinear problems. In the current work we aim to find explicit SSP Runge-Kutta methods with large allowable time-step, that feature high linear order and simultaneously have the optimal fourth order nonlinear order. These methods have strong stability coefficients that approach those of the linear methods as the number of stages and the linear order is increased. This work shows that when a high linear order method is desired, it may still be worthwhile to use methods with higher nonlinear order.

  16. A Comparative Study of Applying Active-Set and Interior Point Methods in MPC for Controlling Nonlinear pH Process

    Directory of Open Access Journals (Sweden)

    Syam Syafiie

    2014-06-01

    Full Text Available A comparative study of Model Predictive Control (MPC using active-set method and interior point methods is proposed as a control technique for highly non-linear pH process. The process is a strong acid-strong base system. A strong acid of hydrochloric acid (HCl and a strong base of sodium hydroxide (NaOH with the presence of buffer solution sodium bicarbonate (NaHCO3 are used in a neutralization process flowing into reactor. The non-linear pH neutralization model governed in this process is presented by multi-linear models. Performance of both controllers is studied by evaluating its ability of set-point tracking and disturbance-rejection. Besides, the optimization time is compared between these two methods; both MPC shows the similar performance with no overshoot, offset, and oscillation. However, the conventional active-set method gives a shorter control action time for small scale optimization problem compared to MPC using IPM method for pH control.

  17. Lacunarity Definition For Ramified Data Sets Based On Optimal Cover

    Energy Technology Data Exchange (ETDEWEB)

    Tolle, Charles Robert; Rohrbaugh, David Thomas; Timothy R. McJunkin

    2003-05-01

    Lacunarity is a measure of how data fills space. It complements fractal dimension, which measures how much space is filled. This paper discusses the limitations of the standard gliding box algorithm for calculating lacunarity, which leads to a re-examination of what lacunarity is meant to describe. Two new lacunarity measures for ramified data sets are then presented that more directly measure the gaps in a ramified data set. These measures are rigorously defined. An algorithm for estimating the new lacunarity measure, using Fuzzy-C means clustering algorithm, is developed. The lacunarity estimation algorithm is used to analyze two- and three-dimensional Cantor dusts. Applications for these measures include biological modeling and target detection within ramified data sets.

  18. Optimization of a nonlinear model for predicting the ground vibration using the combinational particle swarm optimization-genetic algorithm

    Science.gov (United States)

    Samareh, Hossein; Khoshrou, Seyed Hassan; Shahriar, Kourosh; Ebadzadeh, Mohammad Mehdi; Eslami, Mohammad

    2017-09-01

    When particle's wave velocity resulting from mining blasts exceeds a certain level, then the intensity of produced vibrations incur damages to the structures around the blasting regions. Development of mathematical models for predicting the peak particle velocity (PPV) based on the properties of the wave emission environment is an appropriate method for better designing of blasting parameters, since the probability of incurred damages can considerably be mitigated by controlling the intensity of vibrations at the building sites. In this research, first out of 11 blasting and geo-mechanical parameters of rock masses, four parameters which had the greatest influence on the vibrational wave velocities were specified using regression analysis. Thereafter, some models were developed for predicting the PPV by nonlinear regression analysis (NLRA) and artificial neural network (ANN) with correlation coefficients of 0.854 and 0.662, respectively. Afterward, the coefficients associated with the parameters in the NLRA model were optimized using optimization particle swarm-genetic algorithm. The values of PPV were estimated for 18 testing dataset in order to evaluate the accuracy of the prediction and performance of the developed models. By calculating statistical indices for the test recorded maps, it was found that the optimized model can predict the PPV with a lower error than the other two models. Furthermore, considering the correlation coefficient (0.75) between the values of the PPV measured and predicted by the optimized nonlinear model, it was found that this model possesses a more desirable performance for predicting the PPV than the other two models.

  19. Depression screening optimization in an academic rural setting.

    Science.gov (United States)

    Aleem, Sohaib; Torrey, William C; Duncan, Mathew S; Hort, Shoshana J; Mecchella, John N

    2015-01-01

    Primary care plays a critical role in screening and management of depression. The purpose of this paper is to focus on leveraging the electronic health record (EHR) as well as work flow redesign to improve the efficiency and reliability of the process of depression screening in two adult primary care clinics of a rural academic institution in USA. The authors utilized various process improvement tools from lean six sigma methodology including project charter, swim lane process maps, critical to quality tree, process control charts, fishbone diagrams, frequency impact matrix, mistake proofing and monitoring plan in Define-Measure-Analyze-Improve-Control format. Interventions included change in depression screening tool, optimization of data entry in EHR. EHR data entry optimization; follow up of positive screen, staff training and EHR redesign. Depression screening rate for office-based primary care visits improved from 17.0 percent at baseline to 75.9 percent in the post-intervention control phase (p<0.001). Follow up of positive depression screen with Patient History Questionnaire-9 data collection remained above 90 percent. Duplication of depression screening increased from 0.6 percent initially to 11.7 percent and then decreased to 4.7 percent after optimization of data entry by patients and flow staff. Impact of interventions on clinical outcomes could not be evaluated. Successful implementation, sustainability and revision of a process improvement initiative to facilitate screening, follow up and management of depression in primary care requires accounting for voice of the process (performance metrics), system limitations and voice of the customer (staff and patients) to overcome various system, customer and human resource constraints.

  20. Optimal value functions of generalized semi-infinite min-max programming on a noncompact set

    Institute of Scientific and Technical Information of China (English)

    WANG; Changyu; YANG; Xiaoqi; YANG; Xinmin

    2005-01-01

    In this paper, we study optimal value functions of generalized semi-infinite min-max programming problems on a noncompact set. Directional derivatives and subdifferential characterizations of optimal value functions are given. Using these properties,we establish first order optimality conditions for unconstrained generalized semi-infinite programming problems.

  1. Bid Optimization for Internet Graphical Ad Auction Systems via Special Ordered Sets

    CERN Document Server

    Wiggins, Ralphe

    2007-01-01

    This paper describes an optimization model for setting bid levels for certain types of advertisements on web pages. This model is non-convex, but we are able to obtain optimal or near-optimal solutions rapidly using branch and cut open-source software. The financial benefits obtained using the prototype system have been substantial.

  2. Optimal tooth numbers for compact standard spur gear sets

    Science.gov (United States)

    Savage, M.; Coy, J.; Townsend, D. P.

    1981-01-01

    The design of a standard gear mesh is treated with the objective of minimizing the gear size for a given ratio, pinion torque, and allowable tooth strength. Scoring, pitting fatigue, bending fatigue, and the kinematic limits of contact ratio and interference are considered. A design space is defined in terms of the number of teeth on the pinion and the diametral pitch. This space is then combined with the objective function of minimum center distance to obtain an optimal design region. This region defines the number of pinion teeth for the most compact design. The number is a function of the gear ratio only. A design example illustrating this procedure is also given.

  3. On the number of support points of maximin and Bayesian D-optimal designs in nonlinear regression models

    OpenAIRE

    Braess, Dietrich; Dette, Holger

    2004-01-01

    We consider maximin and Bayesian D -optimal designs for nonlinear regression models. The maximin criterion requires the specification of a region for the nonlinear parameters in the model, while the Bayesian optimality criterion assumes that a prior distribution for these parameters is available. It was observed empirically by many authors that an increase of uncertainty in the prior information (i.e. a larger range for the parameter space in the maximin criterion or a larger variance of the ...

  4. Optimization models using fuzzy sets and possibility theory

    CERN Document Server

    Orlovski, S

    1987-01-01

    Optimization is of central concern to a number of discip­ lines. Operations Research and Decision Theory are often consi­ dered to be identical with optimizationo But also in other areas such as engineering design, regional policy, logistics and many others, the search for optimal solutions is one of the prime goals. The methods and models which have been used over the last decades in these areas have primarily been "hard" or "crisp", i. e. the solutions were considered to be either fea­ sible or unfeasible, either above a certain aspiration level or below. This dichotomous structure of methods very often forced the modeller to approximate real problem situations of the more-or-less type by yes-or-no-type models, the solutions of which might turn out not to be the solutions to the real prob­ lems. This is particularly true if the problem under considera­ tion includes vaguely defined relationships, human evaluations, uncertainty due to inconsistent or incomplete evidence, if na­ tural language has to be...

  5. Extended Application of the Conditional Nonlinear Optimal Parameter Perturbation Method in the Common Land Model

    Institute of Scientific and Technical Information of China (English)

    WANG Bo; HUO Zhenhua

    2013-01-01

    An extension of the conditional nonlinear optimal parameter perturbation (CNOP-P) method is applied to the parameter optimization of the Common Land Model (CoLM) for the North China Plain with the differential evolution (DE) method.Using National Meteorological Center (NMC) Reanalysis 6-hourly surface flux data and National Center for Environmental Prediction/Department of Energy (NCEP/DOE)Atmospheric Model Intercomparison Project II (AMIP-II) 6-hourly Reanalysis Gaussian Grid data,two experiments (I and II) were designed to investigate the impact of the percentages of sand and clay in the shallow soil in CoLM on its ability to simulate shallow soil moisture.A third experiment (III) was designed to study the shallow soil moisture and latent heat flux simultaneously.In all the three experiments,after the optimization stage,the percentages of sand and clay of the shallow soil were used to predict the shallow soil moisture in the following month.The results show that the optimal parameters can enable CoLM to better simulate shallow soil moisture,with the simulation results of CoLM after the double-parameter optimal experiment being better than the single-parameter optimal experiment in the optimization slot.Furthermore,the optimal parameters were able to significantly improve the prediction results of CoLM at the prediction stage.In addition,whether or not the atmospheric forcing and observational data are accurate can seriously affect the results of optimization,and the more accurate the data are,the more significant the results of optimization may be.

  6. Robust Optimization Using Supremum of the Objective Function for Nonlinear Programming Problems

    Energy Technology Data Exchange (ETDEWEB)

    Lee, Se Jung; Park, Gyung Jin [Hanyang University, Seoul (Korea, Republic of)

    2014-05-15

    In the robust optimization field, the robustness of the objective function emphasizes an insensitive design. In general, the robustness of the objective function can be achieved by reducing the change of the objective function with respect to the variation of the design variables and parameters. However, in conventional methods, when an insensitive design is emphasized, the performance of the objective function can be deteriorated. Besides, if the numbers of the design variables are increased, the numerical cost is quite high in robust optimization for nonlinear programming problems. In this research, the robustness index for the objective function and a process of robust optimization are proposed. Moreover, a method using the supremum of linearized functions is also proposed to reduce the computational cost. Mathematical examples are solved for the verification of the proposed method and the results are compared with those from the conventional methods. The proposed approach improves the performance of the objective function and its efficiency.

  7. Optimal Control of Nonlinear Hydraulic Networks in the Presence of Disturbance

    DEFF Research Database (Denmark)

    Tahavori, Maryamsadat; Leth, John-Josef; Kallesøe, Carsten;

    2014-01-01

    Water leakage is an important component of water loss. Many methods have emerged from urban water supply systems for leakage control, but it still remains a challenge in many countries. Pressure management is an effective way to reduce the leakage in a system. It can also reduce the power consump...... control problem is the interior point method. The method which is used in this paper can be used for a general hydraulic networks to optimize the leakage and energy consumption and to satisfy the demands at the end-users....... consumption. To this end, an optimal control strategy is proposed in this paper. In the water supply system model, the hydraulic resistance of the valve is estimated by the real data from a water supply system and it is considered to be a disturbance. The method which is used to solve the nonlinear optimal...

  8. Cavity-enhanced second harmonic generation via nonlinear-overlap optimization

    CERN Document Server

    Lin, Zin; Loncar, Marko; Johnson, Steven G; Rodriguez, Alejandro W

    2015-01-01

    We describe an approach based on topology optimization that enables automatic discovery of wavelength-scale photonic structures for achieving high-efficiency second-harmonic generation (SHG). A key distinction from previous formulation and designs that seek to maximize Purcell factors at individual frequencies is that our method not only aims to achieve frequency matching (across an entire octave) and large radiative lifetimes, but also optimizes the equally important nonlinear--coupling figure of merit $\\bar{\\beta}$, involving a complicated spatial overlap-integral between modes. We apply this method to the particular problem of optimizing micropost and grating-slab cavities (one-dimensional multilayered structures) and demonstrate that a variety of material platforms can support modes with the requisite frequencies, large lifetimes $Q \\gtrsim 10^3$, small modal volumes $\\sim (\\lambda/n)^3$, and extremely large $\\bar{\\beta} \\gtrsim 10^{-2}$, orders of magnitude larger than the state of the art.

  9. Optimal Algorithms and the BFGS Updating Techniques for Solving Unconstrained Nonlinear Minimization Problems

    Directory of Open Access Journals (Sweden)

    Chein-Shan Liu

    2014-01-01

    Full Text Available To solve an unconstrained nonlinear minimization problem, we propose an optimal algorithm (OA as well as a globally optimal algorithm (GOA, by deflecting the gradient direction to the best descent direction at each iteration step, and with an optimal parameter being derived explicitly. An invariant manifold defined for the model problem in terms of a locally quadratic function is used to derive a purely iterative algorithm and the convergence is proven. Then, the rank-two updating techniques of BFGS are employed, which result in several novel algorithms as being faster than the steepest descent method (SDM and the variable metric method (DFP. Six numerical examples are examined and compared with exact solutions, revealing that the new algorithms of OA, GOA, and the updated ones have superior computational efficiency and accuracy.

  10. Nonlinear Dynamic Characteristics and Optimal Control of SMA Composite Wings Subjected to Stochastic Excitation

    Directory of Open Access Journals (Sweden)

    Zhi-Wen Zhu

    2015-01-01

    Full Text Available A kind of high-aspect-ratio shape memory alloy (SMA composite wing is proposed to reduce the wing’s fluttering. The nonlinear dynamic characteristics and optimal control of the SMA composite wings subjected to in-plane stochastic excitation are investigated where the great bending under the flight loads is considered. The stochastic stability of the system is analyzed, and the system’s response is obtained. The conditions of stochastic Hopf bifurcation are determined, and the probability density of the first-passage time is obtained. Finally, the optimal control strategy is proposed. Numerical simulation shows that the stability of the system varies with bifurcation parameters, and stochastic Hopf bifurcation appears in the process; the reliability of the system is improved through optimal control, and the first-passage time is delayed. Finally, the effects of the control strategy are proved by experiments. The results of this paper are helpful for engineering applications of SMA.

  11. Renormalization Group Invariance and Optimal QCD Renormalization Scale-Setting

    CERN Document Server

    Wu, Xing-Gang; Wang, Sheng-Quan; Fu, Hai-Bing; Ma, Hong-Hao; Brodsky, Stanley J; Mojaza, Matin

    2014-01-01

    A valid prediction from quantum field theory for a physical observable should be independent of the choice of renormalization scheme -- this is the primary requirement of renormalization group invariance (RGI). Satisfying scheme invariance is a challenging problem for perturbative QCD (pQCD), since truncated perturbation series do not automatically satisfy the requirements of the renormalization group. Two distinct approaches for satisfying the RGI principle have been suggested in the literature. One is the "Principle of Maximum Conformality" (PMC) in which the terms associated with the $\\beta$-function are absorbed into the scale of the running coupling at each perturbative order; its predictions are scheme and scale independent at every finite order. The other approach is the "Principle of Minimum Sensitivity" (PMS), which is based on local RGI; the PMS approach determines the optimal renormalization scale by requiring the slope of the approximant of an observable to vanish. In this paper, we present a deta...

  12. Perturbing engine performance measurements to determine optimal engine control settings

    Science.gov (United States)

    Jiang, Li; Lee, Donghoon; Yilmaz, Hakan; Stefanopoulou, Anna

    2014-12-30

    Methods and systems for optimizing a performance of a vehicle engine are provided. The method includes determining an initial value for a first engine control parameter based on one or more detected operating conditions of the vehicle engine, determining a value of an engine performance variable, and artificially perturbing the determined value of the engine performance variable. The initial value for the first engine control parameter is then adjusted based on the perturbed engine performance variable causing the engine performance variable to approach a target engine performance variable. Operation of the vehicle engine is controlled based on the adjusted initial value for the first engine control parameter. These acts are repeated until the engine performance variable approaches the target engine performance variable.

  13. Experimental validation of an optimized signal processing method to handle non-linearity in swept-source optical coherence tomography.

    Science.gov (United States)

    Vergnole, Sébastien; Lévesque, Daniel; Lamouche, Guy

    2010-05-10

    We evaluate various signal processing methods to handle the non-linearity in wavenumber space exhibited by most laser sources for swept-source optical coherence tomography. The following methods are compared for the same set of experimental data: non-uniform discrete Fourier transforms with Vandermonde matrix or with Lomb periodogram, resampling with linear interpolation or spline interpolation prior to fast-Fourier transform (FFT), and resampling with convolution prior to FFT. By selecting an optimized Kaiser-Bessel window to perform the convolution, we show that convolution followed by FFT is the most efficient method. It allows small fractional oversampling factor between 1 and 2, thus a minimal computational time, while retaining an excellent image quality. (c) 2010 Optical Society of America.

  14. A general non-linear optimization algorithm for lower bound limit analysis

    DEFF Research Database (Denmark)

    Krabbenhøft, Kristian; Damkilde, Lars

    2003-01-01

    The non-linear programming problem associated with the discrete lower bound limit analysis problem is treated by means of an algorithm where the need to linearize the yield criteria is avoided. The algorithm is an interior point method and is completely general in the sense that no particular...... finite element discretization or yield criterion is required. As with interior point methods for linear programming the number of iterations is affected only little by the problem size. Some practical implementation issues are discussed with reference to the special structure of the common lower bound...... load optimization problem. and finally the efficiency and accuracy of the method is demonstrated by means of examples of plate and slab structures obeying different non-linear yield criteria. Copyright (C) 2002 John Wiley Sons. Ltd....

  15. The optimal antenna for nonlinear spectroscopy of weakly and strongly scattering nanoobjects

    Science.gov (United States)

    Schumacher, Thorsten; Brandstetter, Matthias; Wolf, Daniela; Kratzer, Kai; Hentschel, Mario; Giessen, Harald; Lippitz, Markus

    2016-04-01

    Optical nanoantennas, i.e., arrangements of plasmonic nanostructures, promise to enhance the light-matter interaction on the nanoscale. In particular, nonlinear optical spectroscopy of single nanoobjects would profit from such an antenna, as nonlinear optical effects are already weak for bulk material, and become almost undetectable for single nanoobjects. We investigate the design of optical nanoantennas for transient absorption spectroscopy in two different cases: the mechanical breathing mode of a metal nanodisk and the quantum-confined carrier dynamics in a single CdSe nanowire. In the latter case, an antenna with a resonance at the desired wavelength optimally increases the light intensity at the nanoobject. In the first case, the perturbation of the antenna by the investigated nanosystem cannot be neglected and off-resonant antennas become most efficient.

  16. Exploring nonlinear relations: models of clinical decision making by regression with optimal scaling.

    Science.gov (United States)

    Hartmann, Armin; Van Der Kooij, Anita J; Zeeck, Almut

    2009-07-01

    In explorative regression studies, linear models are often applied without questioning the linearity of the relations between the predictor variables and the dependent variable, or linear relations are taken as an approximation. In this study, the method of regression with optimal scaling transformations is demonstrated. This method does not require predefined nonlinear functions and results in easy-to-interpret transformations that will show the form of the relations. The method is illustrated using data from a German multicenter project on the indication criteria for inpatient or day clinic psychotherapy treatment. The indication criteria to include in the regression model were selected with the Lasso, which is a tool for predictor selection that overcomes the disadvantages of stepwise regression methods. The resulting prediction model indicates that treatment status is (approximately) linearly related to some criteria and nonlinearly related to others.

  17. Controller Parameter Optimization for Nonlinear Systems Using Enhanced Bacteria Foraging Algorithm

    Directory of Open Access Journals (Sweden)

    V. Rajinikanth

    2012-01-01

    Full Text Available An enhanced bacteria foraging optimization (EBFO algorithm-based Proportional + integral + derivative (PID controller tuning is proposed for a class of nonlinear process models. The EBFO algorithm is a modified form of standard BFO algorithm. A multiobjective performance index is considered to guide the EBFO algorithm for discovering the best possible value of controller parameters. The efficiency of the proposed scheme has been validated through a comparative study with classical BFO, adaptive BFO, PSO, and GA based controller tuning methods proposed in the literature. The proposed algorithm is tested in real time on a nonlinear spherical tank system. The real-time results show that, EBFO tuned PID controller gives a smooth response for setpoint tracking performance.

  18. 有限时区非线性系统的最优切换控制%Optimal Switching Control for Nonlinear Systems in A Finite Duration

    Institute of Scientific and Technical Information of China (English)

    慕小武; 刘海军

    2006-01-01

    This paper proposes a optimal control problem for a general nonlinear systems with finitely many admissible control settings and with costs assigned to switching of controls. With dynamic programming and viscosity solution theory we show that the switching lower-value function is a viscosity solution of the appropriate systems of quasi-variational inequalities(the appropriate generalization of the Hamilton-Jacobi equation in this context)and that the minimal such switching-storage function is equal to the continuous switching lower-value for the game. With the lower value function a optimal switching control is designed for minimizing the cost of running the systems.

  19. On the response of nonlinear viscoelastic materials in creep and stress relaxation experiments in the lubricated squeeze flow setting

    Science.gov (United States)

    Řehoř, Martin; Pr&oring; ša, Vít; T&oring; ma, Karel

    2016-10-01

    Rigorous analysis of the response of nonlinear materials to step inputs requires one to simultaneously handle the discontinuity, differentiation, and nonlinearity. This task is however beyond the reach of the standard theories such as the classical theory of distributions and presents a considerable mathematical difficulty. New advanced mathematical tools are necessary to handle the challenge. An elegant and relatively easy-to-use framework capable of accomplishing the task is provided by the Colombeau algebra, which is a generalisation of the classical theory of distributions to the nonlinear setting. We use the Colombeau algebra formalism and derive explicit formulae describing the response of incompressible Maxwell viscoelastic fluid subject to step load/deformation in the lubricated squeeze flow setting.

  20. Setting the Optimal Exercise Prices of Executive Stock Options

    Institute of Scientific and Technical Information of China (English)

    ZhengyunWu; JinlongZhang

    2004-01-01

    Exercise-price policy is perhaps the central design issue regarding nontradable Executive Stock Options (ESO). In this paper, we give the value line of ESO, V(P), and the range of the incentive-maximizing exercise prices which is defined as the exercise prices that generate incentives, εn(P)/εP, within 1 percent of the maximum using the “certainty equivalence” approach, similar to that adopted by Richard Lambert et al.. Our results show that, holding constant the company's cost of making an option grant, incentives are maximized by setting exercise prices within a range that typically includes the grant-date market price.

  1. Exact relaxation for polynomial optimization on semi-algebraic sets

    OpenAIRE

    Abril Bucero, Marta; Mourrain, Bernard

    2014-01-01

    In this paper, we study the problem of computing by relaxation hierarchies the infimum of a real polynomial function f on a closed basic semialgebraic set and the points where this infimum is reached, if they exist. We show that when the infimum is reached, a relaxation hierarchy constructed from the Karush-Kuhn-Tucker ideal is always exact and that the vanishing ideal of the KKT minimizer points is generated by the kernel of the associated moment matrix in that degree, even if this ideal is ...

  2. Applications of Conditional Nonlinear Optimal Perturbation in Predictability Study and Sensitivity Analysis of Weather and Climate

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    Considering the limitation of the linear theory of singular vector (SV), the authors and their collaborators proposed conditional nonlinear optimal perturbation (CNOP) and then applied it in the predictability study and the sensitivity analysis of weather and climate system. To celebrate the 20th anniversary of Chinese National Committee for World Climate Research Programme (WCRP), this paper is devoted to reviewing the main results of these studies. First, CNOP represents the initial perturbation that has largest nonlinear evolution at prediction time, which is different from linear singular vector (LSV) for the large magnitude of initial perturbation or/and the long optimization time interval. Second, CNOP,rather than linear singular vector (LSV), represents the initial anomaly that evolves into ENSO events most probably. It is also the CNOP that induces the most prominent seasonal variation of error growth for ENSO predictability; furthermore, CNOP was applied to investigate the decadal variability of ENSO asymmetry. It is demonstrated that the changing nonlinearity causes the change of ENSO asymmetry.Third, in the studies of the sensitivity and stability of ocean's thermohaline circulation (THC), the non-linear asymmetric response of THC to finite amplitude of initial perturbations was revealed by CNOP.Through this approach the passive mechanism of decadal variation of THC was demonstrated; Also the authors studies the instability and sensitivity analysis of grassland ecosystem by using CNOP and show the mechanism of the transitions between the grassland and desert states. Finally, a detailed discussion on the results obtained by CNOP suggests the applicability of CNOP in predictability studies and sensitivity analysis.

  3. Nonlinear approach for oil field optimization based on gas lift optimization

    Energy Technology Data Exchange (ETDEWEB)

    Khamehchi, Ehsan; Rashidi, Fariborz [Amirkabir Univ. of Technology, Tehran (Iran). Faculty of Chemical Engineering; Karimi, Behrooz [Amirkabir Univ. of Technology, Tehran (Iran). Faculty of Industrial Engineering; Pourafshary, Peyman [Tehran Univ. (Iran). Petroleum Engineering Inst.

    2009-12-15

    When the initial energy of a virgin reservoir is not sufficient or when this energy falls below a certain limit after a production history, the production rates won't be able to meet economic margins. It is then time for artificial lift methods to come to aid. Among which, gas lift is the most commonly used scenario. Being somehow an ancient tool with an age of over a century, gas lift is though still a challenging problem when overall optimization is the concern. When the injection gas is of limited supply the problem is finding the best gas allocation scheme. However there are ever more cases emerging in certain geographic localities where the gas supplies are usually unlimited. The optimization problem then totally relates to the wellbore and completion string and fully engages with multiphase flow concepts. In the present study an intelligent genetic algorithm has been developed to simultaneously optimize all role playing factors, namely gas injection rate, injection depth and tubing diameter towards the maximum oil production rate with the water cut and injection pressure as the restrictions. The computations and real field data are mutually compared. (orig.)

  4. Adaptive nearly optimal control for a class of continuous-time nonaffine nonlinear systems with inequality constraints.

    Science.gov (United States)

    Fan, Quan-Yong; Yang, Guang-Hong

    2017-01-01

    The state inequality constraints have been hardly considered in the literature on solving the nonlinear optimal control problem based the adaptive dynamic programming (ADP) method. In this paper, an actor-critic (AC) algorithm is developed to solve the optimal control problem with a discounted cost function for a class of state-constrained nonaffine nonlinear systems. To overcome the difficulties resulting from the inequality constraints and the nonaffine nonlinearities of the controlled systems, a novel transformation technique with redesigned slack functions and a pre-compensator method are introduced to convert the constrained optimal control problem into an unconstrained one for affine nonlinear systems. Then, based on the policy iteration (PI) algorithm, an online AC scheme is proposed to learn the nearly optimal control policy for the obtained affine nonlinear dynamics. Using the information of the nonlinear model, novel adaptive update laws are designed to guarantee the convergence of the neural network (NN) weights and the stability of the affine nonlinear dynamics without the requirement for the probing signal. Finally, the effectiveness of the proposed method is validated by simulation studies.

  5. Conditional nonlinear optimal perturbations based on the particle swarm optimization and their applications to the predictability problems

    Science.gov (United States)

    Zheng, Qin; Yang, Zubin; Sha, Jianxin; Yan, Jun

    2017-02-01

    In predictability problem research, the conditional nonlinear optimal perturbation (CNOP) describes the initial perturbation that satisfies a certain constraint condition and causes the largest prediction error at the prediction time. The CNOP has been successfully applied in estimation of the lower bound of maximum predictable time (LBMPT). Generally, CNOPs are calculated by a gradient descent algorithm based on the adjoint model, which is called ADJ-CNOP. This study, through the two-dimensional Ikeda model, investigates the impacts of the nonlinearity on ADJ-CNOP and the corresponding precision problems when using ADJ-CNOP to estimate the LBMPT. Our conclusions are that (1) when the initial perturbation is large or the prediction time is long, the strong nonlinearity of the dynamical model in the prediction variable will lead to failure of the ADJ-CNOP method, and (2) when the objective function has multiple extreme values, ADJ-CNOP has a large probability of producing local CNOPs, hence making a false estimation of the LBMPT. Furthermore, the particle swarm optimization (PSO) algorithm, one kind of intelligent algorithm, is introduced to solve this problem. The method using PSO to compute CNOP is called PSO-CNOP. The results of numerical experiments show that even with a large initial perturbation and long prediction time, or when the objective function has multiple extreme values, PSO-CNOP can always obtain the global CNOP. Since the PSO algorithm is a heuristic search algorithm based on the population, it can overcome the impact of nonlinearity and the disturbance from multiple extremes of the objective function. In addition, to check the estimation accuracy of the LBMPT presented by PSO-CNOP and ADJ-CNOP, we partition the constraint domain of initial perturbations into sufficiently fine grid meshes and take the LBMPT obtained by the filtering method as a benchmark. The result shows that the estimation presented by PSO-CNOP is closer to the true value than the

  6. OSPF Weight Setting Optimization for Single Link Failures

    Directory of Open Access Journals (Sweden)

    Mohammed H. Sqalli

    2011-01-01

    Full Text Available In operational networks, nodes are connected via multiple links for load sharing and redundancy. Thisis done to make sure that a failureof a link does not disconnect or isolate some parts of the network.However, link failures have an effect on routing, as the routers find alternate paths for the trafficoriginally flowing through the link which has failed. This effect is severe in case of failure of a criticallink in the network, such as backbone links or the links carrying higher traffic loads. When routing isdone using the Open Shortest Path First (OSPF routing protocol, the original weight selection for thenormalstate topology may not be as efficient for the failure state. In this paper, we investigate the singlelink failure issue with an objective to find a weight setting which results in efficient routing in normaland failure states. We engineer Tabu Search Iterative heuristic using two different implementationstrategies to solve the OSPF weight setting problem for link failure scenarios. We evaluate theseheuristics and show through experimental results that both heuristics efficiently handle weight settingfor the failure state. A comparison of both strategies is also presented.

  7. On large-scale nonlinear programming techniques for solving optimal control problems

    Energy Technology Data Exchange (ETDEWEB)

    Faco, J.L.D.

    1994-12-31

    The formulation of decision problems by Optimal Control Theory allows the consideration of their dynamic structure and parameters estimation. This paper deals with techniques for choosing directions in the iterative solution of discrete-time optimal control problems. A unified formulation incorporates nonlinear performance criteria and dynamic equations, time delays, bounded state and control variables, free planning horizon and variable initial state vector. In general they are characterized by a large number of variables, mostly when arising from discretization of continuous-time optimal control or calculus of variations problems. In a GRG context the staircase structure of the jacobian matrix of the dynamic equations is exploited in the choice of basic and super basic variables and when changes of basis occur along the process. The search directions of the bound constrained nonlinear programming problem in the reduced space of the super basic variables are computed by large-scale NLP techniques. A modified Polak-Ribiere conjugate gradient method and a limited storage quasi-Newton BFGS method are analyzed and modifications to deal with the bounds on the variables are suggested based on projected gradient devices with specific linesearches. Some practical models are presented for electric generation planning and fishery management, and the application of the code GRECO - Gradient REduit pour la Commande Optimale - is discussed.

  8. Quantum-behaved particle swarm optimization with collaborative attractors for nonlinear numerical problems

    Science.gov (United States)

    Liu, Tianyu; Jiao, Licheng; Ma, Wenping; Shang, Ronghua

    2017-03-01

    In this paper, an improved quantum-behaved particle swarm optimization (CL-QPSO), which adopts a new collaborative learning strategy to generate local attractors for particles, is proposed to solve nonlinear numerical problems. Local attractors, which directly determine the convergence behavior of particles, play an important role in quantum-behaved particle swarm optimization (QPSO). In order to get a promising and efficient local attractor for each particle, a collaborative learning strategy is introduced to generate local attractors in the proposed algorithm. Collaborative learning strategy consists of two operators, namely orthogonal operator and comparison operator. For each particle, orthogonal operator is used to discover the useful information that lies in its personal and global best positions, while comparison operator is used to enhance the particle's ability of jumping out of local optima. By using a probability parameter, the two operators cooperate with each other to generate local attractors for particles. A comprehensive comparison of CL-QPSO with some state-of-the-art evolutionary algorithms on nonlinear numeric optimization functions demonstrates the effectiveness of the proposed algorithm.

  9. Discrete homotopy analysis for optimal trading execution with nonlinear transient market impact

    Science.gov (United States)

    Curato, Gianbiagio; Gatheral, Jim; Lillo, Fabrizio

    2016-10-01

    Optimal execution in financial markets is the problem of how to trade a large quantity of shares incrementally in time in order to minimize the expected cost. In this paper, we study the problem of the optimal execution in the presence of nonlinear transient market impact. Mathematically such problem is equivalent to solve a strongly nonlinear integral equation, which in our model is a weakly singular Urysohn equation of the first kind. We propose an approach based on Homotopy Analysis Method (HAM), whereby a well behaved initial trading strategy is continuously deformed to lower the expected execution cost. Specifically, we propose a discrete version of the HAM, i.e. the DHAM approach, in order to use the method when the integrals to compute have no closed form solution. We find that the optimal solution is front loaded for concave instantaneous impact even when the investor is risk neutral. More important we find that the expected cost of the DHAM strategy is significantly smaller than the cost of conventional strategies.

  10. Automatic weight determination in nonlinear model predictive control of wind turbines using swarm optimization technique

    Science.gov (United States)

    Tofighi, Elham; Mahdizadeh, Amin

    2016-09-01

    This paper addresses the problem of automatic tuning of weighting coefficients for the nonlinear model predictive control (NMPC) of wind turbines. The choice of weighting coefficients in NMPC is critical due to their explicit impact on efficiency of the wind turbine control. Classically, these weights are selected based on intuitive understanding of the system dynamics and control objectives. The empirical methods, however, may not yield optimal solutions especially when the number of parameters to be tuned and the nonlinearity of the system increase. In this paper, the problem of determining weighting coefficients for the cost function of the NMPC controller is formulated as a two-level optimization process in which the upper- level PSO-based optimization computes the weighting coefficients for the lower-level NMPC controller which generates control signals for the wind turbine. The proposed method is implemented to tune the weighting coefficients of a NMPC controller which drives the NREL 5-MW wind turbine. The results are compared with similar simulations for a manually tuned NMPC controller. Comparison verify the improved performance of the controller for weights computed with the PSO-based technique.

  11. Experimental investigation on the influence of instrument settings on pixel size and nonlinearity in SEM image formation

    DEFF Research Database (Denmark)

    Carli, Lorenzo; Genta, Gianfranco; Cantatore, Angela

    2010-01-01

    The work deals with an experimental investigation on the influence of three Scanning Electron Microscope (SEM) instrument settings, accelerating voltage, spot size and magnification, on the image formation process. Pixel size and nonlinearity were chosen as output parameters related to image qual...

  12. Stochastic optimal controller design for uncertain nonlinear networked control system via neuro dynamic programming.

    Science.gov (United States)

    Xu, Hao; Jagannathan, Sarangapani

    2013-03-01

    The stochastic optimal controller design for the nonlinear networked control system (NNCS) with uncertain system dynamics is a challenging problem due to the presence of both system nonlinearities and communication network imperfections, such as random delays and packet losses, which are not unknown a priori. In the recent literature, neuro dynamic programming (NDP) techniques, based on value and policy iterations, have been widely reported to solve the optimal control of general affine nonlinear systems. However, for realtime control, value and policy iterations-based methodology are not suitable and time-based NDP techniques are preferred. In addition, output feedback-based controller designs are preferred for implementation. Therefore, in this paper, a novel NNCS representation incorporating the system uncertainties and network imperfections is introduced first by using input and output measurements for facilitating output feedback. Then, an online neural network (NN) identifier is introduced to estimate the control coefficient matrix, which is subsequently utilized for the controller design. Subsequently, the critic and action NNs are employed along with the NN identifier to determine the forward-in-time, time-based stochastic optimal control of NNCS without using value and policy iterations. Here, the value function and control inputs are updated once a sampling instant. By using novel NN weight update laws, Lyapunov theory is used to show that all the closed-loop signals and NN weights are uniformly ultimately bounded in the mean while the approximated control input converges close to its target value with time. Simulation results are included to show the effectiveness of the proposed scheme.

  13. Economic Optimization of Spray Dryer Operation using Nonlinear Model Predictive Control

    DEFF Research Database (Denmark)

    Petersen, Lars Norbert; Poulsen, Niels Kjølstad; Niemann, Hans Henrik

    2014-01-01

    In this paper we investigate an economically optimizing Nonlinear Model Predictive Control (E-NMPC) for a spray drying process. By simulation we evaluate the economic potential of this E-NMPC compared to a conventional PID based control strategy. Spray drying is the preferred process to reduce......-shooting method combined with a quasi-Newton Sequential Quadratic Programming (SQP) algorithm and the adjoint method for computation of gradients. The E-NMPC improves the cost of spray drying by 26.7% compared to conventional PI control in our simulations....

  14. An Optimal Homotopy Asymptotic Approach Applied to Nonlinear MHD Jeffery-Hamel Flow

    Directory of Open Access Journals (Sweden)

    Vasile Marinca

    2011-01-01

    Full Text Available A simple and effective procedure is employed to propose a new analytic approximate solution for nonlinear MHD Jeffery-Hamel flow. This technique called the Optimal Homotopy Asymptotic Method (OHAM does not depend upon any small/large parameters and provides us with a convenient way to control the convergence of the solution. The examples given in this paper lead to the conclusion that the accuracy of the obtained results is growing along with increasing the number of constants in the auxiliary function, which are determined using a computer technique. The results obtained through the proposed method are in very good agreement with the numerical results.

  15. Optimization of coherent optical OFDM transmitter using DP-IQ modulator with nonlinear response

    Science.gov (United States)

    Chang, Sun Hyok; Kang, Hun-Sik; Moon, Sang-Rok; Lee, Joon Ki

    2016-07-01

    In this paper, we investigate the performance of dual polarization orthogonal frequency division multiplexing (DP-OFDM) signal generation when the signal is generated by a DP-IQ optical modulator. The DP-IQ optical modulator is made of four parallel Mach-Zehnder modulators (MZMs) which have nonlinear responses and limited extinction ratios. We analyze the effects of the MZM in the DP-OFDM signal generation by numerical simulation. The operating conditions of the DP-IQ modulator are optimized to have the best performance of the DP-OFDM signal.

  16. Comparison of Linear and Nonlinear Model Predictive Control for Optimization of Spray Dryer Operation

    DEFF Research Database (Denmark)

    Petersen, Lars Norbert; Poulsen, Niels Kjølstad; Niemann, Hans Henrik;

    2015-01-01

    In this paper, we compare the performance of an economically optimizing Nonlinear Model Predictive Controller (E-NMPC) to a linear tracking Model Predictive Controller (MPC) for a spray drying plant. We find in this simulation study, that the economic performance of the two controllers are almost...... equal. We evaluate the economic performance with an industrially recorded disturbance scenario, where unmeasured disturbances and model mismatch are present. The state of the spray dryer, used in the E-NMPC and MPC, is estimated using Kalman Filters with noise covariances estimated by a maximum...

  17. Global stability, periodic solutions, and optimal control in a nonlinear differential delay model

    Directory of Open Access Journals (Sweden)

    Anatoli F. Ivanov

    2010-09-01

    Full Text Available A nonlinear differential equation with delay serving as a mathematical model of several applied problems is considered. Sufficient conditions for the global asymptotic stability and for the existence of periodic solutions are given. Two particular applications are treated in detail. The first one is a blood cell production model by Mackey, for which new periodicity criteria are derived. The second application is a modified economic model with delay due to Ramsey. An optimization problem for a maximal consumption is stated and solved for the latter.

  18. Continuity of Convex Set-valued Maps and a Fundamental Duality Formula for Set-valued Optimization

    CERN Document Server

    Heyde, Frank

    2011-01-01

    Over the past years a theory of conjugate duality for set-valued functions that map into the set of upper closed subsets of a preordered topological vector space was developed. For scalar duality theory, continuity of convex functions plays an important role. For set-valued maps different notions of continuity exist. We will compare the most prevalent ones in the special case that the image space is the set of upper closed subsets of a preordered topological vector space and analyze which of the results can be conveyed from the extended real-valued case. Moreover, we present a fundamental duality formula for set-valued optimization, using the weakest of the continuity concepts under consideration for a regularity condition.

  19. Optimal aeroassisted orbital transfer with plane change using collocation and nonlinear programming

    Science.gov (United States)

    Shi, Yun. Y.; Nelson, R. L.; Young, D. H.

    1990-01-01

    The fuel optimal control problem arising in the non-planar orbital transfer employing aeroassisted technology is addressed. The mission involves the transfer from high energy orbit (HEO) to low energy orbit (LEO) with orbital plane change. The basic strategy here is to employ a combination of propulsive maneuvers in space and aerodynamic maneuvers in the atmosphere. The basic sequence of events for the aeroassisted HEO to LEO transfer consists of three phases. In the first phase, the orbital transfer begins with a deorbit impulse at HEO which injects the vehicle into an elliptic transfer orbit with perigee inside the atmosphere. In the second phase, the vehicle is optimally controlled by lift and bank angle modulations to perform the desired orbital plane change and to satisfy heating constraints. Because of the energy loss during the turn, an impulse is required to initiate the third phase to boost the vehicle back to the desired LEO orbital altitude. The third impulse is then used to circularize the orbit at LEO. The problem is solved by a direct optimization technique which uses piecewise polynomial representation for the state and control variables and collocation to satisfy the differential equations. This technique converts the optimal control problem into a nonlinear programming problem which is solved numerically. Solutions were obtained for cases with and without heat constraints and for cases of different orbital inclination changes. The method appears to be more powerful and robust than other optimization methods. In addition, the method can handle complex dynamical constraints.

  20. Density functional theory optimized basis sets for gradient corrected functionals: 3d transition metal systems.

    Science.gov (United States)

    Calaminici, Patrizia; Janetzko, Florian; Köster, Andreas M; Mejia-Olvera, Roberto; Zuniga-Gutierrez, Bernardo

    2007-01-28

    Density functional theory optimized basis sets for gradient corrected functionals for 3d transition metal atoms are presented. Double zeta valence polarization and triple zeta valence polarization basis sets are optimized with the PW86 functional. The performance of the newly optimized basis sets is tested in atomic and molecular calculations. Excitation energies of 3d transition metal atoms, as well as electronic configurations, structural parameters, dissociation energies, and harmonic vibrational frequencies of a large number of molecules containing 3d transition metal elements, are presented. The obtained results are compared with available experimental data as well as with other theoretical data from the literature.

  1. Sample phenotype clusters in high-density oligonucleotide microarray data sets are revealed using Isomap, a nonlinear algorithm

    Directory of Open Access Journals (Sweden)

    Malyj Wasyl

    2005-08-01

    Full Text Available Abstract Background Life processes are determined by the organism's genetic profile and multiple environmental variables. However the interaction between these factors is inherently non-linear 1. Microarray data is one representation of the nonlinear interactions among genes and genes and environmental factors. Still most microarray studies use linear methods for the interpretation of nonlinear data. In this study, we apply Isomap, a nonlinear method of dimensionality reduction, to analyze three independent large Affymetrix high-density oligonucleotide microarray data sets. Results Isomap discovered low-dimensional structures embedded in the Affymetrix microarray data sets. These structures correspond to and help to interpret biological phenomena present in the data. This analysis provides examples of temporal, spatial, and functional processes revealed by the Isomap algorithm. In a spinal cord injury data set, Isomap discovers the three main modalities of the experiment – location and severity of the injury and the time elapsed after the injury. In a multiple tissue data set, Isomap discovers a low-dimensional structure that corresponds to anatomical locations of the source tissues. This model is capable of describing low- and high-resolution differences in the same model, such as kidney-vs.-brain and differences between the nuclei of the amygdala, respectively. In a high-throughput drug screening data set, Isomap discovers the monocytic and granulocytic differentiation of myeloid cells and maps several chemical compounds on the two-dimensional model. Conclusion Visualization of Isomap models provides useful tools for exploratory analysis of microarray data sets. In most instances, Isomap models explain more of the variance present in the microarray data than PCA or MDS. Finally, Isomap is a promising new algorithm for class discovery and class prediction in high-density oligonucleotide data sets.

  2. Sequential Convex Programming for Power Set-point Optimization in a Wind Farm using Black-box Models, Simple Turbine Interactions, and Integer Variables

    DEFF Research Database (Denmark)

    Hovgaard, Tobias Gybel; Larsen, Lars F. S.; Jørgensen, John Bagterp

    2012-01-01

    We consider the optimization of power set-points to a large number of wind turbines arranged within close vicinity of each other in a wind farm. The goal is to maximize the total electric power extracted from the wind, taking the wake effects that couple the individual turbines in the farm...... into account. For any mean wind speed, turbulence intensity, and direction we find the optimal static operating points for the wind farm. We propose an iterative optimization scheme to achieve this goal. When the complicated, nonlinear, dynamics of the aerodynamics in the turbines and of the fluid dynamics...... describing the turbulent wind fields’ propagation through the farm are included in a highly detailed black-box model, numerical results for any given values of the parameter sets can easily be evaluated. However, analytic expressions for model representation in the optimization algorithms might be hard...

  3. Optimizing optical nonlinearities in GaInAs/AlInAs quantum cascade lasers

    Directory of Open Access Journals (Sweden)

    Gajić Aleksandra D.

    2014-01-01

    Full Text Available Regardless of the huge advances made in the design and fabrication of mid-infrared and terahertz quantum cascade lasers, success in accessing the ~3-4 mm region of the electromagnetic spectrum has remained limited. This fact has brought about the need to exploit resonant intersubband transitions as powerful nonlinear oscillators, consequently enabling the occurrence of large nonlinear optical susceptibilities as a means of reaching desired wavelengths. In this work, we present a computational model developed for the optimization of second-order optical nonlinearities in In0.53Ga0.47As/Al0.48In0.52As quantum cascade laser structures based on the implementation of the Genetic algorithm. The carrier transport and the power output of the structure were calculated by self-consistent solutions to the system of rate equations for carriers and photons. Both stimulated and simultaneous double-photon absorption processes occurring between the second harmonic generation-relevant levels are incorporated into rate equations and the material-dependent effective mass and band non-parabolicity are taken into account, as well. The developed method is quite general and can be applied to any higher order effect which requires the inclusion of the photon density equation. [Projekat Ministarstva nauke Republike Srbije, br. III 45010

  4. Optimization of highly nonlinear dispersion-flattened photonic crystal fiber for supercontinuum generation

    Institute of Scientific and Technical Information of China (English)

    Zhang Ya-Ni

    2013-01-01

    A simple type of photonic crystal fiber (PCF) for supercontinuum generation is proposed for the first time.The proposed PCF is composed of a solid silica core and a cladding with square lattice uniform elliptical air holes,which offers not only a large nonlinear coefficient but also a high birefringence and low leakage losses.The PCF with nonlinear coefficient as large as 46 W-1 · km-1 at the wavelength of 1.55 μm and a total dispersion as low as ±2.5 ps.nm-1 · km-1 over an ultra-broad waveband range of the S-C-L band (wavelength from 1.46 μm to 1.625 μm) is optimized by adjusting its structure parameter,such as the lattice constant A,the air-filling fraction f,and the air-hole ellipticity η.The novel PCF with ultra-flattened dispersion,highly nonlinear coefficient,and nearly zero negative dispersion slope will offer a possibility of efficient super-continuum generation in telecommunication windows using a few ps pulses.

  5. Improved nonlinear optimization in the storage ring of the modern synchrotron radiation light source

    Institute of Scientific and Technical Information of China (English)

    TIAN Shun-Qiang; LIU Gui-Min; HOU Jie; CHEN Guang-Ling; CHEN Sen-Yu

    2009-01-01

    In the storage ring of the third generation light sources,nonlinear optimization is an indispensable course in order to obtain ample dynamic acceptances and to reach high injection efficiency and long beam lifetime,especially in a low emittance lattice.An improved optimization algorithm based on the single resonance approach,which takes relative weight and initial Harmonic Sextupole Integral Strength (HSIS) as search variables,is discussed in this paper.Applications of the improved method in several test lattices are presented.Detailed analysis of the storage ring of the Shanghai Synchrotron Radiation Facility (SSRF) is particularly emphasized.Furthermore,cancellation of the driving terms is investigated to reveal the physical mechanism of the harmonic sextupole compensation.Sensitivity to the weight and the initial HSIS as well as dependence of the optimum solution on the convergent factor is analyzed.

  6. Neural network solution for finite-horizon H-infinity constrained optimal control of nonlinear systems

    Institute of Scientific and Technical Information of China (English)

    Tao CHENG; Frank L.LEWIS

    2007-01-01

    In this paper,neural networks are used to approximately solve the finite-horizon constrained input H-infiniy state feedback control problem.The method is based on solving a related Hamilton-Jacobi-Isaacs equation of the corresponding finite-horizon zero-sum game.The game value function is approximated by a neural network wlth timevarying weights.It is shown that the neural network approximation converges uniformly to the game-value function and the resulting almost optimal constrained feedback controller provides closed-loop stability and bounded L2 gain.The result is an almost optimal H-infinity feedback controller with time-varying coefficients that is solved a priori off-line.The effectiveness of the method is shown on the Rotational/Translational Actuator benchmark nonlinear control problem.

  7. Optimal geometry of nonlinear silicon slot waveguides accounting for the effect of waveguide losses.

    Science.gov (United States)

    Ong, Jun Rong; Chen, Valerian H

    2015-12-28

    The optimal geometry of silicon-organic hybrid slot waveguides is investigated in the context of the efficiency of four-wave mixing (FWM), a χ(3) nonlinear optical process. We study the effect of slot and waveguide widths, as well as waveguide asymmetry on the two-photon absorption (TPA) figure of merit and the roughness scattering loss. The optimal waveguide core width is shown to be 220nm (symmetric) with a slot width of 120nm, at a fixed waveguide height of 220nm. We also show that state-of-the-art slot waveguides can outperform rib waveguides, especially at high powers, due to the high TPA figure-of-merit.

  8. Modified nonlinear conjugate gradient method with sufficient descent condition for unconstrained optimization

    Directory of Open Access Journals (Sweden)

    Liu Jinkui

    2011-01-01

    Full Text Available Abstract In this paper, an efficient modified nonlinear conjugate gradient method for solving unconstrained optimization problems is proposed. An attractive property of the modified method is that the generated direction in each step is always descending without any line search. The global convergence result of the modified method is established under the general Wolfe line search condition. Numerical results show that the modified method is efficient and stationary by comparing with the well-known Polak-Ribiére-Polyak method, CG-DESCENT method and DSP-CG method using the unconstrained optimization problems from More and Garbow (ACM Trans Math Softw 7, 17-41, 1981, so it can be widely used in scientific computation. Mathematics Subject Classification (2010 90C26 · 65H10

  9. Robust Fault Detection for a Class of Uncertain Nonlinear Systems Based on Multiobjective Optimization

    Directory of Open Access Journals (Sweden)

    Bingyong Yan

    2015-01-01

    Full Text Available A robust fault detection scheme for a class of nonlinear systems with uncertainty is proposed. The proposed approach utilizes robust control theory and parameter optimization algorithm to design the gain matrix of fault tracking approximator (FTA for fault detection. The gain matrix of FTA is designed to minimize the effects of system uncertainty on residual signals while maximizing the effects of system faults on residual signals. The design of the gain matrix of FTA takes into account the robustness of residual signals to system uncertainty and sensitivity of residual signals to system faults simultaneously, which leads to a multiobjective optimization problem. Then, the detectability of system faults is rigorously analyzed by investigating the threshold of residual signals. Finally, simulation results are provided to show the validity and applicability of the proposed approach.

  10. Optimizing the second-order optical nonlinearities of organic molecules: asymmetric cyanines and highly polarized polyenes

    Science.gov (United States)

    Marder, Seth R.; Gorman, Christopher B.; Cheng, Lap-Tak A.; Tiemann, Bruce G.

    1993-02-01

    We recently reported that there is an optimal combination of donor and acceptor strengths for a given molecular length and bridge structure that maximizes (beta) . For this combination, there is the correct degree of bond length alternation and asymmetry in the molecule. Our recent findings suggest that molecules that can be viewed as asymmetric cyanines with relatively small amounts of bond length alternation are nearly optimal. In this manner, we have identified molecules with nonlinearities many times that of conventional chromophores for a given length. In this paper, we will present a new computational analysis that allows the correlation of bond length alternation with hyperpolarizabilities and will present EFISH data on simple donor-acceptor polyene chromophores.

  11. Robust non-gradient C subroutines for non-linear optimization

    DEFF Research Database (Denmark)

    Brock, Pernille; Madsen, Kaj; Nielsen, Hans Bruun

    2004-01-01

    This report presents a package of robust and easy-to-use C subroutines for solving unconstrained and constrained non-linear optimization problems, where gradient information is not required. The intention is that the routines should use the currently best algorithms available. All routines have...... subroutines are obtained by changing 0 to 1. The present report is a new and updated version of a previous report NI-91-04 with the title Non-gradient c Subroutines for Non- Linear Optimization, [16]. Both the previous and the present report describe a collection of subroutines, which have been translated...... from Fortran to C. The reason for writing the present report is that some of the C subroutines have been replaced by more e ective and robust versions translated from the original Fortran subroutines to C by the Bandler Group, see [1]. Also the test examples have been modified to some extent...

  12. Contrast Optimization by Metaheuristic for Inclusion Detection in Nonlinear Ultrasound Imaging

    Science.gov (United States)

    Girault, Jean-Marc; Ménigot, Sébastien

    In ultrasound imaging, improvements have been made possible by taking into account the harmonic frequencies. However, the transmitted signal often consists of providing empirically pre-set transmit frequencies, even if the medium to be explored should be taken into account during the optimization process. To resolve this waveform optimization, transmission of stochastic sequences were proposed combined with a genetic algorithm. A medium with an inclusion was compared in term of contrast to a reference medium without defect. Two media were distinguished thanks an Euclidean distance. In simulation, the optimal distance could be multiplied by 4 in comparison with an usual excitation.

  13. Optimal in silico target gene deletion through nonlinear programming for genetic engineering.

    Science.gov (United States)

    Hong, Chung-Chien; Song, Mingzhou

    2010-02-24

    Optimal selection of multiple regulatory genes, known as targets, for deletion to enhance or suppress the activities of downstream genes or metabolites is an important problem in genetic engineering. Such problems become more feasible to address in silico due to the availability of more realistic dynamical system models of gene regulatory and metabolic networks. The goal of the computational problem is to search for a subset of genes to knock out so that the activity of a downstream gene or a metabolite is optimized. Based on discrete dynamical system modeling of gene regulatory networks, an integer programming problem is formulated for the optimal in silico target gene deletion problem. In the first result, the integer programming problem is proved to be NP-hard and equivalent to a nonlinear programming problem. In the second result, a heuristic algorithm, called GKONP, is designed to approximate the optimal solution, involving an approach to prune insignificant terms in the objective function, and the parallel differential evolution algorithm. In the third result, the effectiveness of the GKONP algorithm is demonstrated by applying it to a discrete dynamical system model of the yeast pheromone pathways. The empirical accuracy and time efficiency are assessed in comparison to an optimal, but exhaustive search strategy. Although the in silico target gene deletion problem has enormous potential applications in genetic engineering, one must overcome the computational challenge due to its NP-hardness. The presented solution, which has been demonstrated to approximate the optimal solution in a practical amount of time, is among the few that address the computational challenge. In the experiment on the yeast pheromone pathways, the identified best subset of genes for deletion showed advantage over genes that were selected empirically. Once validated in vivo, the optimal target genes are expected to achieve higher genetic engineering effectiveness than a trial

  14. Optimal in silico target gene deletion through nonlinear programming for genetic engineering.

    Directory of Open Access Journals (Sweden)

    Chung-Chien Hong

    Full Text Available BACKGROUND: Optimal selection of multiple regulatory genes, known as targets, for deletion to enhance or suppress the activities of downstream genes or metabolites is an important problem in genetic engineering. Such problems become more feasible to address in silico due to the availability of more realistic dynamical system models of gene regulatory and metabolic networks. The goal of the computational problem is to search for a subset of genes to knock out so that the activity of a downstream gene or a metabolite is optimized. METHODOLOGY/PRINCIPAL FINDINGS: Based on discrete dynamical system modeling of gene regulatory networks, an integer programming problem is formulated for the optimal in silico target gene deletion problem. In the first result, the integer programming problem is proved to be NP-hard and equivalent to a nonlinear programming problem. In the second result, a heuristic algorithm, called GKONP, is designed to approximate the optimal solution, involving an approach to prune insignificant terms in the objective function, and the parallel differential evolution algorithm. In the third result, the effectiveness of the GKONP algorithm is demonstrated by applying it to a discrete dynamical system model of the yeast pheromone pathways. The empirical accuracy and time efficiency are assessed in comparison to an optimal, but exhaustive search strategy. SIGNIFICANCE: Although the in silico target gene deletion problem has enormous potential applications in genetic engineering, one must overcome the computational challenge due to its NP-hardness. The presented solution, which has been demonstrated to approximate the optimal solution in a practical amount of time, is among the few that address the computational challenge. In the experiment on the yeast pheromone pathways, the identified best subset of genes for deletion showed advantage over genes that were selected empirically. Once validated in vivo, the optimal target genes are

  15. A new deterministic global optimization method for general twice-differentiable constrained nonlinear programming problems

    Science.gov (United States)

    Park, Y. C.; Chang, M. H.; Lee, T.-Y.

    2007-06-01

    A deterministic global optimization method that is applicable to general nonlinear programming problems composed of twice-differentiable objective and constraint functions is proposed. The method hybridizes the branch-and-bound algorithm and a convex cut function (CCF). For a given subregion, the difference of a convex underestimator that does not need an iterative local optimizer to determine the lower bound of the objective function is generated. If the obtained lower bound is located in an infeasible region, then the CCF is generated for constraints to cut this region. The cutting region generated by the CCF forms a hyperellipsoid and serves as the basis of a discarding rule for the selected subregion. However, the convergence rate decreases as the number of cutting regions increases. To accelerate the convergence rate, an inclusion relation between two hyperellipsoids should be applied in order to reduce the number of cutting regions. It is shown that the two-hyperellipsoid inclusion relation is determined by maximizing a quadratic function over a sphere, which is a special case of a trust region subproblem. The proposed method is applied to twelve nonlinear programming test problems and five engineering design problems. Numerical results show that the proposed method converges in a finite calculation time and produces accurate solutions.

  16. Nonlinear Optimization-Based Device-Free Localization with Outlier Link Rejection

    Directory of Open Access Journals (Sweden)

    Wendong Xiao

    2015-04-01

    Full Text Available Device-free localization (DFL is an emerging wireless technique for estimating the location of target that does not have any attached electronic device. It has found extensive use in Smart City applications such as healthcare at home and hospitals, location-based services at smart spaces, city emergency response and infrastructure security. In DFL, wireless devices are used as sensors that can sense the target by transmitting and receiving wireless signals collaboratively. Many DFL systems are implemented based on received signal strength (RSS measurements and the location of the target is estimated by detecting the changes of the RSS measurements of the wireless links. Due to the uncertainty of the wireless channel, certain links may be seriously polluted and result in erroneous detection. In this paper, we propose a novel nonlinear optimization approach with outlier link rejection (NOOLR for RSS-based DFL. It consists of three key strategies, including: (1 affected link identification by differential RSS detection; (2 outlier link rejection via geometrical positional relationship among links; (3 target location estimation by formulating and solving a nonlinear optimization problem. Experimental results demonstrate that NOOLR is robust to the fluctuation of the wireless signals with superior localization accuracy compared with the existing Radio Tomographic Imaging (RTI approach.

  17. Optimal Tuning of Decentralized PI Controller of Nonlinear Multivariable Process Using Archival Based Multiobjective Particle Swarm Optimization

    Directory of Open Access Journals (Sweden)

    R. Kotteeswaran

    2014-01-01

    Full Text Available A Multiobjective Particle Swarm Optimization (MOPSO algorithm is proposed to fine-tune the baseline PI controller parameters of Alstom gasifier. The existing baseline PI controller is not able to meet the performance requirements of Alstom gasifier for sinusoidal pressure disturbance at 0% load. This is considered the major drawback of controller design. A best optimal solution for Alstom gasifier is obtained from a set of nondominated solutions using MOPSO algorithm. Performance of gasifier is investigated at all load conditions. The controller with optimized controller parameters meets all the performance requirements at 0%, 50%, and 100% load conditions. The investigations are also extended for variations in coal quality, which shows an improved stability of the gasifier over a wide range of coal quality variations.

  18. The Study of the Optimal Parameter Settings in a Hospital Supply Chain System in Taiwan

    Directory of Open Access Journals (Sweden)

    Hung-Chang Liao

    2014-01-01

    Full Text Available This study proposed the optimal parameter settings for the hospital supply chain system (HSCS when either the total system cost (TSC or patient safety level (PSL (or both simultaneously was considered as the measure of the HSCS’s performance. Four parameters were considered in the HSCS: safety stock, maximum inventory level, transportation capacity, and the reliability of the HSCS. A full-factor experimental design was used to simulate an HSCS for the purpose of collecting data. The response surface method (RSM was used to construct the regression model, and a genetic algorithm (GA was applied to obtain the optimal parameter settings for the HSCS. The results show that the best method of obtaining the optimal parameter settings for the HSCS is the simultaneous consideration of both the TSC and the PSL to measure performance. Also, the results of sensitivity analysis based on the optimal parameter settings were used to derive adjustable strategies for the decision-makers.

  19. Minimal K-Covering Set Algorithm based on Particle Swarm Optimizer

    National Research Council Canada - National Science Library

    Yong Hu

    2013-01-01

    .... In order to maximize the cost savings network resources for wireless sensor networks, extend the life network, this paper proposed a algorithm for the minimal k-covering set based on particle swarm optimizer...

  20. A LEVEL SET BASED SHAPE OPTIMIZATION METHOD FOR AN ELLIPTIC OBSTACLE PROBLEM

    KAUST Repository

    Burger, Martin

    2011-04-01

    In this paper, we construct a level set method for an elliptic obstacle problem, which can be reformulated as a shape optimization problem. We provide a detailed shape sensitivity analysis for this reformulation and a stability result for the shape Hessian at the optimal shape. Using the shape sensitivities, we construct a geometric gradient flow, which can be realized in the context of level set methods. We prove the convergence of the gradient flow to an optimal shape and provide a complete analysis of the level set method in terms of viscosity solutions. To our knowledge this is the first complete analysis of a level set method for a nonlocal shape optimization problem. Finally, we discuss the implementation of the methods and illustrate its behavior through several computational experiments. © 2011 World Scientific Publishing Company.

  1. A level set method for reliability-based topology optimization of compliant mechanisms

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    Based on the level set model and the reliability theory, a numerical approach of reliability-based topology optimization for compliant mechanisms with multiple inputs and outputs is presented. A multi-objective topology optimal model of compliant mechanisms considering uncertainties of the loads, material properties, and member geometries is developed. The reliability analysis and topology optimization are integrated in the optimal iterative process. The reliabilities of the compliant mechanisms are evaluated by using the first order reliability method. Meanwhile, the problem of structural topology optimization is solved by the level set method which is flexible in handling complex topological changes and concise in describing the boundary shape of the mechanism. Numerical examples show the importance of considering the stochastic nature of the compliant mechanisms in the topology optimization process.

  2. Influence of equipment and settings on myocardial performance index repeatability and definition of settings to achieve optimal reproducibility.

    Science.gov (United States)

    Lobmaier, S M; Cruz-Lemini, M; Valenzuela-Alcaraz, B; Ortiz, J U; Martinez, J M; Gratacos, E; Crispi, F

    2014-06-01

    To compare left myocardial performance index (MPI) values and reproducibility using different settings and ultrasound equipment in order to standardize optimal machine settings. Left MPI was prospectively evaluated by one observer performing conventional Doppler in 62 fetuses (28-36 weeks of gestational age) using different settings (changing sweep speed, gain and wall motion filter (WMF)) and two different ultrasound devices (Siemens Antares, Siemens; Voluson 730 Expert, GE Medical Systems). Intraclass coefficients of agreement (ICCs) were calculated using Bland-Altman analysis. Using baseline settings on the Siemens, mean (SD) MPI was 0.44 (0.05) with an ICC of 0.81. Decreasing the sweep speed resulted in decreasing average MPI values (0.43) and decreasing ICC (0.61). Lowering gain also influenced average MPI values (0.46) and ICC (0.76). Raising gain resulted in similar MPI values (0.45) with better ICC (0.90) compared with baseline settings. Raising wall motion filter (WMF) provided the best ICC (0.94) compared with the other settings. Changing the ultrasound equipment resulted in an ICC of 0.64. The optimal settings to achieve the highest reproducibility in measurement of MPI were sweep speed 8, gain 60 dB and WMF 281 Hz for Siemens Antares and sweep speed 5, gain -10 dB and WMF 210 Hz for Voluson 730 Expert. Changing ultrasound settings or equipment may affect the calculation and repeatability of measurement of MPI values. Strict standardization of methods decreases the variability of this parameter for fetal cardiac function assessment. Copyright © 2014 ISUOG. Published by John Wiley & Sons Ltd.

  3. The structure of weak Pareto solution sets in piecewise linear multiobjective optimization in normed spaces

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    In general normed spaces,we consider a multiobjective piecewise linear optimization problem with the ordering cone being convex and having a nonempty interior.We establish that the weak Pareto optimal solution set of such a problem is the union of finitely many polyhedra and that this set is also arcwise connected under the cone convexity assumption of the objective function.Moreover,we provide necessary and suffcient conditions about the existence of weak(sharp) Pareto solutions.

  4. Full Glowworm Swarm Optimization Algorithm for Whole-Set Orders Scheduling in Single Machine

    Directory of Open Access Journals (Sweden)

    Zhang Yu

    2013-01-01

    Full Text Available By analyzing the characteristics of whole-set orders problem and combining the theory of glowworm swarm optimization, a new glowworm swarm optimization algorithm for scheduling is proposed. A new hybrid-encoding schema combining with two-dimensional encoding and random-key encoding is given. In order to enhance the capability of optimal searching and speed up the convergence rate, the dynamical changed step strategy is integrated into this algorithm. Furthermore, experimental results prove its feasibility and efficiency.

  5. Full Glowworm Swarm Optimization Algorithm for Whole-Set Orders Scheduling in Single Machine

    OpenAIRE

    Zhang Yu; Xiaomei Yang

    2013-01-01

    By analyzing the characteristics of whole-set orders problem and combining the theory of glowworm swarm optimization, a new glowworm swarm optimization algorithm for scheduling is proposed. A new hybrid-encoding schema combining with two-dimensional encoding and random-key encoding is given. In order to enhance the capability of optimal searching and speed up the convergence rate, the dynamical changed step strategy is integrated into this algorithm. Furthermore, experimental results prove it...

  6. Full glowworm swarm optimization algorithm for whole-set orders scheduling in single machine.

    Science.gov (United States)

    Yu, Zhang; Yang, Xiaomei

    2013-01-01

    By analyzing the characteristics of whole-set orders problem and combining the theory of glowworm swarm optimization, a new glowworm swarm optimization algorithm for scheduling is proposed. A new hybrid-encoding schema combining with two-dimensional encoding and random-key encoding is given. In order to enhance the capability of optimal searching and speed up the convergence rate, the dynamical changed step strategy is integrated into this algorithm. Furthermore, experimental results prove its feasibility and efficiency.

  7. An efficient identification approach for stable and unstable nonlinear systems using Colliding Bodies Optimization algorithm.

    Science.gov (United States)

    Pal, Partha S; Kar, R; Mandal, D; Ghoshal, S P

    2015-11-01

    This paper presents an efficient approach to identify different stable and practically useful Hammerstein models as well as unstable nonlinear process along with its stable closed loop counterpart with the help of an evolutionary algorithm as Colliding Bodies Optimization (CBO) optimization algorithm. The performance measures of the CBO based optimization approach such as precision, accuracy are justified with the minimum output mean square value (MSE) which signifies that the amount of bias and variance in the output domain are also the least. It is also observed that the optimization of output MSE in the presence of outliers has resulted in a very close estimation of the output parameters consistently, which also justifies the effective general applicability of the CBO algorithm towards the system identification problem and also establishes the practical usefulness of the applied approach. Optimum values of the MSEs, computational times and statistical information of the MSEs are all found to be the superior as compared with those of the other existing similar types of stochastic algorithms based approaches reported in different recent literature, which establish the robustness and efficiency of the applied CBO based identification scheme.

  8. Identification of a Non-Linear Landing Gear Model Using Nature-Inspired Optimization

    Directory of Open Access Journals (Sweden)

    Felipe A.C. Viana

    2008-01-01

    Full Text Available This work deals with the application of a nature-inspired optimization technique to solve an inverse problem represented by the identification of an aircraft landing gear model. The model is described in terms of the landing gear geometry, internal volumes and areas, shock absorber travel, tire type, and gas and oil characteristics of the shock absorber. The solution to this inverse problem can be obtained by using classical gradient-based optimization methods. However, this is a difficult task due to the existence of local minima in the design space and the requirement of an initial guess. These aspects have motivated the authors to explore a nature-inspired approach using a method known as LifeCycle Model. In the present formulation two nature-based methods, namely the Genetic Algorithms and the Particle Swarm Optimization were used. An optimization problem is formulated in which the objective function represents the difference between the measured characteristics of the system and its model counterpart. The polytropic coefficient of the gas and the damping parameter of the shock absorber are assumed as being unknown: they are considered as design variables. As an illustration, experimental drop test data, obtained under zero horizontal speed, were used in the non-linear landing gear model updating of a small aircraft.

  9. New version of Optimal Homotopy Asymptotic Method for the solution of nonlinear boundary value problems in finite and infinite intervals

    Directory of Open Access Journals (Sweden)

    Liaqat Ali

    2016-09-01

    Full Text Available In this research work a new version of Optimal Homotopy Asymptotic Method is applied to solve nonlinear boundary value problems (BVPs in finite and infinite intervals. It comprises of initial guess, auxiliary functions (containing unknown convergence controlling parameters and a homotopy. The said method is applied to solve nonlinear Riccati equations and nonlinear BVP of order two for thin film flow of a third grade fluid on a moving belt. It is also used to solve nonlinear BVP of order three achieved by Mostafa et al. for Hydro-magnetic boundary layer and micro-polar fluid flow over a stretching surface embedded in a non-Darcian porous medium with radiation. The obtained results are compared with the existing results of Runge-Kutta (RK-4 and Optimal Homotopy Asymptotic Method (OHAM-1. The outcomes achieved by this method are in excellent concurrence with the exact solution and hence it is proved that this method is easy and effective.

  10. A nonlinear programming optimization model to maximize net revenue in cheese manufacture.

    Science.gov (United States)

    Papadatos, A; Berger, A M; Pratt, J E; Barbano, D M

    2002-11-01

    A nonlinear programming optimization model was developed to maximize net revenue in cheese manufacture and is described in this paper. The model identifies the optimal mix of milk resources together with the types of cheeses and co-products that maximize net revenue. It works in Excel while it takes the data specified by the user from a user-friendly interface created in Access. The user can specify any number of resources, cheese types, and co-products. To demonstrate the capabilities of the model, we determined the impact of variation in milk price and composition in the period 1998 to 2000 on the optimal mix of resources and optimal type of co-product for Cheddar and low-moisture, part-skim Mozzarella. It was also desired to determine the impact of variation in protein content of nonfat dry milk (NDM) on net revenue, and examine the effect of reconstitution of NDM with water versus milk on net revenue. The optimal mix of resources and the net revenue markedly varied as milk resource prices and composition varied. The net revenue for Mozzarella was much higher than for Cheddar when the price of cream was high. Cheese plants that did not optimize the use of resources in response to variations in prices and composition missed a significant profit opportunity. Whey powder was more profitable than 34% whey protein concentrate and lactose in most months. The use of high-protein NDM led to an appreciable increase in net revenue. When the value of the nonfat portion of raw milk was high, reconstitution of NDM with water rather than milk markedly raised net revenue.

  11. Non-linear modeling of 1H NMR metabonomic data using kernel-based orthogonal projections to latent structures optimized by simulated annealing.

    Science.gov (United States)

    Fonville, Judith M; Bylesjö, Max; Coen, Muireann; Nicholson, Jeremy K; Holmes, Elaine; Lindon, John C; Rantalainen, Mattias

    2011-10-31

    Linear multivariate projection methods are frequently applied for predictive modeling of spectroscopic data in metabonomic studies. The OPLS method is a commonly used computational procedure for characterizing spectral metabonomic data, largely due to its favorable model interpretation properties providing separate descriptions of predictive variation and response-orthogonal structured noise. However, when the relationship between descriptor variables and the response is non-linear, conventional linear models will perform sub-optimally. In this study we have evaluated to what extent a non-linear model, kernel-based orthogonal projections to latent structures (K-OPLS), can provide enhanced predictive performance compared to the linear OPLS model. Just like its linear counterpart, K-OPLS provides separate model components for predictive variation and response-orthogonal structured noise. The improved model interpretation by this separate modeling is a property unique to K-OPLS in comparison to other kernel-based models. Simulated annealing (SA) was used for effective and automated optimization of the kernel-function parameter in K-OPLS (SA-K-OPLS). Our results reveal that the non-linear K-OPLS model provides improved prediction performance in three separate metabonomic data sets compared to the linear OPLS model. We also demonstrate how response-orthogonal K-OPLS components provide valuable biological interpretation of model and data. The metabonomic data sets were acquired using proton Nuclear Magnetic Resonance (NMR) spectroscopy, and include a study of the liver toxin galactosamine, a study of the nephrotoxin mercuric chloride and a study of Trypanosoma brucei brucei infection. Automated and user-friendly procedures for the kernel-optimization have been incorporated into version 1.1.1 of the freely available K-OPLS software package for both R and Matlab to enable easy application of K-OPLS for non-linear prediction modeling.

  12. Optimization on class of operator equations in the probabilistic case setting

    Institute of Scientific and Technical Information of China (English)

    Gen-sun FANG; Li-xin QIAN

    2007-01-01

    In this paper, we introduce a problem of the optimization of approximate solutions of operator equations in the probabilistic case setting, and prove a general result which connects the relation between the optimal approximation order of operator equations with the asymptotic order of the probabilistic width. Moreover, using this result, we determine the exact orders on the optimal approximate solutions of multivariate Freldholm integral equations of the second kind with the kernels belonging to the multivariate Sobolev class with the mixed derivative in the probabilistic case setting.

  13. Optimization on class of operator equations in the probabilistic case setting

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    In this paper, we introduce a problem of the optimization of approximate solutions of operator equations in the probabilistic case setting, and prove a general result which connects the relation between the optimal approximation order of operator equations with the asymptotic order of the probabilistic width. Moreover, using this result, we determine the exact orders on the optimal approximate solutions of multivariate Preldholm integral equations of the second kind with the kernels belonging to the multivariate Sobolev class with the mixed derivative in the probabilistic case setting.

  14. Optimal location and setting of SVC and TCSC devices using non-dominated sorting particle swarm optimization

    Energy Technology Data Exchange (ETDEWEB)

    Benabid, R. [Nuclear Research Center of Birine, B.P. 180, 17200 Ain oussera, Djelfa (Algeria); Boudour, M. [Department of Electrical Engineering University of Sciences and Technology Houari Boumediene (U.S.T.H.B), El Alia, BP 32, Bab Ezzouar, 16111 Algiers (Algeria); Abido, M.A. [Electrical Engineering Department, King Fahd University of Petroleum and Mineral, Box 1225, Dhahran 183 (Saudi Arabia)

    2009-12-15

    In this paper, a new method for optimal locating multi-type FACTS devices in order to optimize multi-objective voltage stability problem is presented. The proposed methodology is based on a new variant of particle swarm optimization (PSO) specialized in multi-objective optimization problem known as non-dominated sorting particle swarm optimization (NSPSO). The crowding distance technique is used to maintain the Pareto front size at the chosen limit, without destroying its characteristics. To aid the decision maker choosing the best compromise solution from the Pareto front, the fuzzy-based mechanism is employed for this task. NSPSO is used to find the optimal location and setting of two types of FACTS namely: Thyristor controlled series compensator (TCSC) and static var compensator (SVC) that maximize static voltage stability margin (SVSM), reduce real power losses (RPL), and load voltage deviation (LVD). The optimization is carried out on two and three objective functions for various FACTS combinations considering. For ensure the robustness of the proposed method and gives a practical sense of our study, N - 1 contingency analysis and the stress of power system is considered in the optimization process. The thermal limits of lines and voltage limits of load buses are considered as the security constraints. The proposed method is validated on IEEE 30-bus and realistic Algerian 114-bus power system. The simulation results are compared with those obtained by particle swarm optimization (PSO) and non-dominated sorting genetic algorithms (NSGA-II). The comparisons show the effectiveness of the proposed NSPSO to solve the multi-objective optimization problem and capture Pareto optimal solutions with satisfactory diversity characteristics. (author)

  15. Breaking Computational Barriers: Real-time Analysis and Optimization with Large-scale Nonlinear Models via Model Reduction

    Energy Technology Data Exchange (ETDEWEB)

    Carlberg, Kevin Thomas [Sandia National Lab. (SNL-CA), Livermore, CA (United States). Quantitative Modeling and Analysis; Drohmann, Martin [Sandia National Lab. (SNL-CA), Livermore, CA (United States). Quantitative Modeling and Analysis; Tuminaro, Raymond S. [Sandia National Lab. (SNL-CA), Livermore, CA (United States). Computational Mathematics; Boggs, Paul T. [Sandia National Lab. (SNL-CA), Livermore, CA (United States). Quantitative Modeling and Analysis; Ray, Jaideep [Sandia National Lab. (SNL-CA), Livermore, CA (United States). Quantitative Modeling and Analysis; van Bloemen Waanders, Bart Gustaaf [Sandia National Lab. (SNL-CA), Livermore, CA (United States). Optimization and Uncertainty Estimation

    2014-10-01

    -model errors. This enables ROMs to be rigorously incorporated in uncertainty-quantification settings, as the error model can be treated as a source of epistemic uncertainty. This work was completed as part of a Truman Fellowship appointment. We note that much additional work was performed as part of the Fellowship. One salient project is the development of the Trilinos-based model-reduction software module Razor , which is currently bundled with the Albany PDE code and currently allows nonlinear reduced-order models to be constructed for any application supported in Albany. Other important projects include the following: 1. ROMES-equipped ROMs for Bayesian inference: K. Carlberg, M. Drohmann, F. Lu (Lawrence Berkeley National Laboratory), M. Morzfeld (Lawrence Berkeley National Laboratory). 2. ROM-enabled Krylov-subspace recycling: K. Carlberg, V. Forstall (University of Maryland), P. Tsuji, R. Tuminaro. 3. A pseudo balanced POD method using only dual snapshots: K. Carlberg, M. Sarovar. 4. An analysis of discrete v. continuous optimality in nonlinear model reduction: K. Carlberg, M. Barone, H. Antil (George Mason University). Journal articles for these projects are in progress at the time of this writing.

  16. CHESS-changing horizon efficient set search: A simple principle for multiobjective optimization

    DEFF Research Database (Denmark)

    Borges, Pedro Manuel F. C.

    2000-01-01

    This paper presents a new concept for generating approximations to the non-dominated set in multiobjective optimization problems. The approximation set A is constructed by solving several single-objective minimization problems in which a particular function D(A, z) is minimized. A new algorithm...

  17. Homogeneity analysis with k sets of variables: An alternating least squares method with optimal scaling features

    NARCIS (Netherlands)

    van der Burg, Eeke; de Leeuw, Jan; Verdegaal, R.

    1986-01-01

    Homogeneity analysis, or multiple correspondence analysis, is usually applied to k separate variables. In this paper, it is applied to sets of variables by using sums within sets. The resulting technique is referred to as OVERALS. It uses the notion of optimal scaling, with transformations that can

  18. An Optimal Set of Flesh Points on Tongue and Lips for Speech-Movement Classification

    Science.gov (United States)

    Wang, Jun; Samal, Ashok; Rong, Panying; Green, Jordan R.

    2016-01-01

    Purpose: The authors sought to determine an optimal set of flesh points on the tongue and lips for classifying speech movements. Method: The authors used electromagnetic articulographs (Carstens AG500 and NDI Wave) to record tongue and lip movements from 13 healthy talkers who articulated 8 vowels, 11 consonants, a phonetically balanced set of…

  19. CHESS-changing horizon efficient set search: A simple principle for multiobjective optimization

    DEFF Research Database (Denmark)

    Borges, Pedro Manuel F. C.

    2000-01-01

    This paper presents a new concept for generating approximations to the non-dominated set in multiobjective optimization problems. The approximation set A is constructed by solving several single-objective minimization problems in which a particular function D(A, z) is minimized. A new algorithm t...

  20. Aerostructural Level Set Topology Optimization for a Common Research Model Wing

    Science.gov (United States)

    Dunning, Peter D.; Stanford, Bret K.; Kim, H. Alicia

    2014-01-01

    The purpose of this work is to use level set topology optimization to improve the design of a representative wing box structure for the NASA common research model. The objective is to minimize the total compliance of the structure under aerodynamic and body force loading, where the aerodynamic loading is coupled to the structural deformation. A taxi bump case was also considered, where only body force loads were applied. The trim condition that aerodynamic lift must balance the total weight of the aircraft is enforced by allowing the root angle of attack to change. The level set optimization method is implemented on an unstructured three-dimensional grid, so that the method can optimize a wing box with arbitrary geometry. Fast matching and upwind schemes are developed for an unstructured grid, which make the level set method robust and efficient. The adjoint method is used to obtain the coupled shape sensitivities required to perform aerostructural optimization of the wing box structure.

  1. Estimating the Tradeoff Between Risk Protection and Moral Hazard with a Nonlinear Budget Set Model of Health Insurance*

    OpenAIRE

    Amanda E. Kowalski

    2015-01-01

    Insurance induces a well-known tradeoff between the welfare gains from risk protection and the welfare losses from moral hazard. Empirical work traditionally estimates each side of the tradeoff separately, potentially yielding mutually inconsistent results. I develop a nonlinear budget set model of health insurance that allows for the calculation of both sides of the tradeoff simultaneously, allowing for a relationship between moral hazard and risk protection. An important feature of this mod...

  2. A-optimal encoding weights for nonlinear inverse problems, with application to the Helmholtz inverse problem

    Science.gov (United States)

    Crestel, Benjamin; Alexanderian, Alen; Stadler, Georg; Ghattas, Omar

    2017-07-01

    The computational cost of solving an inverse problem governed by PDEs, using multiple experiments, increases linearly with the number of experiments. A recently proposed method to decrease this cost uses only a small number of random linear combinations of all experiments for solving the inverse problem. This approach applies to inverse problems where the PDE solution depends linearly on the right-hand side function that models the experiment. As this method is stochastic in essence, the quality of the obtained reconstructions can vary, in particular when only a small number of combinations are used. We develop a Bayesian formulation for the definition and computation of encoding weights that lead to a parameter reconstruction with the least uncertainty. We call these weights A-optimal encoding weights. Our framework applies to inverse problems where the governing PDE is nonlinear with respect to the inversion parameter field. We formulate the problem in infinite dimensions and follow the optimize-then-discretize approach, devoting special attention to the discretization and the choice of numerical methods in order to achieve a computational cost that is independent of the parameter discretization. We elaborate our method for a Helmholtz inverse problem, and derive the adjoint-based expressions for the gradient of the objective function of the optimization problem for finding the A-optimal encoding weights. The proposed method is potentially attractive for real-time monitoring applications, where one can invest the effort to compute optimal weights offline, to later solve an inverse problem repeatedly, over time, at a fraction of the initial cost.

  3. Non-linear modeling of {sup 1}H NMR metabonomic data using kernel-based orthogonal projections to latent structures optimized by simulated annealing

    Energy Technology Data Exchange (ETDEWEB)

    Fonville, Judith M., E-mail: j.fonville07@imperial.ac.uk [Biomolecular Medicine, Department of Surgery and Cancer, Faculty of Medicine, Imperial College London, Sir Alexander Fleming Building, South Kensington, London SW7 2AZ (United Kingdom); Bylesjoe, Max, E-mail: max.bylesjo@almacgroup.com [Almac Diagnostics, 19 Seagoe Industrial Estate, Craigavon BT63 5QD (United Kingdom); Coen, Muireann, E-mail: m.coen@imperial.ac.uk [Biomolecular Medicine, Department of Surgery and Cancer, Faculty of Medicine, Imperial College London, Sir Alexander Fleming Building, South Kensington, London SW7 2AZ (United Kingdom); Nicholson, Jeremy K., E-mail: j.nicholson@imperial.ac.uk [Biomolecular Medicine, Department of Surgery and Cancer, Faculty of Medicine, Imperial College London, Sir Alexander Fleming Building, South Kensington, London SW7 2AZ (United Kingdom); Holmes, Elaine, E-mail: elaine.holmes@imperial.ac.uk [Biomolecular Medicine, Department of Surgery and Cancer, Faculty of Medicine, Imperial College London, Sir Alexander Fleming Building, South Kensington, London SW7 2AZ (United Kingdom); Lindon, John C., E-mail: j.lindon@imperial.ac.uk [Biomolecular Medicine, Department of Surgery and Cancer, Faculty of Medicine, Imperial College London, Sir Alexander Fleming Building, South Kensington, London SW7 2AZ (United Kingdom); Rantalainen, Mattias, E-mail: rantalai@stats.ox.ac.uk [Department of Statistics, Oxford University, 1 South Parks Road, Oxford OX1 3TG (United Kingdom)

    2011-10-31

    Highlights: {yields} Non-linear modeling of metabonomic data using K-OPLS. {yields} automated optimization of the kernel parameter by simulated annealing. {yields} K-OPLS provides improved prediction performance for exemplar spectral data sets. {yields} software implementation available for R and Matlab under GPL v2 license. - Abstract: Linear multivariate projection methods are frequently applied for predictive modeling of spectroscopic data in metabonomic studies. The OPLS method is a commonly used computational procedure for characterizing spectral metabonomic data, largely due to its favorable model interpretation properties providing separate descriptions of predictive variation and response-orthogonal structured noise. However, when the relationship between descriptor variables and the response is non-linear, conventional linear models will perform sub-optimally. In this study we have evaluated to what extent a non-linear model, kernel-based orthogonal projections to latent structures (K-OPLS), can provide enhanced predictive performance compared to the linear OPLS model. Just like its linear counterpart, K-OPLS provides separate model components for predictive variation and response-orthogonal structured noise. The improved model interpretation by this separate modeling is a property unique to K-OPLS in comparison to other kernel-based models. Simulated annealing (SA) was used for effective and automated optimization of the kernel-function parameter in K-OPLS (SA-K-OPLS). Our results reveal that the non-linear K-OPLS model provides improved prediction performance in three separate metabonomic data sets compared to the linear OPLS model. We also demonstrate how response-orthogonal K-OPLS components provide valuable biological interpretation of model and data. The metabonomic data sets were acquired using proton Nuclear Magnetic Resonance (NMR) spectroscopy, and include a study of the liver toxin galactosamine, a study of the nephrotoxin mercuric chloride and

  4. Optimal Constant-Stress Accelerated Degradation Test Plans Using Nonlinear Generalized Wiener Process

    Directory of Open Access Journals (Sweden)

    Zhen Chen

    2016-01-01

    Full Text Available Accelerated degradation test (ADT has been widely used to assess highly reliable products’ lifetime. To conduct an ADT, an appropriate degradation model and test plan should be determined in advance. Although many historical studies have proposed quite a few models, there is still room for improvement. Hence we propose a Nonlinear Generalized Wiener Process (NGWP model with consideration of the effects of stress level, product-to-product variability, and measurement errors for a higher estimation accuracy and a wider range of use. Then under the constraints of sample size, test duration, and test cost, the plans of constant-stress ADT (CSADT with multiple stress levels based on the NGWP are designed by minimizing the asymptotic variance of the reliability estimation of the products under normal operation conditions. An optimization algorithm is developed to determine the optimal stress levels, the number of units allocated to each level, inspection frequency, and measurement times simultaneously. In addition, a comparison based on degradation data of LEDs is made to show better goodness-of-fit of the NGWP than that of other models. Finally, optimal two-level and three-level CSADT plans under various constraints and a detailed sensitivity analysis are demonstrated through examples in this paper.

  5. Optimal bipedal interactions with dynamic terrain: synthesis and analysis via nonlinear programming

    Science.gov (United States)

    Hubicki, Christian; Goldman, Daniel; Ames, Aaron

    In terrestrial locomotion, gait dynamics and motor control behaviors are tuned to interact efficiently and stably with the dynamics of the terrain (i.e. terradynamics). This controlled interaction must be particularly thoughtful in bipeds, as their reduced contact points render them highly susceptible to falls. While bipedalism under rigid terrain assumptions is well-studied, insights for two-legged locomotion on soft terrain, such as sand and dirt, are comparatively sparse. We seek an understanding of how biological bipeds stably and economically negotiate granular media, with an eye toward imbuing those abilities in bipedal robots. We present a trajectory optimization method for controlled systems subject to granular intrusion. By formulating a large-scale nonlinear program (NLP) with reduced-order resistive force theory (RFT) models and jamming cone dynamics, the optimized motions are informed and shaped by the dynamics of the terrain. Using a variant of direct collocation methods, we can express all optimization objectives and constraints in closed-form, resulting in rapid solving by standard NLP solvers, such as IPOPT. We employ this tool to analyze emergent features of bipedal locomotion in granular media, with an eye toward robotic implementation.

  6. Near Optimal Event-Triggered Control of Nonlinear Discrete-Time Systems Using Neurodynamic Programming.

    Science.gov (United States)

    Sahoo, Avimanyu; Xu, Hao; Jagannathan, Sarangapani

    2016-09-01

    This paper presents an event-triggered near optimal control of uncertain nonlinear discrete-time systems. Event-driven neurodynamic programming (NDP) is utilized to design the control policy. A neural network (NN)-based identifier, with event-based state and input vectors, is utilized to learn the system dynamics. An actor-critic framework is used to learn the cost function and the optimal control input. The NN weights of the identifier, the critic, and the actor NNs are tuned aperiodically once every triggered instant. An adaptive event-trigger condition to decide the trigger instants is derived. Thus, a suitable number of events are generated to ensure a desired accuracy of approximation. A near optimal performance is achieved without using value and/or policy iterations. A detailed analysis of nontrivial inter-event times with an explicit formula to show the reduction in computation is also derived. The Lyapunov technique is used in conjunction with the event-trigger condition to guarantee the ultimate boundedness of the closed-loop system. The simulation results are included to verify the performance of the controller. The net result is the development of event-driven NDP.

  7. Optimal Reservoir Operation for Hydropower Generation using Non-linear Programming Model

    Science.gov (United States)

    Arunkumar, R.; Jothiprakash, V.

    2012-05-01

    Hydropower generation is one of the vital components of reservoir operation, especially for a large multi-purpose reservoir. Deriving optimal operational rules for such a large multi-purpose reservoir serving various purposes like irrigation, hydropower and flood control are complex, because of the large dimension of the problem and the complexity is more if the hydropower production is not an incidental. Thus optimizing the operations of a reservoir serving various purposes requires a systematic study. In the present study such a large multi-purpose reservoir, namely, Koyna reservoir operations are optimized for maximizing the hydropower production subject to the condition of satisfying the irrigation demands using a non-linear programming model. The hydropower production from the reservoir is analysed for three different dependable inflow conditions, representing wet, normal and dry years. For each dependable inflow conditions, various scenarios have been analyzed based on the constraints on the releases and the results are compared. The annual power production, combined monthly power production from all the powerhouses, end of month storage levels, evaporation losses and surplus are discussed. From different scenarios, it is observed that more hydropower can be generated for various dependable inflow conditions, if the restrictions on releases are slightly relaxed. The study shows that Koyna dam is having potential to generate more hydropower.

  8. Problem Decomposition Method to Compute an Optimal Cover for a Set of Functional Dependencies

    Directory of Open Access Journals (Sweden)

    Vitalie COTELEA

    2011-12-01

    Full Text Available The paper proposes a problem decomposition method for building optimal cover for a set of functional dependencies to decrease the solving time. At the beginning, the paper includes an overview of the covers of functional dependencies. There are considered definitions and properties of non redundant covers for sets of functional dependencies, reduced and canonical covers as well as equivalence classes of functional dependencies, minimum and optimal covers. Then, a theoretical tool for inference of functional dependencies is proposed, which possesses the uniqueness property. And finally, the set of attributes of the relational schema is divided into equivalence classes of attributes that will serve as the basis for building optimal cover for a set of functional dependencies.

  9. On the equivalence of stochastic completeness, Liouville and Khas'minskii condition in linear and nonlinear setting

    CERN Document Server

    Mari, Luciano

    2011-01-01

    Set in Riemannian enviroment, the aim of this paper is to present and discuss some equivalent characterizations of the Liouville property relative to special operators, in some sense modeled after the p-Laplacian with potential. In particular, we discuss the equivalence between the Lioville property and the Khas'minskii condition, i.e. the existence of an exhaustion functions which is also a supersolution for the operator outside a compact set. This generalizes a previous result obtained by one of the authors and answers to a question in "Aspects of potential theory, linear and nonlinear" by Pigola Rigoli and Setti.

  10. Proportional Plus Integral Control for Set-Point Regulation of a Class of Nonlinear RLC Circuits

    NARCIS (Netherlands)

    Castanos, Fernando; Jayawardhana, Bayu; Ortega, Romeo; Garcia-Ganseco, Eloisa; García-Canseco, Eloísa

    2009-01-01

    In this paper we identify graph-theoretic conditions which allow us to write a nonlinear RLC circuit as port-Hamiltonian with constant input matrices. We show that under additional monotonicity conditions on the network's components, the circuit enjoys the property of relative passivity, an extended

  11. Nonlinear optimal control of bypass transition in a boundary layer flow

    Science.gov (United States)

    Xiao, Dandan; Papadakis, George

    2016-11-01

    Bypass transition is observed in a flat-plate boundary-layer flow when high levels of free stream turbulence are present. This scenario is characterized by the formation of streamwise elongated streaks inside the boundary layer, their break down into turbulent spots and eventually fully turbulent flow. In the current work, we perform DNS simulations of control of bypass transition in a zero-pressure-gradient boundary layer. A non-linear optimal control algorithm is developed that employs the direct-adjoint approach to minimise a quadratic cost function based on the deviation from the Blasius velocity profile. Using the Lagrange variational approach, the distribution of the blowing/suction control velocity is found by solving iteratively the non-linear Navier-Stokes and its adjoint equations in a forward/backward loop. The optimisation is performed over a finite time horizon during which the Lagrange functional is to be minimised. Large values of optimisation horizon result in instability of the adjoint equations. The results show that the controller is able to reduce the turbulent kinetic energy of the flow in the region where the objective function is defined and the velocity profile is seen to approach the Blasius solution. Significant drag reduction is also achieved.

  12. Molecule-optimized Basis Sets and Hamiltonians for Accelerated Electronic Structure Calculations of Atoms and Molecules

    CERN Document Server

    Gidofalvi, Gergely

    2014-01-01

    Molecule-optimized basis sets, based on approximate natural orbitals, are developed for accelerating the convergence of quantum calculations with strongly correlated (multi-referenced) electrons. We use a low-cost approximate solution of the anti-Hermitian contracted Schr{\\"o}dinger equation (ACSE) for the one- and two-electron reduced density matrices (RDMs) to generate an approximate set of natural orbitals for strongly correlated quantum systems. The natural-orbital basis set is truncated to generate a molecule-optimized basis set whose rank matches that of a standard correlation-consistent basis set optimized for the atoms. We show that basis-set truncation by approximate natural orbitals can be viewed as a one-electron unitary transformation of the Hamiltonian operator and suggest an extension of approximate natural-orbital truncations through two-electron unitary transformations of the Hamiltonian operator, such as those employed in the solution of the ACSE. The molecule-optimized basis set from the ACS...

  13. Use of stochastic optimization techniques for damage detection in complex nonlinear systems

    Directory of Open Access Journals (Sweden)

    Jafarkhani R.

    2012-07-01

    Full Text Available In this study, the performance of stochastic optimization techniques in the finite element model updating approach was investigated for damage detection in a quarter-scale two-span reinforced concrete bridge system which was tested experimentally at the University of Nevada, Reno. The damage sequence in the structure was induced by a range of progressively increasing excitations in the transverse direction of the specimen. Intermediate non-destructive white noise excitations and response measurements were used for system identification and damage detection purposes. It is shown that, when evaluated together with the strain gauge measurements and visual inspection results, the applied finite element model updating algorithm on this complex nonlinear system could accurately detect, localize, and quantify the damage in the tested bridge columns throughout the different phases of the experiment.

  14. SEQUENTIAL SYSTEMS OF LINEAR EQUATIONS ALGORITHM FOR NONLINEAR OPTIMIZATION PROBLEMS - INEQUALITY CONSTRAINED PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    Zi-you Gao; Tian-de Guo; Guo-ping He; Fang Wu

    2002-01-01

    In this paper, a new superlinearly convergent algorithm of sequential systems of linear equations (SSLE) for nonlinear optimization problems with inequality constraints is proposed. Since the new algorithm only needs to solve several systems of linear equations having a same coefficient matrix per iteration, the computation amount of the algorithm is much less than that of the existing SQP algorithms per iteration. Moreover, for the SQPtype algorithms, there exist so-called inconsistent problems, i.e., quadratic programming subproblems of the SQP algorithms may not have a solution at some iterations, but this phenomenon will not occur with the SSLE algorithms because the related systems of linear equations always have solutions. Some numerical results are reported.

  15. Application of optimal homotopy asymptotic method to nonlinear Bingham fluid dampers

    CERN Document Server

    Marinca, Vasile; Bereteu, Liviu

    2015-01-01

    Magnetorheological fluids (MR) are stable suspensions of magnetizable microparticles, characterized by the property to change the rheological characteristics when subjected to the action of magnetic field. Together with another class of materials that change their rheological characteristics in the presence of an electric field, called electrorheological materials are known in the literature as the smart materials or controlled materials. In the absence of a magnetic field the particles in MR fluid are dispersed in the base fluid and its flow through the apertures is behaves as a Newtonian fluid having a constant shear stress. When the magnetic field is applying a MR fluid behavior change, and behaves like a Bingham fluid with a variable shear stress. Dynamic response time is an important characteristic for determining the performance of MR dampers in practical civil engineering applications. The purpose of this paper is to show how to use the Optimal Homotopy Asymptotic Method (OHAM) to solve the nonlinear d...

  16. Generation of stable subfemtosecond hard x-ray pulses with optimized nonlinear bunch compression

    Directory of Open Access Journals (Sweden)

    Senlin Huang

    2014-12-01

    Full Text Available In this paper, we propose a simple scheme that leverages existing x-ray free-electron laser hardware to produce stable single-spike, subfemtosecond x-ray pulses. By optimizing a high-harmonic radio-frequency linearizer to achieve nonlinear compression of a low-charge (20 pC electron beam, we obtain a sharp current profile possessing a few-femtosecond full width at half maximum temporal duration. A reverse undulator taper is applied to enable lasing only within the current spike, where longitudinal space charge forces induce an electron beam time-energy chirp. Simulations based on the Linac Coherent Light Source parameters show that stable single-spike x-ray pulses with a duration less than 200 attoseconds can be obtained.

  17. An Improved Control Vector Iteration Approach for Nonlinear Dynamic Optimization. II. Problems with Path Constraints

    Institute of Scientific and Technical Information of China (English)

    胡云卿; 刘兴高; 薛安克

    2014-01-01

    This paper considers dealing with path constraints in the framework of the improved control vector it-eration (CVI) approach. Two available ways for enforcing equality path constraints are presented, which can be di-rectly incorporated into the improved CVI approach. Inequality path constraints are much more difficult to deal with, even for small scale problems, because the time intervals where the inequality path constraints are active are unknown in advance. To overcome the challenge, the l1 penalty function and a novel smoothing technique are in-troduced, leading to a new effective approach. Moreover, on the basis of the relevant theorems, a numerical algo-rithm is proposed for nonlinear dynamic optimization problems with inequality path constraints. Results obtained from the classic batch reactor operation problem are in agreement with the literature reports, and the computational efficiency is also high.

  18. Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization

    KAUST Repository

    Gunnels, John

    2010-06-01

    We provide a first demonstration of the idea that matrix-based algorithms for nonlinear combinatorial optimization problems can be efficiently implemented. Such algorithms were mainly conceived by theoretical computer scientists for proving efficiency. We are able to demonstrate the practicality of our approach by developing an implementation on a massively parallel architecture, and exploiting scalable and efficient parallel implementations of algorithms for ultra high-precision linear algebra. Additionally, we have delineated and implemented the necessary algorithmic and coding changes required in order to address problems several orders of magnitude larger, dealing with the limits of scalability from memory footprint, computational efficiency, reliability, and interconnect perspectives. © Springer and Mathematical Programming Society 2010.

  19. A genetic algorithm for the pareto optimal solution set of multi-objective shortest path problem

    Institute of Scientific and Technical Information of China (English)

    HU Shi-cheng; XU Xiao-fei; ZHAN De-chen

    2005-01-01

    Unlike the shortest path problem that has only one optimal solution and can be solved in polynomial time, the multi-objective shortest path problem (MSPP) has a set of pareto optimal solutions and cannot be solved in polynomial time. The present algorithms focused mainly on how to obtain a precisely pareto optimal solution for MSPP resulting in a long time to obtain multiple pareto optimal solutions with them. In order to obtain a set of satisfied solutions for MSPP in reasonable time to meet the demand of a decision maker, a genetic algorithm MSPP-GA is presented to solve the MSPP with typically competing objectives, cost and time, in this paper. The encoding of the solution and the operators such as crossover, mutation and selection are developed.The algorithm introduced pareto domination tournament and sharing based selection operator, which can not only directly search the pareto optimal frontier but also maintain the diversity of populations in the process of evolutionary computation. Experimental results show that MSPP-GA can obtain most efficient solutions distributed all along the pareto frontier in less time than an exact algorithm. The algorithm proposed in this paper provides a new and effective method of how to obtain the set of pareto optimal solutions for other multiple objective optimization problems in a short time.

  20. Cost optimization for series-parallel execution of a collection of intersecting operation sets

    Science.gov (United States)

    Dolgui, Alexandre; Levin, Genrikh; Rozin, Boris; Kasabutski, Igor

    2016-05-01

    A collection of intersecting sets of operations is considered. These sets of operations are performed successively. The operations of each set are activated simultaneously. Operation durations can be modified. The cost of each operation decreases with the increase in operation duration. In contrast, the additional expenses for each set of operations are proportional to its time. The problem of selecting the durations of all operations that minimize the total cost under constraint on completion time for the whole collection of operation sets is studied. The mathematical model and method to solve this problem are presented. The proposed method is based on a combination of Lagrangian relaxation and dynamic programming. The results of numerical experiments that illustrate the performance of the proposed method are presented. This approach was used for optimization multi-spindle machines and machining lines, but the problem is common in engineering optimization and thus the techniques developed could be useful for other applications.

  1. A nonlinear programming approach for optimizing two-stage lifting vehicle ascent to orbit

    Science.gov (United States)

    Kamm, J. L.; Johnson, I. L.

    1973-01-01

    An optimal atmospheric flight branched trajectory-shaping capability is presented based on the Davidon-Fletcher-Powell variable metric parameter optimization technique. Gradient information is generated using finite difference methods. A typical atmospheric flight branched optimization problem is analyzed which requires the determination of 31 parameters. This parameter set includes the three-dimensional description of vehicle attitude control angles for three branches of flight: first-stage ascent, second-stage ascent, and first-stage flyback. The important inflight inequality contraints required to maintain the integrity of the vehicles are considered. Some of the numerical methods employed are discussed, along with several new auxiliary techniques developed to improve the compatibility of the numerical gradient and iterator.

  2. A novel Chemical Reaction Optimization based Higher order Neural Network (CRO-HONN for nonlinear classification

    Directory of Open Access Journals (Sweden)

    Janmenjoy Nayak

    2015-09-01

    Full Text Available In this paper, a Chemical Reaction Optimization (CRO based higher order neural network with a single hidden layer called Pi–Sigma Neural Network (PSNN has been proposed for data classification which maintains fast learning capability and avoids the exponential increase of number of weights and processing units. CRO is a recent metaheuristic optimization algorithm inspired by chemical reactions, free from intricate operator and parameter settings such as other algorithms and loosely couples chemical reactions with optimization. The performance of the proposed CRO-PSNN has been tested with various benchmark datasets from UCI machine learning repository and compared with the resulting performance of PSNN, GA-PSNN, PSO-PSNN. The methods have been implemented in MATLAB and the accuracy measures have been tested by using the ANOVA statistical tool. Experimental results show that the proposed method is fast, steady and reliable and provides better classification accuracy than others.

  3. Adaptive dynamic programming for finite-horizon optimal control of discrete-time nonlinear systems with ε-error bound.

    Science.gov (United States)

    Wang, Fei-Yue; Jin, Ning; Liu, Derong; Wei, Qinglai

    2011-01-01

    In this paper, we study the finite-horizon optimal control problem for discrete-time nonlinear systems using the adaptive dynamic programming (ADP) approach. The idea is to use an iterative ADP algorithm to obtain the optimal control law which makes the performance index function close to the greatest lower bound of all performance indices within an ε-error bound. The optimal number of control steps can also be obtained by the proposed ADP algorithms. A convergence analysis of the proposed ADP algorithms in terms of performance index function and control policy is made. In order to facilitate the implementation of the iterative ADP algorithms, neural networks are used for approximating the performance index function, computing the optimal control policy, and modeling the nonlinear system. Finally, two simulation examples are employed to illustrate the applicability of the proposed method.

  4. PID Controller Design of Nonlinear System using a New Modified Particle Swarm Optimization with Time-Varying Constriction Coefficient

    Directory of Open Access Journals (Sweden)

    Alrijadjis .

    2014-12-01

    Full Text Available The proportional integral derivative (PID controllers have been widely used in most process control systems for a long time. However, it is a very important problem how to choose PID parameters, because these parameters give a great influence on the control performance. Especially, it is difficult to tune these parameters for nonlinear systems. In this paper, a new modified particle swarm optimization (PSO is presented to search for optimal PID parameters for such system. The proposed algorithm is to modify constriction coefficient which is nonlinearly decreased time-varying for improving the final accuracy and the convergence speed of PSO. To validate the control performance of the proposed method, a typical nonlinear system control, a continuous stirred tank reactor (CSTR process, is illustrated. The results testify that a new modified PSO algorithm can perform well in the nonlinear PID control system design in term of lesser overshoot, rise-time, settling-time, IAE and ISE. Keywords: PID controller, Particle Swarm Optimization (PSO,constriction factor, nonlinear system.

  5. Fixed set theorems for discrete dynamics and nonlinear boundary-value problems

    Directory of Open Access Journals (Sweden)

    Robert Brooks

    2011-05-01

    Full Text Available We consider self-mappings of Hausdorff topological spaces which map compact sets to compact sets and establish the existence of invariant (fixed sets. The fixed set results are used to provide fixed set analogues of well-known fixed point theorems. An algorithm is employed to compute the existence of fixed sets which are self-similar in a generalized sense. Some numerical examples are given. The utility of the abstract result is further illustrated via the study of a boundary value problem for a system of differential equations

  6. Decoupled ARX and RBF Neural Network Modeling Using PCA and GA Optimization for Nonlinear Distributed Parameter Systems.

    Science.gov (United States)

    Zhang, Ridong; Tao, Jili; Lu, Renquan; Jin, Qibing

    2016-12-08

    Modeling of distributed parameter systems is difficult because of their nonlinearity and infinite-dimensional characteristics. Based on principal component analysis (PCA), a hybrid modeling strategy that consists of a decoupled linear autoregressive exogenous (ARX) model and a nonlinear radial basis function (RBF) neural network model are proposed. The spatial-temporal output is first divided into a few dominant spatial basis functions and finite-dimensional temporal series by PCA. Then, a decoupled ARX model is designed to model the linear dynamics of the dominant modes of the time series. The nonlinear residual part is subsequently parameterized by RBFs, where genetic algorithm is utilized to optimize their hidden layer structure and the parameters. Finally, the nonlinear spatial-temporal dynamic system is obtained after the time/space reconstruction. Simulation results of a catalytic rod and a heat conduction equation demonstrate the effectiveness of the proposed strategy compared to several other methods.

  7. Fitting aerodynamic forces in the Laplace domain: An application of a nonlinear nongradient technique to multilevel constrained optimization

    Science.gov (United States)

    Tiffany, S. H.; Adams, W. M., Jr.

    1984-01-01

    A technique which employs both linear and nonlinear methods in a multilevel optimization structure to best approximate generalized unsteady aerodynamic forces for arbitrary motion is described. Optimum selection of free parameters is made in a rational function approximation of the aerodynamic forces in the Laplace domain such that a best fit is obtained, in a least squares sense, to tabular data for purely oscillatory motion. The multilevel structure and the corresponding formulation of the objective models are presented which separate the reduction of the fit error into linear and nonlinear problems, thus enabling the use of linear methods where practical. Certain equality and inequality constraints that may be imposed are identified; a brief description of the nongradient, nonlinear optimizer which is used is given; and results which illustrate application of the method are presented.

  8. Non-linear stochastic optimal control of acceleration parametrically excited systems

    Science.gov (United States)

    Wang, Yong; Jin, Xiaoling; Huang, Zhilong

    2016-02-01

    Acceleration parametrical excitations have not been taken into account due to the lack of physical significance in macroscopic structures. The explosive development of microtechnology and nanotechnology, however, motivates the investigation of the acceleration parametrically excited systems. The adsorption and desorption effects dramatically change the mass of nano-sized structures, which significantly reduces the precision of nanoscale sensors or can be reasonably utilised to detect molecular mass. This manuscript proposes a non-linear stochastic optimal control strategy for stochastic systems with acceleration parametric excitation based on stochastic averaging of energy envelope and stochastic dynamic programming principle. System acceleration is approximately expressed as a function of system displacement in a short time range under the conditions of light damping and weak excitations, and the acceleration parametrically excited system is shown to be equivalent to a constructed system with an additional displacement parametric excitation term. Then, the controlled system is converted into a partially averaged Itô equation with respect to the total system energy through stochastic averaging of energy envelope, and the optimal control strategy for the averaged system is derived from solving the associated dynamic programming equation. Numerical results for a controlled Duffing oscillator indicate the efficacy of the proposed control strategy.

  9. Optimization of elstomeric micro-fluidic valve dimensions using non-linear finite element methods

    Directory of Open Access Journals (Sweden)

    H Khawaja

    2016-04-01

    Full Text Available We use a nonlinear finite element (FE method model to compare,optimize and determine the limits for useful geometries of microfluidicvalves in elastomer polydimethylsiloxane (PDMS. Simulations havebeen performed with the aim of finding the optimal shape, size andlocation of pressurization that minimizes the pressure required to operatethe valve. One important constraint governing the design parameters isthat the stresses should be within elastic limits, so that the componentremains safe from any type of structural failure. To obtain reliable results,non-linear stress analysis was performed using the Mooney-Rivlin 9parameter approximation which is based on the Hyper Elastic MaterialModel. A 20 noded brick element was used for the development of FEmodel. Mesh sensitivity analysis was also performed to assess the qualityof the results. The simulations were performed with commerciallyavailable FE modeling software, developed by ANSYS Inc. to determinethe effect of varying different geometric parameters on the performanceof micro-fluidic valves.The aim of this work is to determine the geometry of the channel crosssectionthat would result in the largest deflection for the least appliedpressure, i.e. to minimize the pressure needed to operate the valve.

  10. Nonlinear dynamic analysis and optimal trajectory planning of a high-speed macro-micro manipulator

    Science.gov (United States)

    Yang, Yi-ling; Wei, Yan-ding; Lou, Jun-qiang; Fu, Lei; Zhao, Xiao-wei

    2017-09-01

    This paper reports the nonlinear dynamic modeling and the optimal trajectory planning for a flexure-based macro-micro manipulator, which is dedicated to the large-scale and high-speed tasks. In particular, a macro- micro manipulator composed of a servo motor, a rigid arm and a compliant microgripper is focused. Moreover, both flexure hinges and flexible beams are considered. By combining the pseudorigid-body-model method, the assumed mode method and the Lagrange equation, the overall dynamic model is derived. Then, the rigid-flexible-coupling characteristics are analyzed by numerical simulations. After that, the microscopic scale vibration excited by the large-scale motion is reduced through the trajectory planning approach. Especially, a fitness function regards the comprehensive excitation torque of the compliant microgripper is proposed. The reference curve and the interpolation curve using the quintic polynomial trajectories are adopted. Afterwards, an improved genetic algorithm is used to identify the optimal trajectory by minimizing the fitness function. Finally, the numerical simulations and experiments validate the feasibility and the effectiveness of the established dynamic model and the trajectory planning approach. The amplitude of the residual vibration reduces approximately 54.9%, and the settling time decreases 57.1%. Therefore, the operation efficiency and manipulation stability are significantly improved.

  11. Value Iteration Adaptive Dynamic Programming for Optimal Control of Discrete-Time Nonlinear Systems.

    Science.gov (United States)

    Wei, Qinglai; Liu, Derong; Lin, Hanquan

    2016-03-01

    In this paper, a value iteration adaptive dynamic programming (ADP) algorithm is developed to solve infinite horizon undiscounted optimal control problems for discrete-time nonlinear systems. The present value iteration ADP algorithm permits an arbitrary positive semi-definite function to initialize the algorithm. A novel convergence analysis is developed to guarantee that the iterative value function converges to the optimal performance index function. Initialized by different initial functions, it is proven that the iterative value function will be monotonically nonincreasing, monotonically nondecreasing, or nonmonotonic and will converge to the optimum. In this paper, for the first time, the admissibility properties of the iterative control laws are developed for value iteration algorithms. It is emphasized that new termination criteria are established to guarantee the effectiveness of the iterative control laws. Neural networks are used to approximate the iterative value function and compute the iterative control law, respectively, for facilitating the implementation of the iterative ADP algorithm. Finally, two simulation examples are given to illustrate the performance of the present method.

  12. Stochastic Optimal Regulation of Nonlinear Networked Control Systems by Using Event-Driven Adaptive Dynamic Programming.

    Science.gov (United States)

    Sahoo, Avimanyu; Jagannathan, Sarangapani

    2017-02-01

    In this paper, an event-driven stochastic adaptive dynamic programming (ADP)-based technique is introduced for nonlinear systems with a communication network within its feedback loop. A near optimal control policy is designed using an actor-critic framework and ADP with event sampled state vector. First, the system dynamics are approximated by using a novel neural network (NN) identifier with event sampled state vector. The optimal control policy is generated via an actor NN by using the NN identifier and value function approximated by a critic NN through ADP. The stochastic NN identifier, actor, and critic NN weights are tuned at the event sampled instants leading to aperiodic weight tuning laws. Above all, an adaptive event sampling condition based on estimated NN weights is designed by using the Lyapunov technique to ensure ultimate boundedness of all the closed-loop signals along with the approximation accuracy. The net result is event-driven stochastic ADP technique that can significantly reduce the computation and network transmissions. Finally, the analytical design is substantiated with simulation results.

  13. Simulation of diets for dairy goats and growing doelings using nonlinear optimization procedures

    Directory of Open Access Journals (Sweden)

    Leonardo Siqueira Glória

    2016-02-01

    Full Text Available ABSTRACT The objective of this study was to simulate total dry matter intake and cost of diets optimized by nonlinear programming to meet the nutritional requirements of dairy does and growing doelings. The mathematical model was programmed in a Microsoft Excel(r spreadsheet. Increasing values of body mass and average daily weight gain for growing doelings and increasing body mass values and milk yield for dairy does were used as inputs for optimizations. Three objective functions were considered: minimization of the dietary cost, dry matter intake maximization, and maximization of the efficiency of use of the ingested crude protein. To solve the proposed problems we used the Excel(r Solver(r algorithm. The Excel(r Solver(r was able to balance diets containing different objective functions and provided different spaces of feasible solutions. The best solutions are obtained by least-cost formulations; the other two objective functions, namely maximize dry matter intake and maximize crude protein use, do not produce favorable diets in terms of costs.

  14. Level Set-Based Topology Optimization for the Design of an Electromagnetic Cloak With Ferrite Material

    DEFF Research Database (Denmark)

    Otomori, Masaki; Yamada, Takayuki; Andkjær, Jacob Anders;

    2013-01-01

    This paper presents a structural optimization method for the design of an electromagnetic cloak made of ferrite material. Ferrite materials exhibit a frequency-dependent degree of permeability, due to a magnetic resonance phenomenon that can be altered by changing the magnitude of an externally...... applied dc magnetic field. Thus, such ferrite cloaks have the potential to provide novel functions, such as on-off operation in response to on-off application of an external magnetic field. The optimization problems are formulated to minimize the norm of the scattering field from a cylindrical obstacle....... A level set-based topology optimization method incorporating a fictitious interface energy is used to find optimized configurations of the ferrite material. The numerical results demonstrate that the optimization successfully found an appropriate ferrite configuration that functions as an electromagnetic...

  15. Neural network fault diagnosis method optimization with rough set and genetic algorithms

    Institute of Scientific and Technical Information of China (English)

    SUN Hong-yan; XIE Zhi-jiang; OUYANG Qi

    2006-01-01

    Aiming at the disadvantages of BP model in artificial neural networks applied to intelligent fault diagnosis, neural network fault diagnosis optimization method with rough sets and genetic algorithms are presented. The neural network nodes of the input layer can be calculated and simplified through rough sets theory; The neural network nodes of the middle layer are designed through genetic algorithms training; the neural network bottom-up weights and bias are obtained finally through the combination of genetic algorithms and BP algorithms. The analysis in this paper illustrates that the optimization method can improve the performance of the neural network fault diagnosis method greatly.

  16. An integer optimization algorithm for robust identification of non-linear gene regulatory networks

    Directory of Open Access Journals (Sweden)

    Chemmangattuvalappil Nishanth

    2012-09-01

    Full Text Available Abstract Background Reverse engineering gene networks and identifying regulatory interactions are integral to understanding cellular decision making processes. Advancement in high throughput experimental techniques has initiated innovative data driven analysis of gene regulatory networks. However, inherent noise associated with biological systems requires numerous experimental replicates for reliable conclusions. Furthermore, evidence of robust algorithms directly exploiting basic biological traits are few. Such algorithms are expected to be efficient in their performance and robust in their prediction. Results We have developed a network identification algorithm to accurately infer both the topology and strength of regulatory interactions from time series gene expression data in the presence of significant experimental noise and non-linear behavior. In this novel formulism, we have addressed data variability in biological systems by integrating network identification with the bootstrap resampling technique, hence predicting robust interactions from limited experimental replicates subjected to noise. Furthermore, we have incorporated non-linearity in gene dynamics using the S-system formulation. The basic network identification formulation exploits the trait of sparsity of biological interactions. Towards that, the identification algorithm is formulated as an integer-programming problem by introducing binary variables for each network component. The objective function is targeted to minimize the network connections subjected to the constraint of maximal agreement between the experimental and predicted gene dynamics. The developed algorithm is validated using both in silico and experimental data-sets. These studies show that the algorithm can accurately predict the topology and connection strength of the in silico networks, as quantified by high precision and recall, and small discrepancy between the actual and predicted kinetic parameters

  17. Stacking sequence and shape optimization of laminated composite plates via a level-set method

    Science.gov (United States)

    Allaire, G.; Delgado, G.

    2016-12-01

    We consider the optimal design of composite laminates by allowing a variable stacking sequence and in-plane shape of each ply. In order to optimize both variables we rely on a decomposition technique which aggregates the constraints into one unique constraint margin function. Thanks to this approach, an exactly equivalent bi-level optimization problem is established. This problem is made up of an inner level represented by the combinatorial optimization of the stacking sequence and an outer level represented by the topology and geometry optimization of each ply. We propose for the stacking sequence optimization an outer approximation method which iteratively solves a set of mixed integer linear problems associated to the evaluation of the constraint margin function. For the topology optimization of each ply, we lean on the level set method for the description of the interfaces and the Hadamard method for boundary variations by means of the computation of the shape gradient. Numerical experiments are performed on an aeronautic test case where the weight is minimized subject to different mechanical constraints, namely compliance, reserve factor and buckling load.

  18. Topology Optimization using the Level Set and eXtended Finite Element Methods: Theory and Applications

    Science.gov (United States)

    Villanueva Perez, Carlos Hernan

    Computational design optimization provides designers with automated techniques to develop novel and non-intuitive optimal designs. Topology optimization is a design optimization technique that allows for the evolution of a broad variety of geometries in the optimization process. Traditional density-based topology optimization methods often lack a sufficient resolution of the geometry and physical response, which prevents direct use of the optimized design in manufacturing and the accurate modeling of the physical response of boundary conditions. The goal of this thesis is to introduce a unified topology optimization framework that uses the Level Set Method (LSM) to describe the design geometry and the eXtended Finite Element Method (XFEM) to solve the governing equations and measure the performance of the design. The methodology is presented as an alternative to density-based optimization approaches, and is able to accommodate a broad range of engineering design problems. The framework presents state-of-the-art methods for immersed boundary techniques to stabilize the systems of equations and enforce the boundary conditions, and is studied with applications in 2D and 3D linear elastic structures, incompressible flow, and energy and species transport problems to test the robustness and the characteristics of the method. A comparison of the framework against density-based topology optimization approaches is studied with regards to convergence, performance, and the capability to manufacture the designs. Furthermore, the ability to control the shape of the design to operate within manufacturing constraints is developed and studied. The analysis capability of the framework is validated quantitatively through comparison against previous benchmark studies, and qualitatively through its application to topology optimization problems. The design optimization problems converge to intuitive designs and resembled well the results from previous 2D or density-based studies.

  19. Memetic Algorithms to Solve a Global Nonlinear Optimization Problem. A Review

    Directory of Open Access Journals (Sweden)

    M. K. Sakharov

    2015-01-01

    Full Text Available In recent decades, evolutionary algorithms have proven themselves as the powerful optimization techniques of search engine. Their popularity is due to the fact that they are easy to implement and can be used in all areas, since they are based on the idea of universal evolution. For example, in the problems of a large number of local optima, the traditional optimization methods, usually, fail in finding the global optimum. To solve such problems using a variety of stochastic methods, in particular, the so-called population-based algorithms, which are a kind of evolutionary methods. The main disadvantage of this class of methods is their slow convergence to the exact solution in the neighborhood of the global optimum, as these methods incapable to use the local information about the landscape of the function. This often limits their use in largescale real-world problems where the computation time is a critical factor.One of the promising directions in the field of modern evolutionary computation are memetic algorithms, which can be regarded as a combination of population search of the global optimum and local procedures for verifying solutions, which gives a synergistic effect. In the context of memetic algorithms, the meme is an implementation of the local optimization method to refine solution in the search.The concept of memetic algorithms provides ample opportunities for the development of various modifications of these algorithms, which can vary the frequency of the local search, the conditions of its end, and so on. The practically significant memetic algorithm modifications involve the simultaneous use of different memes. Such algorithms are called multi-memetic.The paper gives statement of the global problem of nonlinear unconstrained optimization, describes the most promising areas of AI modifications, including hybridization and metaoptimization. The main content of the work is the classification and review of existing varieties of

  20. Active and Purely Dissipative Nambu Systems in General Thermostatistical Settings Described by Nonlinear Partial Differential Equations Involving Generalized Entropy Measures

    Directory of Open Access Journals (Sweden)

    T. D. Frank

    2016-12-01

    Full Text Available In physics, several attempts have been made to apply the concepts and tools of physics to the life sciences. In this context, a thermostatistic framework for active Nambu systems is proposed. The so-called free energy Fokker–Planck equation approach is used to describe stochastic aspects of active Nambu systems. Different thermostatistic settings are considered that are characterized by appropriately-defined entropy measures, such as the Boltzmann–Gibbs–Shannon entropy and the Tsallis entropy. In general, the free energy Fokker–Planck equations associated with these generalized entropy measures correspond to nonlinear partial differential equations. Irrespective of the entropy-related nonlinearities occurring in these nonlinear partial differential equations, it is shown that semi-analytical solutions for the stationary probability densities of the active Nambu systems can be obtained provided that the pumping mechanisms of the active systems assume the so-called canonical-dissipative form and depend explicitly only on Nambu invariants. Applications are presented both for purely-dissipative and for active systems illustrating that the proposed framework includes as a special case stochastic equilibrium systems.

  1. Optimal tracking control for a class of nonlinear discrete-time systems with time delays based on heuristic dynamic programming.

    Science.gov (United States)

    Zhang, Huaguang; Song, Ruizhuo; Wei, Qinglai; Zhang, Tieyan

    2011-12-01

    In this paper, a novel heuristic dynamic programming (HDP) iteration algorithm is proposed to solve the optimal tracking control problem for a class of nonlinear discrete-time systems with time delays. The novel algorithm contains state updating, control policy iteration, and performance index iteration. To get the optimal states, the states are also updated. Furthermore, the "backward iteration" is applied to state updating. Two neural networks are used to approximate the performance index function and compute the optimal control policy for facilitating the implementation of HDP iteration algorithm. At last, we present two examples to demonstrate the effectiveness of the proposed HDP iteration algorithm.

  2. A non-linear branch and cut method for solving discrete minimum compliance problems to global optimality

    DEFF Research Database (Denmark)

    Stolpe, Mathias; Bendsøe, Martin P.

    2007-01-01

    This paper present some initial results pertaining to a search for globally optimal solutions to a challenging benchmark example proposed by Zhou and Rozvany. This means that we are dealing with global optimization of the classical single load minimum compliance topology design problem with a fixed...... finite element discretization and with discrete design variables. Global optimality is achieved by the implementation of some specially constructed convergent nonlinear branch and cut methods, based on the use of natural relaxations and by applying strengthening constraints (linear valid inequalities...

  3. The near optimality of the stabilizing control in a weakly nonlinear system with state-dependent coefficients

    Science.gov (United States)

    Dmitriev, Mikhail G.; Makarov, Dmitry A.

    2016-08-01

    We carried out analysis of near optimality of one computationally effective nonlinear stabilizing control built for weakly nonlinear systems with coefficients depending on the state and the formal small parameter. First investigation of that problem was made in [M. G. Dmitriev, and D. A. Makarov, "The suboptimality of stabilizing regulator in a quasi-linear system with state-depended coefficients," in 2016 International Siberian Conference on Control and Communications (SIBCON) Proceedings, National Research University, Moscow, 2016]. In this paper, another optimal control and gain matrix representations were used and theoretical results analogous to cited work above were obtained. Also as in the cited work above the form of quality criterion on which this close-loop control is optimal was constructed.

  4. Optimal Selection of Reference Set for the Nearest Neighbor Classification by Tabu Search

    Institute of Scientific and Technical Information of China (English)

    张鸿宾; 孙广煜

    2001-01-01

    In this paper, a new approach is presented to find the reference set for the nearest neighbor classifier. The optimal reference set, which has minimum sample size and satisfies a certain error rate threshold, is obtained through a Tabu search algorithm. When the error rate threshold is set to zero, the algorithm obtains a near minimal consistent subset of a given training set. While the threshold is set to a small appropriate value, the obtained reference set may compensate the bias of the nearest neighbor estimate. An aspiration criterion for Tabu search is introduced, which aims to prevent the search process from the inefficient wandering between the feasible and infeasible regions in the search space and speed up the convergence. Experimental results based on a number of typical data sets are presented and analyzed to illustrate the benefits of the proposed method. Compared to conventional methods, such as CNN and Dasarathy's algorithm, the size of the reduced reference sets is much smaller, and the nearest neighbor classification performance is better, especially when the error rate thresholds are set to appropriate nonzero values. The experimental results also illustrate that the MCS (minimal consistent set) of Dasarathy's algorithm is not minimal, and its candidate consistent set is not always ensured to reduce monotonically. A counter example is also given to confirm this claim.

  5. A trust region algorithm for optimization with nonlinear equality and linear inequality constraints

    Institute of Scientific and Technical Information of China (English)

    陈中文; 韩继业

    1996-01-01

    A new algorithm of trust region type is presented to minimize a differentiable function ofmany variables with nonlinear equality and linear inequality constraints. Under the milder conditions, theglobal convergence of the main algorithm is proved. Moreover, since any nonlinear inequality constraint can beconverted into an equation by introducing a slack variable, the trust region method can be used in solving general nonlinear programming problems.

  6. Approximating the Pareto Set of Multiobjective Linear Programs via Robust Optimization

    NARCIS (Netherlands)

    Gorissen, B.L.; den Hertog, D.

    2012-01-01

    Abstract: The Pareto set of a multiobjective optimization problem consists of the solutions for which one or more objectives can not be improved without deteriorating one or more other objectives. We consider problems with linear objectives and linear constraints and use Adjustable Robust Optimizati

  7. Sensitivity Analysis of the Optimal Parameter Settings of an LTE Packet Scheduler

    NARCIS (Netherlands)

    Fernandez Diaz, I.; Litjens, R.; Berg, J.L. van den; Dimitrova, D.C.; Spaey, K.

    2010-01-01

    Advanced packet scheduling schemes in 3G/3G+ mobile networks provide one or more parameters to optimise the trade-off between QoS and resource efficiency. In this paper we study the sensitivity of the optimal parameter setting for packet scheduling in LTE radio networks with respect to various traff

  8. A Decomposition Model for HPLC-DAD Data Set and Its Solution by Particle Swarm Optimization

    Directory of Open Access Journals (Sweden)

    Lizhi Cui

    2014-01-01

    Full Text Available This paper proposes a separation method, based on the model of Generalized Reference Curve Measurement and the algorithm of Particle Swarm Optimization (GRCM-PSO, for the High Performance Liquid Chromatography with Diode Array Detection (HPLC-DAD data set. Firstly, initial parameters are generated to construct reference curves for the chromatogram peaks of the compounds based on its physical principle. Then, a General Reference Curve Measurement (GRCM model is designed to transform these parameters to scalar values, which indicate the fitness for all parameters. Thirdly, rough solutions are found by searching individual target for every parameter, and reinitialization only around these rough solutions is executed. Then, the Particle Swarm Optimization (PSO algorithm is adopted to obtain the optimal parameters by minimizing the fitness of these new parameters given by the GRCM model. Finally, spectra for the compounds are estimated based on the optimal parameters and the HPLC-DAD data set. Through simulations and experiments, following conclusions are drawn: (1 the GRCM-PSO method can separate the chromatogram peaks and spectra from the HPLC-DAD data set without knowing the number of the compounds in advance even when severe overlap and white noise exist; (2 the GRCM-PSO method is able to handle the real HPLC-DAD data set.

  9. Optimal air quality policies and health: a multi-objective nonlinear approach.

    Science.gov (United States)

    Relvas, Helder; Miranda, Ana Isabel; Carnevale, Claudio; Maffeis, Giuseppe; Turrini, Enrico; Volta, Marialuisa

    2017-05-01

    The use of modelling tools to support decision-makers to plan air quality policies is now quite widespread in Europe. In this paper, the Regional Integrated Assessment Tool (RIAT+), which was designed to support policy-maker decision on optimal emission reduction measures to improve air quality at minimum costs, is applied to the Porto Urban Area (Portugal). In addition to technological measures, some local measures were included in the optimization process. Case study results are presented for a multi-objective approach focused on both NO2 and PM10 control measures, assuming equivalent importance in the optimization process. The optimal set of air quality measures is capable to reduce simultaneously the annual average concentrations values of PM10 and NO2 in 1.7 and 1.0 μg/m(3), respectively. This paper illustrates how the tool could be used to prioritize policy objectives and help making informed decisions about reducing air pollution and improving public health.

  10. Internal combustion engine report: Spark ignited ICE GenSet optimization and novel concept development

    Energy Technology Data Exchange (ETDEWEB)

    Keller, J.; Blarigan, P. Van [Sandia National Labs., Livermore, CA (United States)

    1998-08-01

    In this manuscript the authors report on two projects each of which the goal is to produce cost effective hydrogen utilization technologies. These projects are: (1) the development of an electrical generation system using a conventional four-stroke spark-ignited internal combustion engine generator combination (SI-GenSet) optimized for maximum efficiency and minimum emissions, and (2) the development of a novel internal combustion engine concept. The SI-GenSet will be optimized to run on either hydrogen or hydrogen-blends. The novel concept seeks to develop an engine that optimizes the Otto cycle in a free piston configuration while minimizing all emissions. To this end the authors are developing a rapid combustion homogeneous charge compression ignition (HCCI) engine using a linear alternator for both power take-off and engine control. Targeted applications include stationary electrical power generation, stationary shaft power generation, hybrid vehicles, and nearly any other application now being accomplished with internal combustion engines.

  11. A level set-based shape optimization method for periodic sound barriers composed of elastic scatterers

    Science.gov (United States)

    Hashimoto, Hiroshi; Kim, Min-Geun; Abe, Kazuhisa; Cho, Seonho

    2013-10-01

    This paper presents a level set-based topology optimization method for noise barriers formed from an assembly of scatterers. The scattering obstacles are modeled by elastic bodies arranged periodically along the wall. Due to the periodicity, the problem can be reduced to that in a unit cell. The interaction between the elastic scatterers and the acoustic field is described in the context of the level set analysis. The semi-infinite acoustic wave regions located on the both sides of the barrier are represented by impedance matrices. The objective function is defined by the energy transmission passing the barrier. The design sensitivity is evaluated analytically by the aid of adjoint equations. The dependency of the optimal profile on the stiffness of scatterers and on the target frequency band is examined. The feasibility of the developed optimization method is proved through numerical examples.

  12. Robust Optimal Output Tracking Control of A Midwater Trawl System Based on T-S Fuzzy Nonlinear Model

    Institute of Scientific and Technical Information of China (English)

    ZHOU Hua; CHEN Ying-long; YANG Hua-yong

    2013-01-01

    A robust optimal output tracking control method for a midwater trawl system is investigated based on T-S fuzzy nonlinear model.A simplified nonlinear mathematical model is first employed to represent a midwater trawl system,and then a T-S fuzzy model is adopted to approximate the nonlinear system.Since the strong nonlinearities and the external disturbance of the trawling system,a mixed H2/H∞ fuzzy output tracking control strategy via T-S fuzzy system is proposed to regulate the trawl depth to follow a desired trajectory.The trawl depth can be regulated by adjusting the winch velocity automatically and the tracking error can be minimized according to the robust optimal criterion.In order to validate the proposed control method,a computer simulation is conducted.The simulation results indicate that the proposed fuzzy robust optimal controller make the trawl net rapidly follow the desired trajectory under the model uncertainties and the external disturbance caused by wave and current.

  13. Stack emission monitoring using non-dispersive infrared spectroscopy with an optimized nonlinear absorption cross interference correction algorithm

    Directory of Open Access Journals (Sweden)

    Y. W. Sun

    2013-08-01

    Full Text Available In this paper, we present an optimized analysis algorithm for non-dispersive infrared (NDIR to in situ monitor stack emissions. The proposed algorithm simultaneously compensates for nonlinear absorption and cross interference among different gases. We present a mathematical derivation for the measurement error caused by variations in interference coefficients when nonlinear absorption occurs. The proposed algorithm is derived from a classical one and uses interference functions to quantify cross interference. The interference functions vary proportionally with the nonlinear absorption. Thus, interference coefficients among different gases can be modeled by the interference functions whether gases are characterized by linear or nonlinear absorption. In this study, the simultaneous analysis of two components (CO2 and CO serves as an example for the validation of the proposed algorithm. The interference functions in this case can be obtained by least-squares fitting with third-order polynomials. Experiments show that the results of cross interference correction are improved significantly by utilizing the fitted interference functions when nonlinear absorptions occur. The dynamic measurement ranges of CO2 and CO are improved by about a factor of 1.8 and 3.5, respectively. A commercial analyzer with high accuracy was used to validate the CO and CO2 measurements derived from the NDIR analyzer prototype in which the new algorithm was embedded. The comparison of the two analyzers show that the prototype works well both within the linear and nonlinear ranges.

  14. Finite-Horizon Approximate Optimal Guaranteed Cost Control of Uncertain Nonlinear Systems With Application to Mars Entry Guidance.

    Science.gov (United States)

    Wu, Huai-Ning; Li, Mao-Mao; Guo, Lei

    2015-07-01

    This paper studies the finite-horizon optimal guaranteed cost control (GCC) problem for a class of time-varying uncertain nonlinear systems. The aim of this problem is to find a robust state feedback controller such that the closed-loop system has not only a bounded response in a finite duration of time for all admissible uncertainties but also a minimal guaranteed cost. A neural network (NN) based approximate optimal GCC design is developed. Initially, by modifying the cost function to account for the nonlinear perturbation of system, the optimal GCC problem is transformed into a finite-horizon optimal control problem of the nominal system. Subsequently, with the help of the modified cost function together with a parametrized bounding function for all admissible uncertainties, the solution to the optimal GCC problem is given in terms of a parametrized Hamilton-Jacobi-Bellman (PHJB) equation. Then, a NN method is developed to solve offline the PHJB equation approximately and thus obtain the nearly optimal GCC policy. Furthermore, the convergence of approximate PHJB equation and the robust admissibility of nearly optimal GCC policy are also analyzed. Finally, by applying the proposed design method to the entry guidance problem of the Mars lander, the achieved simulation results show the effectiveness of the proposed controller.

  15. Method for Determining the Maximum Allowable Capacity of Wind Farm Based on Box Set Robust Optimization

    Directory of Open Access Journals (Sweden)

    Lihui Guo

    2015-01-01

    Full Text Available With the increasing penetration of wind power, the randomness and volatility of wind power output would have a greater impact on safety and steady operation of power system. In allusion to the uncertainty of wind speed and load demand, this paper applied box set robust optimization theory in determining the maximum allowable installed capacity of wind farm, while constraints of node voltage and line capacity are considered. Optimized duality theory is used to simplify the model and convert uncertainty quantities in constraints into certainty quantities. Under the condition of multi wind farms, a bilevel optimization model to calculate penetration capacity is proposed. The result of IEEE 30-bus system shows that the robust optimization model proposed in the paper is correct and effective and indicates that the fluctuation range of wind speed and load and the importance degree of grid connection point of wind farm and load point have impact on the allowable capacity of wind farm.

  16. New judging model of fuzzy cluster optimal dividing based on rough sets theory

    Institute of Scientific and Technical Information of China (English)

    Wang Yun; Liu Qinghong; Mu Yong; Shi Kaiquan

    2007-01-01

    To investigate the judging problem of optimal dividing matrix among several fuzzy dividing matrices in fuzzy dividing space, correspondingly, which is determined by the various choices of cluster samples in the totality sample space, two algorithms are proposed on the basis of the data analysis method in rough sets theory: information system discrete algorithm (algorithm 1) and samples representatives judging algorithm (algorithm 2).On the principle of the farthest distance, algorithm 1 transforms continuous data into discrete form which could be transacted by rough sets theory.Taking the approximate precision as a criterion, algorithm 2 chooses the sample space with a good representative.Hence, the clustering sample set in inducing and computing optimal dividing matrix can be achieved.Several theorems are proposed to provide strict theoretic foundations for the execution of the algorithm model.An applied example based on the new algorithm model is given, whose result verifies the feasibility of this new algorithm model.

  17. Parameter estimation in biogeochimical surface model using nonlinear inversion: optimization with measurements over a pine forest.

    Science.gov (United States)

    Santaren, D.; Peylin, P.; Viovy, N.; Ciais, P.

    2003-04-01

    Global model of Carbone, water, and energy exchanges between the biosphere and the atmosphere are usually validated and calibrated with intensive measurement made over specific ecosystem like those of the fluxnet networks.However the nonlinear dependance between fluxes and model parameters generally complicate the optimization of the major parameters.In this study, we estimate few key parameters of the ORCHIDEE french model,using diurnal variation measurements of latent heat,sensible heat and net CO2 fluxes for 3 weeks over pine forest (Landes, France).The model is forced with the observed climatic forcing: Temperature, income solar radiations,wind velocity norm, air humidity, pressure and precipitations. We will first present the inverse methodology and the problem linkedto the non linearity. The result of the optimization shows correlations within the initial ensemble of parameters which allow us to choose only five parameters determined independently from the observations. Directly related to the net CO2 flux, the maximum rate of carboxylation,Vcmax,and the stomatal conductance, gs, are significantly changed from their apriori estimate for that period. The aerodynamic resistance, the albedo and a parameter linked to maintenance respiration were also modified within their physical range.Overall the model fit to the data was largely improved. Note however that some discrepancies remain for sensible heat flux which would probably require some model improvements for the stocking of energy in the soil. Such work is currently extended in time to account for parameter variations between the season. The application to other ecosystems and with the supplementary data of the Leaf Area Index will be also discussed.

  18. Development of optimization models for the set behavior and compressive strength of sodium activated geopolymer pastes

    Science.gov (United States)

    Fillenwarth, Brian Albert

    As large countries such as China begin to industrialize and concerns about global warming continue to grow, there is an increasing need for more environmentally friendly building materials. One promising material known as a geopolymer can be used as a portland cement replacement and in this capacity emits around 67% less carbon dioxide. In addition to potentially reducing carbon emissions, geopolymers can be synthesized with many industrial waste products such as fly ash. Although the benefits of geopolymers are substantial, there are a few difficulties with designing geopolymer mixes which have hindered widespread commercialization of the material. One such difficulty is the high variability of the materials used for their synthesis. In addition to this, interrelationships between mix design variables and how these interrelationships impact the set behavior and compressive strength are not well understood. A third complicating factor with designing geopolymer mixes is that the role of calcium in these systems is not well understood. In order to overcome these barriers, this study developed predictive optimization models through the use of genetic programming with experimentally collected set times and compressive strengths of several geopolymer paste mixes. The developed set behavior models were shown to predict the correct set behavior from the mix design over 85% of the time. The strength optimization model was shown to be capable of predicting compressive strengths of geopolymer pastes from their mix design to within about 1 ksi of their actual strength. In addition to this the optimization models give valuable insight into the key factors influencing strength development as well as the key factors responsible for flash set and long set behaviors in geopolymer pastes. A method for designing geopolymer paste mixes was developed from the generated optimization models. This design method provides an invaluable tool for use in future geopolymer research as well as

  19. A new non-linear vortex lattice method:Applications to wing aerodynamic optimizations

    Institute of Scientific and Technical Information of China (English)

    Oliviu S? ugar Gabor; Andreea Koreanschi; Ruxandra Mihaela Botez

    2016-01-01

    This paper presents a new non-linear formulation of the classical Vortex Lattice Method (VLM) approach for calculating the aerodynamic properties of lifting surfaces. The method accounts for the effects of viscosity, and due to its low computational cost, it represents a very good tool to perform rapid and accurate wing design and optimization procedures. The mathematical model is constructed by using two-dimensional viscous analyses of the wing span-wise sections, according to strip theory, and then coupling the strip viscous forces with the forces generated by the vortex rings distributed on the wing camber surface, calculated with a fully three-dimensional vortex lifting law. The numerical results obtained with the proposed method are validated with experimental data and show good agreement in predicting both the lift and pitching moment, as well as in predicting the wing drag. The method is applied to modifying the wing of an Unmanned Aerial System to increase its aerodynamic efficiency and to calculate the drag reductions obtained by an upper surface morphing technique for an adaptable regional aircraft wing.

  20. Optimal experimental design for nonlinear ill-posed problems applied to gravity dams

    Science.gov (United States)

    Lahmer, Tom

    2011-12-01

    The safe operation of gravity dams requires continuous monitoring in order to detect any changes concerning the stability of these constructions. Damage which may result from cyclic loading, variation in temperature, aging, chemical reactions, etc needs to be identified as fast and as reliable as possible. Generally, existing dams are well monitored by several types of measurement devices which log different physical quantities. The monitoring practice is according to official guidelines and the engineer’s experience. The aim of this paper is to perform a simulation-based optimal design for the monitoring of existing dams. Therefore, a design criterion which is based on average mean-squared reconstruction errors is derived. The reconstructions are obtained as regularized solutions of the nonlinear, inverse and ill-posed problem of damage identification. The basis for these investigations is a hydro-mechanically coupled model applied to gravity dams. Damaged zones in the dams are described by a smeared crack model, i.e. by spatially varying material properties. The inherent correlation of changes in the dominating parameters is explicitly considered during the inverse analysis. For the solution and regularization of the inverse problem, the iteratively regularized Gauss-Newton method is applied. Numerical results of the inverse analysis and the design process allow assessments of the applicability of the strategies proposed here.

  1. A new non-linear vortex lattice method: Applications to wing aerodynamic optimizations

    Directory of Open Access Journals (Sweden)

    Oliviu Şugar Gabor

    2016-10-01

    Full Text Available This paper presents a new non-linear formulation of the classical Vortex Lattice Method (VLM approach for calculating the aerodynamic properties of lifting surfaces. The method accounts for the effects of viscosity, and due to its low computational cost, it represents a very good tool to perform rapid and accurate wing design and optimization procedures. The mathematical model is constructed by using two-dimensional viscous analyses of the wing span-wise sections, according to strip theory, and then coupling the strip viscous forces with the forces generated by the vortex rings distributed on the wing camber surface, calculated with a fully three-dimensional vortex lifting law. The numerical results obtained with the proposed method are validated with experimental data and show good agreement in predicting both the lift and pitching moment, as well as in predicting the wing drag. The method is applied to modifying the wing of an Unmanned Aerial System to increase its aerodynamic efficiency and to calculate the drag reductions obtained by an upper surface morphing technique for an adaptable regional aircraft wing.

  2. Non-Linearity Analysis of Depth and Angular Indexes for Optimal Stereo SLAM

    Directory of Open Access Journals (Sweden)

    David Schleicher

    2010-04-01

    Full Text Available In this article, we present a real-time 6DoF egomotion estimation system for indoor environments using a wide-angle stereo camera as the only sensor. The stereo camera is carried in hand by a person walking at normal walking speeds 3–5 km/h. We present the basis for a vision-based system that would assist the navigation of the visually impaired by either providing information about their current position and orientation or guiding them to their destination through different sensing modalities. Our sensor combines two different types of feature parametrization: inverse depth and 3D in order to provide orientation and depth information at the same time. Natural landmarks are extracted from the image and are stored as 3D or inverse depth points, depending on a depth threshold. This depth threshold is used for switching between both parametrizations and it is computed by means of a non-linearity analysis of the stereo sensor. Main steps of our system approach are presented as well as an analysis about the optimal way to calculate the depth threshold. At the moment each landmark is initialized, the normal of the patch surface is computed using the information of the stereo pair. In order to improve long-term tracking, a patch warping is done considering the normal vector information. Some experimental results under indoor environments and conclusions are presented.

  3. A nonlinear H-infinity approach to optimal control of the depth of anaesthesia

    Science.gov (United States)

    Rigatos, Gerasimos; Rigatou, Efthymia; Zervos, Nikolaos

    2016-12-01

    Controlling the level of anaesthesia is important for improving the success rate of surgeries and for reducing the risks to which operated patients are exposed. This paper proposes a nonlinear H-infinity approach to optimal control of the level of anaesthesia. The dynamic model of the anaesthesia, which describes the concentration of the anaesthetic drug in different parts of the body, is subjected to linearization at local operating points. These are defined at each iteration of the control algorithm and consist of the present value of the system's state vector and of the last control input that was exerted on it. For this linearization Taylor series expansion is performed and the system's Jacobian matrices are computed. For the linearized model an H-infinity controller is designed. The feedback control gains are found by solving at each iteration of the control algorithm an algebraic Riccati equation. The modelling errors due to this approximate linearization are considered as disturbances which are compensated by the robustness of the control loop. The stability of the control loop is confirmed through Lyapunov analysis.

  4. Optimizing Geographic Allotment of Photovoltaic Capacity in a Distributed Generation Setting: Preprint

    Energy Technology Data Exchange (ETDEWEB)

    Urquhart, B.; Sengupta, M.; Keller, J.

    2012-09-01

    A multi-objective optimization was performed to allocate 2MW of PV among four candidate sites on the island of Lanai such that energy was maximized and variability in the form of ramp rates was minimized. This resulted in an optimal solution set which provides a range of geographic allotment alternatives for the fixed PV capacity. Within the optimal set, a tradeoff between energy produced and variability experienced was found, whereby a decrease in variability always necessitates a simultaneous decrease in energy. A design point within the optimal set was selected for study which decreased extreme ramp rates by over 50% while only decreasing annual energy generation by 3% over the maximum generation allocation. To quantify the allotment mix selected, a metric was developed, called the ramp ratio, which compares ramping magnitude when all capacity is allotted to a single location to the aggregate ramping magnitude in a distributed scenario. The ramp ratio quantifies simultaneously how much smoothing a distributed scenario would experience over single site allotment and how much a single site is being under-utilized for its ability to reduce aggregate variability. This paper creates a framework for use by cities and municipal utilities to reduce variability impacts while planning for high penetration of PV on the distribution grid.

  5. Security Optimization for Distributed Applications Oriented on Very Large Data Sets

    Directory of Open Access Journals (Sweden)

    Mihai DOINEA

    2010-01-01

    Full Text Available The paper presents the main characteristics of applications which are working with very large data sets and the issues related to security. First section addresses the optimization process and how it is approached when dealing with security. The second section describes the concept of very large datasets management while in the third section the risks related are identified and classified. Finally, a security optimization schema is presented with a cost-efficiency analysis upon its feasibility. Conclusions are drawn and future approaches are identified.

  6. Optimization of a forest harvesting set based on the Queueing Theory: Case study from Karelia

    Directory of Open Access Journals (Sweden)

    Shegelman Ilya

    2015-12-01

    Full Text Available The modern technological process of timber harvesting is a complex system both technically and organizationally. Nowadays, the study of such systems and improvement of their efficiency is impossible without the use of mathematical modeling methods. The paper presents the methodology for the optimization of logging operations based on the queueing theory. We show the adapted queueing model, which characterizes the process of logging with the use of a harvesting set consisting of harvesters and forwarders. We also present the experimental verification of the designated model that confirmed mode’s adequacy. The analysis of the effectiveness of the investigated harvesting set was conducted and the recommendations for its optimization were drawn. The research was conducted in the Pryazhinsky District in the Republic of Karelia. We showed that significant improvement of operational efficiency of the investigated harvesting set in the study area cannot be done by adjusting separate machine operations (i.e. by reducing the time of operations execution and their steadiness. However, a change in the number of machines allowed significant improvement in the operational efficiency. The most optimal harvesting set design for the experimental area consisted of two harvesters and two forwarders.

  7. A nonlinear training set superposition filter derived by neural network training methods for implementation in a shift-invariant optical correlator

    Science.gov (United States)

    Kypraios, Ioannis; Young, Rupert C. D.; Birch, Philip M.; Chatwin, Christopher R.

    2003-08-01

    The various types of synthetic discriminant function (sdf) filter result in a weighted linear superposition of the training set images. Neural network training procedures result in a non-linear superposition of the training set images or, effectively, a feature extraction process, which leads to better interpolation properties than achievable with the sdf filter. However, generally, shift invariance is lost since a data dependant non-linear weighting function is incorporated in the input data window. As a compromise, we train a non-linear superposition filter via neural network methods with the constraint of a linear input to allow for shift invariance. The filter can then be used in a frequency domain based optical correlator. Simulation results are presented that demonstrate the improved training set interpolation achieved by the non-linear filter as compared to a linear superposition filter.

  8. A Binary Cat Swarm Optimization Algorithm for the Non-Unicost Set Covering Problem

    Directory of Open Access Journals (Sweden)

    Broderick Crawford

    2015-01-01

    Full Text Available The Set Covering Problem consists in finding a subset of columns in a zero-one matrix such that they cover all the rows of the matrix at a minimum cost. To solve the Set Covering Problem we use a metaheuristic called Binary Cat Swarm Optimization. This metaheuristic is a recent swarm metaheuristic technique based on the cat behavior. Domestic cats show the ability to hunt and are curious about moving objects. Based on this, the cats have two modes of behavior: seeking mode and tracing mode. We are the first ones to use this metaheuristic to solve this problem; our algorithm solves a set of 65 Set Covering Problem instances from OR-Library.

  9. Investigation and optimization of transverse non-linear beam dynamics in the high-energy storage ring HESR

    Energy Technology Data Exchange (ETDEWEB)

    Welsch, Dominic Markus

    2010-03-10

    The High-Energy Storage Ring (HESR) is part of the upcoming Facility for Antiproton and Ion Research (FAIR) which is planned as a major extension to the present facility of the Helmholtzzentrum fuer Schwerionenforschung (GSI) in Darmstadt. The HESR will provide antiprotons in the momentum range from 1.5 to 15 GeV/c for the internal target experiment PANDA. The demanding requirements of PANDA in terms of beam quality and luminosity together with a limited production rate of antiprotons call for a long beam life time and a minimum of beam loss. Therefore, an effective closed orbit correction and a sufficiently large dynamic aperture of the HESR are crucial. With this thesis I present my work on both of these topics. The expected misalignments of beam guiding magnets have been estimated and used to simulate the closed orbit in the HESR. A closed orbit correction scheme has been developed for different ion optical settings of the HESR and numerical simulations have been performed to validate the scheme. The proposed closed orbit correction method which uses the orbit response matrix has been benchmarked at the Cooler Synchrotron COSY of the Forschungszentrum Juelich. A chromaticity correction scheme for the HESR consisting of sextupole magnets has been developed to reduce tune spread and thus to minimize the emittance growth caused by betatron resonances. The chromaticity correction scheme has been optimized through dynamic aperture calculations. The estimated field errors of the HESR dipole and quadrupole magnets have been included in the non-linear beam dynamics studies. Investigations concerning their optimization have been carried out. The ion optical settings of the HESR have been improved using dynamic aperture calculations and the technique of frequency map analysis. The related diffusion coefficient was also used to predict long-term stability based on short-term particle tracking. With a reasonable reduction of the quadrupole magnets field errors and a

  10. Applications of Conditional Nonlinear Optimal Perturbation to the Study of the Stability and Sensitivity of the Jovian Atmosphere

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    A two-layer quasi-geostrophic model is used to study the stability and sensitivity of motions on small-scale vortices in Jupiter's atmosphere. Conditional nonlinear optimal perturbations (CNOPs) and linear singular vectors (LSVs) are both obtained numerically and compared in this paper. The results show that CNOPs can capture the nonlinear characteristics of motions in small-scale vortices in Jupiter's atmosphere and show great difference from LSVs under the condition that the initial constraint condition is large or the optimization time is not very short or both. Besides, in some basic states, local CNOPs are found.The pattern of LSV is more similar to local CNOP than global CNOP in some cases. The elementary application of the method of CNOP to the Jovian atmosphere helps us to explore the stability of variousscale motions of Jupiter's atmosphere and to compare the stability of motions in Jupiter's atmosphere and Earth's atmosphere further.

  11. Classification of melanoma using wavelet-transform-based optimal feature set

    Science.gov (United States)

    Walvick, Ronn P.; Patel, Ketan; Patwardhan, Sachin V.; Dhawan, Atam P.

    2004-05-01

    The features used in the ABCD rule for characterization of skin lesions suggest that the spatial and frequency information in the nevi changes at various stages of melanoma development. To analyze these changes wavelet transform based features have been reported. The classification of melanoma using these features has produced varying results. In this work, all the reported wavelet transform based features are combined to form a single feature set. This feature set is then optimized by removing redundancies using principal component analysis. A feed forward neural network trained with the back propagation algorithm is then used in the classification process to obtain better classification results.

  12. Generated spiral bevel gears: Optimal machine-tool settings and tooth contact analysis

    Science.gov (United States)

    Litvin, F. L.; Tsung, W. J.; Coy, J. J.; Heine, C.

    1985-01-01

    Geometry and kinematic errors were studied for Gleason generated spiral bevel gears. A new method was devised for choosing optimal machine settings. These settings provide zero kinematic errors and an improved bearing contact. The kinematic errors are a major source of noise and vibration in spiral bevel gears. The improved bearing contact gives improved conditions for lubrication. A computer program for tooth contact analysis was developed, and thereby the new generation process was confirmed. The new process is governed by the requirement that during the generation process there is directional constancy of the common normal of the contacting surfaces for generator and generated surfaces of pinion and gear.

  13. Generated spiral bevel gears - Optimal machine-tool settings and tooth contact analysis

    Science.gov (United States)

    Litvin, F. L.; Tsung, W.-J.; Coy, J. J.; Heine, C.

    1985-01-01

    Geometry and kinematic errors were studied for Gleason generated spiral bevel gears. A new method was devised for choosing optimal machine settings. These settings provide zero kinematic errors and an improved bearing contact. The kinematic errors are a major source of noise and vibration in spiral bevel gears. The improved bearing contact gives improved conditions for lubrication. A computer program for tooth contact analysis was developed, and thereby the new generation process was confirmed. The new process is governed by the requirement that during the generation process there is directional constancy of the common normal of the contacting surfaces for generator and generated surfaces of pinion and gear.

  14. A jazz-based approach for optimal setting of pressure reducing valves in water distribution networks

    Science.gov (United States)

    De Paola, Francesco; Galdiero, Enzo; Giugni, Maurizio

    2016-05-01

    This study presents a model for valve setting in water distribution networks (WDNs), with the aim of reducing the level of leakage. The approach is based on the harmony search (HS) optimization algorithm. The HS mimics a jazz improvisation process able to find the best solutions, in this case corresponding to valve settings in a WDN. The model also interfaces with the improved version of a popular hydraulic simulator, EPANET 2.0, to check the hydraulic constraints and to evaluate the performances of the solutions. Penalties are introduced in the objective function in case of violation of the hydraulic constraints. The model is applied to two case studies, and the obtained results in terms of pressure reductions are comparable with those of competitive metaheuristic algorithms (e.g. genetic algorithms). The results demonstrate the suitability of the HS algorithm for water network management and optimization.

  15. On Optimal Causal Coding of Partially Observed Markov Sources in Single and Multi-Terminal Settings

    CERN Document Server

    Yüksel, Serdar

    2010-01-01

    The optimal causal coding of a partially observed Markov process is studied, where the cost to be minimized is a bounded, non-negative, additive, measurable single-letter function of the source and the receiver output. A structural result is obtained extending Witsenhausen's and Walrand-Varaiya's structural results on the optimal real-time coders to a partially observed setting. The decentralized (multi-terminal) setup is also considered. For the case where the source is an i.i.d. process, it is shown that the design of optimal decentralized causal coding of correlated observations admits a separation. For Markov sources, a counterexample to a natural separation conjecture is presented. Applications in estimation and networked control problems are discussed, in the context of a linear, Gaussian setup.

  16. Benefits of Non-Linear Mixed Effect Modeling and Optimal Design : Pre-Clinical and Clinical Study Applications

    OpenAIRE

    Ernest II, Charles Steven

    2013-01-01

    Despite the growing promise of pharmaceutical research, inferior experimentation or interpretation of data can inhibit breakthrough molecules from finding their way out of research institutions and reaching patients. This thesis provides evidence that better characterization of pre-clinical and clinical data can be accomplished using non-linear mixed effect modeling (NLMEM) and more effective experiments can be conducted using optimal design (OD).  To demonstrate applicability of NLMEM and OD...

  17. A Decomposition Model for HPLC-DAD Data Set and Its Solution by Particle Swarm Optimization

    OpenAIRE

    Lizhi Cui; Zhihao Ling; Josiah Poon; Poon, Simon K.; Junbin Gao; Paul Kwan

    2014-01-01

    This paper proposes a separation method, based on the model of Generalized Reference Curve Measurement and the algorithm of Particle Swarm Optimization (GRCM-PSO), for the High Performance Liquid Chromatography with Diode Array Detection (HPLC-DAD) data set. Firstly, initial parameters are generated to construct reference curves for the chromatogram peaks of the compounds based on its physical principle. Then, a General Reference Curve Measurement (GRCM) model is designed to transform these p...

  18. Optimal setting of FACTS devices for voltage stability improvement using PSO adaptive GSA hybrid algorithm

    Directory of Open Access Journals (Sweden)

    Sai Ram Inkollu

    2016-09-01

    Full Text Available This paper presents a novel technique for optimizing the FACTS devices, so as to maintain the voltage stability in the power transmission systems. Here, the particle swarm optimization algorithm (PSO and the adaptive gravitational search algorithm (GSA technique are proposed for improving the voltage stability of the power transmission systems. In the proposed approach, the PSO algorithm is used for optimizing the gravitational constant and to improve the searching performance of the GSA. Using the proposed technique, the optimal settings of the FACTS devices are determined. The proposed algorithm is an effective method for finding out the optimal location and the sizing of the FACTS controllers. The optimal locations and the power ratings of the FACTS devices are determined based on the voltage collapse rating as well as the power loss of the system. Here, two FACTS devices are used to evaluate the performance of the proposed algorithm, namely, the unified power flow controller (UPFC and the interline power flow controller (IPFC. The Newton–Raphson load flow study is used for analyzing the power flow in the transmission system. From the power flow analysis, bus voltages, active power, reactive power, and power loss of the transmission systems are determined. Then, the voltage stability is enhanced while satisfying a given set of operating and physical constraints. The proposed technique is implemented in the MATLAB platform and consequently, its performance is evaluated and compared with the existing GA based GSA hybrid technique. The performance of the proposed technique is tested with the benchmark system of IEEE 30 bus using two FACTS devices such as, the UPFC and the IPFC.

  19. Pareto Optimization Identifies Diverse Set of Phosphorylation Signatures Predicting Response to Treatment with Dasatinib.

    Science.gov (United States)

    Klammer, Martin; Dybowski, J Nikolaj; Hoffmann, Daniel; Schaab, Christoph

    2015-01-01

    Multivariate biomarkers that can predict the effectiveness of targeted therapy in individual patients are highly desired. Previous biomarker discovery studies have largely focused on the identification of single biomarker signatures, aimed at maximizing prediction accuracy. Here, we present a different approach that identifies multiple biomarkers by simultaneously optimizing their predictive power, number of features, and proximity to the drug target in a protein-protein interaction network. To this end, we incorporated NSGA-II, a fast and elitist multi-objective optimization algorithm that is based on the principle of Pareto optimality, into the biomarker discovery workflow. The method was applied to quantitative phosphoproteome data of 19 non-small cell lung cancer (NSCLC) cell lines from a previous biomarker study. The algorithm successfully identified a total of 77 candidate biomarker signatures predicting response to treatment with dasatinib. Through filtering and similarity clustering, this set was trimmed to four final biomarker signatures, which then were validated on an independent set of breast cancer cell lines. All four candidates reached the same good prediction accuracy (83%) as the originally published biomarker. Although the newly discovered signatures were diverse in their composition and in their size, the central protein of the originally published signature - integrin β4 (ITGB4) - was also present in all four Pareto signatures, confirming its pivotal role in predicting dasatinib response in NSCLC cell lines. In summary, the method presented here allows for a robust and simultaneous identification of multiple multivariate biomarkers that are optimized for prediction performance, size, and relevance.

  20. Variable Structure Disturbance Rejection Control for Nonlinear Uncertain Systems with State and Control Delays via Optimal Sliding Mode Surface Approach

    Directory of Open Access Journals (Sweden)

    Jing Lei

    2013-01-01

    Full Text Available The paper considers the problem of variable structure control for nonlinear systems with uncertainty and time delays under persistent disturbance by using the optimal sliding mode surface approach. Through functional transformation, the original time-delay system is transformed into a delay-free one. The approximating sequence method is applied to solve the nonlinear optimal sliding mode surface problem which is reduced to a linear two-point boundary value problem of approximating sequences. The optimal sliding mode surface is obtained from the convergent solutions by solving a Riccati equation, a Sylvester equation, and the state and adjoint vector differential equations of approximating sequences. Then, the variable structure disturbance rejection control is presented by adopting an exponential trending law, where the state and control memory terms are designed to compensate the state and control delays, a feedforward control term is designed to reject the disturbance, and an adjoint compensator is designed to compensate the effects generated by the nonlinearity and the uncertainty. Furthermore, an observer is constructed to make the feedforward term physically realizable, and thus the dynamical observer-based dynamical variable structure disturbance rejection control law is produced. Finally, simulations are demonstrated to verify the effectiveness of the presented controller and the simplicity of the proposed approach.

  1. Non-linear dynamic characteristics and optimal control of giant magnetostrictive film subjected to in-plane stochastic excitation

    Energy Technology Data Exchange (ETDEWEB)

    Zhu, Z. W., E-mail: zhuzhiwen@tju.edu.cn [Department of Mechanics, Tianjin University, 300072, Tianjin (China); Tianjin Key Laboratory of Non-linear Dynamics and Chaos Control, 300072, Tianjin (China); Zhang, W. D., E-mail: zhangwenditju@126.com; Xu, J., E-mail: xujia-ld@163.com [Department of Mechanics, Tianjin University, 300072, Tianjin (China)

    2014-03-15

    The non-linear dynamic characteristics and optimal control of a giant magnetostrictive film (GMF) subjected to in-plane stochastic excitation were studied. Non-linear differential items were introduced to interpret the hysteretic phenomena of the GMF, and the non-linear dynamic model of the GMF subjected to in-plane stochastic excitation was developed. The stochastic stability was analysed, and the probability density function was obtained. The condition of stochastic Hopf bifurcation and noise-induced chaotic response were determined, and the fractal boundary of the system's safe basin was provided. The reliability function was solved from the backward Kolmogorov equation, and an optimal control strategy was proposed in the stochastic dynamic programming method. Numerical simulation shows that the system stability varies with the parameters, and stochastic Hopf bifurcation and chaos appear in the process; the area of the safe basin decreases when the noise intensifies, and the boundary of the safe basin becomes fractal; the system reliability improved through stochastic optimal control. Finally, the theoretical and numerical results were proved by experiments. The results are helpful in the engineering applications of GMF.

  2. Comparison of linear and nonlinear programming approaches for "worst case dose" and "minmax" robust optimization of intensity-modulated proton therapy dose distributions.

    Science.gov (United States)

    Zaghian, Maryam; Cao, Wenhua; Liu, Wei; Kardar, Laleh; Randeniya, Sharmalee; Mohan, Radhe; Lim, Gino

    2017-03-01

    Robust optimization of intensity-modulated proton therapy (IMPT) takes uncertainties into account during spot weight optimization and leads to dose distributions that are resilient to uncertainties. Previous studies demonstrated benefits of linear programming (LP) for IMPT in terms of delivery efficiency by considerably reducing the number of spots required for the same quality of plans. However, a reduction in the number of spots may lead to loss of robustness. The purpose of this study was to evaluate and compare the performance in terms of plan quality and robustness of two robust optimization approaches using LP and nonlinear programming (NLP) models. The so-called "worst case dose" and "minmax" robust optimization approaches and conventional planning target volume (PTV)-based optimization approach were applied to designing IMPT plans for five patients: two with prostate cancer, one with skull-based cancer, and two with head and neck cancer. For each approach, both LP and NLP models were used. Thus, for each case, six sets of IMPT plans were generated and assessed: LP-PTV-based, NLP-PTV-based, LP-worst case dose, NLP-worst case dose, LP-minmax, and NLP-minmax. The four robust optimization methods behaved differently from patient to patient, and no method emerged as superior to the others in terms of nominal plan quality and robustness against uncertainties. The plans generated using LP-based robust optimization were more robust regarding patient setup and range uncertainties than were those generated using NLP-based robust optimization for the prostate cancer patients. However, the robustness of plans generated using NLP-based methods was superior for the skull-based and head and neck cancer patients. Overall, LP-based methods were suitable for the less challenging cancer cases in which all uncertainty scenarios were able to satisfy tight dose constraints, while NLP performed better in more difficult cases in which most uncertainty scenarios were hard to meet

  3. Nonlinear analysis of a new car-following model accounting for the global average optimal velocity difference

    Science.gov (United States)

    Peng, Guanghan; Lu, Weizhen; He, Hongdi

    2016-09-01

    In this paper, a new car-following model is proposed by considering the global average optimal velocity difference effect on the basis of the full velocity difference (FVD) model. We investigate the influence of the global average optimal velocity difference on the stability of traffic flow by making use of linear stability analysis. It indicates that the stable region will be enlarged by taking the global average optimal velocity difference effect into account. Subsequently, the mKdV equation near the critical point and its kink-antikink soliton solution, which can describe the traffic jam transition, is derived from nonlinear analysis. Furthermore, numerical simulations confirm that the effect of the global average optimal velocity difference can efficiently improve the stability of traffic flow, which show that our new consideration should be taken into account to suppress the traffic congestion for car-following theory.

  4. Construction of pore network models for Berea and Fontainebleau sandstones using non-linear programing and optimization techniques

    Science.gov (United States)

    Sharqawy, Mostafa H.

    2016-12-01

    Pore network models (PNM) of Berea and Fontainebleau sandstones were constructed using nonlinear programming (NLP) and optimization methods. The constructed PNMs are considered as a digital representation of the rock samples which were based on matching the macroscopic properties of the porous media and used to conduct fluid transport simulations including single and two-phase flow. The PNMs consisted of cubic networks of randomly distributed pores and throats sizes and with various connectivity levels. The networks were optimized such that the upper and lower bounds of the pore sizes are determined using the capillary tube bundle model and the Nelder-Mead method instead of guessing them, which reduces the optimization computational time significantly. An open-source PNM framework was employed to conduct transport and percolation simulations such as invasion percolation and Darcian flow. The PNM model was subsequently used to compute the macroscopic properties; porosity, absolute permeability, specific surface area, breakthrough capillary pressure, and primary drainage curve. The pore networks were optimized to allow for the simulation results of the macroscopic properties to be in excellent agreement with the experimental measurements. This study demonstrates that non-linear programming and optimization methods provide a promising method for pore network modeling when computed tomography imaging may not be readily available.

  5. Performance of a Nonlinear Real-Time Optimal Control System for HEVs/PHEVs during Car Following

    Directory of Open Access Journals (Sweden)

    Kaijiang Yu

    2014-01-01

    Full Text Available This paper presents a real-time optimal control approach for the energy management problem of hybrid electric vehicles (HEVs and plug-in hybrid electric vehicles (PHEVs with slope information during car following. The new features of this study are as follows. First, the proposed method can optimize the engine operating points and the driving profile simultaneously. Second, the proposed method gives the freedom of vehicle spacing between the preceding vehicle and the host vehicle. Third, using the HEV/PHEV property, the desired battery state of charge is designed according to the road slopes for better recuperation of free braking energy. Fourth, all of the vehicle operating modes engine charge, electric vehicle, motor assist and electric continuously variable transmission, and regenerative braking, can be realized using the proposed real-time optimal control approach. Computer simulation results are shown among the nonlinear real-time optimal control approach and the ADVISOR rule-based approach. The conclusion is that the nonlinear real-time optimal control approach is effective for the energy management problem of the HEV/PHEV system during car following.

  6. Temporal Data Set Reduction Based on D-Optimality for Quantitative FLIM-FRET Imaging.

    Science.gov (United States)

    Omer, Travis; Intes, Xavier; Hahn, Juergen

    2015-01-01

    Fluorescence lifetime imaging (FLIM) when paired with Förster resonance energy transfer (FLIM-FRET) enables the monitoring of nanoscale interactions in living biological samples. FLIM-FRET model-based estimation methods allow the quantitative retrieval of parameters such as the quenched (interacting) and unquenched (non-interacting) fractional populations of the donor fluorophore and/or the distance of the interactions. The quantitative accuracy of such model-based approaches is dependent on multiple factors such as signal-to-noise ratio and number of temporal points acquired when sampling the fluorescence decays. For high-throughput or in vivo applications of FLIM-FRET, it is desirable to acquire a limited number of temporal points for fast acquisition times. Yet, it is critical to acquire temporal data sets with sufficient information content to allow for accurate FLIM-FRET parameter estimation. Herein, an optimal experimental design approach based upon sensitivity analysis is presented in order to identify the time points that provide the best quantitative estimates of the parameters for a determined number of temporal sampling points. More specifically, the D-optimality criterion is employed to identify, within a sparse temporal data set, the set of time points leading to optimal estimations of the quenched fractional population of the donor fluorophore. Overall, a reduced set of 10 time points (compared to a typical complete set of 90 time points) was identified to have minimal impact on parameter estimation accuracy (≈5%), with in silico and in vivo experiment validations. This reduction of the number of needed time points by almost an order of magnitude allows the use of FLIM-FRET for certain high-throughput applications which would be infeasible if the entire number of time sampling points were used.

  7. Evaluation of conditional non-linear optimal perturbation obtained by an ensemble-based approach using the Lorenz-63 model

    Directory of Open Access Journals (Sweden)

    Xudong Yin

    2014-02-01

    Full Text Available The authors propose to implement conditional non-linear optimal perturbation related to model parameters (CNOP-P through an ensemble-based approach. The approach was first used in our earlier study and is improved to be suitable for calculating CNOP-P. Idealised experiments using the Lorenz-63 model are conducted to evaluate the performance of the improved ensemble-based approach. The results show that the maximum prediction error after optimisation has been multiplied manifold compared with the initial-guess prediction error, and is extremely close to, or greater than, the maximum value of the exhaustive attack method (a million random samples. The calculation of CNOP-P by the ensemble-based approach is capable of maintaining a high accuracy over a long prediction time under different constraints and initial conditions. Further, the CNOP-P obtained by the approach is applied to sensitivity analysis of the Lorenz-63 model. The sensitivity analysis indicates that when the prediction time is set to 0.2 time units, the Lorenz-63 model becomes extremely insensitive to one parameter, which leaves the other two parameters to affect the uncertainty of the model. Finally, a serial of parameter estimation experiments are performed to verify sensitivity analysis. It is found that when the three parameters are estimated simultaneously, the insensitive parameter is estimated much worse, but the Lorenz-63 model can still generate a very good simulation thanks to the relatively accurate values of the other two parameters. When only two sensitive parameters are estimated simultaneously and the insensitive parameter is left to be non-optimised, the outcome is better than the case when the three parameters are estimated simultaneously. With the increase of prediction time and observation, however, the model sensitivity to the insensitive parameter increases accordingly and the insensitive parameter can also be estimated successfully.

  8. An intelligent hybrid scheme for optimizing parking space: A Tabu metaphor and rough set based approach

    Directory of Open Access Journals (Sweden)

    Soumya Banerjee

    2011-03-01

    Full Text Available Congested roads, high traffic, and parking problems are major concerns for any modern city planning. Congestion of on-street spaces in official neighborhoods may give rise to inappropriate parking areas in office and shopping mall complex during the peak time of official transactions. This paper proposes an intelligent and optimized scheme to solve parking space problem for a small city (e.g., Mauritius using a reactive search technique (named as Tabu Search assisted by rough set. Rough set is being used for the extraction of uncertain rules that exist in the databases of parking situations. The inclusion of rough set theory depicts the accuracy and roughness, which are used to characterize uncertainty of the parking lot. Approximation accuracy is employed to depict accuracy of a rough classification [1] according to different dynamic parking scenarios. And as such, the hybrid metaphor proposed comprising of Tabu Search and rough set could provide substantial research directions for other similar hard optimization problems.

  9. Global Convergence of a New restarting Conjugate Gradient Method for Nonlinear Optimizations

    Institute of Scientific and Technical Information of China (English)

    SUNQing-ying

    2003-01-01

    Conjugate gradient optimization algorithms depend on the search directions.with different choices for the parameters in the search directions.In this note,by combining the nice numerical performance of PR and HS methods with the global convergence property of the class of conjugate gradient methods presented by HU and STOREY(1991),a class of new restarting conjugate gradient methods is presented.Global convergences of the new method with two kinds of common line searches,are proved .Firstly,it is shown that,using reverse modulus of continuity funciton and forcing function,the new method for solving unconstrained optimization can work for a continously differentiable function with Curry-Altman's step size rule and a bounded level set .Secondly,by using comparing technique,some general convergence propecties of the new method with other kind of step size rule are established,Numerical experiments show that the new method is efficient by comparing with FR conjugate gradient method.

  10. A set cover approach to fast beam orientation optimization in intensity modulated radiation therapy for total marrow irradiation

    Energy Technology Data Exchange (ETDEWEB)

    Lee, Chieh-Hsiu Jason; Aleman, Dionne M [Department of Mechanical and Industrial Engineering, University of Toronto, 5 King' s College Road, Toronto, ON M5S 3G8 (Canada); Sharpe, Michael B, E-mail: chjlee@mie.utoronto.ca, E-mail: aleman@mie.utoronto.ca, E-mail: michael.sharpe@rmp.uhn.on.ca [Princess Margaret Hospital, Department of Radiation Oncology, University of Toronto, 610 University Avenue, Toronto, ON M5G 2M9 (Canada)

    2011-09-07

    The beam orientation optimization (BOO) problem in intensity modulated radiation therapy (IMRT) treatment planning is a nonlinear problem, and existing methods to obtain solutions to the BOO problem are time consuming due to the complex nature of the objective function and size of the solution space. These issues become even more difficult in total marrow irradiation (TMI), where many more beams must be used to cover a vastly larger treatment area than typical site-specific treatments (e.g., head-and-neck, prostate, etc). These complications result in excessively long computation times to develop IMRT treatment plans for TMI, so we attempt to develop methods that drastically reduce treatment planning time. We transform the BOO problem into the classical set cover problem (SCP) and use existing methods to solve SCP to obtain beam solutions. Although SCP is NP-Hard, our methods obtain beam solutions that result in quality treatments in minutes. We compare our approach to an integer programming solver for the SCP to illustrate the speed advantage of our approach.

  11. Robust optimization for nonlinear time-delay dynamical system of dha regulon with cost sensitivity constraint in batch culture

    Science.gov (United States)

    Yuan, Jinlong; Zhang, Xu; Liu, Chongyang; Chang, Liang; Xie, Jun; Feng, Enmin; Yin, Hongchao; Xiu, Zhilong

    2016-09-01

    Time-delay dynamical systems, which depend on both the current state of the system and the state at delayed times, have been an active area of research in many real-world applications. In this paper, we consider a nonlinear time-delay dynamical system of dha-regulonwith unknown time-delays in batch culture of glycerol bioconversion to 1,3-propanediol induced by Klebsiella pneumonia. Some important properties and strong positive invariance are discussed. Because of the difficulty in accurately measuring the concentrations of intracellular substances and the absence of equilibrium points for the time-delay system, a quantitative biological robustness for the concentrations of intracellular substances is defined by penalizing a weighted sum of the expectation and variance of the relative deviation between system outputs before and after the time-delays are perturbed. Our goal is to determine optimal values of the time-delays. To this end, we formulate an optimization problem in which the time delays are decision variables and the cost function is to minimize the biological robustness. This optimization problem is subject to the time-delay system, parameter constraints, continuous state inequality constraints for ensuring that the concentrations of extracellular and intracellular substances lie within specified limits, a quality constraint to reflect operational requirements and a cost sensitivity constraint for ensuring that an acceptable level of the system performance is achieved. It is approximated as a sequence of nonlinear programming sub-problems through the application of constraint transcription and local smoothing approximation techniques. Due to the highly complex nature of this optimization problem, the computational cost is high. Thus, a parallel algorithm is proposed to solve these nonlinear programming sub-problems based on the filled function method. Finally, it is observed that the obtained optimal estimates for the time-delays are highly satisfactory

  12. Evolutionary optimization of PAW data-sets for accurate high pressure simulations

    Science.gov (United States)

    Sarkar, Kanchan; Topsakal, Mehmet; Holzwarth, N. A. W.; Wentzcovitch, Renata M.

    2017-10-01

    We examine the challenge of performing accurate electronic structure calculations at high pressures by comparing the results of all-electron full potential linearized augmented-plane-wave calculations, as implemented in the WIEN2k code, with those of the projector augmented wave (PAW) method, as implemented in Quantum ESPRESSO or Abinit code. In particular, we focus on developing an automated and consistent way of generating transferable PAW data-sets that can closely produce the all electron equation of state defined from zero to arbitrary high pressures. The technique we propose is an evolutionary search procedure that exploits the ATOMPAW code to generate atomic data-sets and the Quantum ESPRESSO software suite for total energy calculations. We demonstrate different aspects of its workability by optimizing PAW basis functions of some elements relatively abundant in planetary interiors. In addition, we introduce a new measure of atomic data-set goodness by considering their performance uniformity over an extended pressure range.

  13. Evolutionary optimization of PAW data-sets for accurate high pressure simulations

    CERN Document Server

    Sarkar, Kanchan; Holzwarth, N A W; Wentzcovitch, Renata M

    2016-01-01

    We examine the challenge of performing accurate electronic structure calculations at high pressures by comparing the results of all-electron full potential linearized augmented-plane-wave calculations with those of the projector augmented wave (PAW) method. In particular, we focus on developing an automated and consistent way of generating transferable PAW data-sets that can closely produce the all electron equation of state defined from zero to arbitrary high pressures. The technique we propose is an evolutionary search procedure that exploits the ATOMPAW code to generate atomic data-sets and the Quantum ESPRESSO software suite for total energy calculations. We demonstrate different aspects of its workability by optimizing PAW basis functions of some elements relatively abundant in planetary interiors. In addition, we introduce a new measure of atomic data-set goodness by considering their performance uniformity over an enlarged pressure range.

  14. Time-optimal path planning in dynamic flows using level set equations: theory and schemes

    Science.gov (United States)

    Lolla, Tapovan; Lermusiaux, Pierre F. J.; Ueckermann, Mattheus P.; Haley, Patrick J.

    2014-10-01

    We develop an accurate partial differential equation-based methodology that predicts the time-optimal paths of autonomous vehicles navigating in any continuous, strong, and dynamic ocean currents, obviating the need for heuristics. The goal is to predict a sequence of steering directions so that vehicles can best utilize or avoid currents to minimize their travel time. Inspired by the level set method, we derive and demonstrate that a modified level set equation governs the time-optimal path in any continuous flow. We show that our algorithm is computationally efficient and apply it to a number of experiments. First, we validate our approach through a simple benchmark application in a Rankine vortex flow for which an analytical solution is available. Next, we apply our methodology to more complex, simulated flow fields such as unsteady double-gyre flows driven by wind stress and flows behind a circular island. These examples show that time-optimal paths for multiple vehicles can be planned even in the presence of complex flows in domains with obstacles. Finally, we present and support through illustrations several remarks that describe specific features of our methodology.

  15. Extracellular voltage threshold settings can be tuned for optimal encoding of movement and stimulus parameters

    Science.gov (United States)

    Oby, Emily R.; Perel, Sagi; Sadtler, Patrick T.; Ruff, Douglas A.; Mischel, Jessica L.; Montez, David F.; Cohen, Marlene R.; Batista, Aaron P.; Chase, Steven M.

    2016-06-01

    Objective. A traditional goal of neural recording with extracellular electrodes is to isolate action potential waveforms of an individual neuron. Recently, in brain-computer interfaces (BCIs), it has been recognized that threshold crossing events of the voltage waveform also convey rich information. To date, the threshold for detecting threshold crossings has been selected to preserve single-neuron isolation. However, the optimal threshold for single-neuron identification is not necessarily the optimal threshold for information extraction. Here we introduce a procedure to determine the best threshold for extracting information from extracellular recordings. We apply this procedure in two distinct contexts: the encoding of kinematic parameters from neural activity in primary motor cortex (M1), and visual stimulus parameters from neural activity in primary visual cortex (V1). Approach. We record extracellularly from multi-electrode arrays implanted in M1 or V1 in monkeys. Then, we systematically sweep the voltage detection threshold and quantify the information conveyed by the corresponding threshold crossings. Main Results. The optimal threshold depends on the desired information. In M1, velocity is optimally encoded at higher thresholds than speed; in both cases the optimal thresholds are lower than are typically used in BCI applications. In V1, information about the orientation of a visual stimulus is optimally encoded at higher thresholds than is visual contrast. A conceptual model explains these results as a consequence of cortical topography. Significance. How neural signals are processed impacts the information that can be extracted from them. Both the type and quality of information contained in threshold crossings depend on the threshold setting. There is more information available in these signals than is typically extracted. Adjusting the detection threshold to the parameter of interest in a BCI context should improve our ability to decode motor intent

  16. A NEW ALGORITHM IN NONLINEAR ANALYSIS OF STRUCTURES USING PARTICLE SWARM OPTIMIZATION

    OpenAIRE

    Iman Mansouri; Ali Shahri; Hassan Zahedifar

    2016-01-01

    Solving systems of nonlinear equations is a difficult problem in numerical computation. Probably the best known and most widely used algorithm to solve a system of nonlinear equations is Newton-Raphson method. A significant shortcoming of this method becomes apparent when attempting to solve problems with limit points. Once a fixed load is defined in the first step, there is no way to modify the load vector should a limit point occur within the increment. To overcome this defect, displacement...

  17. Geminal embedding scheme for optimal atomic basis set construction in correlated calculations

    Energy Technology Data Exchange (ETDEWEB)

    Sorella, S., E-mail: sorella@sissa.it [International School for Advanced Studies (SISSA), Via Beirut 2-4, 34014 Trieste, Italy and INFM Democritos National Simulation Center, Trieste (Italy); Devaux, N.; Dagrada, M., E-mail: mario.dagrada@impmc.upmc.fr [Institut de Minéralogie, de Physique des Matériaux et de Cosmochimie, Université Pierre et Marie Curie, Case 115, 4 Place Jussieu, 75252 Paris Cedex 05 (France); Mazzola, G., E-mail: gmazzola@phys.ethz.ch [Theoretische Physik, ETH Zurich, 8093 Zurich (Switzerland); Casula, M., E-mail: michele.casula@impmc.upmc.fr [CNRS and Institut de Minéralogie, de Physique des Matériaux et de Cosmochimie, Université Pierre et Marie Curie, Case 115, 4 Place Jussieu, 75252 Paris Cedex 05 (France)

    2015-12-28

    We introduce an efficient method to construct optimal and system adaptive basis sets for use in electronic structure and quantum Monte Carlo calculations. The method is based on an embedding scheme in which a reference atom is singled out from its environment, while the entire system (atom and environment) is described by a Slater determinant or its antisymmetrized geminal power (AGP) extension. The embedding procedure described here allows for the systematic and consistent contraction of the primitive basis set into geminal embedded orbitals (GEOs), with a dramatic reduction of the number of variational parameters necessary to represent the many-body wave function, for a chosen target accuracy. Within the variational Monte Carlo method, the Slater or AGP part is determined by a variational minimization of the energy of the whole system in presence of a flexible and accurate Jastrow factor, representing most of the dynamical electronic correlation. The resulting GEO basis set opens the way for a fully controlled optimization of many-body wave functions in electronic structure calculation of bulk materials, namely, containing a large number of electrons and atoms. We present applications on the water molecule, the volume collapse transition in cerium, and the high-pressure liquid hydrogen.

  18. Weighted Fuzzy Interpolative Reasoning Based on the Slopes of Fuzzy Sets and Particle Swarm Optimization Techniques.

    Science.gov (United States)

    Chen, Shyi-Ming; Hsin, Wen-Chyuan

    2015-07-01

    In this paper, we propose a new weighted fuzzy interpolative reasoning method for sparse fuzzy rule-based systems based on the slopes of fuzzy sets. We also propose a particle swarm optimization (PSO)-based weights-learning algorithm to automatically learn the optimal weights of the antecedent variables of fuzzy rules for weighted fuzzy interpolative reasoning. We apply the proposed weighted fuzzy interpolative reasoning method using the proposed PSO-based weights-learning algorithm to deal with the computer activity prediction problem, the multivariate regression problems, and the time series prediction problems. The experimental results show that the proposed weighted fuzzy interpolative reasoning method using the proposed PSO-based weights-learning algorithm outperforms the existing methods for dealing with the computer activity prediction problem, the multivariate regression problems, and the time series prediction problems.

  19. Optimization design of Iptables rules set%Iptables规则集的优化设计

    Institute of Scientific and Technical Information of China (English)

    林燕

    2015-01-01

    分析了Iptables工作原理,介绍了Iptables规则集,提出了一种有效的规则集优化算法,并在Linux下实现。运用该优化算法能够有效剔除规则集中重复的规则,直接提升系统过滤效率,减少过滤数据包所需的时间,从而提高防火墙系统的网络吞吐量。%The working principles of Iptables are analyzed and its rule set is introduced. An effective optimization algorithm is put forward and implemented in Linux. The optimization algorithm can effectively eliminate rules focused duplicate rules, directly improve the system filtration efficiency and reduce the required data packet filtering time, so as to improve the throughput of network firewall system.

  20. Triaging multiple victims in an avalanche setting: the Avalanche Survival Optimizing Rescue Triage algorithmic approach.

    Science.gov (United States)

    Bogle, Lee B; Boyd, Jeff J; McLaughlin, Kyle A

    2010-03-01

    As winter backcountry activity increases, so does exposure to avalanche danger. A complicated situation arises when multiple victims are caught in an avalanche and where medical and other rescue demands overwhelm resources in the field. These mass casualty incidents carry a high risk of morbidity and mortality, and there is no recommended approach to patient care specific to this setting other than basic first aid principles. The literature is limited with regard to triaging systems applicable to avalanche incidents. In conjunction with the development of an electronic avalanche rescue training module by the Canadian Avalanche Association, we have designed the Avalanche Survival Optimizing Rescue Triage algorithm to address the triaging of multiple avalanche victims to optimize survival and disposition decisions.

  1. On the optimal identification of tag sets in time-constrained RFID configurations.

    Science.gov (United States)

    Vales-Alonso, Javier; Bueno-Delgado, María Victoria; Egea-López, Esteban; Alcaraz, Juan José; Pérez-Mañogil, Juan Manuel

    2011-01-01

    In Radio Frequency Identification facilities the identification delay of a set of tags is mainly caused by the random access nature of the reading protocol, yielding a random identification time of the set of tags. In this paper, the cumulative distribution function of the identification time is evaluated using a discrete time Markov chain for single-set time-constrained passive RFID systems, namely those ones where a single group of tags is assumed to be in the reading area and only for a bounded time (sojourn time) before leaving. In these scenarios some tags in a set may leave the reader coverage area unidentified. The probability of this event is obtained from the cumulative distribution function of the identification time as a function of the sojourn time. This result provides a suitable criterion to minimize the probability of losing tags. Besides, an identification strategy based on splitting the set of tags in smaller subsets is also considered. Results demonstrate that there are optimal splitting configurations that reduce the overall identification time while keeping the same probability of losing tags.

  2. Optimization of megavoltage CT scan registration settings for brain cancer treatments on tomotherapy

    Energy Technology Data Exchange (ETDEWEB)

    Woodford, Curtis; Yartsev, Slav; Van Dyk, Jake [London Regional Cancer Program, London Health Sciences Centre, 790 Commissioners Road East, London, Ontario (Canada)

    2007-04-21

    This study aims to determine the settings that provide the optimal clinical accuracy and consistency for the registration of megavoltage CT (MVCT) with planning kilovoltage CT image sets on the Hi-ART tomotherapy system. The systematic offset between the MVCT and the planning kVCT was determined by registration of multiple MVCT scans of a head phantom aligned with the planning isocentre. Residual error vector lengths and components were used to quantify the alignment quality for the phantom shifted by 5 mm in different directions obtained by all 27 possible combinations of MVCT inter-slice spacing, registration techniques and resolution. MVCT scans with normal slices are superior to coarse slices for registration of shifts in the superior-inferior, lateral and anterior-posterior directions. Decreasing the scan length has no detrimental effect on registration accuracy as long as the scan lengths are larger than 24 mm. In the case of bone technique and fine resolution, normal and fine MVCT scan slice spacing options give similar accuracy, so normal mode is preferable due to shorter procedure and less delivered dose required for patient set-up. A superior-inferior field length of 24-30 mm, normal slice spacing, bone technique, and fine resolution is the optimum set of registration settings for MVCT scans of a Rando head phantom acquired with the Hi-ART tomotherapy system, provided the registration shifts are less than 5 mm. (note)

  3. Optimal design of measurement settings for quantum-state-tomography experiments

    Science.gov (United States)

    Li, Jun; Huang, Shilin; Luo, Zhihuang; Li, Keren; Lu, Dawei; Zeng, Bei

    2017-09-01

    Quantum state tomography is an indispensable but costly part of many quantum experiments. Typically, it requires measurements to be carried out in a number of different settings on a fixed experimental setup. The collected data are often informationally overcomplete, with the amount of information redundancy depending on the particular set of measurement settings chosen. This raises a question about how one should optimally take data so that the number of measurement settings necessary can be reduced. Here, we cast this problem in terms of integer programming. For a given experimental setup, standard integer-programming algorithms allow us to find the minimum set of readout operations that can realize a target tomographic task. We apply the method to certain basic and practical state-tomographic problems in nuclear-magnetic-resonance experimental systems. The results show that considerably fewer readout operations can be found using our technique than by using the previous greedy search strategy. Therefore, our method could be helpful for simplifying measurement schemes to minimize the experimental effort.

  4. Analytical considerations for linear and nonlinear optimization of the TME cells. Application to the CLIC pre-damping rings

    CERN Document Server

    Antoniou, F.

    2014-06-23

    The theoretical minimum emittance cells are the optimal configurations for achieving the absolute minimum emittance, if specific optics constraints are satisfied at the middle of the cell's dipole. Linear lattice design options based on an analytical approach for the theoretical minimum emittance cells are presented in this paper. In particular the parametrization of the quadrupole strengths and optics functions with respect to the emittance and drift lengths is derived. A multi-parametric space can be then created with all the cell parameters, from which one can chose any of them to be optimized. An application of this approach are finally presented for the linear and non-linear optimization of the CLIC Pre-damping rings.

  5. Pareto Optimization Identifies Diverse Set of Phosphorylation Signatures Predicting Response to Treatment with Dasatinib.

    Directory of Open Access Journals (Sweden)

    Martin Klammer

    Full Text Available Multivariate biomarkers that can predict the effectiveness of targeted therapy in individual patients are highly desired. Previous biomarker discovery studies have largely focused on the identification of single biomarker signatures, aimed at maximizing prediction accuracy. Here, we present a different approach that identifies multiple biomarkers by simultaneously optimizing their predictive power, number of features, and proximity to the drug target in a protein-protein interaction network. To this end, we incorporated NSGA-II, a fast and elitist multi-objective optimization algorithm that is based on the principle of Pareto optimality, into the biomarker discovery workflow. The method was applied to quantitative phosphoproteome data of 19 non-small cell lung cancer (NSCLC cell lines from a previous biomarker study. The algorithm successfully identified a total of 77 candidate biomarker signatures predicting response to treatment with dasatinib. Through filtering and similarity clustering, this set was trimmed to four final biomarker signatures, which then were validated on an independent set of breast cancer cell lines. All four candidates reached the same good prediction accuracy (83% as the originally published biomarker. Although the newly discovered signatures were diverse in their composition and in their size, the central protein of the originally published signature - integrin β4 (ITGB4 - was also present in all four Pareto signatures, confirming its pivotal role in predicting dasatinib response in NSCLC cell lines. In summary, the method presented here allows for a robust and simultaneous identification of multiple multivariate biomarkers that are optimized for prediction performance, size, and relevance.

  6. Optimizing Design Parameters for Sets of Concentric Tube Robots using Sampling-based Motion Planning

    OpenAIRE

    Baykal, Cenk; Torres, Luis G.; Alterovitz, Ron

    2015-01-01

    Concentric tube robots are tentacle-like medical robots that can bend around anatomical obstacles to access hard-to-reach clinical targets. The component tubes of these robots can be swapped prior to performing a task in order to customize the robot’s behavior and reachable workspace. Optimizing a robot’s design by appropriately selecting tube parameters can improve the robot’s effectiveness on a procedure-and patient-specific basis. In this paper, we present an algorithm that generates sets ...

  7. Active set truncated-Newton algorithm for simultaneous optimization of distillation column

    Institute of Scientific and Technical Information of China (English)

    LIANG Xi-ming

    2005-01-01

    An active set truncated-Newton algorithm (ASTNA) is proposed to solve the large-scale bound constrained sub-problems. The global convergence of the algorithm is obtained and two groups of numerical experiments are made for the various large-scale problems of varying size. The comparison results between ASTNA and the subspace limited memory quasi-Newton algorithm and between the modified augmented Lagrange multiplier methods combined with ASTNA and the modified barrier function method show the stability and effectiveness of ASTNA for simultaneous optimization of distillation column.

  8. Non-Beiter ternary cyclotomic polynomials with an optimally large set of coefficients

    CERN Document Server

    Moree, Pieter

    2011-01-01

    Let l>=1 be an arbitrary odd integer and p,q and r primes. We show that there exist infinitely many ternary cyclotomic polynomials \\Phi_{pqr}(x) with l^2+3l+5<= pset of coefficients of each of them consists of the p integers in the interval [-(p-l-2)/2,(p+l+2)/2]. It is known that no larger coefficient range is possible. The Beiter conjecture states that the cyclotomic coefficients a_{pqr}(k) of \\Phi_{pqr} satisfy |a_{pqr}(k)|<= (p+1)/2 and thus the above family contradicts the Beiter conjecture. The two already known families of ternary cyclotomic polynomials with an optimally large set of coefficients (found by G. Bachman) satisfy the Beiter conjecture.

  9. Genetic optimization of training sets for improved machine learning models of molecular properties

    CERN Document Server

    Browning, Nicholas J; von Lilienfeld, O Anatole; Röthlisberger, Ursula

    2016-01-01

    The training of molecular models of quantum mechanical properties based on statistical machine learning requires large datasets which exemplify the map from chemical structure to molecular property. Intelligent a priori selection of training examples is often difficult or impossible to achieve as prior knowledge may be sparse or unavailable. Ordinarily representative selection of training molecules from such datasets is achieved through random sampling. We use genetic algorithms for the optimization of training set composition consisting of tens of thousands of small organic molecules. The resulting machine learning models are considerably more accurate with respect to small randomly selected training sets: mean absolute errors for out-of-sample predictions are reduced to ~25% for enthalpies, free energies, and zero-point vibrational energy, to ~50% for heat-capacity, electron-spread, and polarizability, and by more than ~20% for electronic properties such as frontier orbital eigenvalues or dipole-moments. We...

  10. Training set optimization and classifier performance in a top-down diabetic retinopathy screening system

    Science.gov (United States)

    Wigdahl, J.; Agurto, C.; Murray, V.; Barriga, S.; Soliz, P.

    2013-03-01

    Diabetic retinopathy (DR) affects more than 4.4 million Americans age 40 and over. Automatic screening for DR has shown to be an efficient and cost-effective way to lower the burden on the healthcare system, by triaging diabetic patients and ensuring timely care for those presenting with DR. Several supervised algorithms have been developed to detect pathologies related to DR, but little work has been done in determining the size of the training set that optimizes an algorithm's performance. In this paper we analyze the effect of the training sample size on the performance of a top-down DR screening algorithm for different types of statistical classifiers. Results are based on partial least squares (PLS), support vector machines (SVM), k-nearest neighbor (kNN), and Naïve Bayes classifiers. Our dataset consisted of digital retinal images collected from a total of 745 cases (595 controls, 150 with DR). We varied the number of normal controls in the training set, while keeping the number of DR samples constant, and repeated the procedure 10 times using randomized training sets to avoid bias. Results show increasing performance in terms of area under the ROC curve (AUC) when the number of DR subjects in the training set increased, with similar trends for each of the classifiers. Of these, PLS and k-NN had the highest average AUC. Lower standard deviation and a flattening of the AUC curve gives evidence that there is a limit to the learning ability of the classifiers and an optimal number of cases to train on.

  11. A topology optimization method based on the level set method for the design of negative permeability dielectric metamaterials

    DEFF Research Database (Denmark)

    Otomori, Masaki; Yamada, Takayuki; Izui, Kazuhiro;

    2012-01-01

    are highly impractical from an engineering and manufacturing point of view. Therefore, a topology optimization method that can obtain clear optimized configurations is desirable. Here, a level set-based topology optimization method incorporating a fictitious interface energy is applied to a negative......This paper presents a level set-based topology optimization method for the design of negative permeability dielectric metamaterials. Metamaterials are artificial materials that display extraordinary physical properties that are unavailable with natural materials. The aim of the formulated...... optimization problem is to find optimized layouts of a dielectric material that achieve negative permeability. The presence of grayscale areas in the optimized configurations critically affects the performance of metamaterials, positively as well as negatively, but configurations that contain grayscale areas...

  12. Local Stabilization of Time-Delay Nonlinear Discrete-Time Systems Using Takagi-Sugeno Models and Convex Optimization

    Directory of Open Access Journals (Sweden)

    Luís F. P. Silva

    2014-01-01

    Full Text Available A convex condition in terms of linear matrix inequalities (LMIs is developed for the synthesis of stabilizing fuzzy state feedback controllers for nonlinear discrete-time systems with time-varying delays. A Takagi-Sugeno (T-S fuzzy model is used to represent exactly the nonlinear system in a restricted domain of the state space, called region of validity. The proposed stabilization condition is based on a Lyapunov-Krasovskii (L-K function and it takes into account the region of validity to determine a set of initial conditions for which the actual closed-loop system trajectories are asymptotically stable and do not evolve outside the region of validity. This set of allowable initial conditions is determined from the level set associated to a fuzzy L-K function as a Cartesian product of two subsets: one characterizing the set of states at the initial instant and another for the delayed state sequence necessary to characterize the initial conditions. Finally, we propose a convex programming problem to design a fuzzy controller that maximizes the set of initial conditions taking into account the shape of the region of validity of the T-S fuzzy model. Numerical simulations are given to illustrate this proposal.

  13. Reliability-based design optimization of a nonlinear elastic plastic thin-walled T-section beam

    Science.gov (United States)

    Ba-Abbad, Mazen A.

    A two part study is performed to investigate the application of reliability-based design optimization (RBDO) approach to design elastic-plastic stiffener beams with T-section. The objectives of this study are to evaluate the benefits of reliability-based optimization over deterministic optimization, and to illustrate through a practical design example some of the difficulties that a design engineer may encounter while performing reliability-based optimization. Other objectives are to search for a computationally economic RBDO method and to utilize that method to perform RBDO to design an elastic-plastic T-stiffener under combined loads and with flexural-torsional buckling and local buckling failure modes. First, a nonlinear elastic-plastic T-beam was modeled using a simple 6 degree-of-freedom non-linear beam element. To address the problems of RBDO, such as the high non-linearity and derivative discontinuity of the reliability function, and to illustrate a situation where RBDO fails to produce a significant improvement over the deterministic optimization, a graphical method was developed. The method started by obtaining a deterministic optimum design that has the lowest possible weight for a prescribed safety factor (SF), and based on that design, the method obtains an improved optimum design that has either a higher reliability or a lower weight or cost for the same level of reliability as the deterministic design. Three failure modes were considered for an elastic-plastic beam of T cross-section under combined axial and bending loads. The failure modes are based on the total plastic failure in a beam section, buckling, and maximum allowable deflection. The results of the first part show that it is possible to get improved optimum designs (more reliable or lighter weight) using reliability-based optimization as compared to the design given by deterministic optimization. Also, the results show that the reliability function can be highly non-linear with respect to

  14. Nonlinear H∞ Optimal Control Scheme for an Underwater Vehicle with Regional Function Formulation

    Directory of Open Access Journals (Sweden)

    Zool H. Ismail

    2013-01-01

    Full Text Available A conventional region control technique cannot meet the demands for an accurate tracking performance in view of its inability to accommodate highly nonlinear system dynamics, imprecise hydrodynamic coefficients, and external disturbances. In this paper, a robust technique is presented for an Autonomous Underwater Vehicle (AUV with region tracking function. Within this control scheme, nonlinear H∞ and region based control schemes are used. A Lyapunov-like function is presented for stability analysis of the proposed control law. Numerical simulations are presented to demonstrate the performance of the proposed tracking control of the AUV. It is shown that the proposed control law is robust against parameter uncertainties, external disturbances, and nonlinearities and it leads to uniform ultimate boundedness of the region tracking error.

  15. Nonlinear closed loop optimal control: a modified state-dependent Riccati equation.

    Science.gov (United States)

    Rafee Nekoo, S

    2013-03-01

    The state-dependent Riccati equation (SDRE), as a controller, has been introduced and implemented since the 90s. In this article, the other aspects of this controller are declared which shows the capability of this technique. First, a general case which has control nonlinearities and time varying weighting matrix Q is solved with three approaches: exact solution (ES), online control update (OCU) and power series approximation (PSA). The proposed PSA in this paper is able to deal with time varying or state-dependent Q in nonlinear systems. As a result of having the solution of nonlinear systems with complex Q containing constraints, using OCU and proposed PSA, a method is introduced to prevent the collision of an end-effector of a robot and an obstacle which shows the adaptability of the SDRE controller. Two examples to support the idea are presented and conferred. Supplementing constraints to the SDRE via matrix Q, this approach is named a modified SDRE.

  16. Application of Fuzzy Sets for the Improvement of Routing Optimization Heuristic Algorithms

    Directory of Open Access Journals (Sweden)

    Mattas Konstantinos

    2016-12-01

    Full Text Available The determination of the optimal circular path has become widely known for its difficulty in producing a solution and for the numerous applications in the scope of organization and management of passenger and freight transport. It is a mathematical combinatorial optimization problem for which several deterministic and heuristic models have been developed in recent years, applicable to route organization issues, passenger and freight transport, storage and distribution of goods, waste collection, supply and control of terminals, as well as human resource management. Scope of the present paper is the development, with the use of fuzzy sets, of a practical, comprehensible and speedy heuristic algorithm for the improvement of the ability of the classical deterministic algorithms to identify optimum, symmetrical or non-symmetrical, circular route. The proposed fuzzy heuristic algorithm is compared to the corresponding deterministic ones, with regard to the deviation of the proposed solution from the best known solution and the complexity of the calculations needed to obtain this solution. It is shown that the use of fuzzy sets reduced up to 35% the deviation of the solution identified by the classical deterministic algorithms from the best known solution.

  17. Selecting Optimal Feature Set in High-Dimensional Data by Swarm Search

    Directory of Open Access Journals (Sweden)

    Simon Fong

    2013-01-01

    Full Text Available Selecting the right set of features from data of high dimensionality for inducing an accurate classification model is a tough computational challenge. It is almost a NP-hard problem as the combinations of features escalate exponentially as the number of features increases. Unfortunately in data mining, as well as other engineering applications and bioinformatics, some data are described by a long array of features. Many feature subset selection algorithms have been proposed in the past, but not all of them are effective. Since it takes seemingly forever to use brute force in exhaustively trying every possible combination of features, stochastic optimization may be a solution. In this paper, we propose a new feature selection scheme called Swarm Search to find an optimal feature set by using metaheuristics. The advantage of Swarm Search is its flexibility in integrating any classifier into its fitness function and plugging in any metaheuristic algorithm to facilitate heuristic search. Simulation experiments are carried out by testing the Swarm Search over some high-dimensional datasets, with different classification algorithms and various metaheuristic algorithms. The comparative experiment results show that Swarm Search is able to attain relatively low error rates in classification without shrinking the size of the feature subset to its minimum.

  18. Optimal control

    CERN Document Server

    Aschepkov, Leonid T; Kim, Taekyun; Agarwal, Ravi P

    2016-01-01

    This book is based on lectures from a one-year course at the Far Eastern Federal University (Vladivostok, Russia) as well as on workshops on optimal control offered to students at various mathematical departments at the university level. The main themes of the theory of linear and nonlinear systems are considered, including the basic problem of establishing the necessary and sufficient conditions of optimal processes. In the first part of the course, the theory of linear control systems is constructed on the basis of the separation theorem and the concept of a reachability set. The authors prove the closure of a reachability set in the class of piecewise continuous controls, and the problems of controllability, observability, identification, performance and terminal control are also considered. The second part of the course is devoted to nonlinear control systems. Using the method of variations and the Lagrange multipliers rule of nonlinear problems, the authors prove the Pontryagin maximum principle for prob...

  19. MORE: mixed optimization for reverse engineering--an application to modeling biological networks response via sparse systems of nonlinear differential equations.

    Science.gov (United States)

    Sambo, Francesco; de Oca, Marco A Montes; Di Camillo, Barbara; Toffolo, Gianna; Stützle, Thomas

    2012-01-01

    Reverse engineering is the problem of inferring the structure of a network of interactions between biological variables from a set of observations. In this paper, we propose an optimization algorithm, called MORE, for the reverse engineering of biological networks from time series data. The model inferred by MORE is a sparse system of nonlinear differential equations, complex enough to realistically describe the dynamics of a biological system. MORE tackles separately the discrete component of the problem, the determination of the biological network topology, and the continuous component of the problem, the strength of the interactions. This approach allows us both to enforce system sparsity, by globally constraining the number of edges, and to integrate a priori information about the structure of the underlying interaction network. Experimental results on simulated and real-world networks show that the mixed discrete/continuous optimization approach of MORE significantly outperforms standard continuous optimization and that MORE is competitive with the state of the art in terms of accuracy of the inferred networks.

  20. Enhanced nonlinearity interval mapping scheme for high-performance simulation-optimization of watershed-scale BMP placement

    Science.gov (United States)

    Zou, Rui; Riverson, John; Liu, Yong; Murphy, Ryan; Sim, Youn

    2015-03-01

    Integrated continuous simulation-optimization models can be effective predictors of a process-based responses for cost-benefit optimization of best management practices (BMPs) selection and placement. However, practical application of simulation-optimization model is computationally prohibitive for large-scale systems. This study proposes an enhanced Nonlinearity Interval Mapping Scheme (NIMS) to solve large-scale watershed simulation-optimization problems several orders of magnitude faster than other commonly used algorithms. An efficient interval response coefficient (IRC) derivation method was incorporated into the NIMS framework to overcome a computational bottleneck. The proposed algorithm was evaluated using a case study watershed in the Los Angeles County Flood Control District. Using a continuous simulation watershed/stream-transport model, Loading Simulation Program in C++ (LSPC), three nested in-stream compliance points (CP)—each with multiple Total Maximum Daily Loads (TMDL) targets—were selected to derive optimal treatment levels for each of the 28 subwatersheds, so that the TMDL targets at all the CP were met with the lowest possible BMP implementation cost. Genetic Algorithm (GA) and NIMS were both applied and compared. The results showed that the NIMS took 11 iterations (about 11 min) to complete with the resulting optimal solution having a total cost of 67.2 million, while each of the multiple GA executions took 21-38 days to reach near optimal solutions. The best solution obtained among all the GA executions compared had a minimized cost of 67.7 million—marginally higher, but approximately equal to that of the NIMS solution. The results highlight the utility for decision making in large-scale watershed simulation-optimization formulations.