WorldWideScience

Sample records for nonlinear programming problem

  1. Some Duality Results for Fuzzy Nonlinear Programming Problem

    OpenAIRE

    Sangeeta Jaiswal; Geetanjali Panda

    2012-01-01

    The concept of duality plays an important role in optimization theory. This paper discusses some relations between primal and dual nonlinear programming problems in fuzzy environment. Here, fuzzy feasible region for a general fuzzy nonlinear programming is formed and the concept of fuzzy feasible solution is defined. First order dual relation for fuzzy nonlinear programming problem is studied.

  2. An Algorithm for Linearly Constrained Nonlinear Programming Programming Problems.

    Science.gov (United States)

    1980-01-01

    ALGORITHM FOR LINEARLY CONSTRAINED NONLINEAR PROGRAMMING PROBLEMS Mokhtar S. Bazaraa and Jamie J. Goode In this paper an algorithm for solving a linearly...distance pro- gramr.ing, as in the works of Bazaraa and Goode 12], and Wolfe [16 can be used for solving this problem. Special methods that take advantage of...34 Pacific Journal of Mathematics, Volume 16, pp. 1-3, 1966. 2. M. S. Bazaraa and J. j. Goode, "An Algorithm for Finding the Shortest Element of a

  3. An Adaptive Neural Network Model for Nonlinear Programming Problems

    Institute of Scientific and Technical Information of China (English)

    Xiang-sun Zhang; Xin-jian Zhuo; Zhu-jun Jing

    2002-01-01

    In this paper a canonical neural network with adaptively changing synaptic weights and activation function parameters is presented to solve general nonlinear programming problems. The basic part of the model is a sub-network used to find a solution of quadratic programming problems with simple upper and lower bounds. By sequentially activating the sub-network under the control of an external computer or a special analog or digital processor that adjusts the weights and parameters, one then solves general nonlinear programming problems. Convergence proof and numerical results are given.

  4. Modified Filled Function to Solve NonlinearProgramming Problem

    Institute of Scientific and Technical Information of China (English)

    2015-01-01

    Filled function method is an approach to find the global minimum of nonlinear functions. Many Problems, such as computing,communication control, and management, in real applications naturally result in global optimization formulations in a form ofnonlinear global integer programming. This paper gives a modified filled function method to solve the nonlinear global integerprogramming problem. The properties of the proposed modified filled function are also discussed in this paper. The results ofpreliminary numerical experiments are also reported.

  5. Converting general nonlinear programming problems into separable programming problems with feedforward neural networks.

    Science.gov (United States)

    Lu, Bao-Liang; Ito, Koji

    2003-09-01

    In this paper we present a method for converting general nonlinear programming (NLP) problems into separable programming (SP) problems by using feedforward neural networks (FNNs). The basic idea behind the method is to use two useful features of FNNs: their ability to approximate arbitrary continuous nonlinear functions with a desired degree of accuracy and their ability to express nonlinear functions in terms of parameterized compositions of functions of single variables. According to these two features, any nonseparable objective functions and/or constraints in NLP problems can be approximately expressed as separable functions with FNNs. Therefore, any NLP problems can be converted into SP problems. The proposed method has three prominent features. (a) It is more general than existing transformation techniques; (b) it can be used to formulate optimization problems as SP problems even when their precise analytic objective function and/or constraints are unknown; (c) the SP problems obtained by the proposed method may highly facilitate the selection of grid points for piecewise linear approximation of nonlinear functions. We analyze the computational complexity of the proposed method and compare it with an existing transformation approach. We also present several examples to demonstrate the method and the performance of the simplex method with the restricted basis entry rule for solving SP problems.

  6. Bonus algorithm for large scale stochastic nonlinear programming problems

    CERN Document Server

    Diwekar, Urmila

    2015-01-01

    This book presents the details of the BONUS algorithm and its real world applications in areas like sensor placement in large scale drinking water networks, sensor placement in advanced power systems, water management in power systems, and capacity expansion of energy systems. A generalized method for stochastic nonlinear programming based on a sampling based approach for uncertainty analysis and statistical reweighting to obtain probability information is demonstrated in this book. Stochastic optimization problems are difficult to solve since they involve dealing with optimization and uncertainty loops. There are two fundamental approaches used to solve such problems. The first being the decomposition techniques and the second method identifies problem specific structures and transforms the problem into a deterministic nonlinear programming problem. These techniques have significant limitations on either the objective function type or the underlying distributions for the uncertain variables. Moreover, these ...

  7. A convergence theory for a class of nonlinear programming problems.

    Science.gov (United States)

    Rauch, S. W.

    1973-01-01

    A recent convergence theory of Elkin concerning methods for unconstrained minimization is extended to a certain class of nonlinear programming problems. As in Elkin's original approach, the analysis of a variety of step-length algorithms is treated entirely separately from that of several direction algorithms. This allows for their combination into many different methods for solving the constrained problem. These include some of the methods of Rosen and Zoutendijk. We also extend the results of Topkis and Veinott to nonconvex sets and drop their requirement of the uniform feasibility of a subsequence of the search directions.

  8. Nonlinear programming for classification problems in machine learning

    Science.gov (United States)

    Astorino, Annabella; Fuduli, Antonio; Gaudioso, Manlio

    2016-10-01

    We survey some nonlinear models for classification problems arising in machine learning. In the last years this field has become more and more relevant due to a lot of practical applications, such as text and web classification, object recognition in machine vision, gene expression profile analysis, DNA and protein analysis, medical diagnosis, customer profiling etc. Classification deals with separation of sets by means of appropriate separation surfaces, which is generally obtained by solving a numerical optimization model. While linear separability is the basis of the most popular approach to classification, the Support Vector Machine (SVM), in the recent years using nonlinear separating surfaces has received some attention. The objective of this work is to recall some of such proposals, mainly in terms of the numerical optimization models. In particular we tackle the polyhedral, ellipsoidal, spherical and conical separation approaches and, for some of them, we also consider the semisupervised versions.

  9. COYOTE: a finite-element computer program for nonlinear heat-conduction problems

    Energy Technology Data Exchange (ETDEWEB)

    Gartling, D.K.

    1982-10-01

    COYOTE is a finite element computer program designed for the solution of two-dimensional, nonlinear heat conduction problems. The theoretical and mathematical basis used to develop the code is described. Program capabilities and complete user instructions are presented. Several example problems are described in detail to demonstrate the use of the program.

  10. The Expansion of Dynamic Solving Process About a Class of Non-linear Programming Problems

    Institute of Scientific and Technical Information of China (English)

    ZANG Zhen-chun

    2001-01-01

    In this paper, we research non-linear programming problems which have a given specialstructure, some simple forms of this kind structure have been solved in some papers, here we focus on othercomplex ones.

  11. 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.

  12. A Smooth Newton Method for Nonlinear Programming Problems with Inequality Constraints

    Directory of Open Access Journals (Sweden)

    Vasile Moraru

    2012-02-01

    Full Text Available The paper presents a reformulation of the Karush-Kuhn-Tucker (KKT system associated nonlinear programming problem into an equivalent system of smooth equations. Classical Newton method is applied to solve the system of equations. The superlinear convergence of the primal sequence, generated by proposed method, is proved. The preliminary numerical results with a problems test set are presented.

  13. 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.

  14. A high-performance feedback neural network for solving convex nonlinear programming problems.

    Science.gov (United States)

    Leung, Yee; Chen, Kai-Zhou; Gao, Xing-Bao

    2003-01-01

    Based on a new idea of successive approximation, this paper proposes a high-performance feedback neural network model for solving convex nonlinear programming problems. Differing from existing neural network optimization models, no dual variables, penalty parameters, or Lagrange multipliers are involved in the proposed network. It has the least number of state variables and is very simple in structure. In particular, the proposed network has better asymptotic stability. For an arbitrarily given initial point, the trajectory of the network converges to an optimal solution of the convex nonlinear programming problem under no more than the standard assumptions. In addition, the network can also solve linear programming and convex quadratic programming problems, and the new idea of a feedback network may be used to solve other optimization problems. Feasibility and efficiency are also substantiated by simulation examples.

  15. Multilevel adaptive solution procedure for material nonlinear problems in visual programming environment

    Energy Technology Data Exchange (ETDEWEB)

    Kim, D.; Ghanem, R. [State Univ. of New York, Buffalo, NY (United States)

    1994-12-31

    Multigrid solution technique to solve a material nonlinear problem in a visual programming environment using the finite element method is discussed. The nonlinear equation of equilibrium is linearized to incremental form using Newton-Rapson technique, then multigrid solution technique is used to solve linear equations at each Newton-Rapson step. In the process, adaptive mesh refinement, which is based on the bisection of a pair of triangles, is used to form grid hierarchy for multigrid iteration. The solution process is implemented in a visual programming environment with distributed computing capability, which enables more intuitive understanding of solution process, and more effective use of resources.

  16. 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.

  17. GLOBAL CONVERGENCE AND IMPLEMENTATION OF NGTN METHOD FOR SOLVING LARGE-SCALE SPARSE NONLINEAR PROGRAMMING PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    Qin Ni

    2001-01-01

    An NGTN method was proposed for solving large-scale sparse nonlinear programming (NLP) problems. This is a hybrid method of a truncated Newton direction and a modified negative gradient direction, which is suitable for handling sparse data structure and possesses Q-quadratic convergence rate. The global convergence of this new method is proved,the convergence rate is further analysed, and the detailed implementation is discussed in this paper. Some numerical tests for solving truss optimization and large sparse problems are reported. The theoretical and numerical results show that the new method is efficient for solving large-scale sparse NLP problems.

  18. EXACT AUGMENTED LAGRANGIAN FUNCTION FOR NONLINEAR PROGRAMMING PROBLEMS WITH INEQUALITY CONSTRAINTS

    Institute of Scientific and Technical Information of China (English)

    DU Xue-wu; ZHANG Lian-sheng; SHANG You-lin; LI Ming-ming

    2005-01-01

    An exact augmented Lagrangian function for the nonlinear nonconvex programming problems with inequality constraints was discussed. Under suitable hypotheses, the relationship was established between the local unconstrained minimizers of the augmented Lagrangian function on the space of problem variables and the local minimizers of the original constrained problem. Furthermore, under some assumptions,the relationship was also established between the global solutions of the augmented Lagrangian function on some compact subset of the space of problem variables and the global solutions of the constrained problem. Therefore, from the theoretical point of view, a solution of the inequality constrained problem and the corresponding values of the Lagrange multipliers can be found by the well-known method of multipliers which resort to the unconstrained minimization of the augmented Lagrangian function presented.

  19. A high performance neural network for solving nonlinear programming problems with hybrid constraints

    Science.gov (United States)

    Tao, Qing; Cao, Jinde; Xue, Meisheng; Qiao, Hong

    2001-09-01

    A continuous neural network is proposed in this Letter for solving optimization problems. It not only can solve nonlinear programming problems with the constraints of equality and inequality, but also has a higher performance. The main advantage of the network is that it is an extension of Newton's gradient method for constrained problems, the dynamic behavior of the network under special constraints and the convergence rate can be investigated. Furthermore, the proposed network is simpler than the existing networks even for solving positive definite quadratic programming problems. The network considered is constrained by a projection operator on a convex set. The advanced performance of the proposed network is demonstrated by means of simulation of several numerical examples.

  20. Intuitionistic Fuzzy Goal Programming Technique for Solving Non-Linear Multi-objective Structural Problem

    Directory of Open Access Journals (Sweden)

    Samir Dey

    2015-07-01

    Full Text Available This paper proposes a new multi-objective intuitionistic fuzzy goal programming approach to solve a multi-objective nonlinear programming problem in context of a structural design. Here we describe some basic properties of intuitionistic fuzzy optimization. We have considered a multi-objective structural optimization problem with several mutually conflicting objectives. The design objective is to minimize weight of the structure and minimize the vertical deflection at loading point of a statistically loaded three-bar planar truss subjected to stress constraints on each of the truss members. This approach is used to solve the above structural optimization model based on arithmetic mean and compare with the solution by intuitionistic fuzzy goal programming approach. A numerical solution is given to illustrate our approach.

  1. A NEW SQP-FILTER METHOD FOR SOLVING NONLINEAR PROGRAMMING PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    Duoquan Li

    2006-01-01

    In [4],Fletcher and Leyffer present a new method that solves nonlinear programming problems without a penalty function by SQP-Filter algorithm. It has attracted much attention due to its good numerical results. In this paper we propose a new SQP-Filter method which can overcome Maratos effect more effectively. We give stricter acceptant criteria when the iterative points are far from the optimal points and looser ones vice-versa. About this new method,the proof of global convergence is also presented under standard assumptions. Numerical results show that our method is efficient.

  2. 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.

  3. 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.

  4. A DUAL-RELAX PENALTY FUNCTION APPROACH FOR SOLVING NONLINEAR BILEVEL PROGRAMMING WITH LINEAR LOWER LEVEL PROBLEM

    Institute of Scientific and Technical Information of China (English)

    Wan Zhongping; Wang Guangrain; Lv Yibing

    2011-01-01

    The penalty function method, presented many years ago, is an important nu- merical method for the mathematical programming problems. In this article, we propose a dual-relax penalty function approach, which is significantly different from penalty func- tion approach existing for solving the bilevel programming, to solve the nonlinear bilevel programming with linear lower level problem. Our algorithm will redound to the error analysis for computing an approximate solution to the bilevel programming. The error estimate is obtained among the optimal objective function value of the dual-relax penalty problem and of the original bilevel programming problem. An example is illustrated to show the feasibility of the proposed approach.

  5. COYOTE : a finite element computer program for nonlinear heat conduction problems. Part I, theoretical background.

    Energy Technology Data Exchange (ETDEWEB)

    Glass, Micheal W.; Hogan, Roy E., Jr.; Gartling, David K.

    2010-03-01

    The need for the engineering analysis of systems in which the transport of thermal energy occurs primarily through a conduction process is a common situation. For all but the simplest geometries and boundary conditions, analytic solutions to heat conduction problems are unavailable, thus forcing the analyst to call upon some type of approximate numerical procedure. A wide variety of numerical packages currently exist for such applications, ranging in sophistication from the large, general purpose, commercial codes, such as COMSOL, COSMOSWorks, ABAQUS and TSS to codes written by individuals for specific problem applications. The original purpose for developing the finite element code described here, COYOTE, was to bridge the gap between the complex commercial codes and the more simplistic, individual application programs. COYOTE was designed to treat most of the standard conduction problems of interest with a user-oriented input structure and format that was easily learned and remembered. Because of its architecture, the code has also proved useful for research in numerical algorithms and development of thermal analysis capabilities. This general philosophy has been retained in the current version of the program, COYOTE, Version 5.0, though the capabilities of the code have been significantly expanded. A major change in the code is its availability on parallel computer architectures and the increase in problem complexity and size that this implies. The present document describes the theoretical and numerical background for the COYOTE program. This volume is intended as a background document for the user's manual. Potential users of COYOTE are encouraged to become familiar with the present report and the simple example analyses reported in before using the program. The theoretical and numerical background for the finite element computer program, COYOTE, is presented in detail. COYOTE is designed for the multi-dimensional analysis of nonlinear heat conduction

  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. Stable sequential Kuhn-Tucker theorem in iterative form or a regularized Uzawa algorithm in a regular nonlinear programming problem

    Science.gov (United States)

    Sumin, M. I.

    2015-06-01

    A parametric nonlinear programming problem in a metric space with an operator equality constraint in a Hilbert space is studied assuming that its lower semicontinuous value function at a chosen individual parameter value has certain subdifferentiability properties in the sense of nonlinear (nonsmooth) analysis. Such subdifferentiability can be understood as the existence of a proximal subgradient or a Fréchet subdifferential. In other words, an individual problem has a corresponding generalized Kuhn-Tucker vector. Under this assumption, a stable sequential Kuhn-Tucker theorem in nondifferential iterative form is proved and discussed in terms of minimizing sequences on the basis of the dual regularization method. This theorem provides necessary and sufficient conditions for the stable construction of a minimizing approximate solution in the sense of Warga in the considered problem, whose initial data can be approximately specified. A substantial difference of the proved theorem from its classical same-named analogue is that the former takes into account the possible instability of the problem in the case of perturbed initial data and, as a consequence, allows for the inherited instability of classical optimality conditions. This theorem can be treated as a regularized generalization of the classical Uzawa algorithm to nonlinear programming problems. Finally, the theorem is applied to the "simplest" nonlinear optimal control problem, namely, to a time-optimal control problem.

  8. 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.

  9. 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.

  10. A quadratic approximation-based algorithm for the solution of multiparametric mixed-integer nonlinear programming problems

    KAUST Repository

    Domínguez, Luis F.

    2012-06-25

    An algorithm for the solution of convex multiparametric mixed-integer nonlinear programming problems arising in process engineering problems under uncertainty is introduced. The proposed algorithm iterates between a multiparametric nonlinear programming subproblem and a mixed-integer nonlinear programming subproblem to provide a series of parametric upper and lower bounds. The primal subproblem is formulated by fixing the integer variables and solved through a series of multiparametric quadratic programming (mp-QP) problems based on quadratic approximations of the objective function, while the deterministic master subproblem is formulated so as to provide feasible integer solutions for the next primal subproblem. To reduce the computational effort when infeasibilities are encountered at the vertices of the critical regions (CRs) generated by the primal subproblem, a simplicial approximation approach is used to obtain CRs that are feasible at each of their vertices. The algorithm terminates when there does not exist an integer solution that is better than the one previously used by the primal problem. Through a series of examples, the proposed algorithm is compared with a multiparametric mixed-integer outer approximation (mp-MIOA) algorithm to demonstrate its computational advantages. © 2012 American Institute of Chemical Engineers (AIChE).

  11. The nonlinear fixed gravimetric boundary value problem

    Institute of Scientific and Technical Information of China (English)

    于锦海; 朱灼文

    1995-01-01

    The properly-posedness of the nonlinear fixed gravimetric boundary value problem is shown with the help of nonlinear functional analysis and a new iterative method to solve the problem is also given, where each step of the iterative program is reduced to solving one and the same kind of oblique derivative boundary value problem with the same type. Furthermore, the convergence of the iterative program is proved with Schauder estimate of elliptic differential equation.

  12. Nonlinear programming analysis and methods

    CERN Document Server

    Avriel, Mordecai

    2003-01-01

    Comprehensive and complete, this overview provides a single-volume treatment of key algorithms and theories. The author provides clear explanations of all theoretical aspects, with rigorous proof of most results. The two-part treatment begins with the derivation of optimality conditions and discussions of convex programming, duality, generalized convexity, and analysis of selected nonlinear programs. The second part concerns techniques for numerical solutions and unconstrained optimization methods, and it presents commonly used algorithms for constrained nonlinear optimization problems. This g

  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. Problems in nonlinear resistive MHD

    Energy Technology Data Exchange (ETDEWEB)

    Turnbull, A.D.; Strait, E.J.; La Haye, R.J.; Chu, M.S.; Miller, R.L. [General Atomics, San Diego, CA (United States)

    1998-12-31

    Two experimentally relevant problems can relatively easily be tackled by nonlinear MHD codes. Both problems require plasma rotation in addition to the nonlinear mode coupling and full geometry already incorporated into the codes, but no additional physics seems to be crucial. These problems discussed here are: (1) nonlinear coupling and interaction of multiple MHD modes near the B limit and (2) nonlinear coupling of the m/n = 1/1 sawtooth mode with higher n gongs and development of seed islands outside q = 1.

  15. LINEAR AND NONLINEAR SEMIDEFINITE PROGRAMMING

    Directory of Open Access Journals (Sweden)

    Walter Gómez Bofill

    2014-12-01

    Full Text Available This paper provides a short introduction to optimization problems with semidefinite constraints. Basic duality and optimality conditions are presented. For linear semidefinite programming some advances by dealing with degeneracy and the semidefinite facial reduction are discussed. Two relatively recent areas of application are presented. Finally a short overview of relevant literature on algorithmic approaches for efficiently solving linear and nonlinear semidefinite programming is provided.

  16. Recent advances in multiparametric nonlinear programming

    KAUST Repository

    Domínguez, Luis F.

    2010-05-01

    In this paper, we present recent developments in multiparametric nonlinear programming. For the case of convex problems, we highlight key issues regarding the full characterization of the parametric solution space and we discuss, through an illustrative example problem, four alternative state-of-the-art multiparametric nonlinear programming algorithms. We also identify a number of main challenges for the non-convex case and highlight future research directions. © 2009 Elsevier Ltd. All rights reserved.

  17. A NONLINEAR FEASIBILITY PROBLEM HEURISTIC

    Directory of Open Access Journals (Sweden)

    Sergio Drumond Ventura

    2015-04-01

    Full Text Available In this work we consider a region S ⊂ given by a finite number of nonlinear smooth convex inequalities and having nonempty interior. We assume a point x 0 is given, which is close in certain norm to the analytic center of S, and that a new nonlinear smooth convex inequality is added to those defining S (perturbed region. It is constructively shown how to obtain a shift of the right-hand side of this inequality such that the point x 0 is still close (in the same norm to the analytic center of this shifted region. Starting from this point and using the theoretical results shown, we develop a heuristic that allows us to obtain the approximate analytic center of the perturbed region. Then, we present a procedure to solve the problem of nonlinear feasibility. The procedure was implemented and we performed some numerical tests for the quadratic (random case.

  18. Nonlinear Least Squares for Inverse Problems

    CERN Document Server

    Chavent, Guy

    2009-01-01

    Presents an introduction into the least squares resolution of nonlinear inverse problems. This title intends to develop a geometrical theory to analyze nonlinear least square (NLS) problems with respect to their quadratic wellposedness, that is, both wellposedness and optimizability

  19. On some nonlinear potential problems

    Directory of Open Access Journals (Sweden)

    M. A. Efendiev

    1999-05-01

    Full Text Available The degree theory of mappings is applied to a two-dimensional semilinear elliptic problem with the Laplacian as principal part subject to a nonlinear boundary condition of Robin type. Under some growth conditions we obtain existence. The analysis is based on an equivalent coupled system of domain--boundary variational equations whose principal parts are the Dirichlet bilinear form in the domain and the single layer potential bilinear form on the boundary, respectively. This system consists of a monotone and a compact part. Additional monotonicity implies convergence of an appropriate Richardson iteration.

  20. Nonlinear programming analysis and methods

    CERN Document Server

    Avriel, Mordecai

    2012-01-01

    This text provides an excellent bridge between principal theories and concepts and their practical implementation. Topics include convex programming, duality, generalized convexity, analysis of selected nonlinear programs, techniques for numerical solutions, and unconstrained optimization methods.

  1. The virial theorem for nonlinear problems

    Energy Technology Data Exchange (ETDEWEB)

    Amore, Paolo [Facultad de Ciencias, Universidad de Colima, Bernal DIaz del Castillo 340, Colima (Mexico); Fernandez, Francisco M [INIFTA (UNLP, CCT La Plata-CONICET), Division Quimica Teorica, Blvd 113 S/N, Sucursal 4, Casilla de Correo 16, 1900 La Plata (Argentina)], E-mail: paolo.amore@gmail.com, E-mail: fernande@quimica.unlp.edu.ar

    2009-09-15

    We show that the virial theorem provides a useful simple tool for approximating nonlinear problems. In particular, we consider conservative nonlinear oscillators and obtain the same main result derived earlier from the expansion in Chebyshev polynomials. (letters and comments)

  2. Modeling Operation Problem of Micro-grids Considering Economical, Technical and Environmental issues as Mixed-Integer Non-Linear Programming

    Directory of Open Access Journals (Sweden)

    Samira Salahi

    2016-08-01

    Full Text Available Reduction of fossil resources, increasing the production of greenhouse gas emissions and demand growth lead to greater use of distributed energy resources in power system especially in distribution networks. Integrating these resources in order to supply local loads creates a new concept called micro-grid. Optimal operation of micro-grid in the specific time period is one of the most important problems of them. In this paper, the operation problem of micro-grids is modeled considering the economical, technical and environmental issues, as well as uncertainties related to loads, wind speed and solar radiation. The resulting model is a Mixed-Integer Non-Linear Programming (MINLP. To demonstrate the effectiveness of the proposed model, Bisheh village in Iran is considered as a case study. The results showed that considering load curtailment costs, the power losses of the main grid, the penalties of pollutant gasses emissions and the elimination of energy subsides will tremendous impacts on the operation of microgrids. Article History: Received March 12, 2016; Received in revised form June 20, 2016; Accepted July 2nd 2016; Available online How to Cite This Article: Salahi, S., and Bahramara, S. (2016 Modeling Operation Problem of Micro-grids Considering Economical, Technical and Environmental issues as Mixed-Integer Non-Linear Programming. Int. Journal of Renewable Energy Development, 5(2, 139-149. http://dx.doi.org/10.14710/ijred.5.2.139-149 

  3. Nonlinear programming with feedforward neural networks.

    Energy Technology Data Exchange (ETDEWEB)

    Reifman, J.

    1999-06-02

    We provide a practical and effective method for solving constrained optimization problems by successively training a multilayer feedforward neural network in a coupled neural-network/objective-function representation. Nonlinear programming problems are easily mapped into this representation which has a simpler and more transparent method of solution than optimization performed with Hopfield-like networks and poses very mild requirements on the functions appearing in the problem. Simulation results are illustrated and compared with an off-the-shelf optimization tool.

  4. 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

  5. A Null Space Approach for Solving Nonlinear Complementarity Problems

    Institute of Scientific and Technical Information of China (English)

    Pu-yan Nie

    2006-01-01

    In this work, null space techniques are employed to tackle nonlinear complementarity problems(NCPs). NCP conditions are transform into a nonlinear programming problem, which is handled by null space algorithms. The NCP conditions are divided into two groups. Some equalities and inequalities in an NCP are treated as constraints. While other equalities and inequalities in an NCP are to be regarded as objective function.Two groups are all updated in every step. Null space approaches are extended to nonlinear complementarity problems. Two different solvers are employed for an NCP in an algorithm.

  6. Studies of Nonlinear Problems. I

    Science.gov (United States)

    Fermi, E.; Pasta, J.; Ulam, S.

    1955-05-01

    A one-dimensional dynamical system of 64 particles with forces between neighbors containing nonlinear terms has been studied on the Los Alamos computer MANIAC I. The nonlinear terms considered are quadratic, cubic, and broken linear types. The results are analyzed into Fourier components and plotted as a function of time. The results show very little, if any, tendency toward equipartition of energy among the degrees of freedom.

  7. An SQP Algorithm for Recourse-based Stochastic Nonlinear Programming

    Directory of Open Access Journals (Sweden)

    Xinshun Ma

    2016-05-01

    Full Text Available The stochastic nonlinear programming problem with completed recourse and nonlinear constraints is studied in this paper. We present a sequential quadratic programming method for solving the problem based on the certainty extended nonlinear model. This algorithm is obtained by combing the active set method and filter method. The convergence of the method is established under some standard assumptions. Moreover, a practical design is presented and numerical results are provided.

  8. RESEARCH ON NONLINEAR PROBLEMS IN STRUCTURAL DYNAMICS.

    Science.gov (United States)

    Research on nonlinear problems structural dynamics is briefly summarized. Panel flutter was investigated to make a critical comparison between theory...panel flutter in aerospace vehicles, plausible simplifying assumptions are examined in the light of experimental results. Structural dynamics research

  9. A Trust Region Algorithm for Solving Bilevel Programming Problems

    Institute of Scientific and Technical Information of China (English)

    Guo-shan LIU; Shi-qin XU; Ji-ye HAN

    2013-01-01

    In this paper,we present a new trust region algorithm for a nonlinear bilevel programming problem by solving a series of its linear or quadratic approximation subproblems.For the nonlinear bilevel programming problem in which the lower level programming problem is a strongly convex programming problem with linear constraints,we show that each accumulation point of the iterative sequence produced by this algorithm is a stationary point of the bilevel programming problem.

  10. The role of nonlinearity in inverse problems

    Science.gov (United States)

    Snieder, Roel

    1998-06-01

    In many practical inverse problems, one aims to retrieve a model that has infinitely many degrees of freedom from a finite amount of data. It follows from a simple variable count that this cannot be done in a unique way. Therefore, inversion entails more than estimating a model: any inversion is not complete without a description of the class of models that is consistent with the data; this is called the appraisal problem. Nonlinearity makes the appraisal problem particularly difficult. The first reason for this is that nonlinear error propagation is a difficult problem. The second reason is that for some nonlinear problems the model parameters affect the way in which the model is being interrogated by the data. Two examples are given of this, and it is shown how the nonlinearity may make the problem more ill-posed. Finally, three attempts are shown to carry out the model appraisal for nonlinear inverse problems that are based on an analytical approach, a numerical approach and a common sense approach.

  11. A Cauchy problem in nonlinear heat conduction

    Energy Technology Data Exchange (ETDEWEB)

    De Lillo, S [Istituto Nazionale di Fisica Nucleare, Sezione di Perugia, Perugia (Italy); Lupo, G [Dipartimento di Matematica e Informatica, Universita degli Studi di Perugia, Via Vanvitelli, 1, 06123 Perugia (Italy); Sanchini, G [Istituto Nazionale di Fisica Nucleare, Sezione di Perugia, Perugia (Italy)

    2006-06-09

    A Cauchy problem on the semiline for a nonlinear diffusion equation is considered, with a boundary condition corresponding to a prescribed thermal conductivity at the origin. The problem is mapped into a moving boundary problem for the linear heat equation with a Robin-type boundary condition. Such a problem is then reduced to a linear integral Volterra equation of II type which admits a unique solution.

  12. Compressed Sensing with Nonlinear Observations and Related Nonlinear Optimisation Problems

    CERN Document Server

    Blumensath, Thomas

    2012-01-01

    Non-convex constraints have recently proven a valuable tool in many optimisation problems. In particular sparsity constraints have had a significant impact on sampling theory, where they are used in Compressed Sensing and allow structured signals to be sampled far below the rate traditionally prescribed. Nearly all of the theory developed for Compressed Sensing signal recovery assumes that samples are taken using linear measurements. In this paper we instead address the Compressed Sensing recovery problem in a setting where the observations are non-linear. We show that, under conditions similar to those required in the linear setting, the Iterative Hard Thresholding algorithm can be used to accurately recover sparse or structured signals from few non-linear observations. Similar ideas can also be developed in a more general non-linear optimisation framework. In the second part of this paper we therefore present related result that show how this can be done under sparsity and union of subspaces constraints, wh...

  13. 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.      

  14. Combined algorithms in nonlinear problems of magnetostatics

    Energy Technology Data Exchange (ETDEWEB)

    Gregus, M.; Khoromsky, B.N.; Mazurkevich, G.E.; Zhidkov, E.P.

    1988-05-09

    To solve boundary problems of magnetostatics in unbounded two- or three-dimensional regions, we construct combined algorithms based on a combination of the method of boundary integral equations with the grid methods. We study the question of substantiation of the combined method in nonlinear magnetostatic problems without the preliminary discretization of equations and give some results on the convergence of iterative processes that arise in nonlinear cases. We also discuss economical iterative processes and algorithms that solve boundary integral equations on certain surfaces. Finally, examples of numerical solutions of magnetostatic problems that arose when modelling the fields of electrophysical installations are given, too. 14 refs., 2 figs.

  15. Monotone method for nonlinear nonlocal hyperbolic problems

    Directory of Open Access Journals (Sweden)

    Azmy S. Ackleh

    2003-02-01

    Full Text Available We present recent results concerning the application of the monotone method for studying existence and uniqueness of solutions to general first-order nonlinear nonlocal hyperbolic problems. The limitations of comparison principles for such nonlocal problems are discussed. To overcome these limitations, we introduce new definitions for upper and lower solutions.

  16. Lobachevsky geometry and modern nonlinear problems

    CERN Document Server

    Popov, Andrey

    2014-01-01

    This monograph presents the basic concepts of hyperbolic Lobachevsky geometry and their possible applications to modern nonlinear applied problems in mathematics and physics, summarizing the findings of roughly the last hundred years. The central sections cover the classical building blocks of hyperbolic Lobachevsky geometry, pseudo spherical surfaces theory, net geometrical investigative techniques of nonlinear differential equations in partial derivatives, and their applications to the analysis of the physical models. As the sine-Gordon equation appears to have profound “geometrical roots” and numerous applications to modern nonlinear problems, it is treated as a universal “object” of investigation, connecting many of the problems discussed. The aim of this book is to form a general geometrical view on the different problems of modern mathematics, physics and natural science in general in the context of non-Euclidean hyperbolic geometry.

  17. The Interaction Programming Problem

    Institute of Scientific and Technical Information of China (English)

    LI Rong-sheng; CHENG Ying

    2001-01-01

    Based upon the research to the economic equilibrium problems, we present a kind of new mathematical programming problem-interaction programming problem (abbreviated by IPP). The IPP is composed of two or multiple parametric programming problems which is interrelated with each other. The IPP reflects the equality and mutual benefit relationship between two (or among multiple) economic planners in an economic system. In essence, the IPP is similar to the generalized Nash equilibria (GNE) game which has been given several names in the literature: social equilibria games, pseudo-Nash equilibria games, and equilibrium programming problems. In this paper, we establish the mathematical model and some basic concepts to the IPP. We investigate the structure and the properties of the IPP. We also give a necessary and sufficient conditions for the existence of the equilibrium points to a kind of linear IPP.

  18. Studies in nonlinear problems of energy

    Science.gov (United States)

    Matkowsky, B. J.

    1992-07-01

    Emphasis has been on combustion and flame propagation. The research program was on modeling, analysis and computation of combustion phenomena, with emphasis on transition from laminar to turbulent combustion. Nonlinear dynamics and pattern formation were investigated in the transition. Stability of combustion waves, and transitions to complex waves are described. Combustion waves possess large activation energies, so that chemical reactions are significant only in thin layers, or reaction zones. In limit of infinite activation energy, the zones shrink to moving surfaces, termed fronts which must be found during the analysis, so that the problems are moving free boundary problems. The studies are carried out for limiting case with fronts, while the numerical studies are carried out for finite, though large, activation energy. Accurate resolution of the solution in the reaction zones is essential, otherwise false predictions of dynamics are possible. Since the the reaction zones move, adaptive pseudo-spectral methods were developed. The approach is based on a synergism of analytical and computational methods. The numerical computations build on and extend the analytical information. Furthermore, analytical solutions serve as benchmarks for testing the accuracy of the computation. Finally, ideas from analysis (singular perturbation theory) have induced new approaches to computations. The computational results suggest new analysis to be considered. Among the recent interesting results, was spatio-temporal chaos in combustion. One goal is extension of the adaptive pseudo-spectral methods to adaptive domain decomposition methods. Efforts have begun to develop such methods for problems with multiple reaction zones, corresponding to problems with more complex, and more realistic chemistry. Other topics included stochastics, oscillators, Rysteretic Josephson junctions, DC SQUID, Markov jumps, laser with saturable absorber, chemical physics, Brownian movement, combustion

  19. Nonlinear elliptic-parabolic problems

    CERN Document Server

    Kim, Inwon C

    2012-01-01

    We introduce a notion of viscosity solutions for a general class of elliptic-parabolic phase transition problems. These include the Richards equation, which is a classical model in filtration theory. Existence and uniqueness results are proved via the comparison principle. In particular, we show existence and stability properties of maximal and minimal viscosity solutions for a general class of initial data. These results are new even in the linear case, where we also show that viscosity solutions coincide with the regular weak solutions introduced in [Alt&Luckhaus 1983].

  20. Advanced Research Workshop on Nonlinear Hyperbolic Problems

    CERN Document Server

    Serre, Denis; Raviart, Pierre-Arnaud

    1987-01-01

    The field of nonlinear hyperbolic problems has been expanding very fast over the past few years, and has applications - actual and potential - in aerodynamics, multifluid flows, combustion, detonics amongst other. The difficulties that arise in application are of theoretical as well as numerical nature. In fact, the papers in this volume of proceedings deal to a greater extent with theoretical problems emerging in the resolution of nonlinear hyperbolic systems than with numerical methods. The volume provides an excellent up-to-date review of the current research trends in this area.

  1. Filter-sequence of quadratic programming method with nonlinear complementarity problem function%结合非线性互补问题函数的滤子逐次二次规划算法

    Institute of Scientific and Technical Information of China (English)

    金中; 濮定国; 张宇; 蔡力

    2008-01-01

    A mechanism for proving global convergence in filter-SQP(sequence of quadratic programming)method with the nonlinear complementarity problem(NCP)function is described for constrained nonlinear optimization problem.We introduce an NCP function into the filter and construct a new SQP-filter algorithm.Such methods are characterized by their use of the dominance concept of multi-objective optimization,instead of a penalty parameter whose adjustment can be problematic.We prove that the algorithm has global convergence and superlinear convergence rates under some mild conditions.

  2. Studies in nonlinear problems of energy

    Energy Technology Data Exchange (ETDEWEB)

    Matkowsky, B.J.

    1992-07-01

    Emphasis has been on combustion and flame propagation. The research program was on modeling, analysis and computation of combustion phenomena, with emphasis on transition from laminar to turbulent combustion. Nonlinear dynamics and pattern formation were investigated in the transition. Stability of combustion waves, and transitions to complex waves are described. Combustion waves possess large activation energies, so that chemical reactions are significant only in thin layers, or reaction zones. In limit of infinite activation energy, the zones shrink to moving surfaces, (fronts) which must be found during the analysis, so that (moving free boundary problems). The studies are carried out for limiting case with fronts, while the numerical studies are carried out for finite, though large, activation energy. Accurate resolution of the solution in the reaction zones is essential, otherwise false predictions of dynamics are possible. Since the the reaction zones move, adaptive pseudo-spectral methods were developed. The approach is based on a synergism of analytical and computational methods. The numerical computations build on and extend the analytical information. Furthermore, analytical solutions serve as benchmarks for testing the accuracy of the computation. Finally, ideas from analysis (singular perturbation theory) have induced new approaches to computations. The computational results suggest new analysis to be considered. Among the recent interesting results, was spatio-temporal chaos in combustion. One goal is extension of the adaptive pseudo-spectral methods to adaptive domain decomposition methods. Efforts have begun to develop such methods for problems with multiple reaction zones, corresponding to problems with more complex, and more realistic chemistry. Other topics included stochastics, oscillators, Rysteretic Josephson junctions, DC SQUID, Markov jumps, laser with saturable absorber, chemical physics, Brownian movement, combustion synthesis, etc.

  3. Topological invariants in nonlinear boundary value problems

    Energy Technology Data Exchange (ETDEWEB)

    Vinagre, Sandra [Departamento de Matematica, Universidade de Evora, Rua Roma-tilde o Ramalho 59, 7000-671 Evora (Portugal)]. E-mail: smv@uevora.pt; Severino, Ricardo [Departamento de Matematica, Universidade do Minho, Campus de Gualtar, 4710-057 Braga (Portugal)]. E-mail: ricardo@math.uminho.pt; Ramos, J. Sousa [Departamento de Matematica, Instituto Superior Tecnico, Av. Rovisco Pais 1, 1049-001 Lisbon (Portugal)]. E-mail: sramos@math.ist.utl.pt

    2005-07-01

    We consider a class of boundary value problems for partial differential equations, whose solutions are, basically, characterized by the iteration of a nonlinear function. We apply methods of symbolic dynamics of discrete bimodal maps in the interval in order to give a topological characterization of its solutions.

  4. 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.

  5. Bifurcations and sensitivity in parametric nonlinear programming

    Science.gov (United States)

    Lundberg, Bruce N.; Poore, Aubrey B.

    1990-01-01

    The parametric nonlinear programming problem is that of determining the behavior of solution(s) as a parameter or vector of parameters alpha belonging to R(sup r) varies over a region of interest for the problem: Minimize over x the set f(x, alpha):h(x, alpha) = 0, g(x, alpha) is greater than or equal to 0, where f:R(sup (n+r)) approaches R, h:R(sup (n+r)) approaches R(sup q) and g:R(sup (n+r)) approaches R(sup p) are assumed to be at least twice continuously differentiable. Some of these parameters may be fixed but not known precisely and others may be varied to enhance the performance of the system. In both cases a fundamentally important problem in the investigation of global sensitivity of the system is to determine the stability boundaries of the regions in parameter space which define regions of qualitatively similar solutions. The objective is to explain how numerical continuation and bifurcation techniques can be used to investigate the parametric nonlinear programming problem in a global sense. Thus, first the problem is converted to a closed system of parameterized nonlinear equations whose solution set contains all local minimizers of the original problem. This system, which will be represented as F(z,alpha) = O, will include all Karush-Kuhn-Tucker and Fritz John points, both feasible and infeasible solutions, and relative minima, maxima, and saddle points of the problem. The local existence and uniqueness of a solution path (z(alpha), alpha) of this system as well as the solution type persist as long as a singularity in the Jacobian D(sub z)F(z,alpha) is not encountered. Thus the nonsingularity of this Jacobian is characterized in terms of conditions on the problem itself. Then, a class of efficient predictor-corrector continuation procedures for tracing solution paths of the system F(z,alpha) = O which are tailored specifically to the parametric programming problem are described. Finally, these procedures and the obtained information are illustrated

  6. Multigrid Methods for Nonlinear Problems: An Overview

    Energy Technology Data Exchange (ETDEWEB)

    Henson, V E

    2002-12-23

    Since their early application to elliptic partial differential equations, multigrid methods have been applied successfully to a large and growing class of problems, from elasticity and computational fluid dynamics to geodetics and molecular structures. Classical multigrid begins with a two-grid process. First, iterative relaxation is applied, whose effect is to smooth the error. Then a coarse-grid correction is applied, in which the smooth error is determined on a coarser grid. This error is interpolated to the fine grid and used to correct the fine-grid approximation. Applying this method recursively to solve the coarse-grid problem leads to multigrid. The coarse-grid correction works because the residual equation is linear. But this is not the case for nonlinear problems, and different strategies must be employed. In this presentation we describe how to apply multigrid to nonlinear problems. There are two basic approaches. The first is to apply a linearization scheme, such as the Newton's method, and to employ multigrid for the solution of the Jacobian system in each iteration. The second is to apply multigrid directly to the nonlinear problem by employing the so-called Full Approximation Scheme (FAS). In FAS a nonlinear iteration is applied to smooth the error. The full equation is solved on the coarse grid, after which the coarse-grid error is extracted from the solution. This correction is then interpolated and applied to the fine grid approximation. We describe these methods in detail, and present numerical experiments that indicate the efficacy of them.

  7. Pattern selection as a nonlinear eigenvalue problem

    CERN Document Server

    Büchel, P

    1996-01-01

    A unique pattern selection in the absolutely unstable regime of driven, nonlinear, open-flow systems is reviewed. It has recently been found in numerical simulations of propagating vortex structures occuring in Taylor-Couette and Rayleigh-Benard systems subject to an externally imposed through-flow. Unlike the stationary patterns in systems without through-flow the spatiotemporal structures of propagating vortices are independent of parameter history, initial conditions, and system length. They do, however, depend on the boundary conditions in addition to the driving rate and the through-flow rate. Our analysis of the Ginzburg-Landau amplitude equation elucidates how the pattern selection can be described by a nonlinear eigenvalue problem with the frequency being the eigenvalue. Approaching the border between absolute and convective instability the eigenvalue problem becomes effectively linear and the selection mechanism approaches that of linear front propagation. PACS: 47.54.+r,47.20.Ky,47.32.-y,47.20.Ft

  8. A New Superlinearly Convergent SQP Algorithm for Nonlinear Minimax Problems

    Institute of Scientific and Technical Information of China (English)

    Jin-bao Jian; Ran Quan; Qing-jie Hu

    2007-01-01

    In this paper, the nonlinear minimax problems are discussed. By means of the Sequential Quadratic Programming (SQP), a new descent algorithm for solving the problems is presented. At each iteration of the proposed algorithm, a main search direction is obtained by solving a Quadratic Programming (QP) which always has a solution. In order to avoid the Maratos effect, a correction direction is obtained by updating the main direction with a simple explicit formula. Under mild conditions without the strict complementarity, the global and superlinear convergence of the algorithm can be obtained. Finally, some numerical experiments are reported.

  9. Using genetic programming to discover nonlinear variable interactions.

    Science.gov (United States)

    Westbury, Chris; Buchanan, Lori; Sanderson, Michael; Rhemtulla, Mijke; Phillips, Leah

    2003-05-01

    Psychology has to deal with many interacting variables. The analyses usually used to uncover such relationships have many constraints that limit their utility. We briefly discuss these and describe recent work that uses genetic programming to evolve equations to combine variables in nonlinear ways in a number of different domains. We focus on four studies of interactions from lexical access experiments and psychometric problems. In all cases, genetic programming described nonlinear combinations of items in a manner that was subsequently independently verified. We discuss the general implications of genetic programming and related computational methods for multivariate problems in psychology.

  10. A novel neural network for nonlinear convex programming.

    Science.gov (United States)

    Gao, Xing-Bao

    2004-05-01

    In this paper, we present a neural network for solving the nonlinear convex programming problem in real time by means of the projection method. The main idea is to convert the convex programming problem into a variational inequality problem. Then a dynamical system and a convex energy function are constructed for resulting variational inequality problem. It is shown that the proposed neural network is stable in the sense of Lyapunov and can converge to an exact optimal solution of the original problem. Compared with the existing neural networks for solving the nonlinear convex programming problem, the proposed neural network has no Lipschitz condition, no adjustable parameter, and its structure is simple. The validity and transient behavior of the proposed neural network are demonstrated by some simulation results.

  11. A Note on Separable Nonlinear Least Squares Problem

    CERN Document Server

    Gharibi, Wajeb

    2011-01-01

    Separable nonlinear least squares (SNLS)problem is a special class of nonlinear least squares (NLS)problems, whose objective function is a mixture of linear and nonlinear functions. It has many applications in many different areas, especially in Operations Research and Computer Sciences. They are difficult to solve with the infinite-norm metric. In this paper, we give a short note on the separable nonlinear least squares problem, unseparated scheme for NLS, and propose an algorithm for solving mixed linear-nonlinear minimization problem, method of which results in solving a series of least squares separable problems.

  12. OPEN PROBLEM: Some nonlinear challenges in biology

    Science.gov (United States)

    Mosconi, Francesco; Julou, Thomas; Desprat, Nicolas; Sinha, Deepak Kumar; Allemand, Jean-François; Croquette, Vincent; Bensimon, David

    2008-08-01

    Driven by a deluge of data, biology is undergoing a transition to a more quantitative science. Making sense of the data, building new models, asking the right questions and designing smart experiments to answer them are becoming ever more relevant. In this endeavour, nonlinear approaches can play a fundamental role. The biochemical reactions that underlie life are very often nonlinear. The functional features exhibited by biological systems at all levels (from the activity of an enzyme to the organization of a colony of ants, via the development of an organism or a functional module like the one responsible for chemotaxis in bacteria) are dynamically robust. They are often unaffected by order of magnitude variations in the dynamical parameters, in the number or concentrations of actors (molecules, cells, organisms) or external inputs (food, temperature, pH, etc). This type of structural robustness is also a common feature of nonlinear systems, exemplified by the fundamental role played by dynamical fixed points and attractors and by the use of generic equations (logistic map, Fisher-Kolmogorov equation, the Stefan problem, etc.) in the study of a plethora of nonlinear phenomena. However, biological systems differ from these examples in two important ways: the intrinsic stochasticity arising from the often very small number of actors and the role played by evolution. On an evolutionary time scale, nothing in biology is frozen. The systems observed today have evolved from solutions adopted in the past and they will have to adapt in response to future conditions. The evolvability of biological system uniquely characterizes them and is central to biology. As the great biologist T Dobzhansky once wrote: 'nothing in biology makes sense except in the light of evolution'.

  13. Interval Arithmetic for Nonlinear Problem Solving

    OpenAIRE

    2013-01-01

    Implementation of interval arithmetic in complex problems has been hampered by the tedious programming exercise needed to develop a particular implementation. In order to improve productivity, the use of interval mathematics is demonstrated using the computing platform INTLAB that allows for the development of interval-arithmetic-based programs more efficiently than with previous interval-arithmetic libraries. An interval-Newton Generalized-Bisection (IN/GB) method is developed in this platfo...

  14. Studies in nonlinear problems of energy

    Energy Technology Data Exchange (ETDEWEB)

    Matkowsky, B.J.

    1990-11-01

    We carry out a research program with primary emphasis on the applications of Bifurcation and Stability Theory to Problems of energy, with specific emphasis on Problems of Combustion and Flame Propagation. In particular we consider the problem of transition from laminar to turbulent flame propagation. A great deal of progress has been made in our investigations. More than one hundred and thirty papers citing this project have been prepared for publication in technical journals. A list of the papers, including abstracts for each paper, is appended to this report.

  15. An Evaluation and Comparison of Three Nonlinear Programming Codes

    Science.gov (United States)

    1976-03-01

    sixth problem was selected from the Himmelblau collection [Ref. 11] and the remaining two were adaptations cf an inventory model and an entropy model...both require utilization of the main nonlinear codes with their high core and corresponding time requirements. Himmelblau estimated preparation times...Nonlinear Program mincf Moclel for "Determining a Huni/Eions ITix, By R*.J. CTasen, E.¥.Graves ana J.Y7 Iu, 3arch 1974. 11. Himmelblau . D.M., Applied

  16. Bayesian nonlinear regression for large small problems

    KAUST Repository

    Chakraborty, Sounak

    2012-07-01

    Statistical modeling and inference problems with sample sizes substantially smaller than the number of available covariates are challenging. This is known as large p small n problem. Furthermore, the problem is more complicated when we have multiple correlated responses. We develop multivariate nonlinear regression models in this setup for accurate prediction. In this paper, we introduce a full Bayesian support vector regression model with Vapnik\\'s ε-insensitive loss function, based on reproducing kernel Hilbert spaces (RKHS) under the multivariate correlated response setup. This provides a full probabilistic description of support vector machine (SVM) rather than an algorithm for fitting purposes. We have also introduced a multivariate version of the relevance vector machine (RVM). Instead of the original treatment of the RVM relying on the use of type II maximum likelihood estimates of the hyper-parameters, we put a prior on the hyper-parameters and use Markov chain Monte Carlo technique for computation. We have also proposed an empirical Bayes method for our RVM and SVM. Our methods are illustrated with a prediction problem in the near-infrared (NIR) spectroscopy. A simulation study is also undertaken to check the prediction accuracy of our models. © 2012 Elsevier Inc.

  17. Method for solving a convex integer programming problem

    OpenAIRE

    Stefanov, Stefan M.

    2003-01-01

    We consider a convex integer program which is a nonlinear version of the assignment problem. This problem is reformulated as an equivalent problem. An algorithm for solving the original problem is suggested which is based on solving the simple assignment problem via some of known algorithms.

  18. An Algorithm to Solve Separable Nonlinear Least Square Problem

    Directory of Open Access Journals (Sweden)

    Wajeb Gharibi

    2013-07-01

    Full Text Available Separable Nonlinear Least Squares (SNLS problem is a special class of Nonlinear Least Squares (NLS problems, whose objective function is a mixture of linear and nonlinear functions. SNLS has many applications in several areas, especially in the field of Operations Research and Computer Science. Problems related to the class of NLS are hard to resolve having infinite-norm metric. This paper gives a brief explanation about SNLS problem and offers a Lagrangian based algorithm for solving mixed linear-nonlinear minimization problem

  19. The fully nonlinear stratified geostrophic adjustment problem

    Science.gov (United States)

    Coutino, Aaron; Stastna, Marek

    2017-01-01

    The study of the adjustment to equilibrium by a stratified fluid in a rotating reference frame is a classical problem in geophysical fluid dynamics. We consider the fully nonlinear, stratified adjustment problem from a numerical point of view. We present results of smoothed dam break simulations based on experiments in the published literature, with a focus on both the wave trains that propagate away from the nascent geostrophic state and the geostrophic state itself. We demonstrate that for Rossby numbers in excess of roughly 2 the wave train cannot be interpreted in terms of linear theory. This wave train consists of a leading solitary-like packet and a trailing tail of dispersive waves. However, it is found that the leading wave packet never completely separates from the trailing tail. Somewhat surprisingly, the inertial oscillations associated with the geostrophic state exhibit evidence of nonlinearity even when the Rossby number falls below 1. We vary the width of the initial disturbance and the rotation rate so as to keep the Rossby number fixed, and find that while the qualitative response remains consistent, the Froude number varies, and these variations are manifested in the form of the emanating wave train. For wider initial disturbances we find clear evidence of a wave train that initially propagates toward the near wall, reflects, and propagates away from the geostrophic state behind the leading wave train. We compare kinetic energy inside and outside of the geostrophic state, finding that for long times a Rossby number of around one-quarter yields an equal split between the two, with lower (higher) Rossby numbers yielding more energy in the geostrophic state (wave train). Finally we compare the energetics of the geostrophic state as the Rossby number varies, finding long-lived inertial oscillations in the majority of the cases and a general agreement with the past literature that employed either hydrostatic, shallow-water equation-based theory or

  20. Robust adaptive dynamic programming and feedback stabilization of nonlinear systems.

    Science.gov (United States)

    Jiang, Yu; Jiang, Zhong-Ping

    2014-05-01

    This paper studies the robust optimal control design for a class of uncertain nonlinear systems from a perspective of robust adaptive dynamic programming (RADP). The objective is to fill up a gap in the past literature of adaptive dynamic programming (ADP) where dynamic uncertainties or unmodeled dynamics are not addressed. A key strategy is to integrate tools from modern nonlinear control theory, such as the robust redesign and the backstepping techniques as well as the nonlinear small-gain theorem, with the theory of ADP. The proposed RADP methodology can be viewed as an extension of ADP to uncertain nonlinear systems. Practical learning algorithms are developed in this paper, and have been applied to the controller design problems for a jet engine and a one-machine power system.

  1. Approximate Augmented Lagrangian Functions and Nonlinear Semidefinite Programs

    Institute of Scientific and Technical Information of China (English)

    X. X. HUANG; K. L. TEO; X. Q. YANG

    2006-01-01

    In this paper, an approximate augmented Lagrangian function for nonlinear semidefinite programs is introduced. Some basic properties of the approximate augmented Lagrange function such as monotonicity and convexity are discussed. Necessary and sufficient conditions for approximate strong duality results are derived. Conditions for an approximate exact penalty representation in the framework of augmented Lagrangian are given. Under certain conditions, it is shown that any limit point of a sequence of stationary points of approximate augmented Lagrangian problems is a KKT point of the original semidefinite program and that a sequence of optimal solutions to augmented Lagrangian problems converges to a solution of the original semidefinite program.

  2. 寻找非线性规划问题Kuhn-Tucker 点的一种微分方程方法%A differential equation approach to finding a Kuhn-Tucker point of a nonlinear programming problem

    Institute of Scientific and Technical Information of China (English)

    周丽美; 张立卫

    2005-01-01

    A system of differential equations is constructed to find Kuhn-Tucker points of a nonlinear programming problem with both equality and inequality constraints. It is proved that the Kuhn-Tucker point of the nonlinear programming problem is an asymptotically stable equilibrium point of the differential system and a numerical algorithm is given based on the numerical integration of the proposed system of ordinary differential equations.The convergence theorem of the numerical algorithm is demonstrated. Several illustrative examples show the effectiveness of the algorithm.%为了寻找带有等式约束和不等式约束的非线性规划问题的Kuhn-Tucker点,给出了一种微分方程系统.在一定的条件下,证明了非线性规划问题的Kuhn-Tucker点是微分方程系统的渐进稳定平衡点,并且基于一般微分方程系统的数值积分建立了一个数值算法,然后给出了该数值算法的收敛性定理.数值算例表明了该算法的有效性.

  3. A NEW SMOOTHING EQUATIONS APPROACH TO THE NONLINEAR COMPLEMENTARITY PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    Chang-feng Ma; Pu-yan Nie; Guo-ping Liang

    2003-01-01

    The nonlinear complementarity problem can be reformulated as a nonsmooth equation. In this paper we propose a new smoothing Newton algorithm for the solution of the nonlinear complementarity problem by constructing a new smoothing approximation function. Global and local superlinear convergence results of the algorithm are obtained under suitable conditions. Numerical experiments confirm the good theoretical properties of the algorithm.

  4. Nonlinear algebraic multigrid for constrained solid mechanics problems using Trilinos

    OpenAIRE

    Gee, M.W.; R. S. Tuminaro

    2012-01-01

    The application of the finite element method to nonlinear solid mechanics problems results in the neccessity to repeatedly solve a large nonlinear set of equations. In this paper we limit ourself to problems arising in constrained solid mechanics problems. It is common to apply some variant of Newton?s method or a Newton? Krylov method to such problems. Often, an analytic Jacobian matrix is formed and used in the above mentioned methods. However, if no analytic Jacobian is given, Newton metho...

  5. Bifurcation of solutions of nonlinear Sturm–Liouville problems

    Directory of Open Access Journals (Sweden)

    Gulgowski Jacek

    2001-01-01

    Full Text Available A global bifurcation theorem for the following nonlinear Sturm–Liouville problem is given Moreover we give various versions of existence theorems for boundary value problems The main idea of these proofs is studying properties of an unbounded connected subset of the set of all nontrivial solutions of the nonlinear spectral problem , associated with the boundary value problem , in such a way that .

  6. Multisplitting for linear, least squares and nonlinear problems

    Energy Technology Data Exchange (ETDEWEB)

    Renaut, R.

    1996-12-31

    In earlier work, presented at the 1994 Iterative Methods meeting, a multisplitting (MS) method of block relaxation type was utilized for the solution of the least squares problem, and nonlinear unconstrained problems. This talk will focus on recent developments of the general approach and represents joint work both with Andreas Frommer, University of Wupertal for the linear problems and with Hans Mittelmann, Arizona State University for the nonlinear problems.

  7. Solutions manual to accompany Nonlinear programming

    CERN Document Server

    Bazaraa, Mokhtar S; Shetty, C M

    2014-01-01

    As the Solutions Manual, this book is meant to accompany the main title, Nonlinear Programming: Theory and Algorithms, Third Edition. This book presents recent developments of key topics in nonlinear programming (NLP) using a logical and self-contained format. The volume is divided into three sections: convex analysis, optimality conditions, and dual computational techniques. Precise statements of algortihms are given along with convergence analysis. Each chapter contains detailed numerical examples, graphical illustrations, and numerous exercises to aid readers in understanding the concepts a

  8. DBEM crack propagation for nonlinear fracture problems

    Directory of Open Access Journals (Sweden)

    R. Citarella

    2015-10-01

    Full Text Available A three-dimensional crack propagation simulation is performed by the Dual Boundary Element Method (DBEM. The Stress Intensity Factors (SIFs along the front of a semi elliptical crack, initiated from the external surface of a hollow axle, are calculated for bending and press fit loading separately and for a combination of them. In correspondence of the latter loading condition, a crack propagation is also simulated, with the crack growth rates calculated using the NASGRO3 formula, calibrated for the material under analysis (steel ASTM A469. The J-integral and COD approaches are selected for SIFs calculation in DBEM environment, where the crack path is assessed by the minimum strain energy density criterion (MSED. In correspondence of the initial crack scenario, SIFs along the crack front are also calculated by the Finite Element (FE code ZENCRACK, using COD, in order to provide, by a cross comparison with DBEM, an assessment on the level of accuracy obtained. Due to the symmetry of the bending problem a pure mode I crack propagation is realised with no kinking of the propagating crack whereas for press fit loading the crack propagation becomes mixed mode. The crack growth analysis is nonlinear because of normal gap elements used to model the press fit condition with added friction, and is developed in an iterative-incremental procedure. From the analysis of the SIFs results related to the initial cracked configuration, it is possible to assess the impact of the press fit condition when superimposed to the bending load case.

  9. 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.

  10. LINEARIZATION AND CORRECTION METHOD FOR NONLINEAR PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    何吉欢

    2002-01-01

    A new perturbation-like technique called linearization and correction method is proposed. Contrary to the traditional perturbation techniques, the present theory does not assume that the solution is expressed in the form of a power series of small parameter. To obtain an asymptotic solution of nonlinear system, the technique first searched for a solution for the linearized system, then a correction was added to the linearized solution. So the obtained results are uniformly valid for both weakly and strongly nonlinear equations.

  11. Discussion of Some Problems About Nonlinear Time Series Prediction Using v-Support Vector Machine

    Institute of Scientific and Technical Information of China (English)

    GAO Cheng-Feng; CHEN Tian-Lun; NAN Tian-Shi

    2007-01-01

    Some problems in using v-support vector machine (v-SVM) for the prediction of nonlinear time series are discussed. The problems include selection of various net parameters, which affect the performance of prediction, mixture of kernels, and decomposition cooperation linear programming v-SVM regression, which result in improvements of the algorithm. Computer simulations in the prediction of nonlinear time series produced by Mackey-Glass equation and Lorenz equation provide some improved results.

  12. 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.

  13. A Stability Theory in Nonlinear Programming

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    We propose a new method for finding the local optimal points ofthe constrained nonlinear programming by Ordinary Differential Equations (ODE), and prove asymptotic stability of the singular points of partial variables in this paper. The condition of overall uniform, asymptotic stability is also given.

  14. 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.

  15. Evolutionary Programming for IP/MIP Problems with Linear Constraints

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    In this paper, we propose a modified evolutionary programming with dynamic domain for solving nonlinear IP/MIP problems with linear constraints, without involving penalty function or any transformation for the problem to a linear model or others. The numerical results show that the new algorithm gives a satisfactory performance in which it works of high speed and accuracy in IP/MIP problems.

  16. Evaluation of a transfinite element numerical solution method for nonlinear heat transfer problems

    Science.gov (United States)

    Cerro, J. A.; Scotti, S. J.

    1991-01-01

    Laplace transform techniques have been widely used to solve linear, transient field problems. A transform-based algorithm enables calculation of the response at selected times of interest without the need for stepping in time as required by conventional time integration schemes. The elimination of time stepping can substantially reduce computer time when transform techniques are implemented in a numerical finite element program. The coupling of transform techniques with spatial discretization techniques such as the finite element method has resulted in what are known as transfinite element methods. Recently attempts have been made to extend the transfinite element method to solve nonlinear, transient field problems. This paper examines the theoretical basis and numerical implementation of one such algorithm, applied to nonlinear heat transfer problems. The problem is linearized and solved by requiring a numerical iteration at selected times of interest. While shown to be acceptable for weakly nonlinear problems, this algorithm is ineffective as a general nonlinear solution method.

  17. Nonlinear Second-Order Multivalued Boundary Value Problems

    Indian Academy of Sciences (India)

    Leszek Gasiński; Nikolaos S Papageorgiou

    2003-08-01

    In this paper we study nonlinear second-order differential inclusions involving the ordinary vector -Laplacian, a multivalued maximal monotone operator and nonlinear multivalued boundary conditions. Our framework is general and unifying and incorporates gradient systems, evolutionary variational inequalities and the classical boundary value problems, namely the Dirichlet, the Neumann and the periodic problems. Using notions and techniques from the nonlinear operatory theory and from multivalued analysis, we obtain solutions for both the `convex' and `nonconvex' problems. Finally, we present the cases of special interest, which fit into our framework, illustrating the generality of our results.

  18. Minimax theory for a class of nonlinear statistical inverse problems

    Science.gov (United States)

    Ray, Kolyan; Schmidt-Hieber, Johannes

    2016-06-01

    We study a class of statistical inverse problems with nonlinear pointwise operators motivated by concrete statistical applications. A two-step procedure is proposed, where the first step smoothes the data and inverts the nonlinearity. This reduces the initial nonlinear problem to a linear inverse problem with deterministic noise, which is then solved in a second step. The noise reduction step is based on wavelet thresholding and is shown to be minimax optimal (up to logarithmic factors) in a pointwise function-dependent sense. Our analysis is based on a modified notion of Hölder smoothness scales that are natural in this setting.

  19. 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.

  20. 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.

  1. Robust Monotone Iterates for Nonlinear Singularly Perturbed Boundary Value Problems

    Directory of Open Access Journals (Sweden)

    Boglaev Igor

    2009-01-01

    Full Text Available This paper is concerned with solving nonlinear singularly perturbed boundary value problems. Robust monotone iterates for solving nonlinear difference scheme are constructed. Uniform convergence of the monotone methods is investigated, and convergence rates are estimated. Numerical experiments complement the theoretical results.

  2. Analytical Solutions to Non-linear Mechanical Oscillation Problems

    DEFF Research Database (Denmark)

    Kaliji, H. D.; Ghadimi, M.; Barari, Amin

    2011-01-01

    In this paper, the Max-Min Method is utilized for solving the nonlinear oscillation problems. The proposed approach is applied to three systems with complex nonlinear terms in their motion equations. By means of this method, the dynamic behavior of oscillation systems can be easily approximated u...

  3. A Unified Approach for Solving Nonlinear Regular Perturbation Problems

    Science.gov (United States)

    Khuri, S. A.

    2008-01-01

    This article describes a simple alternative unified method of solving nonlinear regular perturbation problems. The procedure is based upon the manipulation of Taylor's approximation for the expansion of the nonlinear term in the perturbed equation. An essential feature of this technique is the relative simplicity used and the associated unified…

  4. Penalized interior point approach for constrained nonlinear programming

    Institute of Scientific and Technical Information of China (English)

    LU Wen-ting; YAO Yi-rong; ZHANG Lian-sheng

    2009-01-01

    A penalized interior point approach for constrained nonlinear programming is examined in this work. To overcome the difficulty of initialization for the interior point method, a problem equivalent to the primal problem via incorporating an auxiliary variable is constructed. A combined approach of logarithm barrier and quadratic penalty function is proposed to solve the problem. Based on Newton's method, the global convergence of interior point and line search algorithm is proven.Only a finite number of iterations is required to reach an approximate optimal solution. Numerical tests are given to show the effectiveness of the method.

  5. Finite Element Analysis to Two-Dimensional Nonlinear Sloshing Problems

    Institute of Scientific and Technical Information of China (English)

    严承华; 王赤忠; 程尔升

    2001-01-01

    A two-dimensional nonlinear sloshing problem is analyzed by means of the fully nonlinear theory and time domainsecond order theory of water waves. Liquid sloshing in a rectangular container subjected to a horizontal excitation is sim-ulated by the finite element method. Comparisons between the two theories are made based on their numerical results. Itis found that good agreement is obtained for the case of small amplitude oscillation and obvious differences occur forlarge amplitude excitation. Even though, the second order solution can still exhibit typical nonlinear features ofnonlinear wave and can be used instead of the fully nonlinear theory.

  6. An application of Matlab c on Dimensional Nonlinear Programming

    OpenAIRE

    Fernando Giménez Palomares; María José Marín Fernández

    2014-01-01

    [EN] Nonlinear Programming (NLP) is a widely applicable tool in modeling real life problems applied to business, economics and engineering. Is to maximize or minimize a scalar field whose domain is given as a set of constraints given by equalities and/or inequalities not necessarily linear. In this paper we present a virtual laboratory to study the PNL graphically and numerically in the case of two variables [EN] La Programación No Lineal (PNL) constituye una herramienta de amp...

  7. QUASILINEAR ELLIPTIC BOUNDARY VALUE PROBLEMS WITH DISCONTINUOUS NONLINEARITIES

    Institute of Scientific and Technical Information of China (English)

    2000-01-01

    In this paper we shall consider a discontinuous nonlinear nonmonotone elliptic boundary value problem, i.e. a quasilinear elliptic hemivariational inequality. This kind of problems is strongly motivated by various problems in mechanics. By use of the notion of the generalized gradient of Clarke and the theory of pseudomonotone operators, we will prove the existence of solutions.

  8. Inverse Coefficient Problems for Nonlinear Elliptic Variational Inequalities

    Institute of Scientific and Technical Information of China (English)

    Run-sheng Yang; Yun-hua Ou

    2011-01-01

    This paper is devoted to a class of inverse coefficient problems for nonlinear elliptic variational inequalities. The unknown coefficient of elliptic variational inequalities depends on the gradient of the solution and belongs to a set of admissible coefficients. It is shown that the nonlinear elliptic variational inequalities is unique solvable for the given class of coefficients. The existence of quasisolutions of the inverse problems is obtained.

  9. Iterative regularization methods for nonlinear ill-posed problems

    CERN Document Server

    Scherzer, Otmar; Kaltenbacher, Barbara

    2008-01-01

    Nonlinear inverse problems appear in many applications, and typically they lead to mathematical models that are ill-posed, i.e., they are unstable under data perturbations. Those problems require a regularization, i.e., a special numerical treatment. This book presents regularization schemes which are based on iteration methods, e.g., nonlinear Landweber iteration, level set methods, multilevel methods and Newton type methods.

  10. Nonlinear eigenvalue problems with semipositone structure

    Directory of Open Access Journals (Sweden)

    Alfonso Castro

    2000-10-01

    Full Text Available In this paper we summarize the developments of semipositone problems to date, including very recent results on semipositone systems. We also discuss applications and open problems.

  11. Inverse Problems for Nonlinear Delay Systems

    Science.gov (United States)

    2011-03-15

    Ba82]. For nonlinear delay systems such as those discussed here, approximation in the context of a linear semigroup framework as presented [BBu1, BBu2...linear part generates a linear semigroup as in [BBu1, BBu2, BKap]. One then uses the linear semigroup in a vari- ation of parameters implicit...BBu2, BKap] (for the linear semigroup ) plus a Gronwall inequality. An alternative (and more general) approach given in [Ba82] eschews use of the Trotter

  12. Parabolic Perturbation of a Nonlinear Hyperbolic Problem Arising in Physiology

    Science.gov (United States)

    Colli, P.; Grasselli, M.

    We study a transport-diffusion initial value problem where the diffusion codlicient is "small" and the transport coefficient is a time function depending on the solution in a nonlinear and nonlocal way. We show the existence and the uniqueness of a weak solution of this problem. Moreover we discuss its asymptotic behaviour as the diffusion coefficient goes to zero, obtaining a well-posed first-order nonlinear hyperbolic problem. These problems arise from mathematical models of muscle contraction in the framework of the sliding filament theory.

  13. THIRD-ORDER NONLINEAR SINGULARLY PERTURBED BOUNDARY VALUE PROBLEM

    Institute of Scientific and Technical Information of China (English)

    王国灿; 金丽

    2002-01-01

    Third order singulary perturbed boundary value problem by means of differential inequality theories is studied. Based on the given results of second order nonlinear boundary value problem, the upper and lower solutions method of third order nonlinear boundary value problems by making use of Volterra type integral operator was established.Specific upper and lower solutions were constructed, and existence and asymptotic estimates of solutions under suitable conditions were obtained.The result shows that it seems to be new to apply these techniques to solving these kinds of third order singularly perturbed boundary value problem. An example is given to demonstrate the applications.

  14. Higher-order techniques for some problems of nonlinear control

    Directory of Open Access Journals (Sweden)

    Sarychev Andrey V.

    2002-01-01

    Full Text Available A natural first step when dealing with a nonlinear problem is an application of some version of linearization principle. This includes the well known linearization principles for controllability, observability and stability and also first-order optimality conditions such as Lagrange multipliers rule or Pontryagin's maximum principle. In many interesting and important problems of nonlinear control the linearization principle fails to provide a solution. In the present paper we provide some examples of how higher-order methods of differential geometric control theory can be used for the study nonlinear control systems in such cases. The presentation includes: nonlinear systems with impulsive and distribution-like inputs; second-order optimality conditions for bang–bang extremals of optimal control problems; methods of high-order averaging for studying stability and stabilization of time-variant control systems.

  15. A NONLINEAR TRANSFORMATION AND A BOUNDARY-INITIAL VALUE PROBLEM FOR ACLASS OF NONLINEAR CONVECTION-DIFFUSION EQUATIONS

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    With the aid of a nonlinear transformation, a class of nonlinear convectiondiffusion PDE in one space dimension is converted into a linear one, the unique solution of a nonlinear boundary-initial value problem for the nonlinear PDE can be exactly expressed by the nonlinear transformation, and several illustrative examples are given

  16. 96 International Conference on Nonlinear Programming

    CERN Document Server

    1998-01-01

    About 60 scientists and students attended the 96' International Conference on Nonlinear Programming, which was held September 2-5 at Institute of Compu­ tational Mathematics and Scientific/Engineering Computing (ICMSEC), Chi­ nese Academy of Sciences, Beijing, China. 25 participants were from outside China and 35 from China. The conference was to celebrate the 60's birthday of Professor M.J.D. Powell (Fellow of Royal Society, University of Cambridge) for his many contributions to nonlinear optimization. On behalf of the Chinese Academy of Sciences, vice president Professor Zhi­ hong Xu attended the opening ceremony of the conference to express his warm welcome to all the participants. After the opening ceremony, Professor M.J.D. Powell gave the keynote lecture "The use of band matrices for second derivative approximations in trust region methods". 13 other invited lectures on recent advances of nonlinear programming were given during the four day meeting: "Primal-dual methods for nonconvex optimization" by...

  17. Nonlinear Preserver Problems on B(H)

    Institute of Scientific and Technical Information of China (English)

    Jian Lian CUI

    2011-01-01

    Let H be a complex Hilbert space of dimension greater than 2, and B(H) denote the Banach algebra of all bounded linear operators on H. For A, B ∈ B(H), define the binary relation A ≤* B by A*A = A*B and AA* = AB*. Then (B(H), "≤*") is a partially ordered set and the relation "≤*" is called the star order on B(H). Denote by Bs(H) the set of all self-adjoint operators in B(H). In this paper, we first characterize nonlinear continuous bijective maps on Bs (H) which preserve the star order in both directions. We characterize also additive maps (or linear maps) on B(H) (or nest algebras) which are multiplicative at some invertible operator.

  18. 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.

  19. Variational approach to various nonlinear problems in geometry and physics

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    In this survey, we will summarize the existence results of nonlinear partial differential equations which arises from geometry or physics by using variational method. We use the method to study Kazdan-Warner problem, Chern-Simons-Higgs model, Toda systems, and the prescribed Q-curvature problem in 4-dimension.

  20. 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.

  1. A Hybrid Method for Nonlinear Least Squares Problems

    Institute of Scientific and Technical Information of China (English)

    Zhongyi Liu; Linping Sun

    2007-01-01

    A negative curvature method is applied to nonlinear least squares problems with indefinite Hessian approximation matrices. With the special structure of the method,a new switch is proposed to form a hybrid method. Numerical experiments show that this method is feasible and effective for zero-residual,small-residual and large-residual problems.

  2. 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.

  3. A One-parameter Filled Function Method for Nonlinear Integer Programming

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    This paper gives a new definition of the filled function for nonlinear integer programming problem. A filled function satisfying our definition is presented. This function contains only one parameter. The properties of the proposed filled function and the method using this filled function to solve nonlinear integer programming problem are also discussed. Numerical results indicate the efficiency and reliability of the proposed filled function algorithm.

  4. One-parameter quasi-filled function algorithm for nonlinear integer programming

    Institute of Scientific and Technical Information of China (English)

    SHANG You-lin; HAN Bo-shun

    2005-01-01

    A definition of the quasi-filled function for nonlinear integer programming problem is given in this paper. A quasi-filled function satisfying our definition is presented. This function contains only one parameter. The properties of the proposed quasi-filled function and the method using this quasi-filled function to solve nonlinear integer programming problem are also discussed in this paper. Numerical results indicated the efficiency and reliability of the proposed quasi-filled function algorithm.

  5. Multigrid Reduction in Time for Nonlinear Parabolic Problems

    Energy Technology Data Exchange (ETDEWEB)

    Falgout, R. D. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Manteuffel, T. A. [Univ. of Colorado, Boulder, CO (United States); O' Neill, B. [Univ. of Colorado, Boulder, CO (United States); Schroder, J. B. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

    2016-01-04

    The need for parallel-in-time is being driven by changes in computer architectures, where future speed-ups will be available through greater concurrency, but not faster clock speeds, which are stagnant.This leads to a bottleneck for sequential time marching schemes, because they lack parallelism in the time dimension. Multigrid Reduction in Time (MGRIT) is an iterative procedure that allows for temporal parallelism by utilizing multigrid reduction techniques and a multilevel hierarchy of coarse time grids. MGRIT has been shown to be effective for linear problems, with speedups of up to 50 times. The goal of this work is the efficient solution of nonlinear problems with MGRIT, where efficient is defined as achieving similar performance when compared to a corresponding linear problem. As our benchmark, we use the p-Laplacian, where p = 4 corresponds to a well-known nonlinear diffusion equation and p = 2 corresponds to our benchmark linear diffusion problem. When considering linear problems and implicit methods, the use of optimal spatial solvers such as spatial multigrid imply that the cost of one time step evaluation is fixed across temporal levels, which have a large variation in time step sizes. This is not the case for nonlinear problems, where the work required increases dramatically on coarser time grids, where relatively large time steps lead to worse conditioned nonlinear solves and increased nonlinear iteration counts per time step evaluation. This is the key difficulty explored by this paper. We show that by using a variety of strategies, most importantly, spatial coarsening and an alternate initial guess to the nonlinear time-step solver, we can reduce the work per time step evaluation over all temporal levels to a range similar with the corresponding linear problem. This allows for parallel scaling behavior comparable to the corresponding linear problem.

  6. 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.

  7. A reduced order model for nonlinear vibroacoustic problems

    Directory of Open Access Journals (Sweden)

    Ouisse Morvan

    2012-07-01

    Full Text Available This work is related to geometrical nonlinearities applied to thin plates coupled with fluid-filled domain. Model reduction is performed to reduce the computation time. Reduced order model (ROM is issued from the uncoupled linear problem and enriched with residues to describe the nonlinear behavior and coupling effects. To show the efficiency of the proposed method, numerical simulations in the case of an elastic plate closing an acoustic cavity are presented.

  8. Frozen Landweber Iteration for Nonlinear Ill-Posed Problems

    Institute of Scientific and Technical Information of China (English)

    J.Xu; B.Han; L.Li

    2007-01-01

    In this paper we propose a modification of the Landweber iteration termed frozen Landweber iteration for nonlinear ill-posed problems.A convergence analysis for this iteration is presented.The numerical performance of this frozen Landweber iteration for a nonlinear Hammerstein integral equation is compared with that of the Landweber iteration.We obtain a shorter running time of the frozen Landweber iteration based on the same convergence accuracy.

  9. Numerical Simulation of Two-dimensional Nonlinear Sloshing Problems

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    Numerical simulation of a two-dimensional nonlinearsloshing problem is preceded by the finite element method. Two theories are used. One is fully nonlinear theory; the other is time domain second order theory. A liquid sloshing in a rectangular container subjected to a horizontal excitation is simulated using these two theories. Numerical results are obtained and comparisons are made. It is found that a good agreement is obtained for the case of small amplitude oscillation. For the situation of large amplitude excitation, although the differences between using the two theories are obvious the second order solution can still exhibit typical nonlinear features of nonlinear wave.

  10. Inverse Coefficient Problems for Nonlinear Parabolic Differential Equations

    Institute of Scientific and Technical Information of China (English)

    Yun Hua OU; Alemdar HASANOV; Zhen Hai LIU

    2008-01-01

    This paper is devoted to a class of inverse problems for a nonlinear parabolic differential equation.The unknown coefficient of the equation depends on the gradient of the solution and belongs to a set of admissible coefficients.It is proved that the convergence of solutions for the corresponding direct problems continuously depends on the coefficient convergence.Based on this result the existence of a quasisolution of the inverse problem is obtained in the appropriate class of admissible coefficients.

  11. STEW A Nonlinear Data Modeling Computer Program

    CERN Document Server

    Chen, H

    2000-01-01

    A nonlinear data modeling computer program, STEW, employing the Levenberg-Marquardt algorithm, has been developed to model the experimental sup 2 sup 3 sup 9 Pu(n,f) and sup 2 sup 3 sup 5 U(n,f) cross sections. This report presents results of the modeling of the sup 2 sup 3 sup 9 Pu(n,f) and sup 2 sup 3 sup 5 U(n,f) cross-section data. The calculation of the fission transmission coefficient is based on the double-humped-fission-barrier model of Bjornholm and Lynn. Incident neutron energies of up to 5 MeV are considered.

  12. A New Approach to Solving Nonlinear Programming

    Institute of Scientific and Technical Information of China (English)

    SHEN Jie; CHEN Ling

    2002-01-01

    A method for solving nonlinear programming using genetic algorithm is presented. In the operations of crossover and mutation in each generation, to ensure the new solutions are all feasible, we present a method in which the bounds of every variable in the solution are estimated beforehand according to the constrained conditions. For the operation of mutation, we present two methods of cube bounding and variable bounding. The experimental results are given and analyzed. They show that the method is efficient and can obtain the results in less generation.

  13. STEW: A Nonlinear Data Modeling Computer Program

    Energy Technology Data Exchange (ETDEWEB)

    Chen, H.

    2000-03-04

    A nonlinear data modeling computer program, STEW, employing the Levenberg-Marquardt algorithm, has been developed to model the experimental {sup 239}Pu(n,f) and {sup 235}U(n,f) cross sections. This report presents results of the modeling of the {sup 239}Pu(n,f) and {sup 235}U(n,f) cross-section data. The calculation of the fission transmission coefficient is based on the double-humped-fission-barrier model of Bjornholm and Lynn. Incident neutron energies of up to 5 MeV are considered.

  14. Analysis of nonlinear channel friction inverse problem

    Institute of Scientific and Technical Information of China (English)

    CHENG Weiping; LIU Guohua

    2007-01-01

    Based on the Backus-Gilbert inverse theory, the singular value decomposition (SVD) for general inverse matrices and the optimization algorithm are used to solve the channel friction inverse problem. The resolution and covari- ance friction inverse model in matrix form is developed to examine the reliability of solutions. Theoretical analyses demonstrate that the convergence rate of the general Newton optimization algorithm is in the second-order. The Wiggins method is also incorporated into the algorithm. Using the method, noise can be suppressed effectively, and the results are close to accurate solutions with proper control parameters. Also, the numerical stability can be improved.

  15. A Smoothing Inexact Newton Method for Generalized Nonlinear Complementarity Problem

    Directory of Open Access Journals (Sweden)

    Meixia Li

    2012-01-01

    Full Text Available Based on the smoothing function of penalized Fischer-Burmeister NCP-function, we propose a new smoothing inexact Newton algorithm with non-monotone line search for solving the generalized nonlinear complementarity problem. We view the smoothing parameter as an independent variable. Under suitable conditions, we show that any accumulation point of the generated sequence is a solution of the generalized nonlinear complementarity problem. We also establish the local superlinear (quadratic convergence of the proposed algorithm under the BD-regular assumption. Preliminary numerical experiments indicate the feasibility and efficiency of the proposed algorithm.

  16. On the Cauchy problem for a doubly nonlinear degenerate parabolic equation with strongly nonlinear sources

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    In this article, we consider the existence of local and global solution to the Cauchy problem of a doubly nonlinear equation. By introducing the norms |||f|||h and h, we give the suffcient and necessary conditions on the initial value to the existence of local solution of doubly nonlinear equation. Moreover some results on the global existence and nonexistence of solutions are considered.

  17. 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$.

  18. Solution of Contact Problems for Nonlinear Gao Beam and Obstacle

    Directory of Open Access Journals (Sweden)

    J. Machalová

    2015-01-01

    Full Text Available Contact problem for a large deformed beam with an elastic obstacle is formulated, analyzed, and numerically solved. The beam model is governed by a nonlinear fourth-order differential equation developed by Gao, while the obstacle is considered as the elastic foundation of Winkler’s type in some distance under the beam. The problem is static without a friction and modeled either using Signorini conditions or by means of normal compliance contact conditions. The problems are then reformulated as optimal control problems which is useful both for theoretical aspects and for solution methods. Discretization is based on using the mixed finite element method with independent discretization and interpolations for foundation and beam elements. Numerical examples demonstrate usefulness of the presented solution method. Results for the nonlinear Gao beam are compared with results for the classical Euler-Bernoulli beam model.

  19. A Recurrent Neural Network for Nonlinear Fractional Programming

    Directory of Open Access Journals (Sweden)

    Quan-Ju Zhang

    2012-01-01

    Full Text Available This paper presents a novel recurrent time continuous neural network model which performs nonlinear fractional optimization subject to interval constraints on each of the optimization variables. The network is proved to be complete in the sense that the set of optima of the objective function to be minimized with interval constraints coincides with the set of equilibria of the neural network. It is also shown that the network is primal and globally convergent in the sense that its trajectory cannot escape from the feasible region and will converge to an exact optimal solution for any initial point being chosen in the feasible interval region. Simulation results are given to demonstrate further the global convergence and good performance of the proposing neural network for nonlinear fractional programming problems with interval constraints.

  20. INITIAL BOUNDARY VALUE PROBLEM FOR A DAMPED NONLINEAR HYPERBOLIC EQUATION

    Institute of Scientific and Technical Information of China (English)

    陈国旺

    2003-01-01

    In the paper, the existence and uniqueness of the generalized global solution and the classical global solution of the initial boundary value problems for the nonlinear hyperbolic equationare proved by Galerkin method and the sufficient conditions of blow-up of solution in finite time are given.

  1. Major open problems in chaos theory and nonlinear dynamics

    CERN Document Server

    Li, Y Charles

    2013-01-01

    Nowadays, chaos theory and nonlinear dynamics lack research focuses. Here we mention a few major open problems: 1. an effective description of chaos and turbulence, 2. rough dependence on initial data, 3. arrow of time, 4. the paradox of enrichment, 5. the paradox of pesticides, 6. the paradox of plankton.

  2. Linear iterative technique for solution of nonlinear thermal network problems

    Energy Technology Data Exchange (ETDEWEB)

    Seabourn, C.M.

    1976-11-01

    A method for rapid and accurate solution of linear and/or nonlinear thermal network problems is described. It is a matrix iterative process that converges for nodal temperatures and variations of thermal conductivity with temperature. The method is computer oriented and can be changed easily for design studies.

  3. A POSITIVE INTERIOR-POINT ALGORITHM FOR NONLINEAR COMPLEMENTARITY PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    马昌凤; 梁国平; 陈新美

    2003-01-01

    A new iterative method, which is called positive interior-point algorithm, is presented for solving the nonlinear complementarity problems. This method is of the desirable feature of robustness. And the convergence theorems of the algorithm is established. In addition, some numerical results are reported.

  4. Multiple solutions for inhomogeneous nonlinear elliptic problems arising in astrophyiscs

    Directory of Open Access Journals (Sweden)

    Marco Calahorrano

    2004-04-01

    Full Text Available Using variational methods we prove the existence and multiplicity of solutions for some nonlinear inhomogeneous elliptic problems on a bounded domain in $mathbb{R}^n$, with $ngeq 2$ and a smooth boundary, and when the domain is $mathbb{R}_+^n$

  5. Some problems on nonlinear hyperbolic equations and applications

    CERN Document Server

    Peng, YueJun

    2010-01-01

    This volume is composed of two parts: Mathematical and Numerical Analysis for Strongly Nonlinear Plasma Models and Exact Controllability and Observability for Quasilinear Hyperbolic Systems and Applications. It presents recent progress and results obtained in the domains related to both subjects without attaching much importance to the details of proofs but rather to difficulties encountered, to open problems and possible ways to be exploited. It will be very useful for promoting further study on some important problems in the future.

  6. Adomian decomposition method for nonlinear Sturm-Liouville problems

    Directory of Open Access Journals (Sweden)

    Sennur Somali

    2007-09-01

    Full Text Available In this paper the Adomian decomposition method is applied to the nonlinear Sturm-Liouville problem-y" + y(tp=λy(t, y(t > 0, t ∈ I = (0, 1, y(0 = y(1 = 0, where p > 1 is a constant and λ > 0 is an eigenvalue parameter. Also, the eigenvalues and the behavior of eigenfuctions of the problem are demonstrated.

  7. 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...

  8. Mathematical programming methods for large-scale topology optimization problems

    DEFF Research Database (Denmark)

    Rojas Labanda, Susana

    , and at the same time, reduce the number of function evaluations. Nonlinear optimization methods, such as sequential quadratic programming and interior point solvers, have almost not been embraced by the topology optimization community. Thus, this work is focused on the introduction of this kind of second......This thesis investigates new optimization methods for structural topology optimization problems. The aim of topology optimization is finding the optimal design of a structure. The physical problem is modelled as a nonlinear optimization problem. This powerful tool was initially developed...... for the classical minimum compliance problem. Two of the state-of-the-art optimization algorithms are investigated and implemented for this structural topology optimization problem. A Sequential Quadratic Programming (TopSQP) and an interior point method (TopIP) are developed exploiting the specific mathematical...

  9. Iterative total variation schemes for nonlinear inverse problems

    Science.gov (United States)

    Bachmayr, Markus; Burger, Martin

    2009-10-01

    In this paper we discuss the construction, analysis and implementation of iterative schemes for the solution of inverse problems based on total variation regularization. Via different approximations of the nonlinearity we derive three different schemes resembling three well-known methods for nonlinear inverse problems in Hilbert spaces, namely iterated Tikhonov, Levenberg-Marquardt and Landweber. These methods can be set up such that all arising subproblems are convex optimization problems, analogous to those appearing in image denoising or deblurring. We provide a detailed convergence analysis and appropriate stopping rules in the presence of data noise. Moreover, we discuss the implementation of the schemes and the application to distributed parameter estimation in elliptic partial differential equations.

  10. Microscopic structures from reduction of continuum nonlinear problems

    CERN Document Server

    Lovison, Alberto

    2011-01-01

    We present an application of the Amann-Zehnder exact finite reduction to a class of nonlinear perturbations of elliptic elasto-static problems. We propose the existence of minmax solutions by applying Ljusternik-Schnirelmann theory to a finite dimensional variational formulation of the problem, based on a suitable spectral cut-off. As a by-product, with a choice of fit variables, we establish a variational equivalence between the above spectral finite description and a discrete mechanical model. By doing so, we decrypt the abstract information encoded in the AZ reduction and give rise to a concrete and finite description of the continuous problem.

  11. Numerical solution of control problems governed by nonlinear differential equations

    Energy Technology Data Exchange (ETDEWEB)

    Heinkenschloss, M. [Virginia Polytechnic Institute and State Univ., Blacksburg, VA (United States)

    1994-12-31

    In this presentation the author investigates an iterative method for the solution of optimal control problems. These problems are formulated as constrained optimization problems with constraints arising from the state equation and in the form of bound constraints on the control. The method for the solution of these problems uses the special structure of the problem arising from the bound constraint and the state equation. It is derived from SQP methods and projected Newton methods and combines the advantages of both methods. The bound constraint is satisfied by all iterates using a projection, the nonlinear state equation is satisfied in the limit. Only a linearized state equation has to be solved in every iteration. The solution of the linearized problems are done using multilevel methods and GMRES.

  12. An Approximate Algorithm for a Class of Nonlinear Bilevel Integer Programming

    Institute of Scientific and Technical Information of China (English)

    LI Lei; TENG Chun-xian; TIAN Guang-yue

    2002-01-01

    The algorithm for a class of nonlinear bilevel integer programming is discussed in this paper. It is based on the theory and algorithm for nonlinear integer programming. The continuity methods for integer programming are studied in this paper. After simulated annealing algorithm is applied to the upper-level programming problem and the thought of filled function method for continuous global optimization is applied to the corresponding lower-level programming, an approximate algorithm is established. The satisfactory algorithm is elaborated in the following example.

  13. A monomial chaos approach for efficient uncertainty quantification on nonlinear problems

    NARCIS (Netherlands)

    Witteveen, J.A.S.; Bijl, H.

    2008-01-01

    A monomial chaos approach is presented for efficient uncertainty quantification in nonlinear computational problems. Propagating uncertainty through nonlinear equations can be computationally intensive for existing uncertainty quantification methods. It usually results in a set of nonlinear equation

  14. A monomial chaos approach for efficient uncertainty quantification on nonlinear problems

    NARCIS (Netherlands)

    Witteveen, J.A.S.; Bijl, H.

    2008-01-01

    A monomial chaos approach is presented for efficient uncertainty quantification in nonlinear computational problems. Propagating uncertainty through nonlinear equations can be computationally intensive for existing uncertainty quantification methods. It usually results in a set of nonlinear

  15. Galerkin approximation for inverse problems for nonautonomous nonlinear distributed systems

    Science.gov (United States)

    Banks, H. T.; Reich, Simeon; Rosen, I. G.

    1988-01-01

    An abstract framework and convergence theory is developed for Galerkin approximation for inverse problems involving the identification of nonautonomous nonlinear distributed parameter systems. A set of relatively easily verified conditions is provided which are sufficient to guarantee the existence of optimal solutions and their approximation by a sequence of solutions to a sequence of approximating finite dimensional identification problems. The approach is based on the theory of monotone operators in Banach spaces and is applicable to a reasonably broad class of nonlinear distributed systems. Operator theoretic and variational techniques are used to establish a fundamental convergence result. An example involving evolution systems with dynamics described by nonstationary quasilinear elliptic operators along with some applications are presented and discussed.

  16. Lectures on nonlinear evolution equations initial value problems

    CERN Document Server

    Racke, Reinhard

    2015-01-01

    This book mainly serves as an elementary, self-contained introduction to several important aspects of the theory of global solutions to initial value problems for nonlinear evolution equations. The book employs the classical method of continuation of local solutions with the help of a priori estimates obtained for small data. The existence and uniqueness of small, smooth solutions that are defined for all values of the time parameter are investigated. Moreover, the asymptotic behavior of the solutions is described as time tends to infinity. The methods for nonlinear wave equations are discussed in detail. Other examples include the equations of elasticity, heat equations, the equations of thermoelasticity, Schrödinger equations, Klein-Gordon equations, Maxwell equations and plate equations. To emphasize the importance of studying the conditions under which small data problems offer global solutions, some blow-up results are briefly described. Moreover, the prospects for corresponding initial-boundary value p...

  17. Sparse Variational Bayesian Approximations for Nonlinear Inverse Problems: applications in nonlinear elastography

    CERN Document Server

    Franck, I M

    2014-01-01

    This paper presents an efficient Bayesian framework for solving nonlinear, high-dimensional model calibration problems. It is based on Variational Bayesian formulation that aims at approximating the exact posterior by means of solving an optimization problem in an appropriately selected family of distributions. The goal is two-fold. Firstly, to find lower-dimensional representations of the unknown parameter vector that capture as much as possible of the associated posterior density, and secondly to enable the computation of the approximate posterior density with as few forward calls as possible. We discuss how these objectives can be achieved by using a fully Bayesian argumentation and employing the marginal likelihood or evidence as the ultimate model validation metric for any proposed dimensionality reduction. We demonstrate the performance of the proposed methodology to problems in nonlinear elastography where the identification of the mechanical properties of biological materials can inform non-invasive, ...

  18. On a mixed problem for a coupled nonlinear system

    Directory of Open Access Journals (Sweden)

    Marcondes R. Clark

    1997-03-01

    Full Text Available In this article we prove the existence and uniqueness of solutions to the mixed problem associated with the nonlinear system $$ u_{tt}-M(int_Omega |abla u|^2dxDelta u+|u|^ ho u+heta =f $$ $$ heta _t -Delta heta +u_{t}=g $$ where $M$ is a positive real function, and $f$ and $g$ are known real functions.

  19. On Nonlinear Approximations to Cosmic Problems with Mixed Boundary Conditions

    OpenAIRE

    Mancinelli, Paul J.; Yahil, Amos; Ganon, Galit; Dekel, Avishai

    1993-01-01

    Nonlinear approximations to problems with mixed boundary conditions are useful for predicting large-scale streaming velocities from the density field, or vice-versa. We evaluate the schemes of Bernardeau \\cite{bernardeau92}, Gramann \\cite{gramann93}, and Nusser \\etal \\cite{nusser91}, using smoothed density and velocity fields obtained from $N$-body simulations of a CDM universe. The approximation of Nusser \\etal is overall the most accurate and robust. For Gaussian smoothing of 1000\\kms\\ the ...

  20. Application of homotopy analysis method for solving nonlinear Cauchy problem

    Directory of Open Access Journals (Sweden)

    V.G. Gupta

    2012-11-01

    Full Text Available In this paper, by means of the homotopy analysis method (HAM, the solutions of some nonlinear Cauchy problem of parabolic-hyperbolic type are exactly obtained in the form of convergent Taylor series. The HAM contains the auxiliary parameter \\hbar that provides a convenient way of controlling the convergent region of series solutions. This analytical method is employed to solve linear examples to obtain the exact solutions. The results reveal that the proposed method is very effective and simple.

  1. Properties of positive solutions to a nonlinear parabolic problem

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    This paper deals with the properties of positive solutions to a quasilinear parabolic equation with the nonlinear absorption and the boundary flux. The necessary and sufficient conditions on the global existence of solutions are described in terms of different parameters appearing in this problem. Moreover, by a result of Chasseign and Vazquez and the comparison principle, we deduce that the blow-up occurs only on the boundary (?)Ω. In addition, for a bounded Lipschitz domainΩ, we establish the blow-up rate estimates for the positive solution to this problem with a= 0.

  2. Inverse problem for multi-body interaction of nonlinear waves

    CERN Document Server

    Marruzzo, Alessia; Antenucci, Fabrizio; Pagnani, Andrea; Leuzzi, Luca

    2016-01-01

    The inverse problem is studied in multi-body systems with nonlinear dynamics representing, e.g., phase-locked wave systems, standard multimode and random lasers. Using a general model for four-body interacting complex-valued variables we test two methods based on pseudolikelihood, respectively with regularization and with decimation, to determine the coupling constants from sets of measured configurations. We test statistical inference predictions for increasing number of sampled configurations and for an externally tunable {\\em temperature}-like parameter mimicing real data noise and helping minimization procedures. Analyzed models with phasors and rotors are generalizations of problems of real-valued spherical problems (e.g., density fluctuations), discrete spins (Ising and vectorial Potts) or finite number of states (standard Potts): inference methods presented here can, then, be straightforward applied to a large class of inverse problems.

  3. Numerical techniques for solving nonlinear instability problems in smokeless tactical solid rocket motors. [finite difference technique

    Science.gov (United States)

    Baum, J. D.; Levine, J. N.

    1980-01-01

    The selection of a satisfactory numerical method for calculating the propagation of steep fronted shock life waveforms in a solid rocket motor combustion chamber is discussed. A number of different numerical schemes were evaluated by comparing the results obtained for three problems: the shock tube problems; the linear wave equation, and nonlinear wave propagation in a closed tube. The most promising method--a combination of the Lax-Wendroff, Hybrid and Artificial Compression techniques, was incorporated into an existing nonlinear instability program. The capability of the modified program to treat steep fronted wave instabilities in low smoke tactical motors was verified by solving a number of motor test cases with disturbance amplitudes as high as 80% of the mean pressure.

  4. 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.

  5. C-L METHOD AND ITS APPLICATION TO ENGINEERING NONLINEAR DYNAMICAL PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    陈予恕; 丁千

    2001-01-01

    The C-L method was generalized from Liapunov-Schmidt reduction method,combined with theory of singularities, for study of non-autonomous dynamical systems to obtain the typical bifurcating response curves in the system parameter spaces. This method has been used , as an example, to analyze the engineering nonlinear dynamical problems by obtaining the bifurcation programs and response curves which are useful in developing tech niques of control to subharmonic instability of large rotating machinery.

  6. 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

  7. Extensions to the Multilevel Programming Problem

    Science.gov (United States)

    1988-05-01

    READS IN A 0-1 BILEVEL PROGRAMMING C PROBLEM (BLPP) AND CREATES THE MATHEMATICAL C PROGRAMMING PROBLEM WHICH CAN BE SOLVED TO FIND C THE SOLUTION OF THE...CODES DEVELOPED BY DR. PAUL A. JENSEN. C IT IS USED TO SOLVE THE 0-1 INTEGER PROGRAMMING C PROBLEM DERIVED FROM THE 0-1 BLPP. C IMPLICIT INTEGER (A-Z...233 PROGRAM BLPPRD C C *****PURPOSE C THIS PROGRAM READS IN A BILEVEL PROGRAMMING C PROBLEM (BLPP) OR A MIXED INTEGER BLPP AND CREATES C THE

  8. The relative degree enhancement problem for MIMO nonlinear systems

    Energy Technology Data Exchange (ETDEWEB)

    Schoenwald, D.A. [Oak Ridge National Lab., TN (United States); Oezguener, Ue. [Ohio State Univ., Columbus, OH (United States). Dept. of Electrical Engineering

    1995-07-01

    The authors present a result for linearizing a nonlinear MIMO system by employing partial feedback - feedback at all but one input-output channel such that the SISO feedback linearization problem is solvable at the remaining input-output channel. The partial feedback effectively enhances the relative degree at the open input-output channel provided the feedback functions are chosen to satisfy relative degree requirements. The method is useful for nonlinear systems that are not feedback linearizable in a MIMO sense. Several examples are presented to show how these feedback functions can be computed. This strategy can be combined with decentralized observers for a completely decentralized feedback linearization result for at least one input-output channel.

  9. Lavrentiev regularization method for nonlinear ill-posed problems

    CERN Document Server

    Kinh, N V

    2002-01-01

    In this paper we shall be concerned with Lavientiev regularization method to reconstruct solutions x sub 0 of non ill-posed problems F(x)=y sub o , where instead of y sub 0 noisy data y subdelta is an element of X with absolut(y subdelta-y sub 0) X is an accretive nonlinear operator from a real reflexive Banach space X into itself. In this regularization method solutions x subalpha supdelta are obtained by solving the singularly perturbed nonlinear operator equation F(x)+alpha(x-x*)=y subdelta with some initial guess x*. Assuming certain conditions concerning the operator F and the smoothness of the element x*-x sub 0 we derive stability estimates which show that the accuracy of the regularized solutions is order optimal provided that the regularization parameter alpha has been chosen properly.

  10. Jacobi elliptic functions: A review of nonlinear oscillatory application problems

    Science.gov (United States)

    Kovacic, Ivana; Cveticanin, Livija; Zukovic, Miodrag; Rakaric, Zvonko

    2016-10-01

    This review paper is concerned with the applications of Jacobi elliptic functions to nonlinear oscillators whose restoring force has a monomial or binomial form that involves cubic and/or quadratic nonlinearity. First, geometric interpretations of three basic Jacobi elliptic functions are given and their characteristics are discussed. It is shown then how their different forms can be utilized to express exact solutions for the response of certain free conservative oscillators. These forms are subsequently used as a starting point for a presentation of different quantitative techniques for obtaining an approximate response for free perturbed nonlinear oscillators. An illustrative example is provided. Further, two types of externally forced nonlinear oscillators are reviewed: (i) those that are excited by elliptic-type excitations with different exact and approximate solutions; (ii) those that are damped and excited by harmonic excitations, but their approximate response is expressed in terms of Jacobi elliptic functions. Characteristics of the steady-state response are discussed and certain qualitative differences with respect to the classical Duffing oscillator excited harmonically are pointed out. Parametric oscillations of the oscillators excited by an elliptic-type forcing are considered as well, and the differences with respect to the stability chart of the classical Mathieu equation are emphasized. The adjustment of the Melnikov method to derive the general condition for the onset of homoclinic bifurcations in a system parametrically excited by an elliptic-type forcing is provided and compared with those corresponding to harmonic excitations. Advantages and disadvantages of the use of Jacobi elliptic functions in nonlinear oscillatory application problems are discussed and some suggestions for future work are given.

  11. Two-parameters quasi-filled function algorithm for nonlinear integer programming

    Institute of Scientific and Technical Information of China (English)

    WANG Wei-xiang; SHANG You-lin; ZHANG Lian-sheng

    2006-01-01

    A quasi-filled function for nonlinear integer programming problem is given in this paper. This function contains two parameters which are easily to be chosen. Theoretical properties of the proposed quasi-filled function are investigated. Moreover,we also propose a new solution algorithm using this quasi-filled function to solve nonlinear integer programming problem in this paper. The examples with 2 to 6 variables are tested and computational results indicated the efficiency and reliability of the proposed quasi-filled function algorithm.

  12. Geometric Programming Approach to an Interactive Fuzzy Inventory Problem

    Directory of Open Access Journals (Sweden)

    Nirmal Kumar Mandal

    2011-01-01

    Full Text Available An interactive multiobjective fuzzy inventory problem with two resource constraints is presented in this paper. The cost parameters and index parameters, the storage space, the budgetary cost, and the objective and constraint goals are imprecise in nature. These parameters and objective goals are quantified by linear/nonlinear membership functions. A compromise solution is obtained by geometric programming method. If the decision maker is not satisfied with this result, he/she may try to update the current solution to his/her satisfactory solution. In this way we implement man-machine interactive procedure to solve the problem through geometric programming method.

  13. 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.

  14. Application of genetic algorithms in nonlinear heat conduction problems.

    Science.gov (United States)

    Kadri, Muhammad Bilal; Khan, Waqar A

    2014-01-01

    Genetic algorithms are employed to optimize dimensionless temperature in nonlinear heat conduction problems. Three common geometries are selected for the analysis and the concept of minimum entropy generation is used to determine the optimum temperatures under the same constraints. The thermal conductivity is assumed to vary linearly with temperature while internal heat generation is assumed to be uniform. The dimensionless governing equations are obtained for each selected geometry and the dimensionless temperature distributions are obtained using MATLAB. It is observed that GA gives the minimum dimensionless temperature in each selected geometry.

  15. Nonlinear triple-point problems on time scales

    Directory of Open Access Journals (Sweden)

    Douglas R. Anderson

    2004-04-01

    Full Text Available We establish the existence of multiple positive solutions to the nonlinear second-order triple-point boundary-value problem on time scales, $$displaylines{ u^{Delta abla}(t+h(tf(t,u(t=0, cr u(a=alpha u(b+delta u^Delta(a,quad eta u(c+gamma u^Delta(c=0 }$$ for $tin[a,c]subsetmathbb{T}$, where $mathbb{T}$ is a time scale, $eta, gamma, deltage 0$ with $Beta+gamma>0$, $0

  16. Basis properties of eigenfunctions of nonlinear Sturm-Liouville problems

    OpenAIRE

    Peter E. Zhidkov

    2000-01-01

    We consider three nonlinear eigenvalue problems that consist of $$-y''+f(y^2)y=lambda y$$ with one of the following boundary conditions: $$displaylines{ y(0)=y(1)=0 quad y'(0)=p ,,cr y'(0)=y(1)=0 quad y(0)=p,, cr y'(0)=y'(1)=0 quad y(0)=p,, }$$ where $p$ is a positive constant. Under smoothness and monotonicity conditions on $f$, we show the existence and uniqueness of a sequence of eigenvalues ${lambda _n}$ and corresponding eigenfunctions ${y_n}$ such that $y_n(x)$ has precisely $n$ roots i...

  17. Computer-aided analysis of nonlinear problems in transport phenomena

    Science.gov (United States)

    Brown, R. A.; Scriven, L. E.; Silliman, W. J.

    1980-01-01

    The paper describes algorithms for equilibrium and steady-state problems with coefficients in the expansions derived by the Galerkin weighted residual method and calculated from the resulting sets of nonlinear algebraic equations by the Newton-Raphson method. Initial approximations are obtained from nearby solutions by continuation techniques as parameters are varied. The Newton-Raphson technique is preferred because the Jacobian of the solution is useful for continuation, for analyzing the stability of solutions, for detecting bifurcation of solution families, and for computing asymptotic estimates of the effects on any solution of small changes in parameters, boundary conditions, and boundary shape.

  18. On filter-successive linearization methods for nonlinear semidefinite programming

    Institute of Scientific and Technical Information of China (English)

    2009-01-01

    In this paper we present a filter-successive linearization method with trust region for solutions of nonlinear semidefinite programming. Such a method is based on the concept of filter for nonlinear programming introduced by Fletcher and Leyffer in 2002. We describe the new algorithm and prove its global convergence under weaker assumptions. Some numerical results are reported and show that the new method is potentially effcient.

  19. On filter-successive linearization methods for nonlinear semidefinite programming

    Institute of Scientific and Technical Information of China (English)

    LI ChengJin; SUN WenYui

    2009-01-01

    In this paper we present a filter-successive linearization method with trust region for solutions of nonlinear semidefinite programming. Such a method is based on the concept of filter for nonlinear programming introduced by Fletcher and Leyffer in 2002. We describe the new algorithm and prove its global convergence under weaker assumptions. Some numerical results are reported and show that the new method is potentially efficient.

  20. Measurement problem in PROGRAM UNIVERSE

    Energy Technology Data Exchange (ETDEWEB)

    Noyes, H.P.; Gefwert, C.

    1984-12-01

    We present a discrete theory that meets the measurement problem in a new way. We generate a growing universe of bit strings, labeled by 2/sup 127/ + 136 strings organized by some representation of the closed, four level, combinatorial hierarchy, of bit-length N/sub 139/ greater than or equal to 139. The rest of the strings for each label, which grow in both length and number, are called addresses. The generating algorithm, called PROGRAM UNIVERSE, starts from a random choice between the two symbols ''0'' and ''1'' and grows (a) by discriminating between two randomly chosen strings and adjoining a novel result to the universe, or when the string so generated is not novel, by (b) adjoining a randomly chosen bit at the growing end of each string. We obtain, by appropriate definitions and interpretations, stable ''particles'' which satisfy the usual relativistic kinematics and quantized angular momentum without being localizable in a continuum space-time. The labeling scheme is congruent with the ''standard model'' of quarks and leptons with three generations, but for the problem at hand, the implementation of this aspect of the theory is unimportant. What matters most is that (a) these complicated ''particles'' have the periodicities familiar from relativistic ''deBroglie waves'' and resolve in a discrete way the ''wave-particle dualism'' and (b) can be ''touched'' by our discrete equivalent of ''soft photons'' in such a way as to follow, macroscopically, the usual Rutherford scattering trajectories with the associated bound states. Thus our theory could provide a discrete description of ''measurement'' in a way that allows no conceptual barrier between the ''micro'' and the ''macro'' worlds, if we are willing to base our physics on

  1. Approximation on computing partial sum of nonlinear differential eigenvalue problems

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    In computing the electronic structure and energy band in a system of multi-particles, quite a large number of problems are referred to the acquisition of obtaining the partial sum of densities and energies using the “first principle”. In the conventional method, the so-called self-consistency approach is limited to a small scale because of high computing complexity. In this paper, the problem of computing the partial sum for a class of nonlinear differential eigenvalue equations is changed into the constrained functional minimization. By space decomposition and perturbation method, a secondary approximating formula for the minimal is provided. It is shown that this formula is more precise and its quantity of computation can be reduced significantly

  2. SOLUTION OF NONLINEAR PROBLEMS IN WATER RESOURCES SYSTEMS BY GENETIC ALGORITHM

    Directory of Open Access Journals (Sweden)

    Ahmet BAYLAR

    1998-03-01

    Full Text Available Genetic Algorithm methodology is a genetic process treated on computer which is considering evolution process in the nature. The genetic operations takes place within the chromosomes stored in computer memory. By means of various operators, the genetic knowledge in chromosomes change continuously and success of the community progressively increases as a result of these operations. The primary purpose of this study is calculation of nonlinear programming problems in water resources systems by Genetic Algorithm. For this purpose a Genetic Algoritm based optimization program were developed. It can be concluded that the results obtained from the genetic search based method give the precise results.

  3. On the linear properties of the nonlinear radiative transfer problem

    Science.gov (United States)

    Pikichyan, H. V.

    2016-11-01

    In this report, we further expose the assertions made in nonlinear problem of reflection/transmission of radiation from a scattering/absorbing one-dimensional anisotropic medium of finite geometrical thickness, when both of its boundaries are illuminated by intense monochromatic radiative beams. The new conceptual element of well-defined, so-called, linear images is noteworthy. They admit a probabilistic interpretation. In the framework of nonlinear problem of reflection/transmission of radiation, we derive solution which is similar to linear case. That is, the solution is reduced to the linear combination of linear images. By virtue of the physical meaning, these functions describe the reflectivity and transmittance of the medium for a single photon or their beam of unit intensity, incident on one of the boundaries of the layer. Thereby the medium in real regime is still under the bilateral illumination by external exciting radiation of arbitrary intensity. To determine the linear images, we exploit three well known methods of (i) adding of layers, (ii) its limiting form, described by differential equations of invariant imbedding, and (iii) a transition to the, so-called, functional equations of the "Ambartsumyan's complete invariance".

  4. Boundary-Value Problems for Weakly Nonlinear Delay Differential Systems

    Directory of Open Access Journals (Sweden)

    A. Boichuk

    2011-01-01

    Full Text Available Conditions are derived of the existence of solutions of nonlinear boundary-value problems for systems of n ordinary differential equations with constant coefficients and single delay (in the linear part and with a finite number of measurable delays of argument in nonlinearity: ż(t=Az(t-τ+g(t+εZ(z(hi(t,t,ε,  t∈[a,b], assuming that these solutions satisfy the initial and boundary conditions z(s:=ψ(s if s∉[a,b],  lz(⋅=α∈Rm. The use of a delayed matrix exponential and a method of pseudoinverse by Moore-Penrose matrices led to an explicit and analytical form of sufficient conditions for the existence of solutions in a given space and, moreover, to the construction of an iterative process for finding the solutions of such problems in a general case when the number of boundary conditions (defined by a linear vector functional l does not coincide with the number of unknowns in the differential system with a single delay.

  5. Approximating electrical distribution networks via mixed-integer nonlinear programming

    Energy Technology Data Exchange (ETDEWEB)

    Lakhera, Sanyogita [Citibank, New York City, NY (United States); Shanbhag, Uday V. [Department of Industrial and Enterprise Systems Engineering at the University of Illinois at Urbana-Champaign, 117 Transportation Building, 104 S. Mathews Ave., Urbana, IL 61801 (United States); McInerney, Michael K. [Construction Engineering Research Laboratory (CERL) (United States)

    2011-02-15

    Given urban data derived from a geographical information system (GIS), we consider the problem of constructing an estimate of the electrical distribution system of an urban area. We employ the image data to obtain an approximate electrical load distribution over a network of a prespecificed discretization. Together with partial information about existing substations, we determine the optimal placement of electrical substations to sustain such a load that minimizes the cost of capital and losses. This requires solving large-scale quadratic programs with discrete variables for which we present a novel penalization-smoothing scheme. The choice of locations allows one to determine the optimal flows in this network, as required by physical requirements which provide us with an approximation of the distribution network. Furthermore, the scheme allows for approximating systems in the presence of no-go areas, such as lakes and fields. We examine the performance of our algorithm on the solution of a set of location problems and observe that the scheme is capable of solving large-scale instances, well beyond the realm of existing mixed-integer nonlinear programming solvers. We conclude with a case study in which a stage-wise extension of this scheme is developed to reflect the temporal evolution of load. (author)

  6. Nonlinear Multidimensional Assignment Problems Efficient Conic Optimization Methods and Applications

    Science.gov (United States)

    2015-06-24

    CONTRACT NUMBER 5b. GRANT NUMBER FA9550-12-1-0153 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S) Mittelmann, Hans D 5d. PROJECT NUMBER 5e. TASK NUMBER 5f...problems. The size 16 three-dimensional quadratic assignment problem Q3AP from wireless communications was solved using a sophisticated approach...placement of the sensors. However, available MINLP solvers are not sufficiently effective, even in the convex case, and a hybrid Benders

  7. Application of HPEM to investigate the response and stability of nonlinear problems in vibration

    DEFF Research Database (Denmark)

    Mohammadi, M.H.; Mohammadi, A.; Kimiaeifar, A.;

    2010-01-01

    In this work, a powerful analytical method, called He's Parameter Expanding Methods (HPEM) is used to obtain the exact solution of nonlinear problems in nonlinear vibration. In this work, the governing equation is obtained by using Lagrange method, then the nonlinear governing equation is solved...... and convenient for solving these problems....

  8. An inverse problem of determining a nonlinear term in an ordinary differential equation

    OpenAIRE

    Kamimura, Yutaka

    1998-01-01

    An inverse problem for a nonlinear ordinary differential equation is discussed. We prove an existence theorem of a nonlinear term with which a boundary value problem admits a solution. This is an improvement of earlier work by A. Lorenzi. We also prove a uniqueness theorem of the nonlinear term.

  9. Nonlinear Preconditioning and its Application in Multicomponent Problems

    KAUST Repository

    Liu, Lulu

    2015-12-07

    The Multiplicative Schwarz Preconditioned Inexact Newton (MSPIN) algorithm is presented as a complement to Additive Schwarz Preconditioned Inexact Newton (ASPIN). At an algebraic level, ASPIN and MSPIN are variants of the same strategy to improve the convergence of systems with unbalanced nonlinearities; however, they have natural complementarity in practice. MSPIN is naturally based on partitioning of degrees of freedom in a nonlinear PDE system by field type rather than by subdomain, where a modest factor of concurrency can be sacrificed for physically motivated convergence robustness. ASPIN, originally introduced for decompositions into subdomains, is natural for high concurrency and reduction of global synchronization. The ASPIN framework, as an option for the outermost solver, successfully handles strong nonlinearities in computational fluid dynamics, but is barely explored for the highly nonlinear models of complex multiphase flow with capillarity, heterogeneity, and complex geometry. In this dissertation, the fully implicit ASPIN method is demonstrated for a finite volume discretization based on incompressible two-phase reservoir simulators in the presence of capillary forces and gravity. Numerical experiments show that the number of global nonlinear iterations is not only scalable with respect to the number of processors, but also significantly reduced compared with the standard inexact Newton method with a backtracking technique. Moreover, the ASPIN method, in contrast with the IMPES method, saves overall execution time because of the savings in timestep size. We consider the additive and multiplicative types of inexact Newton algorithms in the field-split context, and we augment the classical convergence theory of ASPIN for the multiplicative case. Moreover, we provide the convergence analysis of the MSPIN algorithm. Under suitable assumptions, it is shown that MSPIN is locally convergent, and desired superlinear or even quadratic convergence can be

  10. Nonlinear programming strategies for source detection of municipal water networks.

    Energy Technology Data Exchange (ETDEWEB)

    van Bloemen Waanders, Bart Gustaaf; Biegler, Lorenz T. (Carnegie Mellon University, Pittsburgh, PA); Bartlett, Roscoe Ainsworth; Laird, Carl Damon (Carnegie Mellon University, Pittsburgh, PA)

    2003-01-01

    Increasing concerns for the security of the national infrastructure have led to a growing need for improved management and control of municipal water networks. To deal with this issue, optimization offers a general and extremely effective method to identify (possibly harmful) disturbances, assess the current state of the network, and determine operating decisions that meet network requirements and lead to optimal performance. This paper details an optimization strategy for the identification of source disturbances in the network. Here we consider the source inversion problem modeled as a nonlinear programming problem. Dynamic behavior of municipal water networks is simulated using EPANET. This approach allows for a widely accepted, general purpose user interface. For the source inversion problem, flows and concentrations of the network will be reconciled and unknown sources will be determined at network nodes. Moreover, intrusive optimization and sensitivity analysis techniques are identified to assess the influence of various parameters and models in the network in a computational efficient manner. A number of numerical comparisons are made to demonstrate the effectiveness of various optimization approaches.

  11. 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.

  12. Inverse problem for multi-body interaction of nonlinear waves.

    Science.gov (United States)

    Marruzzo, Alessia; Tyagi, Payal; Antenucci, Fabrizio; Pagnani, Andrea; Leuzzi, Luca

    2017-06-14

    The inverse problem is studied in multi-body systems with nonlinear dynamics representing, e.g., phase-locked wave systems, standard multimode and random lasers. Using a general model for four-body interacting complex-valued variables we test two methods based on pseudolikelihood, respectively with regularization and with decimation, to determine the coupling constants from sets of measured configurations. We test statistical inference predictions for increasing number of sampled configurations and for an externally tunable temperature-like parameter mimicing real data noise and helping minimization procedures. Analyzed models with phasors and rotors are generalizations of problems of real-valued spherical problems (e.g., density fluctuations), discrete spins (Ising and vectorial Potts) or finite number of states (standard Potts): inference methods presented here can, then, be straightforward applied to a large class of inverse problems. The high versatility of the exposed techniques also concerns the number of expected interactions: results are presented for different graph topologies, ranging from sparse to dense graphs.

  13. Fault detection for nonlinear systems - A standard problem approach

    DEFF Research Database (Denmark)

    Stoustrup, Jakob; Niemann, Hans Henrik

    1998-01-01

    The paper describes a general method for designing (nonlinear) fault detection and isolation (FDI) systems for nonlinear processes. For a rich class of nonlinear systems, a nonlinear FDI system can be designed using convex optimization procedures. The proposed method is a natural extension...

  14. SINGULAR LIMIT SOLUTIONS FOR TWO-DIMENSIONAL ELLIPTIC PROBLEMS WITH EXPONENTIALLY DOMINATED NONLINEARITY

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    The authors consider the existence of singular limit solutions for a family of nonlinear elliptic problems with exponentially dominated nonlinearity and Dirichlet boundary condition and generalize the results of [3].

  15. A Hierarchy of New Nonlinear Evolution Equations Associated with a 3 × 3 Matrix Spectral Problem

    Institute of Scientific and Technical Information of China (English)

    GENG Xian-Guo; LI Fang

    2009-01-01

    A 3 × 3 matrix spectral problem with three potentials and the corresponding hierarchy of new nonlinear evolution equations are proposed. Generalized Hamiltonian structures for the hierarchy of nonlinear evolution equations are derived with the aid of trace identity.

  16. Ultimate limit state design of sheet pile walls by finite elements and nonlinear programming

    DEFF Research Database (Denmark)

    Krabbenhøft, Kristian; Damkilde, Lars; Krabbenhøft, Sven

    2005-01-01

    as a nonlinear programming problem where the yield moment of the wall is minimized subject to equilibrium and yield conditions. The finite element discretization used enables exact fulfillment of these conditions and thus, according to the lower bound theorem, the solutions are safe....

  17. Ultimate Limit State Design Of Sheet Pile Walls By Finite Elements And Nonlinear Programming

    DEFF Research Database (Denmark)

    Krabbenhøft, Kristian; Damkilde, Lars; Krabbenhøft, Sven

    2005-01-01

    as a nonlinear programming problem where the yield moment of the wall is minimized subject to equilibrium and yield conditions. The finite element discretization used enables exact fulfillment of these conditions and thus, according to the lower bound theorem, the solutions are safe...

  18. Minimization and error estimates for a class of the nonlinear Schrodinger eigenvalue problems

    Institute of Scientific and Technical Information of China (English)

    MurongJIANG; JiachangSUN

    2000-01-01

    It is shown that the nonlinear eigenvaiue problem can be transformed into a constrained functional problem. The corresponding minimal function is a weak solution of this nonlinear problem. In this paper, one type of the energy functional for a class of the nonlinear SchrSdinger eigenvalue problems is proposed, the existence of the minimizing solution is proved and the error estimate is given out.

  19. Multiparametric programming based algorithms for pure integer and mixed-integer bilevel programming problems

    KAUST Repository

    Domínguez, Luis F.

    2010-12-01

    This work introduces two algorithms for the solution of pure integer and mixed-integer bilevel programming problems by multiparametric programming techniques. The first algorithm addresses the integer case of the bilevel programming problem where integer variables of the outer optimization problem appear in linear or polynomial form in the inner problem. The algorithm employs global optimization techniques to convexify nonlinear terms generated by a reformulation linearization technique (RLT). A continuous multiparametric programming algorithm is then used to solve the reformulated convex inner problem. The second algorithm addresses the mixed-integer case of the bilevel programming problem where integer and continuous variables of the outer problem appear in linear or polynomial forms in the inner problem. The algorithm relies on the use of global multiparametric mixed-integer programming techniques at the inner optimization level. In both algorithms, the multiparametric solutions obtained are embedded in the outer problem to form a set of single-level (M)(I)(N)LP problems - which are then solved to global optimality using standard fixed-point (global) optimization methods. Numerical examples drawn from the open literature are presented to illustrate the proposed algorithms. © 2010 Elsevier Ltd.

  20. On the sputtering of metals and insulators: A nonlinear evolution problem with nonlinear boundary condition

    Energy Technology Data Exchange (ETDEWEB)

    Zhang, H. [Univ. of Texas, Austin, TX (United States). Dept. of Mathematics

    1994-10-01

    In this paper the author considers a nonlinear evolution problem denoted in the paper as P. Problem (P) arises in the study of thermal evaporation of atoms and molecules from locally heated surface regions (spikes) invoked as one of several mechanisms of ion-bombardment-induced particle emission (sputtering). Then in the case of particle-induced evaporation, the Stefan-Boltzman law of heat loss by radiation is replaced by some activation law describing the loss of heat by evaporation. The equation in P is the so-called degenerate diffusion problem, which has been extensively studied in recent years. However, when dealing with the nonlinear flux boundary condition, {beta}({center_dot}) is usually assumed to be monotene. The purpose of this paper is to provide a general theory for problem P under a different assumption on {beta}({center_dot}), i.e., Lipschitz continuity instead of monotonicity. The main idea of the proof used here is to choose an appropriate test function from the corresponding linearized dual space of the solution. The similar idea has been used by many authors, e.g., Aronson, Crandall and Peletier, Bertsch and Hilhorst and Friedman. The author follows the proof of Bertsch and Hilhorst. The paper is organized as follows. They begin by stating the precise assumptions on the functions involved in P and by defining a weak solution. Then, in Section 2 they prove the existence of the solution by the method of parabolic regularization. The uniqueness is proved in Section 3. Finally, they study the large time behavior of the solution in Section 4.

  1. Modified Semi-Classical Methods for Nonlinear Quantum Oscillations Problems

    CERN Document Server

    Moncrief, Vincent; Maitra, Rachel

    2012-01-01

    We develop a modified semi-classical approach to the approximate solution of Schrodinger's equation for certain nonlinear quantum oscillations problems. At lowest order, the Hamilton-Jacobi equation of the conventional semi-classical formalism is replaced by an inverted-potential-vanishing-energy variant thereof. Under smoothness, convexity and coercivity hypotheses on its potential energy function, we prove, using the calculus of variations together with the Banach space implicit function theorem, the existence of a global, smooth `fundamental solution'. Higher order quantum corrections, for ground and excited states, are computed through the integration of associated systems of linear transport equations, and formal expansions for the corresponding energy eigenvalues obtained by imposing smoothness on the quantum corrections to the eigenfunctions. For linear oscillators our expansions naturally truncate, reproducing the well-known solutions for the energy eigenfunctions and eigenvalues. As an application, w...

  2. Stability analysis for nonlinear multi-variable delay perturbation problems

    Institute of Scientific and Technical Information of China (English)

    WangHongshan; ZhangChengjian

    2003-01-01

    This paper discusses the stability of theoretical solutions for nonlinear multi-variable delay perturbation problems(MVDPP) of the form x′(t) = f(x(t),x(t - τ1(t)),…,x(t -τm(t)),y(t),y(t - τ1(t)),…,y(t - τm(t))), and gy′(t) = g(x(t),x(t- τ1(t)),…,x(t- τm(t)),y(t),y(t- τ1(t)),…,y(t- τm(t))), where 0 < ε <<1. A sufficient condition of stability for the systems is obtained. Additionally we prove the numerical solutions of the implicit Euler method are stable under this condition.

  3. THREE POINT BOUNDARY VALUE PROBLEMS FOR NONLINEAR FRACTIONAL DIFFERENTIAL EQUATIONS

    Institute of Scientific and Technical Information of China (English)

    Mujeeb ur Rehman; Rahmat Ali Khan; Naseer Ahmad Asif

    2011-01-01

    In this paper,we study existence and uniqueness of solutions to nonlinear three point boundary value problems for fractional differential equation of the type cDδ0+u(t) =f(t,u(t),cDσ0+u(t)),t ∈[0,T],u(0) =αu(η),u(T) =βu(η),where1 <δ<2,0<σ< 1,α,β∈R,η∈(0,T),αη(1-β)+(1-α)(T-βη) ≠0 and cDoδ+,cDσ0+ are the Caputo fractional derivatives.We use Schauder fixed point theorem and contraction mapping principle to obtain existence and uniqueness results.Examples are also included to show the applicability of our results.

  4. On a shock problem involving a nonlinear viscoelastic bar

    Directory of Open Access Journals (Sweden)

    Tran Ngoc Diem

    2005-11-01

    Full Text Available We treat an initial boundary value problem for a nonlinear wave equation utt−uxx+K|u|αu+λ|ut|βut=f(x,t in the domain 0problem in classical Sobolev spaces. The proof is based on a Galerkin-type approximation, various energy estimates, and compactness arguments. In the case of α=β=0, the regularity of solutions is studied also. Finally, we obtain an asymptotic expansion of the solution (u,P of this problem up to order N+1 in two small parameters K, λ.

  5. Semantic Solutions to Program Analysis Problems

    CERN Document Server

    Tobin-Hochstadt, Sam

    2011-01-01

    Problems in program analysis can be solved by developing novel program semantics and deriving abstractions conventionally. For over thirty years, higher-order program analysis has been sold as a hard problem. Its solutions have required ingenuity and complex models of approximation. We claim that this difficulty is due to premature focus on abstraction and propose a new approach that emphasizes semantics. Its simplicity enables new analyses that are beyond the current state of the art.

  6. An Algorithm for Solving Quadratic Programming Problems

    Directory of Open Access Journals (Sweden)

    V. Moraru

    1997-08-01

    Full Text Available Herein is investigated the method of solution of quadratic programming problems. The algorithm is based on the effective selection of constraints. Quadratic programming with constraints-equalities are solved with the help of an algorithm, so that matrix inversion is avoided, because of the more convenient organization of the Calculus. Optimal solution is determined in a finite number of iterations. It is discussed the extension of the algorithm over solving quadratic non-convex programming problems.

  7. A Dual Approach for Solving Nonlinear Infinity-Norm Minimization Problems with Applications in Separable Cases

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    In this paper, we consider nonlinear infinity-norm minimization problems. We device a reliable Lagrangian dual approach for solving this kind of problems and based on this method we propose an algorithm for the mixed linear and nonlinear infinitynorm minimization problems. Numerical results are presented.

  8. Geometric Programming Problem with Co-Efficients and Exponents Associated with Binary Numbers

    Directory of Open Access Journals (Sweden)

    A. K. Das

    2010-01-01

    Full Text Available Geometric programming (GP provides a power tool for solving a variety of optimization problems. In the real world, many applications of geometric programming (GP are engineering design problems in which some of the problem parameters are estimating of actual values. This paper develops a solution procedure to solve nonlinear programming problems using GP technique by splitting the cost coefficients, constraint coefficients and exponents with the help of binary numbers. The equivalent mathematical programming problems are formulated to find their corresponding value of the objective function based on the duality theorem. The ability of calculating the cost coefficients, constraint coefficients and exponents developed in this paper might help lead to more realistic modeling efforts in engineering design areas. Standard nonlinear programming software has been used to solve the proposed optimization problem. Two numerical examples are presented to illustrate the method.

  9. A ROBUST TRUST REGION ALGORITHM FOR SOLVING GENERAL NONLINEAR PROGRAMMING

    Institute of Scientific and Technical Information of China (English)

    Xin-wei Liu; Ya-xiang Yuan

    2001-01-01

    The trust region approach has been extended to solving nonlinear constrained optimization. Most of these extensions consider only equality constraints and require strong global regularity assumptions. In this paper, a trust region algorithm for solving general nonlinear programming is presented, which solves an unconstrained piecewise quadratic trust region subproblem and a quadratic programming trust region subproblem at each iteration. A new technique for updating the penalty parameter is introduced. Under very mild conditions, the global convergence results are proved. Some local convergence results are also proved. Preliminary numerical results are also reported.

  10. Meshless analysis of an improved element-free Galerkin method for linear and nonlinear elliptic problems

    Science.gov (United States)

    Tang, Yao-Zong; Li, Xiao-Lin

    2017-03-01

    We first give a stabilized improved moving least squares (IMLS) approximation, which has better computational stability and precision than the IMLS approximation. Then, analysis of the improved element-free Galerkin method is provided theoretically for both linear and nonlinear elliptic boundary value problems. Finally, numerical examples are given to verify the theoretical analysis. Project supported by the National Natural Science Foundation of China (Grant No. 11471063), the Chongqing Research Program of Basic Research and Frontier Technology, China (Grant No. cstc2015jcyjBX0083), and the Educational Commission Foundation of Chongqing City, China (Grant No. KJ1600330).

  11. An inverse problem of temperature estimation for the combination of the linear and nonlinear resistances

    Directory of Open Access Journals (Sweden)

    Slavica M. Perovich

    2011-06-01

    Full Text Available The subject of the theoretical analysis presented in this paper is an analytical approach to the temperature estimation, as an inverse problem, for different thermistors – linear resistances structures: series and parallel ones, by the STFT - Special Trans Functions Theory (S.M. Perovich. The mathematical formulae genesis of both cases is given. Some numerical and graphical simulations in MATHEMATICA program have been realized. The estimated temperature intervals for strongly determined values of the equivalent resistances of the nonlinear structures are given, as well.

  12. Solving nonlinear nonstationary problem of heat-conductivity by finite element method

    Directory of Open Access Journals (Sweden)

    Антон Янович Карвацький

    2016-11-01

    Full Text Available Methodology and effective solving algorithm of non-linear dynamic problems of thermal and electric conductivity with significant temperature dependence of thermal and physical properties are given on the basis of finite element method (FEM and Newton linearization method. Discrete equations system FEM was obtained with the use of Galerkin method, where the main function is the finite element form function. The methodology based on successive solving problems of thermal and electrical conductivity has been examined in the work in order to minimize the requirements for calculating resources (RAM. in particular. Having used Mathcad software original programming code was developed to solve the given problem. After investigation of the received results, comparative analyses of accurate solution data and results of numerical solutions, obtained with the use of Matlab programming products, was held. The geometry of one fourth part of the finite sized cylinder was used to test the given numerical model. The discretization of the calculation part was fulfilled using the open programming software for automated Gmsh nets with tetrahedral units, while ParaView, which is an open programming code as well, was used to visualize the calculation results. It was found out that the maximum value violation of potential and temperature determination doesn`t exceed 0,2-0,83% in the given work according to the problem conditions

  13. Scaling properties of weakly nonlinear coefficients in the Faraday problem.

    Science.gov (United States)

    Skeldon, A C; Porter, J

    2011-07-01

    Interesting and exotic surface wave patterns have regularly been observed in the Faraday experiment. Although symmetry arguments provide a qualitative explanation for the selection of some of these patterns (e.g., superlattices), quantitative analysis is hindered by mathematical difficulties inherent in a time-dependent, free-boundary Navier-Stokes problem. More tractable low viscosity approximations are available, but these do not necessarily capture the moderate viscosity regime of the most interesting experiments. Here we focus on weakly nonlinear behavior and compare the scaling results derived from symmetry arguments in the low viscosity limit with the computed coefficients of appropriate amplitude equations using both the full Navier-Stokes equations and a reduced set of partial differential equations due to Zhang and Vinãls. We find the range of viscosities over which one can expect "low viscosity" theories to hold. We also find that there is an optimal viscosity range for locating superlattice patterns experimentally-large enough that the region of parameters giving stable patterns is not impracticably small, yet not so large that crucial resonance effects are washed out. These results help explain some of the discrepancies between theory and experiment.

  14. On Nonlinear Approximations to Cosmic Problems with Mixed Boundary Conditions

    CERN Document Server

    Mancinelli, P J; Ganon, G; Dekel, A; Mancinelli, Paul J.; Yahil, Amos; Ganon, Galit; Dekel, Avishai

    1993-01-01

    Nonlinear approximations to problems with mixed boundary conditions are useful for predicting large-scale streaming velocities from the density field, or vice-versa. We evaluate the schemes of Bernardeau \\cite{bernardeau92}, Gramann \\cite{gramann93}, and Nusser \\etal \\cite{nusser91}, using smoothed density and velocity fields obtained from $N$-body simulations of a CDM universe. The approximation of Nusser \\etal is overall the most accurate and robust. For Gaussian smoothing of 1000\\kms\\ the mean error in the approximated relative density perturbation, $\\delta$, is smaller than 0.06, and the dispersion is 0.1. The \\rms\\ error in the estimated velocity is smaller than 60\\kms, and the dispersion is 40\\kms. For smoothing of 500\\kms\\ these numbers increase by about a factor $\\sim 2$ for $\\delta < 4-5$, but deteriorate at higher densities. The other approximations are comparable to those of Nusser \\etal for smoothing of 1000\\kms, but are much less successful for the smaller smoothing of 500\\kms.

  15. Basis properties of eigenfunctions of nonlinear Sturm-Liouville problems

    Directory of Open Access Journals (Sweden)

    Peter E. Zhidkov

    2000-04-01

    Full Text Available We consider three nonlinear eigenvalue problems that consist of $$-y''+f(y^2y=lambda y$$ with one of the following boundary conditions: $$displaylines{ y(0=y(1=0 quad y'(0=p ,,cr y'(0=y(1=0 quad y(0=p,, cr y'(0=y'(1=0 quad y(0=p,, }$$ where $p$ is a positive constant. Under smoothness and monotonicity conditions on $f$, we show the existence and uniqueness of a sequence of eigenvalues ${lambda _n}$ and corresponding eigenfunctions ${y_n}$ such that $y_n(x$ has precisely $n$ roots in the interval $(0,1$, where $n=0,1,2,dots$. For the first boundary condition, we show that ${y_n}$ is a basis and that ${y_n/|y_n|}$ is a Riesz basis in the space $L_2(0,1$. For the second and third boundary conditions, we show that ${y_n}$ is a Riesz basis.

  16. Incremental approximate dynamic programming for nonlinear flight control design

    NARCIS (Netherlands)

    Zhou, Y.; Van Kampen, E.J.; Chu, Q.P.

    2015-01-01

    A self-learning adaptive flight control design for non-linear systems allows reliable and effective operation of flight vehicles in a dynamic environment. Approximate dynamic programming (ADP) provides a model-free and computationally effective process for designing adaptive linear optimal

  17. 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

  18. Final Report---Next-Generation Solvers for Mixed-Integer Nonlinear Programs: Structure, Search, and Implementation

    Energy Technology Data Exchange (ETDEWEB)

    Linderoth, Jeff T. [University of Wisconsin-Madison; Luedtke, James R. [University of Wisconsin-Madison

    2013-05-30

    The mathematical modeling of systems often requires the use of both nonlinear and discrete components. Problems involving both discrete and nonlinear components are known as mixed-integer nonlinear programs (MINLPs) and are among the most challenging computational optimization problems. This research project added to the understanding of this area by making a number of fundamental advances. First, the work demonstrated many novel, strong, tractable relaxations designed to deal with non-convexities arising in mathematical formulation. Second, the research implemented the ideas in software that is available to the public. Finally, the work demonstrated the importance of these ideas on practical applications and disseminated the work through scholarly journals, survey publications, and conference presentations.

  19. Integer Programming Models for Computational Biology Problems

    Institute of Scientific and Technical Information of China (English)

    Giuseppe Lancia

    2004-01-01

    The recent years have seen an impressive increase in the use of Integer Programming models for the solution of optimization problems originating in Molecular Biology. In this survey, some of the most successful Integer Programming approaches are described, while a broad overview of application areas being is given in modern Computational Molecular Biology.

  20. Direct approach for solving nonlinear evolution and two-point boundary value problems

    Indian Academy of Sciences (India)

    Jonu Lee; Rathinasamy Sakthivel

    2013-12-01

    Time-delayed nonlinear evolution equations and boundary value problems have a wide range of applications in science and engineering. In this paper, we implement the differential transform method to solve the nonlinear delay differential equation and boundary value problems. Also, we present some numerical examples including time-delayed nonlinear Burgers equation to illustrate the validity and the great potential of the differential transform method. Numerical experiments demonstrate the use and computational efficiency of the method. This method can easily be applied to many nonlinear problems and is capable of reducing the size of computational work.

  1. A MESHLESS LOCAL PETROV-GALERKIN METHOD FOR GEOMETRICALLY NONLINEAR PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    Xiong Yuanbo; Long Shuyao; Hu De'an; Li Guangyao

    2005-01-01

    Nonlinear formulations of the meshless local Petrov-Galerkin (MLPG) method are presented for geometrically nonlinear problems. The method requires no mesh in computation and therefore avoids mesh distortion difficulties in the large deformation analysis. The essential boundary conditions in the present formulation are imposed by a penalty method. An incremental and iterative solution procedure is used to solve geometrically nonlinear problems. Several examples are presented to demonstrate the effectiveness of the method in geometrically nonlinear problems analysis. Numerical results show that the MLPG method is an effective one and that the values of the unknown variable are quite accurate.

  2. An SQP algorithm for mathematical programs with nonlinear complementarity constraints

    Institute of Scientific and Technical Information of China (English)

    Zhi-bin ZHU; Jin-bao JIAN; Cong ZHANG

    2009-01-01

    In this paper,we describe a successive approximation and smooth sequential quadratic programming (SQP) method for mathematical programs with nonlinear complementarity constraints (MPCC). We introduce a class of smooth programs to approximate the MPCC. Using an l1 penalty function,the line search assures global convergence,while the superlinear convergence rate is shown under the strictly complementary and second-order sufficient conditions. Moreover,we prove that the current iterated point is an exact stationary point of the mathematical programs with equilibrium constraints (MPEC) when the algorithm terminates finitely.

  3. A Filter Method for Nonlinear Semidefinite Programming with Global Convergence

    Institute of Scientific and Technical Information of China (English)

    Zhi Bin ZHU; Hua Li ZHU

    2014-01-01

    In this study, a new filter algorithm is presented for solving the nonlinear semidefinite programming. This algorithm is inspired by the classical sequential quadratic programming method. Unlike the traditional filter methods, the suffi cient descent is ensured by changing the step size instead of the trust region radius. Under some suitable conditions, the global convergence is obtained. In the end, some numerical experiments are given to show that the algorithm is eff ective.

  4. Variational Problem with Complex Coefficient of a Nonlinear Schrödinger Equation

    Indian Academy of Sciences (India)

    Nigar Yildirim Aksoy; Bunyamin Yildiz; Hakan Yetiskin

    2012-08-01

    An optimal control problem governed by a nonlinear Schrödinger equation with complex coefficient is investigated. The paper studies existence, uniqueness and optimality conditions for the control problem.

  5. Nonlinear predator-prey singularly perturbed Robin Problems for reaction diffusion systems

    Institute of Scientific and Technical Information of China (English)

    莫嘉琪; 韩祥临

    2003-01-01

    The nonlinear predator-prey reaction diffusion systems for singularly perturbed Robin Problems are considered. Under suitable conditions, the theory of differential inequalities can be used to study the asymptotic behavior of the solution for initial boundary value problems.

  6. The Nonlinear Predator-Prey Singularly Perturbed Robin Initial Boundary Value Problems for Reaction Diffusion System

    Institute of Scientific and Technical Information of China (English)

    莫嘉琪

    2003-01-01

    The nonlinear predator-prey singularly perturbed Robin initial boundary value problems for reaction diffusion systems were considered. Under suitable conditions, using theory of differential inequalities the existence and asymptotic behavior of solution for initial boundary value problems were studied.

  7. THE CAUCHY PROBLEM FOR A CLASS OF DOUBLY DEGENERATE NONLINEAR PARABOLIC EQUATION

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    This article studies the Cauchy problem for a class of doubly nonlinear deauthor considers its regularized problem and establishes some estimates. On the basis of the estimates, the existence and uniqueness of the generalized solutions in BV space are proved.

  8. POSITIVE SOLUTIONS OF BOUNDARY VALUE PROBLEM FOR A SYSTEM OF NONLINEAR ORDINARY DIFFERENTIAL EQUATIONS

    Institute of Scientific and Technical Information of China (English)

    LiHongyu; SunJingxian

    2005-01-01

    By using topological method, we study a class of boundary value problem for a system of nonlinear ordinary differential equations. Under suitable conditions,we prove the existence of positive solution of the problem.

  9. Nonlinear programming extensions to rational function approximations of unsteady aerodynamics

    Science.gov (United States)

    Tiffany, Sherwood H.; Adams, William M., Jr.

    1987-01-01

    This paper deals with approximating unsteady generalized aerodynamic forces in the equations of motion of a flexible aircraft. Two methods of formulating these approximations are extended to include both the same flexibility in constraining them and the same methodology in optimizing nonlinear parameters as another currently used 'extended least-squares' method. Optimal selection of 'nonlinear' parameters is made in each of the three methods by use of the same nonlinear (nongradient) optimizer. The objective of the nonlinear optimization is to obtain rational approximations to the unsteady aerodynamics whose state-space realization is of lower order than that required when no optimization of the nonlinear terms is performed. The free 'linear' parameters are determined using least-squares matrix techniques on a Lagrange multiplier formulation of an objective function which incorporates selected linear equality constraints. State-space mathematical models resulting from the different approaches are described, and results are presented which show comparative evaluations from application of each of the extended methods to a numerical example. The results obtained for the example problem show a significant (up to 63 percent) reduction in the number of differential equations used to represent the unsteady aerodynamic forces in linear time-invariant equations of motion as compared to a conventional method in which nonlinear terms are not optimized.

  10. Solutions to Boundary Value Problem of Nonlinear Impulsive Differential Equation of Fractional Order*

    Institute of Scientific and Technical Information of China (English)

    SU XIN-WEI

    2011-01-01

    This paper is devoted to study the existence and uniqueness of solutions to a boundary value problem of nonlinear fractional differential equation with impulsive effects. The arguments are based upon Schauder and Banach fixed-point theorems. We improve and generalize the results presented in [B. Ahmad, S. Sivasundaram, Existence results for nonlinear impulsive hybrid boundary value problems involving fractional differential equations, Nonlinear Analysis: Hybrid Systems, 3(2009), 251258].

  11. 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.

  12. A MATHEMATICAL PROGRAMMING MODEL FOR THE COEXISTENCE OF COMPETITIONS AND COOPERATIONS PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    MENG Zhiqing; HU Qiying; DANG Changyan

    2005-01-01

    We study in. This paper a mathematical programming model for the coexistence of competitions and cooperations problems. We introduce a new solution concept,s-optimal solution for the problem, which always exists under compact and continuous conditions. It is shown that an s-optimal solution can be obtained by solving a nonlinear programming problem. Some examples are given to explain how to compute an s-optimal solution.

  13. A Non-smooth Nonlinear Conjugate Gradient Method for Interactive Contact Force Problems

    DEFF Research Database (Denmark)

    Silcowitz, Morten; Niebe, Sarah Maria; Erleben, Kenny

    2010-01-01

    of a nonlinear complementarity problem (NCP), which can be solved using an iterative splitting method, such as the projected Gauss–Seidel (PGS) method. We present a novel method for solving the NCP problem by applying a Fletcher–Reeves type nonlinear nonsmooth conjugate gradient (NNCG) type method. We analyze...

  14. Multisplitting Iteration Schemes for Solving a Class of Nonlinear Complementarity Problems

    Institute of Scientific and Technical Information of China (English)

    Chen-liang Li; Jin-ping Zeng

    2007-01-01

    We consider several synchronous and asynchronous multisplitting iteration schemes for solving a class of nonlinear complementarity problems with the system matrix being an H-matrix. We establish the convergence theorems for the schemes. The numerical experiments show that the schemes are efficient for solving the class of nonlinear complementarity problems.

  15. A Dual Approach for Solving Nonlinear Infinite-Norm Minimization Problems with Applications in Separable Cases

    CERN Document Server

    Gharibi, Wajeb

    2011-01-01

    In this paper, we focus on nonlinear infinite-norm minimization problems that have many applications, especially in computer science and operations research. We set a reliable Lagrangian dual aproach for solving this kind of problems in general, and based on this method, we propose an algorithm for the mixed linear and nonlinear infinite-norm minimization cases with numerical results.

  16. 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...

  17. Global Optimization Algorithm for Nonlinear Sum of Ratios Problems%非线性比式和问题的全局优化算法

    Institute of Scientific and Technical Information of China (English)

    焦红伟; 郭运瑞; 陈永强

    2008-01-01

    In this paper,a global optimization algorithm is proposed for nonlinear sum of ratios problem(P).The algorithm works by globally solving problem(P1)that is equivalent to problem(P),by utilizing linearization technique a linear relaxation programming of the(P1)is then obtained.The proposed algorithm is convergent to the global minimum of(P1)through the successive refinement of linear relaxation of the feasible region of objective function and solutions of a series of linear relaxation programming.Numerical results indicate that the proposed algorithm is feasible and can be used to globally solve nonlinear sum of ratios problems(P).

  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. 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.

  20. A FORTRAN program for calculating nonlinear seismic ground response

    Science.gov (United States)

    Joyner, William B.

    1977-01-01

    The program described here was designed for calculating the nonlinear seismic response of a system of horizontal soil layers underlain by a semi-infinite elastic medium representing bedrock. Excitation is a vertically incident shear wave in the underlying medium. The nonlinear hysteretic behavior of the soil is represented by a model consisting of simple linear springs and Coulomb friction elements arranged as shown. A boundary condition is used which takes account of finite rigidity in the elastic substratum. The computations are performed by an explicit finite-difference scheme that proceeds step by step in space and time. A brief program description is provided here with instructions for preparing the input and a source listing. A more detailed discussion of the method is presented elsewhere as is the description of a different program employing implicit integration.

  1. Discrete Time McKean–Vlasov Control Problem: A Dynamic Programming Approach

    Energy Technology Data Exchange (ETDEWEB)

    Pham, Huyên, E-mail: pham@math.univ-paris-diderot.fr; Wei, Xiaoli, E-mail: tyswxl@gmail.com [Laboratoire de Probabilités et Modèles Aléatoires, CNRS, UMR 7599, Université Paris Diderot (France)

    2016-12-15

    We consider the stochastic optimal control problem of nonlinear mean-field systems in discrete time. We reformulate the problem into a deterministic control problem with marginal distribution as controlled state variable, and prove that dynamic programming principle holds in its general form. We apply our method for solving explicitly the mean-variance portfolio selection and the multivariate linear-quadratic McKean–Vlasov control problem.

  2. Solving a Fully Fuzzy Linear Programming Problem through Compromise Programming

    OpenAIRE

    Haifang Cheng; Weilai Huang; Jianhu Cai

    2013-01-01

    In the current literatures, there are several models of fully fuzzy linear programming (FFLP) problems where all the parameters and variables were fuzzy numbers but the constraints were crisp equality or inequality. In this paper, an FFLP problem with fuzzy equality constraints is discussed, and a method for solving this FFLP problem is also proposed. We first transform the fuzzy equality constraints into the crisp inequality ones using the measure of the similarity, which is interpreted as t...

  3. Tilt stability in nonlinear programming under Mangasarian-Fromovitz constraint qualification

    OpenAIRE

    Mordukhovich, B. S.; Outrata, J. (Jiří)

    2013-01-01

    The paper concerns the study of tilt stability of local minimizers in standard problems of nonlinear programming. This notion plays an important role in both theoretical and numerical aspects of optimization and has drawn a lot of attention in optimization theory and its applications, especially in recent years. Under the classical Mangasarian–Fromovitz Constraint Qualification, we establish relationships between tilt stability and some other stability notions in constrained optimization. I...

  4. Multigrid techniques for nonlinear eigenvalue probems: Solutions of a nonlinear Schroedinger eigenvalue problem in 2D and 3D

    Science.gov (United States)

    Costiner, Sorin; Taasan, Shlomo

    1994-01-01

    This paper presents multigrid (MG) techniques for nonlinear eigenvalue problems (EP) and emphasizes an MG algorithm for a nonlinear Schrodinger EP. The algorithm overcomes the mentioned difficulties combining the following techniques: an MG projection coupled with backrotations for separation of solutions and treatment of difficulties related to clusters of close and equal eigenvalues; MG subspace continuation techniques for treatment of the nonlinearity; an MG simultaneous treatment of the eigenvectors at the same time with the nonlinearity and with the global constraints. The simultaneous MG techniques reduce the large number of self consistent iterations to only a few or one MG simultaneous iteration and keep the solutions in a right neighborhood where the algorithm converges fast.

  5. Uncertainty Modeling and Robust Output Feedback Control of Nonlinear Discrete Systems: A Mathematical Programming Approach

    Directory of Open Access Journals (Sweden)

    Olav Slupphaug

    2001-01-01

    Full Text Available We present a mathematical programming approach to robust control of nonlinear systems with uncertain, possibly time-varying, parameters. The uncertain system is given by different local affine parameter dependent models in different parts of the state space. It is shown how this representation can be obtained from a nonlinear uncertain system by solving a set of continuous linear semi-infinite programming problems, and how each of these problems can be solved as a (finite series of ordinary linear programs. Additionally, the system representation includes control- and state constraints. The controller design method is derived from Lyapunov stability arguments and utilizes an affine parameter dependent quadratic Lyapunov function. The controller has a piecewise affine output feedback structure, and the design amounts to finding a feasible solution to a set of linear matrix inequalities combined with one spectral radius constraint on the product of two positive definite matrices. A local solution approach to this nonconvex feasibility problem is proposed. Complexity of the design method and some special cases such as state- feedback are discussed. Finally, an application of the results is given by proposing an on-line computationally feasible algorithm for constrained nonlinear state- feedback model predictive control with robust stability.

  6. 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.

  7. Relaxation and decomposition methods for mixed integer nonlinear programming

    CERN Document Server

    Nowak, Ivo; Bank, RE

    2005-01-01

    This book presents a comprehensive description of efficient methods for solving nonconvex mixed integer nonlinear programs, including several numerical and theoretical results, which are presented here for the first time. It contains many illustrations and an up-to-date bibliography. Because on the emphasis on practical methods, as well as the introduction into the basic theory, the book is accessible to a wide audience. It can be used both as a research and as a graduate text.

  8. Employee assistance program treats personal problems.

    Science.gov (United States)

    Bednarek, R J; Featherston, H J

    1984-03-01

    Though the concept of employee assistance programs (EAPs) is widely accepted throughout business and industry, few hospitals have established similar channels for dealing with workers whose personal problems cause work-related problems. Among the reasons for the health care profession's lack of involvement in this area are: lack of information about costs and benefits of EAPs; the hospital's multidisciplinary environment in which standards of employee competence and behavior are set by persons from many disciplines; hospital working hours; and health care workers' attitudes about their vulnerability to illness. St. Benedict's Hospital, Ogden, UT, however, has confronted the question of how to demonstrate Christian concern for its employees. St. Benedict's EAP, the Helping Hand, which was created in 1979, combines progressive disciplinary action with the opportunity for early intervention in and treatment of employees' personal problems. When a worker with personal problems is referred to the EAP coordinator, he or she is matched with the appropriate community or hospital resource for treatment. Supervisors are trained to identify employee problems and to focus on employee job performance rather than on attempting to diagnose the problem. St. Benedict's records during the program's first three years illustrate the human benefits as well as the cost savings of an EAP. Of 92 hospital employees who took part in the EAP, 72 improved their situations or resolved their problems. The hospital's turnover rates declined from 36 percent to 20 percent, and approximately $40,800 in turnover and replacement costs were saved.

  9. Bivium as a Mixed Integer Programming Problem

    DEFF Research Database (Denmark)

    Borghoff, Julia; Knudsen, Lars Ramkilde; Stolpe, Mathias

    2009-01-01

    Trivium is a stream cipher proposed for the eSTREAM project. Raddum introduced some reduced versions of Trivium, named Bivium A and Bivium B. In this article we present a numerical attack on the Biviums. The main idea is to transform the problem of solving a sparse system of quadratic equations...... over $GF(2)$ into a combinatorial optimization problem. We convert the Boolean equation system into an equation system over $\\mathbb{R}$ and formulate the problem of finding a $0$-$1$-valued solution for the system as a mixed-integer programming problem. This enables us to make use of several...... algorithms in the field of combinatorial optimization in order to find a solution for the problem and recover the initial state of Bivium. In particular this gives us an attack on Bivium B in estimated time complexity of $2^{63.7}$ seconds. But this kind of attack is also applicable to other cryptographic...

  10. A SPLITTING METHOD FOR QUADRATIC PROGRAMMING PROBLEM

    Institute of Scientific and Technical Information of China (English)

    魏紫銮

    2001-01-01

    A matrix splitting method is presented for minimizing a quadratic programming (QP)problem, and a general algorithm is designed to solve the QP problem and generates a sequence of iterative points. We prove that the sequence generated by the algorithm converges to the optimal solution and has an R-linear rate of convergence if the QP problem is strictly convex and nondegenerate, and that every accumulation point of the sequence generated by the general algorithm is a KKT point of the original problem under the hypothesis that the value of the objective function is bounded below on the constrained region, and that the sequence converges to a KKT point if the problem is nondegenerate and the constrained region is bounded.

  11. Freeform illumination design: a nonlinear boundary problem for the elliptic Monge-Ampére equation.

    Science.gov (United States)

    Wu, Rengmao; Xu, Liang; Liu, Peng; Zhang, Yaqin; Zheng, Zhenrong; Li, Haifeng; Liu, Xu

    2013-01-15

    We propose an approach to deal with the problem of freeform surface illumination design without assuming any symmetry based on the concept that this problem is similar to the problem of optimal mass transport. With this approach, the freeform design is converted into a nonlinear boundary problem for the elliptic Monge-Ampére equation. The theory and numerical method are given for solving this boundary problem. Experimental results show the feasibility of this approach in tackling this freeform design problem.

  12. 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.

  13. Analytic approximations to nonlinear boundary value problems modeling beam-type nano-electromechanical systems

    Energy Technology Data Exchange (ETDEWEB)

    Zou, Li [Dalian Univ. of Technology, Dalian City (China). State Key Lab. of Structural Analysis for Industrial Equipment; Liang, Songxin; Li, Yawei [Dalian Univ. of Technology, Dalian City (China). School of Mathematical Sciences; Jeffrey, David J. [Univ. of Western Ontario, London (Canada). Dept. of Applied Mathematics

    2017-06-01

    Nonlinear boundary value problems arise frequently in physical and mechanical sciences. An effective analytic approach with two parameters is first proposed for solving nonlinear boundary value problems. It is demonstrated that solutions given by the two-parameter method are more accurate than solutions given by the Adomian decomposition method (ADM). It is further demonstrated that solutions given by the ADM can also be recovered from the solutions given by the two-parameter method. The effectiveness of this method is demonstrated by solving some nonlinear boundary value problems modeling beam-type nano-electromechanical systems.

  14. Analytic Approximations to Nonlinear Boundary Value Problems Modeling Beam-Type Nano-Electromechanical Systems

    Science.gov (United States)

    Zou, Li; Liang, Songxin; Li, Yawei; Jeffrey, David J.

    2017-03-01

    Nonlinear boundary value problems arise frequently in physical and mechanical sciences. An effective analytic approach with two parameters is first proposed for solving nonlinear boundary value problems. It is demonstrated that solutions given by the two-parameter method are more accurate than solutions given by the Adomian decomposition method (ADM). It is further demonstrated that solutions given by the ADM can also be recovered from the solutions given by the two-parameter method. The effectiveness of this method is demonstrated by solving some nonlinear boundary value problems modeling beam-type nano-electromechanical systems.

  15. Control design for the nonlinear benchmark problem via the output regulation method

    Institute of Scientific and Technical Information of China (English)

    Jie HUANG; Guoqiang HU

    2004-01-01

    The problem of designing a feedback controller to achieve asymptotic disturbance rejection / attenuation while maintaining good transient response in the RTAC system is known as a benchmark nonlinear control problem, which has been an intensive research subject since 1995. In this paper, we will further investigate the solvability of the robust disturbance rejection problem of the RTAC system by the measurement output feedback control based on the robust output regulation method. We have obtained a design by overcoming two major obstacles: find a closed-form solution of the regulator equations; and devise a nonlinear internal model to account for non-polynomial nonlinearities.

  16. Women in Jail: Problems, Programs and Resources.

    Science.gov (United States)

    Roy, Marjorie Brown

    This manual is designed to assist those individuals or groups responsible for developing educational and vocational programs for women in jail. The first section identifies the needs and problems of women in jail, focussing on discrimination against poor women unable to afford bail, the nonviolent nature of women's crimes, and the inequity of jail…

  17. Solving Large Scale Nonlinear Eigenvalue Problem in Next-Generation Accelerator Design

    Energy Technology Data Exchange (ETDEWEB)

    Liao, Ben-Shan; Bai, Zhaojun; /UC, Davis; Lee, Lie-Quan; Ko, Kwok; /SLAC

    2006-09-28

    A number of numerical methods, including inverse iteration, method of successive linear problem and nonlinear Arnoldi algorithm, are studied in this paper to solve a large scale nonlinear eigenvalue problem arising from finite element analysis of resonant frequencies and external Q{sub e} values of a waveguide loaded cavity in the next-generation accelerator design. They present a nonlinear Rayleigh-Ritz iterative projection algorithm, NRRIT in short and demonstrate that it is the most promising approach for a model scale cavity design. The NRRIT algorithm is an extension of the nonlinear Arnoldi algorithm due to Voss. Computational challenges of solving such a nonlinear eigenvalue problem for a full scale cavity design are outlined.

  18. 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.

  19. Solution of large nonlinear quasistatic structural mechanics problems on distributed-memory multiprocessor computers

    Energy Technology Data Exchange (ETDEWEB)

    Blanford, M. [Sandia National Labs., Albuquerque, NM (United States)

    1997-12-31

    Most commercially-available quasistatic finite element programs assemble element stiffnesses into a global stiffness matrix, then use a direct linear equation solver to obtain nodal displacements. However, for large problems (greater than a few hundred thousand degrees of freedom), the memory size and computation time required for this approach becomes prohibitive. Moreover, direct solution does not lend itself to the parallel processing needed for today`s multiprocessor systems. This talk gives an overview of the iterative solution strategy of JAS3D, the nonlinear large-deformation quasistatic finite element program. Because its architecture is derived from an explicit transient-dynamics code, it does not ever assemble a global stiffness matrix. The author describes the approach he used to implement the solver on multiprocessor computers, and shows examples of problems run on hundreds of processors and more than a million degrees of freedom. Finally, he describes some of the work he is presently doing to address the challenges of iterative convergence for ill-conditioned problems.

  20. 多约束非线性背包问题的一种有效算法%An efficient algorithm for multi-dimensional nonlinear knapsack problems

    Institute of Scientific and Technical Information of China (English)

    陈娟; 孙小玲; 郭慧娟

    2006-01-01

    Multi-dimensional nonlinear knapsack problem is a bounded nonlinear integer programming problem that maximizes a separable nondecreasing function subject to multiple separable nondecreasing constraints. This problem is often encountered in resource allocation, industrial planning and computer network. In this paper, a new convergent Lagrangian dual method was proposed for solving this problem. Cutting plane method was used to solve the dual problem and to compute the Lagrangian bounds of the primal problem. In order to eliminate the duality gap and thus to guarantee the convergence of the algorithm, domain cut technique was employed to remove certain integer boxes and partition the revised domain to a union of integer boxes. Extensive computational results show that the proposed method is efficient for solving large-scale multi-dimensional nonlinear knapsack problems. Our numerical results also indicate that the cutting plane method significantly outperforms the subgradient method as a dual search procedure.

  1. Initial-boundary value problems for a class of nonlinear thermoelastic plate equations

    Institute of Scientific and Technical Information of China (English)

    Zhang Jian-Wen; Rong Xiao-Liang; Wu Run-Heng

    2009-01-01

    This paper studies initial-boundary value problems for a class of nonlinear thermoelastic plate equations. Under some certain initial data and boundary conditions,it obtains an existence and uniqueness theorem of global weak solutions of the nonlinear thermoelstic plate equations,by means of the Galerkin method. Moreover,it also proves the existence of strong and classical solutions.

  2. Analytical Solution of Nonlinear Problems in Classical Dynamics by Means of Lagrange-Ham

    DEFF Research Database (Denmark)

    Kimiaeifar, Amin; Mahdavi, S. H; Rabbani, A.

    2011-01-01

    In this work, a powerful analytical method, called Homotopy Analysis Methods (HAM) is coupled with Lagrange method to obtain the exact solution for nonlinear problems in classic dynamics. In this work, the governing equations are obtained by using Lagrange method, and then the nonlinear governing...

  3. NONLOCAL INITIAL PROBLEM FOR NONLINEAR NONAUTONOMOUS DIFFERENTIAL EQUATIONS IN A BANACH SPACE

    Institute of Scientific and Technical Information of China (English)

    M.I.Gil'

    2004-01-01

    The nonlocal initial problem for nonlinear nonautonomous evolution equations in a Banach space is considered. It is assumed that the nonlinearities have the local Lipschitz properties. The existence and uniqueness of mild solutions are proved. Applications to integro-differential equations are discussed. The main tool in the paper is the normalizing mapping (the generalized norm).

  4. Cognitive Variables in Problem Solving: A Nonlinear Approach

    Science.gov (United States)

    Stamovlasis, Dimitrios; Tsaparlis, Georgios

    2005-01-01

    We employ tools of complexity theory to examine the effect of cognitive variables, such as working-memory capacity, degree of field dependence-independence, developmental level and the mobility-fixity dimension. The nonlinear method correlates the subjects' rank-order achievement scores with each cognitive variable. From the achievement scores in…

  5. CLASSIFICATION OF BIFURCATIONS FOR NONLINEAR DYNAMICAL PROBLEMS WITH CONSTRAINTS

    Institute of Scientific and Technical Information of China (English)

    吴志强; 陈予恕

    2002-01-01

    Bifurcation of periodic solutions widely existed in nonlinear dynamical systems isa kind of constrained one in intrinsic quality because its amplitude is always non-negative.Classification of the bifurcations with the type of constraint was discussed. All its six typesof transition sets are derived, in which three types are newly found and a method isproposed for analyzing the constrained bifurcation.

  6. Nonlocal Cauchy problem for nonlinear mixed integrodifferential equations

    Directory of Open Access Journals (Sweden)

    H.L. Tidke

    2010-12-01

    Full Text Available The present paper investigates the existence and uniqueness of mild and strong solutions of a nonlinear mixed Volterra-Fredholm integrodifferential equation with nonlocal condition. The results obtained by using Schauder fixed point theorem and the theory of semigroups.

  7. Designing A Nonlinear Integer Programming Model For A Cross-Dock By A Genetic Algorithm

    OpenAIRE

    Bahareh Vaisi; Reza Tavakkoli-Moghaddam

    2015-01-01

    Abstract This paper presents a non-linear integer programming model for a cross-dock problem that considers the total transportation cost of inbound and outbound trucks from an origin to a destination and the total cost of assigning strip and stack doors to trucks based on their number of trips and the distance between doors in cross-dock. In previous studies these two cost-based problems are modeled separately however it is more realistic and practical to use both of them as an integrated cr...

  8. CAD of control systems: Application of nonlinear programming to a linear quadratic formulation

    Science.gov (United States)

    Fleming, P.

    1983-01-01

    The familiar suboptimal regulator design approach is recast as a constrained optimization problem and incorporated in a Computer Aided Design (CAD) package where both design objective and constraints are quadratic cost functions. This formulation permits the separate consideration of, for example, model following errors, sensitivity measures and control energy as objectives to be minimized or limits to be observed. Efficient techniques for computing the interrelated cost functions and their gradients are utilized in conjunction with a nonlinear programming algorithm. The effectiveness of the approach and the degree of insight into the problem which it affords is illustrated in a helicopter regulation design example.

  9. Novel Reduced Order in Time Models for Problems in Nonlinear Aeroelasticity Project

    Data.gov (United States)

    National Aeronautics and Space Administration — Research is proposed for the development and implementation of state of the art, reduced order models for problems in nonlinear aeroelasticity. Highly efficient and...

  10. LEAST-SQUARES MIXED FINITE ELEMENT METHODS FOR NONLINEAR PARABOLIC PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    Dan-ping Yang

    2002-01-01

    Two least-squares mixed finite element schemes are formulated to solve the initialboundary value problem of a nonlinear parabolic partial differential equation and the convergence of these schemes are analyzed.

  11. A NUMERICAL EMBEDDING METHOD FOR SOLVING THE NONLINEAR COMPLEMENTARITY PROBLEM (II)-ALGORITHM AND ITS CONVERGENCE

    Institute of Scientific and Technical Information of China (English)

    张建军; 王德人

    2004-01-01

    In this paper, based on the resuls presented in part I of this paper[18],we present a numerical crabeding algorithm for soling the nonlinear complementarity problem, and prove its convergence carefully. Numerical experiments show that the algorithm is successful.

  12. SIMILARITY REDUCTIONS FOR THE NONLINEAR EVOLUTION EQUATION ARISING IN THE FERMI-PASTA-ULAM PROBLEM

    Institute of Scientific and Technical Information of China (English)

    谢福鼎; 闫振亚; 张鸿庆

    2002-01-01

    Four families of similarity reductions are obtained for the nonlinear evolution equation arising in the Fermi-Pasta-Ulam problem via using both the direct method due to Clarkson and Kruskal and the improved direct method due to Lou.

  13. Existence Theorems for Nonlinear Boundary Value Problems for Second Order Differential Inclusions

    Science.gov (United States)

    Kandilakis, Dimitrios A.; Papageorgiou, Nikolaos S.

    1996-11-01

    In this paper we consider a nonlinear two-point boundary value problem for second order differential inclusions. Using the Leray-Schauder principle and its multivalued analog due to Dugundji-Granas, we prove existence theorems for convex and nonconvex problems. Our results are quite general and incorporate as special cases several classes of problems which are of interest in the literature.

  14. A NUMERICAL EMBEDDING METHOD FOR SOLVING THE NONLINEAR COMPLEMENTARITY PROBLEM(Ⅰ)--THEORY

    Institute of Scientific and Technical Information of China (English)

    Jian-jun Zhang; De-ren Wang

    2002-01-01

    In this paper, we extend the numerical embedding method for solving the smooth equations to the nonlinear complementarity problem. By using the nonsmooth theory,we prove the existence and the continuation of the following path for the corresponding homotopy equations. Therefore the basic theory of the numerical embedding method for solving the nonlinear complementarity problem is established. In part Ⅱ of this paper, we will further study the implementation of the method and give some numerical exapmles.

  15. Efficient Realization of the Mixed Finite Element Discretization for nonlinear Problems

    OpenAIRE

    Knabner, Peter; Summ, Gerhard

    2016-01-01

    We consider implementational aspects of the mixed finite element method for a special class of nonlinear problems. We establish the equivalence of the hybridized formulation of the mixed finite element method to a nonconforming finite element method with augmented Crouzeix-Raviart ansatz space. We discuss the reduction of unknowns by static condensation and propose Newton's method for the solution of local and global systems. Finally, we show, how such a nonlinear problem arises from the mixe...

  16. Programming languages for business problem solving

    CERN Document Server

    Wang, Shouhong

    2007-01-01

    It has become crucial for managers to be computer literate in today's business environment. It is also important that those entering the field acquire the fundamental theories of information systems, the essential practical skills in computer applications, and the desire for life-long learning in information technology. Programming Languages for Business Problem Solving presents a working knowledge of the major programming languages, including COBOL, C++, Java, HTML, JavaScript, VB.NET, VBA, ASP.NET, Perl, PHP, XML, and SQL, used in the current business computing environment. The book examin

  17. Nonlinear problems of complex natural systems: Sun and climate dynamics.

    Science.gov (United States)

    Bershadskii, A

    2013-01-13

    The universal role of the nonlinear one-third subharmonic resonance mechanism in generation of strong fluctuations in complex natural dynamical systems related to global climate is discussed using wavelet regression detrended data. The role of the oceanic Rossby waves in the year-scale global temperature fluctuations and the nonlinear resonance contribution to the El Niño phenomenon have been discussed in detail. The large fluctuations in the reconstructed temperature on millennial time scales (Antarctic ice core data for the past 400,000 years) are also shown to be dominated by the one-third subharmonic resonance, presumably related to the Earth's precession effect on the energy that the intertropical regions receive from the Sun. The effects of galactic turbulence on the temperature fluctuations are also discussed.

  18. Some Problems in Nonlinear Dynamic Instability and Bifurcation Theory for Engineering Structures

    Institute of Scientific and Technical Information of China (English)

    彭妙娟; 程玉民

    2005-01-01

    In civil engineering, the nonlinear dynamic instability of structures occurs at a bifurcation point or a limit point. The instability at a bifurcation point can be analyzed with the theory of nonlinear dynamics, and that at a limit point can be discussed with the theory of elastoplasticity. In this paper, the nonlinear dynamic instability of structures was treated with mathematical and mechanical theories. The research methods for the problems of structural nonlinear dynamic stability were discussed first, and then the criterion of stability or instability of structures, the method to obtain the bifurcation point and the limit point, and the formulae of the directions of the branch solutions at a bifurcation point were elucidated. These methods can be applied to the problems of nonlinear dynamic instability of structures such as reticulated shells, space grid structures, and so on.

  19. Lie and Conditional Symmetries of a Class of Nonlinear (1 + 2-Dimensional Boundary Value Problems

    Directory of Open Access Journals (Sweden)

    Roman Cherniha

    2015-08-01

    Full Text Available A new definition of conditional invariance for boundary value problems involving a wide range of boundary conditions (including initial value problems as a special case is proposed. It is shown that other definitions worked out in order to find Lie symmetries of boundary value problems with standard boundary conditions, followed as particular cases from our definition. Simple examples of direct applicability to the nonlinear problems arising in applications are demonstrated. Moreover, the successful application of the definition for the Lie and conditional symmetry classification of a class of (1 + 2-dimensional nonlinear boundary value problems governed by the nonlinear diffusion equation in a semi-infinite domain is realised. In particular, it is proven that there is a special exponent, k ≠ —2, for the power diffusivity uk when the problem in question with non-vanishing flux on the boundary admits additional Lie symmetry operators compared to the case k ≠ —2. In order to demonstrate the applicability of the symmetries derived, they are used for reducing the nonlinear problems with power diffusivity uk and a constant non-zero flux on the boundary (such problems are common in applications and describing a wide range of phenomena to (1 + 1-dimensional problems. The structure and properties of the problems obtained are briefly analysed. Finally, some results demonstrating how Lie invariance of the boundary value problem in question depends on the geometry of the domain are presented.

  20. A NUMERICAL CALCULATION METHOD FOR EIGENVALUE PROBLEMS OF NONLINEAR INTERNAL WAVES

    Institute of Scientific and Technical Information of China (English)

    SHI Xin-gang; FAN Zhi-song; LIU Hai-long

    2009-01-01

    Generally speaking, the background shear current U(z)must be taken into account in eigenvalue problems of nonlinear internal waves in ocean, as is different from those of linear internal waves. A numerical calculation method for eigenvalue problems of nonlinear internal waves is presented in this paper on the basis of the Thompson-Haskell's calculation method. As an application of this method, at a station (21°N, 117°15′E) in the South China Sea, a modal structure and parameters of nonlinear internal waves are calculated, and the results closely agree with the calculated results based on observation by Yang et al..

  1. Study on high order perturbation-based nonlinear stochastic finite element method for dynamic problems

    Science.gov (United States)

    Wang, Qing; Yao, Jing-Zheng

    2010-12-01

    Several algorithms were proposed relating to the development of a framework of the perturbation-based stochastic finite element method (PSFEM) for large variation nonlinear dynamic problems. For this purpose, algorithms and a framework related to SFEM based on the stochastic virtual work principle were studied. To prove the validity and practicality of the algorithms and framework, numerical examples for nonlinear dynamic problems with large variations were calculated and compared with the Monte-Carlo Simulation method. This comparison shows that the proposed approaches are accurate and effective for the nonlinear dynamic analysis of structures with random parameters.

  2. A MONOTONE DOMAIN DECOMPOSITION ALGORITHM FOR SOLVING WEIGHTED AVERAGE APPROXIMATIONS TO NONLINEAR SINGULARLY PERTURBED PARABOLIC PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    Igor Boglaev; Matthew Hardy

    2008-01-01

    This paper presents and analyzes a monotone domain decomposition algorithm for solving nonlinear singularly perturbed reaction-diffusion problems of parabolic type.To solve the nonlinear weighted average finite difference scheme for the partial differential equation,we construct a monotone domain decomposition algorithm based on a Schwarz alternating method and a box-domain decomposition.This algorithm needs only to solve linear discrete systems at each iterative step and converges monotonically to the exact solution of the nonlinear discrete problem. The rate of convergence of the monotone domain decomposition algorithm is estimated.Numerical experiments are presented.

  3. Assessment of Two Analytical Methods in Solving the Linear and Nonlinear Elastic Beam Deformation Problems

    DEFF Research Database (Denmark)

    Barari, Amin; Ganjavi, B.; Jeloudar, M. Ghanbari

    2010-01-01

    Purpose – In the last two decades with the rapid development of nonlinear science, there has appeared ever-increasing interest of scientists and engineers in the analytical techniques for nonlinear problems. This paper considers linear and nonlinear systems that are not only regarded as general...... and fluid mechanics. Design/methodology/approach – Two new but powerful analytical methods, namely, He's VIM and HPM, are introduced to solve some boundary value problems in structural engineering and fluid mechanics. Findings – Analytical solutions often fit under classical perturbation methods. However...

  4. On the solution of mixed-integer nonlinear programming models for computer aided molecular design.

    Science.gov (United States)

    Ostrovsky, Guennadi M; Achenie, Luke E K; Sinha, Manish

    2002-11-01

    This paper addresses the efficient solution of computer aided molecular design (CAMD) problems, which have been posed as mixed-integer nonlinear programming models. The models of interest are those in which the number of linear constraints far exceeds the number of nonlinear constraints, and with most variables participating in the nonconvex terms. As a result global optimization methods are needed. A branch-and-bound algorithm (BB) is proposed that is specifically tailored to solving such problems. In a conventional BB algorithm, branching is performed on all the search variables that appear in the nonlinear terms. This translates to a large number of node traversals. To overcome this problem, we have proposed a new strategy for branching on a set of linear branchingfunctions, which depend linearly on the search variables. This leads to a significant reduction in the dimensionality of the search space. The construction of linear underestimators for a class of functions is also presented. The CAMD problem that is considered is the design of optimal solvents to be used as cleaning agents in lithographic printing.

  5. An iterative method for tri-level quadratic fractional programming problems using fuzzy goal programming approach

    Science.gov (United States)

    Kassa, Semu Mitiku; Tsegay, Teklay Hailay

    2017-08-01

    Tri-level optimization problems are optimization problems with three nested hierarchical structures, where in most cases conflicting objectives are set at each level of hierarchy. Such problems are common in management, engineering designs and in decision making situations in general, and are known to be strongly NP-hard. Existing solution methods lack universality in solving these types of problems. In this paper, we investigate a tri-level programming problem with quadratic fractional objective functions at each of the three levels. A solution algorithm has been proposed by applying fuzzy goal programming approach and by reformulating the fractional constraints to equivalent but non-fractional non-linear constraints. Based on the transformed formulation, an iterative procedure is developed that can yield a satisfactory solution to the tri-level problem. The numerical results on various illustrative examples demonstrated that the proposed algorithm is very much promising and it can also be used to solve larger-sized as well as n-level problems of similar structure.

  6. Existence of solutions of nonlinear two-point boundary value problems for 4nth-order nonlinear differential equation

    Institute of Scientific and Technical Information of China (English)

    高永馨

    2002-01-01

    Studies the existence of solutions of nonlinear two point boundary value problems for nonlinear 4n-th-order differential equation y(4n)= f( t,y,y' ,y",… ,y(4n-1) ) (a) with the boundary conditions g2i(y(2i) (a) ,y(2i+1) (a)) = 0,h2i(y(2i) (c) ,y(2i+1) (c)) = 0, (I= 0,1,…,2n - 1 ) (b) where the functions f, gi and hi are continuous with certain monotone properties. For the boundary value problems of nonlinear nth order differential equation y(n) = f(t,y,y',y",… ,y(n-1)) many results have been given at the present time. But the existence of solutions of boundary value problem (a), (b) studied in this paper has not been covered by the above researches. Moreover, the corollary of the important theorem in this paper, I.e. Existence of solutions of the boundary value problem. Y(4n) = f(t,y,y',y",… ,y(4n-1) ) a2iy(2i) (at) + a2i+1y(2i+1) (a) = b2i ,c2iy(2O ( c ) + c2i+1y(2i+1) ( c ) = d2i, ( I = 0,1 ,…2n - 1) has not been dealt with in previous works.

  7. Design of asymptotic estimators: an approach based on neural networks and nonlinear programming.

    Science.gov (United States)

    Alessandri, Angelo; Cervellera, Cristiano; Sanguineti, Marcello

    2007-01-01

    A methodology to design state estimators for a class of nonlinear continuous-time dynamic systems that is based on neural networks and nonlinear programming is proposed. The estimator has the structure of a Luenberger observer with a linear gain and a parameterized (in general, nonlinear) function, whose argument is an innovation term representing the difference between the current measurement and its prediction. The problem of the estimator design consists in finding the values of the gain and of the parameters that guarantee the asymptotic stability of the estimation error. Toward this end, if a neural network is used to take on this function, the parameters (i.e., the neural weights) are chosen, together with the gain, by constraining the derivative of a quadratic Lyapunov function for the estimation error to be negative definite on a given compact set. It is proved that it is sufficient to impose the negative definiteness of such a derivative only on a suitably dense grid of sampling points. The gain is determined by solving a Lyapunov equation. The neural weights are searched for via nonlinear programming by minimizing a cost penalizing grid-point constraints that are not satisfied. Techniques based on low-discrepancy sequences are applied to deal with a small number of sampling points, and, hence, to reduce the computational burden required to optimize the parameters. Numerical results are reported and comparisons with those obtained by the extended Kalman filter are made.

  8. Application of the R-Functions Theory to Problems of Nonlinear Dynamics of Laminated Composite Shallow Shells and Plates: Review

    OpenAIRE

    2016-01-01

    A review of studies performed using the R-functions theory to solve problems of nonlinear dynamics of plates and shallow shells is presented. The systematization of results and studies for the problems of free and parametric vibrations and for problems of static and dynamic stability is fulfilled. Expansion of the developed original method of discretization for nonlinear movement equations on new classes of nonlinear problems is shown. These problems include researches of vibratio...

  9. A nonlinear signal-based control method and its applications to input identification for nonlinear SIMO problems

    Science.gov (United States)

    Enokida, Ryuta; Takewaki, Izuru; Stoten, David

    2014-12-01

    The problem of control system design can be conceptualised as identifying an input signal to a plant (the system to be controlled) so that the corresponding output matches that of a pre-defined reference signal. Primarily, this problem is solved via well-known techniques based upon the principle of feedback design, an essential component for ensuring stability and robustness of the controlled system. However, feedforward design techniques also have a large part to play, whereby (in the absence of feedback control and assuming that the plant is stable) a model of the plant dynamics can be used to modify the reference signal so that the resultant feedforward input signal generates a plant output signal that is sufficiently close to the original reference signal. The principal objective of this paper is to introduce a new nonlinear control method, called nonlinear signal-based control (NSBC) that can be executed as an on-line technique of feedforward compensation (used synonymously here with the phrase 'input identification') and an off-line technique of feedback compensation. NSBC determines the feedforward input signal to the plant by using an error signal, determined from the difference between the output signals from a linear model of the plant and from the nonlinear plant, under the same input signal. The efficacy of NSBC is examined via numerical examples using Matlab/Simulink and compared with alternative well-known methods based upon inverse transfer function compensation and also the method of high gain feedback control. NSBC was found to provide the most accurate input identification in all the examined cases of linear or nonlinear single-input, single-output and single-input, multi-output (SIMO) systems. Furthermore, in problems of structural and earthquake engineering, NSBC was also found to be particularly effective in estimating the original ground motion from a nonlinear SIMO system and its response.

  10. Eigenfunction Expansions for Coupled Nonlinear Convection-Diffusion Problems in Complex Physical Domains

    Science.gov (United States)

    Cotta, R. M.; Naveira-Cotta, C. P.; Knupp, D. C.; Zotin, J. L. Z.; Pontes, P. C.

    2016-09-01

    This lecture offers an updated review on the Generalized Integral Transform Technique (GITT), with focus on handling complex geometries, coupled problems, and nonlinear convection-diffusion, so as to illustrate some new application paradigms. Special emphasis is given to demonstrating novel developments, such as a single domain reformulation strategy that simplifies the treatment of complex geometries, an integral balance scheme in handling multiscale problems, the adoption of convective eigenvalue problems in dealing with strongly convective formulations, and the direct integral transformation of nonlinear convection-diffusion problems based on nonlinear eigenvalue problems. Representative application examples are then provided that employ recent extensions on the Generalized Integral Transform Technique (GITT), and a few numerical results are reported to illustrate the convergence characteristics of the proposed eigenfunction expansions.

  11. DOUBLE TRIALS METHOD FOR NONLINEAR PROBLEMS ARISING IN HEAT TRANSFER

    Directory of Open Access Journals (Sweden)

    Chun-Hui He

    2011-01-01

    Full Text Available According to an ancient Chinese algorithm, the Ying Buzu Shu, in about second century BC, known as the rule of double false position in West after 1202 AD, two trial roots are assumed to solve algebraic equations. The solution procedure can be extended to solve nonlinear differential equations by constructing an approximate solution with an unknown parameter, and the unknown parameter can be easily determined using the Ying Buzu Shu. An example in heat transfer is given to elucidate the solution procedure.

  12. Characterization of the shape stability for nonlinear elliptic problems

    Science.gov (United States)

    Bucur, Dorin

    We characterize all geometric perturbations of an open set, for which the solution of a nonlinear elliptic PDE of p-Laplacian type with Dirichlet boundary condition is stable in the L-norm. The necessary and sufficient conditions are jointly expressed by a geometric property associated to the γ-convergence. If the dimension N of the space satisfies N-1

  13. Method of guiding functions in problems of nonlinear analysis

    CERN Document Server

    Obukhovskii, Valeri; Van Loi, Nguyen; Kornev, Sergei

    2013-01-01

    This book offers a self-contained introduction to the theory of guiding functions methods, which can be used to study the existence of periodic solutions and their bifurcations in ordinary differential equations, differential inclusions and in control theory. It starts with the basic concepts of nonlinear and multivalued analysis, describes the classical aspects of the method of guiding functions, and then presents recent findings only available in the research literature. It describes essential applications in control theory, the theory of bifurcations, and physics, making it a valuable resource not only for “pure” mathematicians, but also for students and researchers working in applied mathematics, the engineering sciences and physics.

  14. Dynamics of parabolic problems with memory. Subcritical and critical nonlinearities

    Science.gov (United States)

    Li, Xiaojun

    2016-08-01

    In this paper, we study the long-time behavior of the solutions of non-autonomous parabolic equations with memory in cases when the nonlinear term satisfies subcritical and critical growth conditions. In order to do this, we show that the family of processes associated to original systems with heat source f(x, t) being translation bounded in Lloc 2 ( R ; L 2 ( Ω ) ) is dissipative in higher energy space M α , 0 < α ≤ 1, and possesses a compact uniform attractor in M 0 .

  15. Efficient implementation to numerically solve the nonlinear time fractional parabolic problems on unbounded spatial domain

    Science.gov (United States)

    Li, Dongfang; Zhang, Jiwei

    2016-10-01

    Anomalous diffusion behavior in many practical problems can be described by the nonlinear time-fractional parabolic problems on unbounded domain. The numerical simulation is a challenging problem due to the dependence of global information from time fractional operators, the nonlinearity of the problem and the unboundedness of the spacial domain. To overcome the unboundedness, conventional computational methods lead to extremely expensive costs, especially in high dimensions with a simple treatment of boundary conditions by making the computational domain large enough. In this paper, based on unified approach proposed in [25], we derive the efficient nonlinear absorbing boundary conditions (ABCs), which reformulates the problem on unbounded domain to an initial boundary value problem on bounded domain. To overcome nonlinearity, we construct a linearized finite difference scheme to solve the reduced nonlinear problem such that iterative methods become dispensable. And the stability and convergence of our linearized scheme are proved. Most important, we prove that the numerical solutions are bounded by the initial values with a constant coefficient, i.e., the constant coefficient is independent of the time. Overall, the computational cost can be significantly reduced comparing with the usual implicit schemes and a simple treatment of boundary conditions. Finally, numerical examples are given to demonstrate the efficiency of the artificial boundary conditions and theoretical results of the schemes.

  16. Nonlinear boundary value problem for biregular functions in Clifford analysis

    Institute of Scientific and Technical Information of China (English)

    黄沙

    1996-01-01

    The biregular function in Clifford analysis is discussed. Plemelj’s formula is obtained andnonlinear boundary value problem: is considered. Applying the methodof integral equations and Schauder fixed-point theorem, the existence of solution for the above problem is proved.

  17. A Class of Dynamic Nonlinear Resource Allocation Problems

    Science.gov (United States)

    1989-10-01

    algorithm and presents some numerical results in [5]. Matlin [6] provides a review of the literature on weapon-target allocation problems. Several...weapon, multi-target assignment problem," Working Paper 26957, MITRE, Feb. 1986. [6] S. M. Matlin , "A review of the literature on the missile

  18. Plasmonics and the parallel programming problem

    Science.gov (United States)

    Vishkin, Uzi; Smolyaninov, Igor; Davis, Chris

    2007-02-01

    While many parallel computers have been built, it has generally been too difficult to program them. Now, all computers are effectively becoming parallel machines. Biannual doubling in the number of cores on a single chip, or faster, over the coming decade is planned by most computer vendors. Thus, the parallel programming problem is becoming more critical. The only known solution to the parallel programming problem in the theory of computer science is through a parallel algorithmic theory called PRAM. Unfortunately, some of the PRAM theory assumptions regarding the bandwidth between processors and memories did not properly reflect a parallel computer that could be built in previous decades. Reaching memories, or other processors in a multi-processor organization, required off-chip connections through pins on the boundary of each electric chip. Using the number of transistors that is becoming available on chip, on-chip architectures that adequately support the PRAM are becoming possible. However, the bandwidth of off-chip connections remains insufficient and the latency remains too high. This creates a bottleneck at the boundary of the chip for a PRAM-On-Chip architecture. This also prevents scalability to larger "supercomputing" organizations spanning across many processing chips that can handle massive amounts of data. Instead of connections through pins and wires, power-efficient CMOS-compatible on-chip conversion to plasmonic nanowaveguides is introduced for improved latency and bandwidth. Proper incorporation of our ideas offer exciting avenues to resolving the parallel programming problem, and an alternative way for building faster, more useable and much more compact supercomputers.

  19. Nonlinear problems of complex natural systems: Sun and climate dynamics

    CERN Document Server

    Bershadskii, A

    2012-01-01

    Universal role of the nonlinear one-third subharmonic resonance mechanism in generation of the strong fluctuations in such complex natural dynamical systems as global climate and global solar activity is discussed using wavelet regression detrended data. Role of the oceanic Rossby waves in the year-scale global temperature fluctuations and the nonlinear resonance contribution to the El Nino phenomenon have been discussed in detail. The large fluctuations of the reconstructed temperature on the millennial time-scales (Antarctic ice cores data for the past 400,000 years) are also shown to be dominated by the one-third subharmonic resonance, presumably related to Earth precession effect on the energy that the intertropical regions receive from the Sun. Effects of Galactic turbulence on the temperature fluctuations are discussed in this content. It is also shown that the one-third subharmonic resonance can be considered as a background for the 11-years solar cycle, and again the global (solar) rotation and chaoti...

  20. A nonlinear bi-level programming approach for product portfolio management.

    Science.gov (United States)

    Ma, Shuang

    2016-01-01

    Product portfolio management (PPM) is a critical decision-making for companies across various industries in today's competitive environment. Traditional studies on PPM problem have been motivated toward engineering feasibilities and marketing which relatively pay less attention to other competitors' actions and the competitive relations, especially in mathematical optimization domain. The key challenge lies in that how to construct a mathematical optimization model to describe this Stackelberg game-based leader-follower PPM problem and the competitive relations between them. The primary work of this paper is the representation of a decision framework and the optimization model to leverage the PPM problem of leader and follower. A nonlinear, integer bi-level programming model is developed based on the decision framework. Furthermore, a bi-level nested genetic algorithm is put forward to solve this nonlinear bi-level programming model for leader-follower PPM problem. A case study of notebook computer product portfolio optimization is reported. Results and analyses reveal that the leader-follower bi-level optimization model is robust and can empower product portfolio optimization.

  1. 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.

  2. A quasi-Newton approach to optimization problems with probability density constraints. [problem solving in mathematical programming

    Science.gov (United States)

    Tapia, R. A.; Vanrooy, D. L.

    1976-01-01

    A quasi-Newton method is presented for minimizing a nonlinear function while constraining the variables to be nonnegative and sum to one. The nonnegativity constraints were eliminated by working with the squares of the variables and the resulting problem was solved using Tapia's general theory of quasi-Newton methods for constrained optimization. A user's guide for a computer program implementing this algorithm is provided.

  3. 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.

  4. On Quasi E-Convex Bilevel Programming Problem

    Directory of Open Access Journals (Sweden)

    E. A. Youness

    2005-01-01

    Full Text Available Bilevel programming problems involve two optimization problems where the data of the first one is implicity determined by the solution of the second. This study introduces the notions of E-convexity and quasi E-convexity in bilevel programming problems to generalize quasi convex bilevel programming problems.

  5. CONVERGENCE OF THE CRANK-NICOLSON/NEWTON SCHEME FOR NONLINEAR PARABOLIC PROBLEM

    Institute of Scientific and Technical Information of China (English)

    Xinlong FENG; Yinnian HE

    2016-01-01

    In this paper, the Crank-Nicolson/Newton scheme for solving numerically second-order nonlinear parabolic problem is proposed. The standard Galerkin finite element method based on P2 conforming elements is used to the spatial discretization of the problem and the Crank-Nicolson/Newton scheme is applied to the time discretization of the resulted finite element equations. Moreover, assuming the appropriate regularity of the exact solution and the finite element solution, we obtain optimal error estimates of the fully discrete Crank-Nicolson/Newton scheme of nonlinear parabolic problem. Finally, numerical experiments are presented to show the effcient performance of the proposed scheme.

  6. Asymptotic solution for a class of weakly nonlinear singularly perturbed reaction diffusion problem

    Institute of Scientific and Technical Information of China (English)

    TANG Rong-rong

    2009-01-01

    Under appropriate conditions, with the perturbation method and the theory of differential inequalities, a class of weakly nonlinear singularly perturbed reaction diffusion problem is considered. The existence of solution of the original problem is proved by constructing the auxiliary functions. The uniformly valid asymptotic expansions of the solution for arbitrary mth order approximation are obtained through constructing the formal solutions of the original problem, expanding the nonlinear terms to the power in small parameter e and comparing the coefficient for the same powers of ε. Finally, an example is provided, resulting in the error of O(ε2).

  7. SINGULARLY PERTURBED NONLINEAR BOUNDARY VALUE PROBLEM FOR A KIND OF VOLTERRA TYPE FUNCTIONAL DIFFERENTIAL EQUATION

    Institute of Scientific and Technical Information of China (English)

    鲁世平

    2003-01-01

    By employing the theory of differential inequality and some analysis methods, a nonlinear boundary value problem subject to a general kind of second-order Volterra functional differential equation was considered first. Then, by constructing the right-side layer function and the outer solution, a nonlinear boundary value problem subject to a kind of second- order Volterra functional differential equation with a small parameter was studied further. By using the differential mean value theorem and the technique of upper and lower solution, a new result on the existence of the solutions to the boundary value problem is obtained, and a uniformly valid asymptotic expansions of the solution is given as well.

  8. A Symmetric Characteristic Finite Volume Element Scheme for Nonlinear Convection-Diffusion Problems

    Institute of Scientific and Technical Information of China (English)

    Min Yang; Yi-rang Yuan

    2008-01-01

    In this paper, we implement alternating direction strategy and construct a symmetric FVE scheme for nonlinear convection-diffusion problems. Comparing to general FVE methods, our method has two advantages. First, the coefficient matrices of the discrete schemes will be symmetric even for nonlinear problems.Second, since the solution of the algebraic equations at each time step can be inverted into the solution of several one-dimensional problems, the amount of computation work is smaller. We prove the optimal H1-norm error estimates of order O(△t2 + h) and present some numerical examples at the end of the paper.

  9. Existence of solutions for quasistatic problems of unilateral contact with nonlocal friction for nonlinear elastic materials

    Directory of Open Access Journals (Sweden)

    Alain Mignot

    2005-09-01

    Full Text Available This paper shows the existence of a solution of the quasi-static unilateral contact problem with nonlocal friction law for nonlinear elastic materials. We set up a variational incremental problem which admits a solution, when the friction coefficient is small enough, and then by passing to the limit with respect to time we obtain a solution.

  10. Regularization method with two parameters for nonlinear ill-posed problems

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    This paper is devoted to the regularization of a class of nonlinear ill-posed problems in Banach spaces. The operators involved are multi-valued and the data are assumed to be known approximately. Under the assumption that the original problem is solvable, a strongly convergent approximation procedure is designed by means of the Tikhonov regularization method with two pa- rameters.

  11. Multipoint Singular Boundary-Value Problem for Systems of Nonlinear Differential Equations

    Directory of Open Access Journals (Sweden)

    Zdeněk Šmarda

    2009-01-01

    Full Text Available A singular Cauchy-Nicoletti problem for a system of nonlinear ordinary differential equations is considered. With the aid of combination of Ważewski's topological method and Schauder's principle, the theorem concerning the existence of a solution of this problem (having the graph in a prescribed domain is proved.

  12. Existence of Solutions for Nonlinear Four-Point -Laplacian Boundary Value Problems on Time Scales

    Directory of Open Access Journals (Sweden)

    Topal SGulsan

    2009-01-01

    Full Text Available We are concerned with proving the existence of positive solutions of a nonlinear second-order four-point boundary value problem with a -Laplacian operator on time scales. The proofs are based on the fixed point theorems concerning cones in a Banach space. Existence result for -Laplacian boundary value problem is also given by the monotone method.

  13. The Cauchy problem for non-autonomous nonlinear Schr(o)dinger equations

    Institute of Scientific and Technical Information of China (English)

    Peter Y. H. Pang; TANG Hongyan; WANG Youde

    2005-01-01

    In this paper we study the Cauchy problem for cubic nonlinear Schr(o)dinger equation with space-and time-dependent coefficients on Rm and Tm. By an approximation argument we prove that for suitable initial values, the Cauchy problem admits unique local solutions. Global existence is discussed in the cases of m=1,2.

  14. On high-continuity transfinite element formulations for linear-nonlinear transient thermal problems

    Science.gov (United States)

    Tamma, Kumar K.; Railkar, Sudhir B.

    1987-01-01

    This paper describes recent developments in the applicability of a hybrid transfinite element methodology with emphasis on high-continuity formulations for linear/nonlinear transient thermal problems. The proposed concepts furnish accurate temperature distributions and temperature gradients making use of a relatively smaller number of degrees of freedom; and the methodology is applicable to linear/nonlinear thermal problems. Characteristic features of the formulations are described in technical detail as the proposed hybrid approach combines the major advantages and modeling features of high-continuity thermal finite elements in conjunction with transform methods and classical Galerkin schemes. Several numerical test problems are evaluated and the results obtained validate the proposed concepts for linear/nonlinear thermal problems.

  15. SEACAS Theory Manuals: Part 1. Problem Formulation in Nonlinear Solid Mechancis

    Energy Technology Data Exchange (ETDEWEB)

    Attaway, S.W.; Laursen, T.A.; Zadoks, R.I.

    1998-08-01

    This report gives an introduction to the basic concepts and principles involved in the formulation of nonlinear problems in solid mechanics. By way of motivation, the discussion begins with a survey of some of the important sources of nonlinearity in solid mechanics applications, using wherever possible simple one dimensional idealizations to demonstrate the physical concepts. This discussion is then generalized by presenting generic statements of initial/boundary value problems in solid mechanics, using linear elasticity as a template and encompassing such ideas as strong and weak forms of boundary value problems, boundary and initial conditions, and dynamic and quasistatic idealizations. The notational framework used for the linearized problem is then extended to account for finite deformation of possibly inelastic solids, providing the context for the descriptions of nonlinear continuum mechanics, constitutive modeling, and finite element technology given in three companion reports.

  16. Cauchy problem for a class of nonlinear dispersive wave equations arising in elasto-plastic flow

    Science.gov (United States)

    Zhijian, Yang

    2006-01-01

    The paper studies the existence, both locally and globally in time, stability, decay estimates and blowup of solutions to the Cauchy problem for a class of nonlinear dispersive wave equations arising in elasto-plastic flow. Under the assumption that the nonlinear term of the equations is of polynomial growth order, say [alpha], it proves that when [alpha]>1, the Cauchy problem admits a unique local solution, which is stable and can be continued to a global solution under rather mild conditions; when [alpha][greater-or-equal, slanted]5 and the initial data is small enough, the Cauchy problem admits a unique global solution and its norm in L1,p(R) decays at the rate for 2nonlinear term, the local solutions of the Cauchy problem blow up in finite time.

  17. Cross-constrained problems for nonlinear Schrodinger equation with harmonic potential

    Directory of Open Access Journals (Sweden)

    Runzhang Xu

    2012-11-01

    Full Text Available This article studies a nonlinear Schodinger equation with harmonic potential by constructing different cross-constrained problems. By comparing the different cross-constrained problems, we derive different sharp criterion and different invariant manifolds that separate the global solutions and blowup solutions. Moreover, we conclude that some manifolds are empty due to the essence of the cross-constrained problems. Besides, we compare the three cross-constrained problems and the three depths of the potential wells. In this way, we explain the gaps in [J. Shu and J. Zhang, Nonlinear Shrodinger equation with harmonic potential, Journal of Mathematical Physics, 47, 063503 (2006], which was pointed out in [R. Xu and Y. Liu, Remarks on nonlinear Schrodinger equation with harmonic potential, Journal of Mathematical Physics, 49, 043512 (2008].

  18. A NUMERICAL METHOD FOR SIMULATING NONLINEAR FLUID-RIGID STRUCTURE INTERACTION PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    XingJ.T; PriceW.G; ChenY.G

    2005-01-01

    A numerical method for simulating nonlinear fluid-rigid structure interaction problems is developed. The structure is assumed to undergo large rigid body motions and the fluid flow is governed by nonlinear, viscous or non-viscous, field equations with nonlinear boundary conditions applied to the free surface and fluid-solid interaction interfaces. An Arbitrary-Lagrangian-Eulerian (ALE) mesh system is used to construct the numerical model. A multi-block numerical scheme of study is adopted allowing for the relative motion between moving overset grids, which are independent of one another. This provides a convenient method to overcome the difficulties in matching fluid meshes with large solid motions. Nonlinear numerical equations describing nonlinear fluid-solid interaction dynamics are derived through a numerical discretization scheme of study. A coupling iteration process is used to solve these numerical equations. Numerical examples are presented to demonstrate applications of the model developed.

  19. BILEVEL PROGRAMMING MODEL AND SOLUTION METHOD FOR MIXED TRANSPORTATION NETWORK DESIGN PROBLEM

    Institute of Scientific and Technical Information of China (English)

    Haozhi ZHANG; Ziyou GAO

    2009-01-01

    By handling the travel cost function artfully, the authors formulate the transportation mixed network design problem (MNDP) as a mixed-integer, nonlinear bilevel programming problem, in which the lower-level problem, comparing with that of conventional bilevel DNDP models, is not a side constrained user equilibrium assignment problem, but a standard user equilibrium assignment problem. Then, the bilevel programming model for MNDP is reformulated as a continuous version of bilevel programming problem by the continuation method. By virtue of the optimal-value function, the lower-level assignment problem can be expressed as a nonlinear equality constraint. Therefore, the bilevel programming model for MNDP can be transformed into an equivalent single-level optimization problem. By exploring the inherent nature of the MNDP, the optimal-value function for the lower-level equilibrium assignment problem is proved to be continuously differentiable and its functional value and gradient can be obtained efficiently. Thus, a continuously differentiable but still nonconvex optimization formulation of the MNDP is created, and then a locally convergent algorithm is proposed by applying penalty function method. The inner loop of solving the subproblem is mainly to implement an all-or-nothing assignment. Finally, a small-scale transportation network and a large-scale network are presented to verify the proposed model and algorithm.

  20. A Weak Solution of a Stochastic Nonlinear Problem

    Directory of Open Access Journals (Sweden)

    M. L. Hadji

    2015-01-01

    Full Text Available We consider a problem modeling a porous medium with a random perturbation. This model occurs in many applications such as biology, medical sciences, oil exploitation, and chemical engineering. Many authors focused their study mostly on the deterministic case. The more classical one was due to Biot in the 50s, where he suggested to ignore everything that happens at the microscopic level, to apply the principles of the continuum mechanics at the macroscopic level. Here we consider a stochastic problem, that is, a problem with a random perturbation. First we prove a result on the existence and uniqueness of the solution, by making use of the weak formulation. Furthermore, we use a numerical scheme based on finite differences to present numerical results.

  1. ON TRANSMISSION PROBLEM FOR KIRCHHOFF TYPE WAVE EQUATION WITH A LOCALIZED NONLINEAR DISSIPATION IN BOUNDED DOMAIN

    Institute of Scientific and Technical Information of China (English)

    Jeong Ja Bae

    2012-01-01

    In this article,we consider the global existence and decay rates of solutions for the transmission problem of Kirchhoff type wave equations consisting of two physically different types of materials,one component is a Kirchhoff type wave equation with nonlinear time dependent localized dissipation which is effective only on a neighborhood of certain part of the boundary,while the other is a Kirchhoff type wave equation with nonlinear memory.

  2. 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,...

  3. 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

  4. Unknown parameter's variance-covariance propagation and calculation in generalized nonlinear least squares problem

    Institute of Scientific and Technical Information of China (English)

    TAO Hua-xue; GUO Jin-yun

    2005-01-01

    The unknown parameter's variance-covariance propagation and calculation in the generalized nonlinear least squares remain to be studied now,which didn't appear in the internal and external referencing documents. The unknown parameter's variance-covariance propagation formula, considering the two-power terms, was concluded used to evaluate the accuracy of unknown parameter estimators in the generalized nonlinear least squares problem. It is a new variance-covariance formula and opens up a new way to evaluate the accuracy when processing data which have the multi-source,multi-dimensional, multi-type, multi-time-state, different accuracy and nonlinearity.

  5. Application of HPEM to investigate the response and stability of nonlinear problems in vibration

    DEFF Research Database (Denmark)

    Mohammadi, M.H.; Mohammadi, A.; Kimiaeifar, A.

    2010-01-01

    In this work, a powerful analytical method, called He's Parameter Expanding Methods (HPEM) is used to obtain the exact solution of nonlinear problems in nonlinear vibration. In this work, the governing equation is obtained by using Lagrange method, then the nonlinear governing equation is solved...... analytically by He's Parameter Expanding Methods. It is shown that one term in series expansions is sufficient to obtain a highly accurate solution which is valid for the whole domain. Comparison of the obtained solutions with those obtained using numerical method shows that this method is effective...

  6. SOME BOUNDARY VALUE PROBLEMS FOR NONLINEAR DEGENERATE ELLIPTIC EQUATIONS OF SECOND ORDER

    Institute of Scientific and Technical Information of China (English)

    Wen Guochun

    2007-01-01

    The present article deals with some boundary value problems for nonlinear elliptic equations with degenerate rank 0 including the oblique derivative problem. Firstly the formulation and estimates of solutions of the oblique derivative problem are given, and then by the above estimates and the method of parameter extension, the existence of solutions of the above problem is proved. In this article, the complex analytic method is used, namely the corresponding problem for degenerate elliptic complex equations of first order is firstly discussed, afterwards the above problem for the degenerate elliptic equations of second order is solved.

  7. OBLIQUE DERIVATIVE PROBLEMS FOR SECOND ORDER NONLINEAR MIXED EQUATIONS WITH DEGENERATE LINE

    Institute of Scientific and Technical Information of China (English)

    Wen Guochun

    2008-01-01

    The present article deals with oblique derivative problems for some nonlin-ear mixed equations with parabolic degeneracy, which include the Tricomi problem as a special case. First, the formulation of the problems for the equations is given; next, the representation and estimates of solutions for the above problems are obtained; finally, the existence of solutions for the problems is proved by the successive iteration and the com-pactness principle of solutions of the problems. In this article, the author uses the complex method, namely, the complex functions in the elliptic domain and the hyperbolic complex functions in hyperbolic domain are used.

  8. A UNIVERSAL APPROACH FOR CONTINUOUS OR DISCRETE NONLINEAR PROGRAMMINGS WITH MULTIPLE VARIABLES AND CONSTRAINTS

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    A universal numerical approach for nonlinear mathematic programming problems is presented with an application of ratios of first-order differentials/differences of objective functions to constraint functions with respect to design variables. This approach can be efficiently used to solve continuous and, in particular, discrete programmings with arbitrary design variables and constraints. As a search method, this approach requires only computations of the functions and their partial derivatives or differences with respect to design variables, rather than any solution of mathematic equations. The present approach has been applied on many numerical examples as well as on some classical operational problems such as one-dimensional and two-dimensional knap-sack problems, one-dimensional and two-dimensional resource-distribution problems, problems of working reliability of composite systems and loading problems of machine, and more efficient and reliable solutions are obtained than traditional methods. The present approach can be used without limitation of modeling scales of the problem. Optimum solutions can be guaranteed as long as the objective function,constraint functions and their first-order derivatives/differences exist in the feasible domain or feasible set. There are no failures of convergence and instability when this approach is adopted.

  9. A Combined Homotopy Infeasible Interior-Point Method for Convex Nonlinear Programming%凸非线性规划的同伦不可能内点算法

    Institute of Scientific and Technical Information of China (English)

    杨轶华; 吕显瑞; 刘庆怀

    2006-01-01

    In this paper, on the basis of the logarithmic barrier function and KKT conditions, we propose a combined homotopy infeasible interior-point method (CHIIP)for convex nonlinear programming problems. For any convex nonlinear programming,without strict convexity for the logarithmic barrier function, we get different solutions of the convex programming in different cases by CHIIP method.

  10. 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.

  11. 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.

  12. A-monotonicity and applications to nonlinear variational inclusion problems

    Directory of Open Access Journals (Sweden)

    Ram U. Verma

    2004-01-01

    Full Text Available A new notion of the A-monotonicity is introduced, which generalizes the H-monotonicity. Since the A-monotonicity originates from hemivariational inequalities, and hemivariational inequalities are connected with nonconvex energy functions, it turns out to be a useful tool proving the existence of solutions of nonconvex constrained problems as well.

  13. Linear combination of forecasts with numerical adjustment via MINIMAX non-linear programming

    Directory of Open Access Journals (Sweden)

    Jairo Marlon Corrêa

    2016-03-01

    Full Text Available This paper proposes a linear combination of forecasts obtained from three forecasting methods (namely, ARIMA, Exponential Smoothing and Artificial Neural Networks whose adaptive weights are determined via a multi-objective non-linear programming problem, which seeks to minimize, simultaneously, the statistics: MAE, MAPE and MSE. The results achieved by the proposed combination are compared with the traditional approach of linear combinations of forecasts, where the optimum adaptive weights are determined only by minimizing the MSE; with the combination method by arithmetic mean; and with individual methods

  14. Some comparison of restarted GMRES and QMR for linear and nonlinear problems

    Energy Technology Data Exchange (ETDEWEB)

    Morgan, R. [Baylor Univ., Waco, TX (United States); Joubert, W. [Los Alamos National Lab., NM (United States)

    1994-12-31

    Comparisons are made between the following methods: QMR including its transpose-free version, restarted GMRES, and a modified restarted GMRES that uses approximate eigenvectors to improve convergence, For some problems, the modified GMRES is competitive with or better than QMR in terms of the number of matrix-vector products. Also, the GMRES methods can be much better when several similar systems of linear equations must be solved, as in the case of nonlinear problems and ODE problems.

  15. A NONLOCAL NONLINEAR BOUNDARY VALUE PROBLEM FOR THE HEAT EQUATIONS

    Institute of Scientific and Technical Information of China (English)

    YANJINHAI

    1996-01-01

    The existenoe and limit hehaviour of the solution for a kind of nonloeal noulinear boundary value condition on a part of the boundary is studied for the heat equation, which physicallymeans that the potential is the function of the total flux. When this part of boundary shrinks to a point in a certain way, this condition either results in a Dirac measure or simply disappears in the corresponding problem.

  16. Nodal Solutions for a Nonlinear Fourth-Order Eigenvalue Problem

    Institute of Scientific and Technical Information of China (English)

    Ru Yun MA; Bevan THOMPSON

    2008-01-01

    We are concerned with determining the values of λ, for which there exist nodal solutions of the fourth-order boundary value problem y =λa(x)f(y),00 for all u ≠0. We give conditions on the ratio f (s)/s,at infinity and zero, that guarantee the existence of nodal solutions.The proof of our main results is based upon bifurcation techniques.

  17. Fast Inverse Nonlinear Fourier Transforms for Fiber Bragg Grating Design and Related Problems

    CERN Document Server

    Wahls, Sander

    2016-01-01

    The problem of constructing a fiber Bragg grating profile numerically such that the reflection coefficient of the grating matches a given specification is considered. The well-known analytic solution to this problem is given by a suitable inverse nonlinear Fourier transform (also known as inverse scattering transform) of the specificed reflection coefficient. Many different algorithms have been proposed to compute this inverse nonlinear Fourier transform numerically. The most efficient ones require $\\mathcal{O}(D^{2})$ floating point operations (flops) to generate $D$ samples of the grating profile. In this paper, two new fast inverse nonlinear Fourier transform algorithms that require only $\\mathcal{O}(D\\log^{2}D)$ flops are proposed. The merits of our algorithms are demonstrated in numerical examples, in which they are compared to a conventional layer peeling method, the Toeplitz inner bordering method and integral layer peeling. One of our two algorithms also extends to the design problem for fiber-assiste...

  18. Application of a new method of nonlinear dynamical system identification to biochemical problems.

    Science.gov (United States)

    Karnaukhov, A V; Karnaukhova, E V

    2003-03-01

    The system identification method for a variety of nonlinear dynamic models is elaborated. The problem of identification of an original nonlinear model presented as a system of ordinary differential equations in the Cauchy explicit form with a polynomial right part reduces to the solution of the system of linear equations for the constants of the dynamical model. In other words, to construct an integral model of the complex system (phenomenon), it is enough to collect some data array characterizing the time-course of dynamical parameters of the system. Collection of such a data array has always been a problem. However difficulties emerging are, as a rule, not principal and may be overcome almost without exception. The potentialities of the method under discussion are demonstrated by the example of the test problem of multiparametric nonlinear oscillator identification. The identification method proposed may be applied to the study of different biological systems and in particular the enzyme kinetics of complex biochemical reactions.

  19. A Nonlinear Programming Perspective on Sensitivity Calculations for Systems Governed by State Equations

    Science.gov (United States)

    Lewis, Robert Michael

    1997-01-01

    This paper discusses the calculation of sensitivities. or derivatives, for optimization problems involving systems governed by differential equations and other state relations. The subject is examined from the point of view of nonlinear programming, beginning with the analytical structure of the first and second derivatives associated with such problems and the relation of these derivatives to implicit differentiation and equality constrained optimization. We also outline an error analysis of the analytical formulae and compare the results with similar results for finite-difference estimates of derivatives. We then attend to an investigation of the nature of the adjoint method and the adjoint equations and their relation to directions of steepest descent. We illustrate the points discussed with an optimization problem in which the variables are the coefficients in a differential operator.

  20. 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.

  1. A Nonlinear Lagrange Algorithm for Stochastic Minimax Problems Based on Sample Average Approximation Method

    Directory of Open Access Journals (Sweden)

    Suxiang He

    2014-01-01

    Full Text Available An implementable nonlinear Lagrange algorithm for stochastic minimax problems is presented based on sample average approximation method in this paper, in which the second step minimizes a nonlinear Lagrange function with sample average approximation functions of original functions and the sample average approximation of the Lagrange multiplier is adopted. Under a set of mild assumptions, it is proven that the sequences of solution and multiplier obtained by the proposed algorithm converge to the Kuhn-Tucker pair of the original problem with probability one as the sample size increases. At last, the numerical experiments for five test examples are performed and the numerical results indicate that the algorithm is promising.

  2. On a nonlinear elliptic problem with critical potential in R2

    Institute of Scientific and Technical Information of China (English)

    SHEN; Yaotian; YAO; Yangxin; HEN; Zhihui

    2004-01-01

    Consider the existence of nontrivial solutions of homogeneous Dirichlet problem for a nonlinear elliptic equation with the critical potential in R2. By establishing a weighted inequality with the best constant, determine the critical potential in R2, and study the eigenvalues of Laplace equation with the critical potential. By the Pohozaev identity of a solution with a singular point and the Cauchy-Kovalevskaya theorem, obtain the nonexistence result of solutions with singular points to the nonlinear elliptic equation. Moreover, for the same problem, the existence results of multiple solutions are proved by the mountain pass theorem.

  3. The Modified Adomian Decomposition Method for Nonlinear Fractional Boundary Value Problems

    Institute of Scientific and Technical Information of China (English)

    WANG Jie

    2012-01-01

    We use the modified Adomian decomposition method(ADM) for solving the nonlinear fractional boundary value problem Dα0+u(x)=f(x,u(x)), 0<x<1, 3<α≤4u(0) =α0, u″(0) =α2 (1)u(1) =β0, u″(1) =β2where Dα0+u is Caputo fractional derivative and α0,α2,β0,β2 is not zero at all,and f:[0,1] x R → R is continuous.The calculated numerical results show reliability and efficiency of the algorithm given.The numerical procedure is tested on linear and nonlinear problems.

  4. ASYMPTOTIC THEORY OF INITIAL VALUE PROBLEMS FOR NONLINEAR PERTURBED KLEIN-GORDON EQUATIONS

    Institute of Scientific and Technical Information of China (English)

    GAN Zai-hui; ZHANG Jian

    2005-01-01

    The asymptotic theory of initial value problems for a class of nonlinear perturbed Klein-Gordon equations in two space dimensions is considered. Firstly, using the contraction mapping principle, combining some priori estimates and the convergence of Bessel function, the well-posedness of solutions of the initial value problem in twice continuous differentiable space was obtained according to the equivalent integral equation of initial value problem for the Klein-Gordon equations. Next, formal approximations of initial value problem was constructed by perturbation method and the asymptotic validity of the formal approximation is got. Finally, an application of the asymptotic theory was given, the asymptotic approximation degree of solutions for the initial value problem of a specific nonlinear Klein-Gordon equation was analyzed by using the asymptotic approximation theorem.

  5. Time-domain analysis of nonlinear motion responses and structural loads on ships and offshore structures: development of WISH programs

    Directory of Open Access Journals (Sweden)

    Yonghwan Kim

    2011-03-01

    Full Text Available The present paper introduced a computer program, called WISH, which is based on a time-domain Rankine panel method. The WISH has been developed for practical use to predict the linear and nonlinear ship motion and structural loads in waves. The WISH adopts three different levels of seakeeping analysis: linear, weakly-nonlinear and weak-scatterer approaches. Later, WISH-FLEX has been developed to consider hydroelasticity effects on hull-girder structure. This program can solve the springing and whipping problems by coupling between the hydrodynamic and structural problems. More recently this development has been continued to more diverse problems, including the motion responses of multiple adjacent bodies, the effects of seakeeping in ship maneuvering, and the floating-body motion in finite-depth domain with varying bathymetry. This paper introduces a brief theoretical and numerical background of the WISH package, and some validation results. Also several applications to real ships and offshore structures are shown.

  6. 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

  7. 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

  8. Studies in nonlinear problems of energy. Progress report, January 1, 1992--December 31, 1992

    Energy Technology Data Exchange (ETDEWEB)

    Matkowsky, B.J.

    1992-07-01

    Emphasis has been on combustion and flame propagation. The research program was on modeling, analysis and computation of combustion phenomena, with emphasis on transition from laminar to turbulent combustion. Nonlinear dynamics and pattern formation were investigated in the transition. Stability of combustion waves, and transitions to complex waves are described. Combustion waves possess large activation energies, so that chemical reactions are significant only in thin layers, or reaction zones. In limit of infinite activation energy, the zones shrink to moving surfaces, (fronts) which must be found during the analysis, so that (moving free boundary problems). The studies are carried out for limiting case with fronts, while the numerical studies are carried out for finite, though large, activation energy. Accurate resolution of the solution in the reaction zones is essential, otherwise false predictions of dynamics are possible. Since the the reaction zones move, adaptive pseudo-spectral methods were developed. The approach is based on a synergism of analytical and computational methods. The numerical computations build on and extend the analytical information. Furthermore, analytical solutions serve as benchmarks for testing the accuracy of the computation. Finally, ideas from analysis (singular perturbation theory) have induced new approaches to computations. The computational results suggest new analysis to be considered. Among the recent interesting results, was spatio-temporal chaos in combustion. One goal is extension of the adaptive pseudo-spectral methods to adaptive domain decomposition methods. Efforts have begun to develop such methods for problems with multiple reaction zones, corresponding to problems with more complex, and more realistic chemistry. Other topics included stochastics, oscillators, Rysteretic Josephson junctions, DC SQUID, Markov jumps, laser with saturable absorber, chemical physics, Brownian movement, combustion synthesis, etc.

  9. A boundary control problem with a nonlinear reaction term

    Directory of Open Access Journals (Sweden)

    John R. Cannon

    2009-04-01

    Full Text Available The authors study the problem $u_t=u_{xx}-au$, $00$; $u(x,0=0$, and $-u_x(0,t=u_x(1,t=phi(t$, where $a=a(x,t,u$, and $phi(t=1$ for $t_{2k} < t

  10. Optimum sensitivity derivatives of objective functions in nonlinear programming

    Science.gov (United States)

    Barthelemy, J.-F. M.; Sobieszczanski-Sobieski, J.

    1983-01-01

    The feasibility of eliminating second derivatives from the input of optimum sensitivity analyses of optimization problems is demonstrated. This elimination restricts the sensitivity analysis to the first-order sensitivity derivatives of the objective function. It is also shown that when a complete first-order sensitivity analysis is performed, second-order sensitivity derivatives of the objective function are available at little additional cost. An expression is derived whose application to linear programming is presented.

  11. An efficient and simple approximate technique for solving nonlinear initial and boundary-value problems

    Science.gov (United States)

    Kounadis, A. N.

    1992-05-01

    An efficient and easily applicable, approximate analytic technique for the solution of nonlinear initial and boundary-value problems associated with nonlinear ordinary differential equations (O.D.E.) of any order and variable coefficients, is presented. Convergence, uniqueness and upper bound error estimates of solutions, obtained by the successive approximations scheme of the proposed technique, are thoroughly established. Important conclusions regarding the improvement of convergence for large time and large displacement solutions in case of nonlinear initial-value problems are also assessed. The proposed technique is much more efficient than the perturbations schemes for establishing the large postbuckling response of structural systems. The efficiency, simplicity and reliability of the proposed technique is demonstrated by two illustrative examples for which available numerical results exist.

  12. Mathematical modeling of materially nonlinear problems in structural analyses, Part II: Application in contemporary software

    Directory of Open Access Journals (Sweden)

    Bonić Zoran

    2010-01-01

    Full Text Available The paper presents application of nonlinear material models in the software package Ansys. The development of the model theory is presented in the paper of the mathematical modeling of material nonlinear problems in structural analysis (part I - theoretical foundations, and here is described incremental-iterative procedure for solving problems of nonlinear material used by this package and an example of modeling of spread footing by using Bilinear-kinematics and Drucker-Prager mode was given. A comparative analysis of the results obtained by these modeling and experimental research of the author was made. Occurrence of the load level that corresponds to plastic deformation was noted, development of deformations with increasing load, as well as the distribution of dilatation in the footing was observed. Comparison of calculated and measured values of reinforcement dilatation shows their very good agreement.

  13. Analysis of search-extension method for finding multiple solutions of nonlinear problem

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    For numerical computations of multiple solutions of the nonlinear elliptic problemΔu+ f(u)=0 inΩ, u=0 onΓ, a search-extension method (SEM) was proposed and systematically studied by the authors. This paper shall complete its theoretical analysis. It is assumed that the nonlinearity is non-convex and its solution is isolated, under some conditions the corresponding linearized problem has a unique solution. By use of the compactness of the solution family and the contradiction argument, in general conditions, the high order regularity of the solution u∈H1+α,α>0 is proved. Assume that some initial value searched by suitably many eigenbases is already fallen into the neighborhood of the isolated solution, then the optimal error estimates of its nonlinear finite element approximation are shown by the duality argument and continuation method.

  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. An improved iterative technique for solving nonlinear doubly singular two-point boundary value problems

    Science.gov (United States)

    Roul, Pradip

    2016-06-01

    This paper presents a new iterative technique for solving nonlinear singular two-point boundary value problems with Neumann and Robin boundary conditions. The method is based on the homotopy perturbation method and the integral equation formalism in which a recursive scheme is established for the components of the approximate series solution. This method does not involve solution of a sequence of nonlinear algebraic or transcendental equations for the unknown coefficients as in some other iterative techniques developed for singular boundary value problems. The convergence result for the proposed method is established in the paper. The method is illustrated by four numerical examples, two of which have physical significance: The first problem is an application of the reaction-diffusion process in a porous spherical catalyst and the second problem arises in the study of steady-state oxygen-diffusion in a spherical cell with Michaelis-Menten uptake kinetics.

  16. A New Kind of Simple Smooth Exact Penalty Function of Constrained Nonlinear Programming

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    The penalty function method is one basic method for solving constrained nonlinear programming, in which simple smooth exact penalty functions draw much attention for their simpleness and smoothness. This article offers a new kind of simple smooth approximative exact penalty function of general constrained nonlinear programmings and analyzes its properties.

  17. Long step homogeneous interior point algorithm for the p* nonlinear complementarity problems

    Directory of Open Access Journals (Sweden)

    Lešaja Goran

    2002-01-01

    Full Text Available A P*-Nonlinear Complementarity Problem as a generalization of the P*-Linear Complementarity Problem is considered. We show that the long-step version of the homogeneous self-dual interior-point algorithm could be used to solve such a problem. The algorithm achieves linear global convergence and quadratic local convergence under the following assumptions: the function satisfies a modified scaled Lipschitz condition, the problem has a strictly complementary solution, and certain submatrix of the Jacobian is nonsingular on some compact set.

  18. THE NONLINEAR NONLOCAL SINGULARLY PERTURBED PROBLEMS FOR REACTION DIFFUSION EQUATIONS WITH A BOUNDARY PERTURBATION

    Institute of Scientific and Technical Information of China (English)

    Jingsun Yao; Jiaqi Mo

    2005-01-01

    The nonlinear nonlocal singularly perturbed initial boundary value problems for reaction diffusion equations with a boundary perturbation is considered. Under suitable conditions, the outer solution of the original problem is obtained. Using the stretched variable, the composing expansion method and the expanding theory of power series the initial layer is constructed. And then using the theory of differential inequalities the asymptotic behavior of solution for the initial boundary value problems is studied. Finally the existence and uniqueness of solution for the original problem and the uniformly valid asymptotic estimation are discussed.

  19. A smart nonstandard finite difference scheme for second order nonlinear boundary value problems

    NARCIS (Netherlands)

    Erdogan, Utku; Ozis, Turgut

    2011-01-01

    A new kind of finite difference scheme is presented for special second order nonlinear two point boundary value problems. An artificial parameter is introduced in the scheme. Symbolic computation is proposed for the construction of the scheme. Local truncation error of the method is discussed. Numer

  20. ON THE NONLINEAR RIEMANN PROBLEMS FOR GENERAL FIRST ELLIPTIC SYSTEMS IN THE PLANE

    Institute of Scientific and Technical Information of China (English)

    李明忠; 宋洁

    2005-01-01

    The nonlinear Riemann problem for general systems of the first-order linear and quasi-linear equations in the plane are considered. It translates them to singular integral equations and proves the existence of the solution by means of contract principle or. general contract principle. The known results are generalized.

  1. On the solvability of initial-value problems for nonlinear implicit difference equations

    Directory of Open Access Journals (Sweden)

    Yen Ha Thi Ngoc

    2004-01-01

    Full Text Available Our aim is twofold. First, we propose a natural definition of index for linear nonautonomous implicit difference equations, which is similar to that of linear differential-algebraic equations. Then we extend this index notion to a class of nonlinear implicit difference equations and prove some existence theorems for their initial-value problems.

  2. THE CAUCHY PROBLEM OF NONLINEAR SCHR(O)DINGER-BOUSSINESQ EQUATIONS IN Hs(Rd)

    Institute of Scientific and Technical Information of China (English)

    Han Yongqian

    2005-01-01

    In this paper, the local well posedness and global well posedness of solutions for the initial value problem (IVP) of nonlinear Schrodinger-Boussinesq equations is considered in Hs(Rd) by resorting Besov spaces, where real number s ≥ 0.

  3. On the solvability of initial-value problems for nonlinear implicit difference equations

    Directory of Open Access Journals (Sweden)

    Ha Thi Ngoc Yen

    2004-07-01

    Full Text Available Our aim is twofold. First, we propose a natural definition of index for linear nonautonomous implicit difference equations, which is similar to that of linear differential-algebraic equations. Then we extend this index notion to a class of nonlinear implicit difference equations and prove some existence theorems for their initial-value problems.

  4. A smart nonstandard finite difference scheme for second order nonlinear boundary value problems

    NARCIS (Netherlands)

    Erdogan, Utku; Ozis, Turgut

    2011-01-01

    A new kind of finite difference scheme is presented for special second order nonlinear two point boundary value problems. An artificial parameter is introduced in the scheme. Symbolic computation is proposed for the construction of the scheme. Local truncation error of the method is discussed.

  5. Solutions of Multi Objective Fuzzy Transportation Problems with Non-Linear Membership Functions

    Directory of Open Access Journals (Sweden)

    Dr. M. S. Annie Christi

    2016-11-01

    Full Text Available Multi-objective transportation problem with fuzzy interval numbers are considered. The solution of linear MOTP is obtained by using non-linear membership functions. The optimal compromise solution obtained is compared with the solution got by using a linear membership function. Some numerical examples are presented to illustrate this.

  6. Nonlinear quarter-plane problem for the Korteweg-de Vries equation

    Directory of Open Access Journals (Sweden)

    Nikolai A. Larkin

    2011-08-01

    Full Text Available This article concerns an initial-boundary value problem in a quarter-plane for the Korteweg-de Vries (KdV equation. For general nonlinear boundary conditions we prove the existence and uniqueness of a global regular solution.

  7. PERIODIC BOUNDARY VALUE PROBLEM FOR NONLINEAR INTEGRO-DIFFERENTIAL EQUATION OF MIXED TYPE ON TIME SCALES

    Institute of Scientific and Technical Information of China (English)

    Yepeng Xing; Qiong Wang; Valery G. Romanovski

    2009-01-01

    We prove several new comparison results and develop the monotone iterative tech-nique to show the existence of extremal solutions to a kind of periodic boundary value problem (PBVP) for nonlinear integro-differential equation of mixed type on time scales.

  8. Positive Solutions of a Nonlinear Fourth-order Integral Boundary Value Problem

    Directory of Open Access Journals (Sweden)

    Benaicha Slimane

    2016-07-01

    Full Text Available In this paper, the existence of positive solutions for a nonlinear fourth-order two-point boundary value problem with integral condition is investigated. By using Krasnoselskii’s fixed point theorem on cones, sufficient conditions for the existence of at least one positive solutions are obtained.

  9. THE NONLINEAR BOUNDARY VALUE PROBLEM FOR A CLASS OF INTEGRO-DIFFERENTIAL SYSTEM

    Institute of Scientific and Technical Information of China (English)

    Rongrong Tang

    2006-01-01

    In this paper, using the theory of differential inequalities, we study the nonlinear boundary value problem for a class of integro-differential system. Under appropriate assumptions, the existence of solution is proved and the uniformly valid asymptotic expansions for arbitrary n-th order approximation and the estimation of remainder term are obtained simply and conveniently.

  10. Scenarios for solving a non-linear transportation problem in multi-agent systems

    DEFF Research Database (Denmark)

    Brehm, Robert; Top, Søren; Mátéfi-Tempfli, Stefan

    2017-01-01

    We introduce and provide an evaluation on two scenarios and related algorithms for implementation of a multi-agent system to solve a type of non-linear transportation problem using distributed optimization algorithms based on dual decomposition and consensus. The underlying fundamental optimization...

  11. EXISTENCE AND UNIQUENESS RESULTS FOR NONLINEAR THIRD-ORDER BOUNDARY VALUE PROBLEM

    Institute of Scientific and Technical Information of China (English)

    2009-01-01

    In this paper,we investigate a nonlinear third-order three-point boundary value problem. By several well-known fixed point theorems,the existence of positive solutions is discussed. Besides,the uniqueness results are obtained by imposing growth restrictions on f.

  12. Multiple Positive Solutions of Boundary Value Problems for Systems of Nonlinear Third-Order Differential Equations

    Institute of Scientific and Technical Information of China (English)

    Yaohong LI; Xiaoyan ZHANG

    2013-01-01

    In this paper,we consider boundary value problems for systems of nonlinear thirdorder differential equations.By applying the fixed point theorems of cone expansion and compression of norm type and Leggett-Williams fixed point theorem,the existence of multiple positive solutions is obtained.As application,we give some examples to demonstrate our results.

  13. Existence of three solutions for impulsive nonlinear fractional boundary value problems

    Directory of Open Access Journals (Sweden)

    Shapour Heidarkhani

    2017-01-01

    Full Text Available In this work we present new criteria on the existence of three solutions for a class of impulsive nonlinear fractional boundary-value problems depending on two parameters. We use variational methods for smooth functionals defined on reflexive Banach spaces in order to achieve our results.

  14. Existence of Two Solutions of Nonlinear m-Point Boundary Value Problems

    Institute of Scientific and Technical Information of China (English)

    任景莉; 葛渭高

    2003-01-01

    Sufficient conditions for the existence of at least two positive solutions of a nonlinear m-points boundary value problems are established. The results are obtained by using a new fixed point theorem in cones. An example is provided to illustrate the theory.

  15. The Application of the Fixed—point Theory in Jacketed Solution of Singularly Perturbed Nonlinear Problem

    Institute of Scientific and Technical Information of China (English)

    CHENGYan

    2003-01-01

    In this paper,the fixed-point theorem is used to estimated an asymptotic solution of intial val-ue problems for a class of third nonlinear differential equations which has double initial-layer properties.We obtain the uniformly valid asymptotic expansion of any orders including boundary layers.

  16. A two-phase free boundary problem for a nonlinear diffusion-convection equation

    Energy Technology Data Exchange (ETDEWEB)

    De Lillo, S; Lupo, G [Dipartimento di Matematica e Informatica, Universita degli Studi di Perugia, Via Vanvitelli 1, 06123 Perugia (Italy)], E-mail: silvana.delillo@pg.infn.it

    2008-04-11

    A two-phase free boundary problem associated with a diffusion-convection equation is considered. The problem is reduced to a system of nonlinear integral equations, which admits a unique solution for small times. The system admits an explicit two-component solution corresponding to a two-component shock wave of the Burgers equation. The stability of such a solution is also discussed.

  17. Existence results for boundary problems for uniformly elliptic and parabolic fully nonlinear equations

    Directory of Open Access Journals (Sweden)

    M. G. Crandall

    1999-07-01

    Full Text Available We study existence of continuous weak (viscosity solutions of Dirichlet and Cauchy-Dirichlet problems for fully nonlinear uniformly elliptic and parabolic equations. Two types of results are obtained in contexts where uniqueness of solutions fails or is unknown. For equations with merely measurable coefficients we prove solvability of the problem, while in the continuous case we construct maximal and minimal solutions. Necessary barriers on external cones are also constructed.

  18. Nonlinear boundary value problems for first order impulsive integro-differential equations

    Directory of Open Access Journals (Sweden)

    Xinzhi Liu

    1989-01-01

    Full Text Available In this paper, we investigate a class of first order impulsive integro-differential equations subject to certain nonlinear boundary conditions and prove, with the help of upper and lower solutions, that the problem has a solution lying between the upper and lower solutions. We also develop monotone iterative technique and show the existence of multiple solutions of a class of periodic boundary value problems.

  19. On the System of Nonlinear Mixed Implicit Equilibrium Problems in Hilbert Spaces

    Directory of Open Access Journals (Sweden)

    Yeol Je Cho

    2010-01-01

    Full Text Available We use the Wiener-Hopf equations and the Yosida approximation notions to prove the existence theorem of a system of nonlinear mixed implicit equilibrium problems (SMIE in Hilbert spaces. The algorithm for finding a solution of the problem (SMIE is suggested; the convergence criteria and stability of the iterative algorithm are discussed. The results presented in this paper are more general and are viewed as an extension, refinement, and improvement of the previously known results in the literature.

  20. Multiple positive solutions for Kirchhoff type problems involving concave and convex nonlinearities in R^3

    Directory of Open Access Journals (Sweden)

    Xiaofei Cao

    2016-11-01

    Full Text Available In this article, we consider the multiplicity of positive solutions for a class of Kirchhoff type problems with concave and convex nonlinearities. Under appropriate assumptions, we prove that the problem has at least two positive solutions, moreover, one of which is a positive ground state solution. Our approach is mainly based on the Nehari manifold, Ekeland variational principle and the theory of Lagrange multipliers.

  1. Error estimations of mixed finite element methods for nonlinear problems of shallow shell theory

    Science.gov (United States)

    Karchevsky, M.

    2016-11-01

    The variational formulations of problems of equilibrium of a shallow shell in the framework of the geometrically and physically nonlinear theory by boundary conditions of different main types, including non-classical, are considered. Necessary and sufficient conditions for their solvability are derived. Mixed finite element methods for the approximate solutions to these problems based on the use of second derivatives of the bending as auxiliary variables are proposed. Estimations of accuracy of approximate solutions are established.

  2. Initial value problem for a class of fourth-order nonlinear wave equations

    Institute of Scientific and Technical Information of China (English)

    Guo-wang CHEN; Chang-shun HOU

    2009-01-01

    In this paper, existence and uniqueness of the generalized global solution and the classical global solution to the initial value problem for a class of fourth-order nonlinear wave equations are studied in the fractional order Sobolev space using the contraction mapping principle and the extension theorem. The sufficient conditions for the blow up of the solution to the initial value problem are given.

  3. On a Mixed Nonlinear One Point Boundary Value Problem for an Integrodifferential Equation

    Directory of Open Access Journals (Sweden)

    Said Mesloub

    2008-03-01

    Full Text Available This paper is devoted to the study of a mixed problem for a nonlinear parabolic integro-differential equation which mainly arise from a one dimensional quasistatic contact problem. We prove the existence and uniqueness of solutions in a weighted Sobolev space. Proofs are based on some a priori estimates and on the Schauder fixed point theorem. we also give a result which helps to establish the regularity of a solution.

  4. On a Mixed Nonlinear One Point Boundary Value Problem for an Integrodifferential Equation

    Directory of Open Access Journals (Sweden)

    Mesloub Said

    2008-01-01

    Full Text Available This paper is devoted to the study of a mixed problem for a nonlinear parabolic integro-differential equation which mainly arise from a one dimensional quasistatic contact problem. We prove the existence and uniqueness of solutions in a weighted Sobolev space. Proofs are based on some a priori estimates and on the Schauder fixed point theorem. we also give a result which helps to establish the regularity of a solution.

  5. Iterative Adaptive Dynamic Programming for Solving Unknown Nonlinear Zero-Sum Game Based on Online Data.

    Science.gov (United States)

    Zhu, Yuanheng; Zhao, Dongbin; Li, Xiangjun

    2017-03-01

    H∞ control is a powerful method to solve the disturbance attenuation problems that occur in some control systems. The design of such controllers relies on solving the zero-sum game (ZSG). But in practical applications, the exact dynamics is mostly unknown. Identification of dynamics also produces errors that are detrimental to the control performance. To overcome this problem, an iterative adaptive dynamic programming algorithm is proposed in this paper to solve the continuous-time, unknown nonlinear ZSG with only online data. A model-free approach to the Hamilton-Jacobi-Isaacs equation is developed based on the policy iteration method. Control and disturbance policies and value are approximated by neural networks (NNs) under the critic-actor-disturber structure. The NN weights are solved by the least-squares method. According to the theoretical analysis, our algorithm is equivalent to a Gauss-Newton method solving an optimization problem, and it converges uniformly to the optimal solution. The online data can also be used repeatedly, which is highly efficient. Simulation results demonstrate its feasibility to solve the unknown nonlinear ZSG. When compared with other algorithms, it saves a significant amount of online measurement time.

  6. An inner-outer nonlinear programming approach for constrained quadratic matrix model updating

    Science.gov (United States)

    Andretta, M.; Birgin, E. G.; Raydan, M.

    2016-01-01

    The Quadratic Finite Element Model Updating Problem (QFEMUP) concerns with updating a symmetric second-order finite element model so that it remains symmetric and the updated model reproduces a given set of desired eigenvalues and eigenvectors by replacing the corresponding ones from the original model. Taking advantage of the special structure of the constraint set, it is first shown that the QFEMUP can be formulated as a suitable constrained nonlinear programming problem. Using this formulation, a method based on successive optimizations is then proposed and analyzed. To avoid that spurious modes (eigenvectors) appear in the frequency range of interest (eigenvalues) after the model has been updated, additional constraints based on a quadratic Rayleigh quotient are dynamically included in the constraint set. A distinct practical feature of the proposed method is that it can be implemented by computing only a few eigenvalues and eigenvectors of the associated quadratic matrix pencil.

  7. A Dynamic Programming Algorithm for the k-Haplotyping Problem

    Institute of Scientific and Technical Information of China (English)

    Zhen-ping Li; Ling-yun Wu; Yu-ying Zhao; Xiang-sun Zhang

    2006-01-01

    The Minimum Fragments Removal (MFR) problem is one of the haplotyping problems: given a set of fragments, remove the minimum number of fragments so that the resulting fragments can be partitioned into k classes of non-conflicting subsets. In this paper, we formulate the k-MFR problem as an integer linear programming problem, and develop a dynamic programming approach to solve the k-MFR problem for both the gapless and gap cases.

  8. Policy iteration adaptive dynamic programming algorithm for discrete-time nonlinear systems.

    Science.gov (United States)

    Liu, Derong; Wei, Qinglai

    2014-03-01

    This paper is concerned with a new discrete-time policy iteration adaptive dynamic programming (ADP) method for solving the infinite horizon optimal control problem of nonlinear systems. The idea is to use an iterative ADP technique to obtain the iterative control law, which optimizes the iterative performance index function. The main contribution of this paper is to analyze the convergence and stability properties of policy iteration method for discrete-time nonlinear systems for the first time. It shows that the iterative performance index function is nonincreasingly convergent to the optimal solution of the Hamilton-Jacobi-Bellman equation. It is also proven that any of the iterative control laws can stabilize the nonlinear systems. Neural networks are used to approximate the performance index function and compute the optimal control law, respectively, for facilitating the implementation of the iterative ADP algorithm, where the convergence of the weight matrices is analyzed. Finally, the numerical results and analysis are presented to illustrate the performance of the developed method.

  9. A URI 4-NODE QUADRILATERAL ELEMENT BY ASSUMED STRAIN METHOD FOR NONLINEAR PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    WANG Jinyan; CHEN Jun; LI Minghui

    2004-01-01

    In this paper one-point quadrature "assumed strain" mixed element formulation based on the Hu-Washizu variational principle is presented. Special care is taken to avoid hourglass modes and volumetric locking as well as shear locking. The assumed strain fields are constructed so that those portions of the fields which lead to volumetric and shear locking phenomena are eliminated by projection, while the implementation of the proposed URI scheme is straightforward to suppress hourglass modes. In order to treat geometric nonlinearities simply and efficiently, a corotational coordinate system is used. Several numerical examples are given to demonstrate the performance of the suggested formulation, including nonlinear static/dynamic mechanical problems.

  10. Local-instantaneous filtering in the integral transform solution of nonlinear diffusion problems

    Science.gov (United States)

    Macêdo, E. N.; Cotta, R. M.; Orlande, H. R. B.

    A novel filtering strategy is proposed to be utilized in conjunction with the Generalized Integral Transform Technique (GITT), in the solution of nonlinear diffusion problems. The aim is to optimize convergence enhancement, yielding computationally efficient eigenfunction expansions. The proposed filters include space and time dependence, extracted from linearized versions of the original partial differential system. The scheme automatically updates the filter along the time integration march, as the required truncation orders for the user requested accuracy begin to exceed a prescribed maximum system size. A fully nonlinear heat conduction example is selected to illustrate the computational performance of the filtering strategy, against the classical single-filter solution behavior.

  11. Nonlinear evolution equations associated with the chiral-field spectral problem

    Energy Technology Data Exchange (ETDEWEB)

    Bruschi, M.; Ragnisco, O. (Istituto Nazionale di Fisica Nucleare, Roma (Italy); Dipt. di Fisica, Univ. Rome (Italy))

    1985-08-11

    In this paper we derive and investigate the class of nonlinear evolution equations (NEEs) associated with the linear problem psisub(x) = lambdaApsi. It turns out that many physically interesting NEEs pertain to this class: for instance, the chiral-field equation, the nonlinear Klein-Gordon equations, the Heisenberg and Papanicolau spin chain models, the modified Boussinesq equation, the Wadati-Konno-Ichikawa equations, etc. We display also the Baecklund transformations for such a class and exploit them to derive in a special case the one-soliton solution.

  12. An iterative regularization method for nonlinear problems based on Bregman projections

    Science.gov (United States)

    Maaß, Peter; Strehlow, Robin

    2016-11-01

    In this paper, we present an iterative method for the regularization of ill-posed, nonlinear problems. The approach is based on the Bregman projection onto stripes the width of which is controlled by both the noise level and the structure of the operator. In our investigations, we follow (Lorenz et al 2014 SIAM J. Imaging Sci. 7 1237-62) and extend the respective method to the setting of nonlinear operators. Furthermore, we present a proof for the regularizing properties of the method.

  13. On the Cauchy problem for nonlinear Schrödinger equations with rotation

    KAUST Repository

    Antonelli, Paolo

    2011-10-01

    We consider the Cauchy problem for (energy-subcritical) nonlinear Schrödinger equations with sub-quadratic external potentials and an additional angular momentum rotation term. This equation is a well-known model for superuid quantum gases in rotating traps. We prove global existence (in the energy space) for defocusing nonlinearities without any restriction on the rotation frequency, generalizing earlier results given in [11, 12]. Moreover, we find that the rotation term has a considerable in fiuence in proving finite time blow-up in the focusing case.

  14. The Scattering Problem for a Noncommutative Nonlinear Schrödinger Equation

    Directory of Open Access Journals (Sweden)

    Bergfinnur Durhuus

    2010-06-01

    Full Text Available We investigate scattering properties of a Moyal deformed version of the nonlinear Schrödinger equation in an even number of space dimensions. With rather weak conditions on the degree of nonlinearity, the Cauchy problem for general initial data has a unique globally defined solution, and also has solitary wave solutions if the interaction potential is suitably chosen. We demonstrate how to set up a scattering framework for equations of this type, including appropriate decay estimates of the free time evolution and the construction of wave operators defined for small scattering data in the general case and for arbitrary scattering data in the rotationally symmetric case.

  15. Domain decomposition based iterative methods for nonlinear elliptic finite element problems

    Energy Technology Data Exchange (ETDEWEB)

    Cai, X.C. [Univ. of Colorado, Boulder, CO (United States)

    1994-12-31

    The class of overlapping Schwarz algorithms has been extensively studied for linear elliptic finite element problems. In this presentation, the author considers the solution of systems of nonlinear algebraic equations arising from the finite element discretization of some nonlinear elliptic equations. Several overlapping Schwarz algorithms, including the additive and multiplicative versions, with inexact Newton acceleration will be discussed. The author shows that the convergence rate of the Newton`s method is independent of the mesh size used in the finite element discretization, and also independent of the number of subdomains into which the original domain in decomposed. Numerical examples will be presented.

  16. Exponential distribution-based genetic algorithm for solving mixed-integer bilevel programming problems

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    Two classes of mixed-integer nonlinear bilevel programming problems are discussed. One is that the follower's functions are separable with respect to the follower's variables, and the other is that the follower's functions are convex if the follower's variables are not restricted to integers. A genetic algorithm based on an exponential distribution is proposed for the aforementioned problems. First, for each fixed leader's variable x, it is proved that the optimal solution y of the follower's mixed-integer programming can be obtained by solving associated relaxed problems, and according to the convexity of the functions involved, a simplified branch and bound approach is given to solve the follower's programming for the second class of problems. Furthermore, based on an exponential distribution with a parameter A, a new crossover operator is designed in which the best individuals are used to generate better offspring of crossover. The simulation results illustrate that the proposed algorithm is efficient and robust.

  17. Fractional Goal Programming for Fuzzy Solid Transportation Problem with Interval Cost

    Directory of Open Access Journals (Sweden)

    B. Radhakrishnan

    2014-09-01

    Full Text Available In this paper, we study a solid transportation problem with interval cost using fractional goal programming approach (FGP. In real life applications of the FGP problem with multiple objectives, it is difficult for the decision-maker(s to determine the goal value of each objective precisely as the goal values are imprecise, vague, or uncertain. Therefore, a fuzzy goal programming model is developed for this purpose. The proposed model presents an application of fuzzy goal programming to the solid transportation problem. Also, we use a special type of non-linear (hyperbolic membership functions to solve multi-objective transportation problem. It gives an optimal compromise solution. The proposed model is illustrated by using an example.

  18. Local and Global Existence of Solutions to Initial Value Problems of Modified Nonlinear Kawahara Equations

    Institute of Scientific and Technical Information of China (English)

    Shuang Ping TAO; Shang Bin CUI

    2005-01-01

    This paper is devoted to studying the initial value problem of the modified nonlinear Kawahara equation ()u/()t+ a u2()u/()m + β()3u/()x3 + γ()5u-()x5 = 0, (x, t) ∈ We first establish several Strichartz type estimates for the fundamental solution of the corresponding linear problem. Then we apply such estimates to prove local and global existence of solutions for the initial value problem of the modified nonlinear Karahara equation. The results show that a local solution exists if the initial function u0(x) ∈ Hs(R) with s ≥ 1/4, and a global solution exists if s ≥ 2.

  19. A LQP BASED INTERIOR PREDICTION-CORRECTION METHOD FOR NONLINEAR COMPLEMENTARITY PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    Bing-sheng He; Li-zhi Liao; Xiao-ming Yuan

    2006-01-01

    To solve nonlinear complementarity problems (NCP), at each iteration, the classical proximal point algorithm solves a well-conditioned sub-NCP while the LogarithmicQuadratic Proximal (LQP) method solves a system of nonlinear equations (LQP system). This paper presents a practical LQP method-based prediction-correction method for NCP.The predictor is obtained via solving the LQP system approximately under significantly relaxed restriction, and the new iterate (the corrector) is computed directly by an explicit formula derived from the original LQP method. The implementations are very easy to be carried out. Global convergence of the method is proved under the same mild assumptions as the original LQP method. Finally, numerical results for traffic equilibrium problems are provided to verify that the method is effective for some practical problems.

  20. The Uniqueness of Optimal Solution for Linear Programming Problem

    Institute of Scientific and Technical Information of China (English)

    QuanlingWei; HongYan; JunWang

    2004-01-01

    This paper investigates an old problem in operations research, the uniqueness of the optimal solution to a linear programming problem. We discuss the problem on a general polyhedron, give some equivalent conditions for uniqueness testing. In addition, we discuss the implementation issues for linear programming based decision making procedures,which motivated this research.

  1. Bilevel programming problems theory, algorithms and applications to energy networks

    CERN Document Server

    Dempe, Stephan; Pérez-Valdés, Gerardo A; Kalashnykova, Nataliya; Kalashnikova, Nataliya

    2015-01-01

    This book describes recent theoretical findings relevant to bilevel programming in general, and in mixed-integer bilevel programming in particular. It describes recent applications in energy problems, such as the stochastic bilevel optimization approaches used in the natural gas industry. New algorithms for solving linear and mixed-integer bilevel programming problems are presented and explained.

  2. An Algorithm for Efficient Maximum Likelihood Estimation and Confidence Interval Determination in Nonlinear Estimation Problems

    Science.gov (United States)

    Murphy, Patrick Charles

    1985-01-01

    An algorithm for maximum likelihood (ML) estimation is developed with an efficient method for approximating the sensitivities. The algorithm was developed for airplane parameter estimation problems but is well suited for most nonlinear, multivariable, dynamic systems. The ML algorithm relies on a new optimization method referred to as a modified Newton-Raphson with estimated sensitivities (MNRES). MNRES determines sensitivities by using slope information from local surface approximations of each output variable in parameter space. The fitted surface allows sensitivity information to be updated at each iteration with a significant reduction in computational effort. MNRES determines the sensitivities with less computational effort than using either a finite-difference method or integrating the analytically determined sensitivity equations. MNRES eliminates the need to derive sensitivity equations for each new model, thus eliminating algorithm reformulation with each new model and providing flexibility to use model equations in any format that is convenient. A random search technique for determining the confidence limits of ML parameter estimates is applied to nonlinear estimation problems for airplanes. The confidence intervals obtained by the search are compared with Cramer-Rao (CR) bounds at the same confidence level. It is observed that the degree of nonlinearity in the estimation problem is an important factor in the relationship between CR bounds and the error bounds determined by the search technique. The CR bounds were found to be close to the bounds determined by the search when the degree of nonlinearity was small. Beale's measure of nonlinearity is developed in this study for airplane identification problems; it is used to empirically correct confidence levels for the parameter confidence limits. The primary utility of the measure, however, was found to be in predicting the degree of agreement between Cramer-Rao bounds and search estimates.

  3. Interval Solution for Nonlinear Programming of Maximizing the Fatigue Life of V-Belt under Polymorphic Uncertain Environment

    Directory of Open Access Journals (Sweden)

    Zhong Wan

    2013-01-01

    Full Text Available In accord with the practical engineering design conditions, a nonlinear programming model is constructed for maximizing the fatigue life of V-belt drive in which some polymorphic uncertainties are incorporated. For a given satisfaction level and a confidence level, an equivalent formulation of this uncertain optimization model is obtained where only interval parameters are involved. Based on the concepts of maximal and minimal range inequalities for describing interval inequality, the interval parameter model is decomposed into two standard nonlinear programming problems, and an algorithm, called two-step based sampling algorithm, is developed to find an interval optimal solution for the original problem. Case study is employed to demonstrate the validity and practicability of the constructed model and the algorithm.

  4. A two-phase linear programming approach for redundancy allocation problems

    Directory of Open Access Journals (Sweden)

    Hsieh Yi-Chih

    2002-01-01

    Full Text Available Provision of redundant components in parallel is an efficient way to increase the system reliability, however, the weight, volume and cost of the system will increase simultaneously. This paper proposes a new two-phase linear programming approach for solving the nonlinear redundancy allocation problems subject to multiple linear constraints. The first phase is used to approximately allocate the resource by using a general linear programming, while the second phase is used to re-allocate the slacks of resource by using a 0-1 integer linear programming. Numerical results demonstrate the effectiveness and efficiency of the proposed approach.

  5. A GLOBALLY DERIVATIVE-FREE DESCENT METHOD FOR NONLINEAR COMPLEMENTARITY PROBLEMS

    Institute of Scientific and Technical Information of China (English)

    Hou-duo Qi; Yu-zhong Zhang

    2000-01-01

    Based on a class of functions. which generalize the squared Fischer-Burmeister NCP function and have many desirable properties as the latter function has, we reformulate nonlinear complementarity problem (NCP for short) as an equivalent unconstrained optimization problem, for which we propose a derivative-free descent method in monotone case. We show its global convergence under some mild conditions. If F, the function involved in NCP, is Ro-function, the optimization problem has bounded level sets. A local property of the merit function is discussed. Finally, we report some numerical results.

  6. On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study

    KAUST Repository

    Lima, Ricardo

    2016-06-16

    This paper addresses the solution of a cardinality Boolean quadratic programming problem using three different approaches. The first transforms the original problem into six mixed-integer linear programming (MILP) formulations. The second approach takes one of the MILP formulations and relies on the specific features of an MILP solver, namely using starting incumbents, polishing, and callbacks. The last involves the direct solution of the original problem by solvers that can accomodate the nonlinear combinatorial problem. Particular emphasis is placed on the definition of the MILP reformulations and their comparison with the other approaches. The results indicate that the data of the problem has a strong influence on the performance of the different approaches, and that there are clear-cut approaches that are better for some instances of the data. A detailed analysis of the results is made to identify the most effective approaches for specific instances of the data. © 2016 Springer Science+Business Media New York

  7. Consensus Problem Over High-Order Multiagent Systems With Uncertain Nonlinearities Under Deterministic and Stochastic Topologies.

    Science.gov (United States)

    Rezaee, Hamed; Abdollahi, Farzaneh

    2016-12-06

    The leaderless consensus problem over a class of high-order nonlinear multiagent systems (MASs) is studied. A robust protocol is proposed which guarantees achieving consensus in the network in the presences of uncertainties in agents models. Achieving consensus in the case of stochastic links failure is studied as well. Based on the concept super-martingales, it is shown that if the probability of the network connectivity is not zero, under some conditions, achieving almost sure consensus in the network can be guaranteed. Despite existing consensus protocols for high-order stochastic networks, the proposed consensus protocol in this paper is robust to uncertain nonlinearities in the agents models, and it can be designed independent of knowledge on the set of feasible topologies (topologies with nonzero probabilities). Numerical examples for a team of single-link flexible joint manipulators with fourth-order models verify the accuracy of the proposed strategy for consensus control of high-order MASs with uncertain nonlinearities.

  8. An iterative HAM approach for nonlinear boundary value problems in a semi-infinite domain

    Science.gov (United States)

    Zhao, Yinlong; Lin, Zhiliang; Liao, Shijun

    2013-09-01

    In this paper, we propose an iterative approach to increase the computation efficiency of the homotopy analysis method (HAM), a analytic technique for highly nonlinear problems. By means of the Schmidt-Gram process (Arfken et al., 1985) [15], we approximate the right-hand side terms of high-order linear sub-equations by a finite set of orthonormal bases. Based on this truncation technique, we introduce the Mth-order iterative HAM by using each Mth-order approximation as a new initial guess. It is found that the iterative HAM is much more efficient than the standard HAM without truncation, as illustrated by three nonlinear differential equations defined in an infinite domain as examples. This work might greatly improve the computational efficiency of the HAM and also the Mathematica package BVPh for nonlinear BVPs.

  9. 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.

  10. Optimal impulse control problems and linear programming.

    OpenAIRE

    Bauso, D.

    2009-01-01

    Optimal impulse control problems are, in general, difficult to solve. A current research goal is to isolate those problems that lead to tractable solutions. In this paper, we identify a special class of optimal impulse control problems which are easy to solve. Easy to solve means that solution algorithms are polynomial in time and therefore suitable to the on-line implementation in real-time problems. We do this by using a paradigm borrowed from the Operations Research field. As main result, ...

  11. A METHOD FOR SOLVING LINEAR PROGRAMMING PROBLEMS WITH FUZZY PARAMETERS BASED ON MULTIOBJECTIVE LINEAR PROGRAMMING TECHNIQUE

    OpenAIRE

    Zangiabadi, M.; H. R. MALEKI

    2007-01-01

    In the real-world optimization problems, coefficients of the objective function are not known precisely and can be interpreted as fuzzy numbers. In this paper we define the concepts of optimality for linear programming problems with fuzzy parameters based on those for multiobjective linear programming problems. Then by using the concept of comparison of fuzzy numbers, we transform a linear programming problem with fuzzy parameters to a multiobjective linear programming problem. To this end, w...

  12. Variational ansatz for the nonlinear Landau-Zener problem for cold atom association

    Energy Technology Data Exchange (ETDEWEB)

    Ishkhanyan, A [Institute for Physical Research NAS of Armenia, 0203 Ashtarak-2 (Armenia); Joulakian, B [LPMC, Universite Paul Verlaine-Metz, 1 Bld Arago, 57078 Metz Cedex 3 (France); Suominen, K-A [Department of Physics and Astronomy, University of Turku, 20014 Turun yliopisto (Finland)

    2009-11-28

    We present a rigorous analysis of the Landau-Zener linear-in-time term crossing problem for quadratic-nonlinear systems relevant to the coherent association of ultracold atoms in degenerate quantum gases. Our treatment is based on an exact third-order nonlinear differential equation for the molecular state probability. Applying a variational two-term ansatz, we construct a simple approximation that accurately describes the whole-time dynamics of the coupled atom-molecular system for any set of involved parameters. Ensuring an absolute error of less than 10{sup -5} for the final transition probability, the resultant solution improves by several orders of magnitude the accuracy of the previous approximations by A Ishkhanyan et al developed separately for the weak coupling (2005 J. Phys. A: Math. Gen. 38 3505) and strong interaction (2006 J. Phys. A: Math. Gen. 39 14887) limits. In addition, the constructed approximation covers the whole moderate-coupling regime, providing this intermediate regime with the same accuracy as the two mentioned limits. The obtained results reveal the remarkable observation, that for the strong-coupling limit the resonance crossing is mostly governed by the nonlinearity, while the coherent atom-molecular oscillations arising soon after the resonance has been crossed are basically of a linear nature. This observation is supposed to be of a general character, due to the basic attributes of the resonance-crossing processes in the nonlinear quantum systems of the discussed type of involved quadratic nonlinearity. (fast track communication)

  13. Nonlinear quantum mechanics, the superposition principle, and the quantum measurement problem

    Indian Academy of Sciences (India)

    Kinjalk Lochan; T P Singh

    2011-01-01

    There are four reasons why our present knowledge and understanding of quantum mechanics can be regarded as incomplete. (1) The principle of linear superposition has not been experimentally tested for position eigenstates of objects having more than about a thousand atoms. (2) There is no universally agreed upon explanation for the process of quantum measurement. (3) There is no universally agreed upon explanation for the observed fact that macroscopic objects are not found in superposition of position eigenstates. (4) Most importantly, the concept of time is classical and hence external to quantum mechanics: there should exist an equivalent reformulation of the theory which does not refer to an external classical time. In this paper we argue that such a reformulation is the limiting case of a nonlinear quantum theory, with the nonlinearity becoming important at the Planck mass scale. Such a nonlinearity can provide insights into the aforesaid problems. We use a physically motivated model for a nonlinear Schr ¨odinger equation to show that nonlinearity can help in understanding quantum measurement. We also show that while the principle of linear superposition holds to a very high accuracy for atomic systems, the lifetime of a quantum superposition becomes progressively smaller, as one goes from microscopic to macroscopic objects. This can explain the observed absence of position superpositions in macroscopic objects (lifetime is too small). It also suggests that ongoing laboratory experiments may be able to detect the finite superposition lifetime for mesoscopic objects in the near future.

  14. 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.

  15. Finite element solution of nonlinear eddy current problems with periodic excitation and its industrial applications.

    Science.gov (United States)

    Bíró, Oszkár; Koczka, Gergely; Preis, Kurt

    2014-05-01

    An efficient finite element method to take account of the nonlinearity of the magnetic materials when analyzing three-dimensional eddy current problems is presented in this paper. The problem is formulated in terms of vector and scalar potentials approximated by edge and node based finite element basis functions. The application of Galerkin techniques leads to a large, nonlinear system of ordinary differential equations in the time domain. The excitations are assumed to be time-periodic and the steady-state periodic solution is of interest only. This is represented either in the frequency domain as a finite Fourier series or in the time domain as a set of discrete time values within one period for each finite element degree of freedom. The former approach is the (continuous) harmonic balance method and, in the latter one, discrete Fourier transformation will be shown to lead to a discrete harmonic balance method. Due to the nonlinearity, all harmonics, both continuous and discrete, are coupled to each other. The harmonics would be decoupled if the problem were linear, therefore, a special nonlinear iteration technique, the fixed-point method is used to linearize the equations by selecting a time-independent permeability distribution, the so-called fixed-point permeability in each nonlinear iteration step. This leads to uncoupled harmonics within these steps. As industrial applications, analyses of large power transformers are presented. The first example is the computation of the electromagnetic field of a single-phase transformer in the time domain with the results compared to those obtained by traditional time-stepping techniques. In the second application, an advanced model of the same transformer is analyzed in the frequency domain by the harmonic balance method with the effect of the presence of higher harmonics on the losses investigated. Finally a third example tackles the case of direct current (DC) bias in the coils of a single-phase transformer.

  16. MINIMUM DISCRIMINATION INFORMATION PROBLEMS VIA GENERALIZED GEOMETRIC PROGRAMMING

    Institute of Scientific and Technical Information of China (English)

    ZhuDetong

    2003-01-01

    In this paper,the quadratic program problm and minimum discrimiation in formation (MDI) problem with a set of quadratic inequality constraints and entropy constraints of density are considered.Based on the properties of the generalized geometric programming,the dual programs of thses two problems are derived.Furthermore,the duality theorms and related Kuhn-Tucker conditions for two pairs of the prime-dual programs are also established by the duality theory.

  17. Bi-Objective Bilevel Programming Problem: A Fuzzy Approach

    Directory of Open Access Journals (Sweden)

    Haseen S.

    2015-12-01

    Full Text Available In this paper, a likely situation of a set of decision maker’s with bi-objectives in case of fuzzy multi-choice goal programming is considered. The problem is then carefully formulated as a bi-objective bilevel programming problem (BOBPP with multiple fuzzy aspiration goals, fuzzy cost coefficients and fuzzy decision variables. Using Ranking method the fuzzy bi-objective bilevel programming problem (FBOBPP is converted into a crisp model. The transformed problem is further solved by adopting a two level Stackelberg game theory and fuzzy decision model of Sakawa. A numerical with hypothetical values is also used to illustrate the problem.

  18. Analytical vs. Simulation Solution Techniques for Pulse Problems in Non-linear Stochastic Dynamics

    DEFF Research Database (Denmark)

    Iwankiewicz, R.; Nielsen, Søren R. K.

    -numerical techniques suitable for Markov response problems such as moments equation, Petrov-Galerkin and cell-to-cell mapping techniques are briefly discussed. Usefulness of these techniques is limited by the fact that effectiveness of each of them depends on the mean rate of impulses. Another limitation is the size...... of the problem, i.e. the number of state variables of the dynamical systems. In contrast, the application of the simulation techniques is not limited to Markov problems, nor is it dependent on the mean rate of impulses. Moreover their use is straightforward for a large class of point processes, at least......Advantages and disadvantages of available analytical and simulation techniques for pulse problems in non-linear stochastic dynamics are discussed. First, random pulse problems, both those which do and do not lead to Markov theory, are presented. Next, the analytical and analytically...

  19. Hybrid transfinite element modeling/analysis of nonlinear heat conduction problems involving phase change

    Science.gov (United States)

    Tamma, Kumar K.; Railkar, Sudhir B.

    1988-01-01

    The present paper describes the applicability of hybrid transfinite element modeling/analysis formulations for nonlinear heat conduction problems involving phase change. The methodology is based on application of transform approaches and classical Galerkin schemes with finite element formulations to maintain the modeling versatility and numerical features for computational analysis. In addition, in conjunction with the above, the effects due to latent heat are modeled using enthalpy formulations to enable a physically realistic approximation to be dealt computationally for materials exhibiting phase change within a narrow band of temperatures. Pertinent details of the approach and computational scheme adapted are described in technical detail. Numerical test cases of comparative nature are presented to demonstrate the applicability of the proposed formulations for numerical modeling/analysis of nonlinear heat conduction problems involving phase change.

  20. Hybrid numerical scheme for nonlinear two-dimensional phase-change problems with the irregular geometry

    Energy Technology Data Exchange (ETDEWEB)

    Lin Jaeyuh [Chang Jung Univ., Tainan (Taiwan, Province of China); Chen Hantaw [National Cheng Kung Univ., Tainan (Taiwan, Province of China). Dept. of Mechanical Engineering

    1997-09-01

    A hybrid numerical scheme combining the Laplace transform and control-volume methods is presented to solve nonlinear two-dimensional phase-change problems with the irregular geometry. The Laplace transform method is applied to deal with the time domain, and then the control-volume method is used to discretize the transformed system in the space domain. Nonlinear terms induced by the temperature-dependent thermal properties are linearized by using the Taylor series approximation. Control-volume meshes in the solid and liquid regions during simulations are generated by using the discrete transfinite mapping method. The location of the phase-change interface and the isothermal distributions are determined. Comparison of these results with previous results shows that the present numerical scheme has good accuracy for two-dimensional phase-change problems. (orig.). With 10 figs.

  1. Homotopy deform method for reproducing kernel space for nonlinear boundary value problems

    Indian Academy of Sciences (India)

    MIN-QIANG XU; YING-ZHEN LIN

    2016-10-01

    In this paper, the combination of homotopy deform method (HDM) and simplified reproducing kernel method (SRKM) is introduced for solving the boundary value problems (BVPs) of nonlinear differential equations. The solution methodology is based on Adomian decomposition and reproducing kernel method (RKM). By the HDM, the nonlinear equations can be converted into a series of linear BVPs. After that, the simplified reproducing kernel method, which not only facilitates the reproducing kernel but also avoids the time-consuming Schmidt orthogonalization process, is proposed to solve linear equations. Some numerical test problems including ordinary differential equations and partial differential equations are analysed to illustrate the procedure and confirm the performance of the proposed method. The results faithfully reveal that our algorithm is considerably accurate and effective as expected.

  2. Numerical solution of a nonlinear least squares problem in digital breast tomosynthesis

    Science.gov (United States)

    Landi, G.; Loli Piccolomini, E.; Nagy, J. G.

    2015-11-01

    In digital tomosynthesis imaging, multiple projections of an object are obtained along a small range of different incident angles in order to reconstruct a pseudo-3D representation (i.e., a set of 2D slices) of the object. In this paper we describe some mathematical models for polyenergetic digital breast tomosynthesis image reconstruction that explicitly takes into account various materials composing the object and the polyenergetic nature of the x-ray beam. A polyenergetic model helps to reduce beam hardening artifacts, but the disadvantage is that it requires solving a large-scale nonlinear ill-posed inverse problem. We formulate the image reconstruction process (i.e., the method to solve the ill-posed inverse problem) in a nonlinear least squares framework, and use a Levenberg-Marquardt scheme to solve it. Some implementation details are discussed, and numerical experiments are provided to illustrate the performance of the methods.

  3. A New Spectral Local Linearization Method for Nonlinear Boundary Layer Flow Problems

    Directory of Open Access Journals (Sweden)

    S. S. Motsa

    2013-01-01

    Full Text Available We propose a simple and efficient method for solving highly nonlinear systems of boundary layer flow problems with exponentially decaying profiles. The algorithm of the proposed method is based on an innovative idea of linearizing and decoupling the governing systems of equations and reducing them into a sequence of subsystems of differential equations which are solved using spectral collocation methods. The applicability of the proposed method, hereinafter referred to as the spectral local linearization method (SLLM, is tested on some well-known boundary layer flow equations. The numerical results presented in this investigation indicate that the proposed method, despite being easy to develop and numerically implement, is very robust in that it converges rapidly to yield accurate results and is more efficient in solving very large systems of nonlinear boundary value problems of the similarity variable boundary layer type. The accuracy and numerical stability of the SLLM can further be improved by using successive overrelaxation techniques.

  4. Determination of an Unknown Radiation Term in a Nonlinear Inverse Problem using Simulation of Markov Chains

    Directory of Open Access Journals (Sweden)

    Morteza Ebrahimi

    2012-01-01

    Full Text Available The purpose of the present study is to provide a fast and accurate algorithm for identifying the medium temperature and the unknown radiation term from an overspecified condition on the boundary in an inverse problem of linear heat equation with nonlinear boundary condition. The design of the paper is to employ Taylor’s series expansion for linearize nonlinear term and then finite-difference approximation to discretize the problem domain. Owing to the application of the finite difference scheme, a large sparse system of linear algebraic equations is obtained. An approach of Monte Carlo method is employed to solve the linear system and estimate unknown radiation term. The Monte Carlo optimization is adopted to modify the estimated values. Results show that a good estimation on the radiation term can be obtained within a couple of minutes CPU time at pentium IV-2.4 GHz PC.

  5. Numerical identification of boundary conditions on nonlinearly radiating inverse heat conduction problems

    Science.gov (United States)

    Murio, Diego A.

    1991-01-01

    An explicit and unconditionally stable finite difference method for the solution of the transient inverse heat conduction problem in a semi-infinite or finite slab mediums subject to nonlinear radiation boundary conditions is presented. After measuring two interior temperature histories, the mollification method is used to determine the surface transient heat source if the energy radiation law is known. Alternatively, if the active surface is heated by a source at a rate proportional to a given function, the nonlinear surface radiation law is then recovered as a function of the interface temperature when the problem is feasible. Two typical examples corresponding to Newton cooling law and Stefan-Boltzmann radiation law respectively are illustrated. In all cases, the method predicts the surface conditions with an accuracy suitable for many practical purposes.

  6. A MODIFIED DECOMPOSITION METHOD FOR SOLVING NONLINEAR PROBLEM OF FLOW IN CONVERGING- DIVERGING CHANNEL

    Directory of Open Access Journals (Sweden)

    MOHAMED KEZZAR

    2015-08-01

    Full Text Available In this research, an efficient technique of computation considered as a modified decomposition method was proposed and then successfully applied for solving the nonlinear problem of the two dimensional flow of an incompressible viscous fluid between nonparallel plane walls. In fact this method gives the nonlinear term Nu and the solution of the studied problem as a power series. The proposed iterative procedure gives on the one hand a computationally efficient formulation with an acceleration of convergence rate and on the other hand finds the solution without any discretization, linearization or restrictive assumptions. The comparison of our results with those of numerical treatment and other earlier works shows clearly the higher accuracy and efficiency of the used Modified Decomposition Method.

  7. Solution of the nonlinear inverse scattering problem by T -matrix completion. II. Simulations

    Science.gov (United States)

    Levinson, Howard W.; Markel, Vadim A.

    2016-10-01

    This is Part II of the paper series on data-compatible T -matrix completion (DCTMC), which is a method for solving nonlinear inverse problems. Part I of the series [H. W. Levinson and V. A. Markel, Phys. Rev. E 94, 043317 (2016), 10.1103/PhysRevE.94.043317] contains theory and here we present simulations for inverse scattering of scalar waves. The underlying mathematical model is the scalar wave equation and the object function that is reconstructed is the medium susceptibility. The simulations are relevant to ultrasound tomographic imaging and seismic tomography. It is shown that DCTMC is a viable method for solving strongly nonlinear inverse problems with large data sets. It provides not only the overall shape of the object, but the quantitative contrast, which can correspond, for instance, to the variable speed of sound in the imaged medium.

  8. Nonlinear programming technique for analyzing flocculent settling data.

    Science.gov (United States)

    Rashid, Md Mamunur; Hayes, Donald F

    2014-04-01

    The traditional graphical approach for drawing iso-concentration curves to analyze flocculent settling data and design sedimentation basins poses difficulties for computer-based design methods. Thus, researchers have developed empirical approaches to analyze settling data. In this study, the ability of five empirical approaches to fit flocculent settling test data is compared. Particular emphasis is given to compare rule-based SETTLE and rule-based nonlinear programming (NLP) techniques as a viable alternative to the modeling methods of Berthouex and Stevens (1982), San (1989), and Ozer (1994). Published flocculent settling data are used to test the suitability of these empirical approaches. The primary objective, however, is to determine if the results of a NLP optimization technique are more reliable than those of other approaches. For this, mathematical curve fitting is conducted and the modeled concentration data are graphically compared to the observed data. The design results in terms of average solid removal efficiency as a function of detention times are also compared. Finally, the sum of squared errors values from these approaches are compared. The results indicate a strong correlation between observed and NLP modeled concentration data. The SETTLE and NLP approaches tend to be more conservative at lower retention times and less conservative at longer retention times. The SETTLE approach appears to be the most conservative. In terms of sum of squared errors values, NLP appears to be rank number one (i.e., best model) for eight data sets and number two for six data sets among 15 data sets. Therefore, NLP is recommended for analyzing flocculent settling data as a logical extension of other approaches. The NLP approach is further recommended as it is an optimization technique and uses conventional mathematical algorithms that can be solved using widely available software such as EXCEL and LINGO.

  9. ON TRANSMISSION PROBLEM FOR VISCOELASTIC WAVE EQUATION WITH A LOCALIZED A NONLINEAR DISSIPATION

    Institute of Scientific and Technical Information of China (English)

    Jeong Ja BAE; Seong Sik KIM

    2013-01-01

    In this article,we consider the global existence and decay rates of solutions for the transmission problem of Kirchhoff type wave equations consisting of two physically different types of materials,one component being a Kirchhoff type wave equation with time dependent localized dissipation which is effective only on a neighborhood of certain part of boundary,while the other being a Kirchhoff type viscoelastic wave equation with nonlinear memory.

  10. EXISTENCE OF SOLUTIONS OF A FAMILY OF NONLINEAR BOUNDARY VALUE PROBLEMS IN L2-SPACES

    Institute of Scientific and Technical Information of China (English)

    WeiLi; ZhouHaiyun

    2005-01-01

    By using the perturbation results of sums of ranges of accretive mappings of Calvert and Gupta (1978),the abstract results on the existence of solutions of a family of nonlinear boundary value problems in L2 (Ω) are studied. The equation discussed in this paper and the methods used here are extension and complement to the corresponding results of Wei Li and He Zhen's previous papers. Especially,some new techniques are used in this paper.

  11. Analytical Approximation Method for the Center Manifold in the Nonlinear Output Regulation Problem

    Science.gov (United States)

    Suzuki, Hidetoshi; Sakamoto, Noboru; Celikovský, Sergej

    In nonlinear output regulation problems, it is necessary to solve the so-called regulator equations consisting of a partial differential equation and an algebraic equation. It is known that, for the hyperbolic zero dynamics case, solving the regulator equations is equivalent to calculating a center manifold for zero dynamics of the system. The present paper proposes a successive approximation method for obtaining center manifolds and shows its effectiveness by applying it for an inverted pendulum example.

  12. Numerical method for nonlinear two-phase displacement problem and its application

    Institute of Scientific and Technical Information of China (English)

    YUAN Yi-rang; LIANG Dong; RUI Hong-xing; DU Ning; WANG Wen-qia

    2008-01-01

    For the three-dimensional nonlinear two-phase displacement problem, the modified upwind finite difference fractional steps schemes were put forward. Some techniques, such as calculus of variations, induction hypothesis, decomposition of high order difference operators, the theory of prior estimates and techniques were used. Optimal order estimates were derived for the error in the approximation solution. These methods have been successfully used to predict the consequences of seawater intrusion and protection projects.

  13. Solvability of a three-point nonlinear boundary-value problem

    Directory of Open Access Journals (Sweden)

    Assia Guezane-Lakoud

    2010-09-01

    Full Text Available Using the Leray Schauder nonlinear alternative, we prove the existence of a nontrivial solution for the three-point boundary-value problem $$displaylines{ u''+f(t,u= 0,quad 0

  14. Positive solutions for a nonlinear periodic boundary-value problem with a parameter

    Directory of Open Access Journals (Sweden)

    Jingliang Qiu

    2012-08-01

    Full Text Available Using topological degree theory with a partially ordered structure of space, sufficient conditions for the existence and multiplicity of positive solutions for a second-order nonlinear periodic boundary-value problem are established. Inspired by ideas in Guo and Lakshmikantham [6], we study the dependence of positive periodic solutions as a parameter approaches infinity, $$ lim_{lambdao +infty}|x_{lambda}|=+infty,quadhbox{or}quad lim_{lambdao+infty}|x_{lambda}|=0. $$

  15. 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.

  16. Validation of Finite Element Solutions of Nonlinear, Periodic Eddy Current Problems

    Directory of Open Access Journals (Sweden)

    Plasser René

    2014-12-01

    Full Text Available An industrial application is presented to validate a finite element analysis of 3-dimensional, nonlinear eddy-current problems with periodic excitation. The harmonic- balance method and the fixed-point technique are applied to get the steady state solution using the finite element method. The losses occurring in steel reinforcements underneath a reactor due to induced eddy-currents are computed and compared to measurements.

  17. A program to solve rotating plasma problems

    NARCIS (Netherlands)

    Bakker, M.; Berg, M.S. van den

    1980-01-01

    It is shown that the solution of a rotating plasma problem minimizes a quitably chosen funtional. This variational problem is solved by the Ritz-Galerkin methud using piecewise bilinear functions and applying some Newton-Côtes-like quadrature. The resulting linear system with a sparse nonegative def

  18. Constraint-based scheduling applying constraint programming to scheduling problems

    CERN Document Server

    Baptiste, Philippe; Nuijten, Wim

    2001-01-01

    Constraint Programming is a problem-solving paradigm that establishes a clear distinction between two pivotal aspects of a problem: (1) a precise definition of the constraints that define the problem to be solved and (2) the algorithms and heuristics enabling the selection of decisions to solve the problem. It is because of these capabilities that Constraint Programming is increasingly being employed as a problem-solving tool to solve scheduling problems. Hence the development of Constraint-Based Scheduling as a field of study. The aim of this book is to provide an overview of the most widely used Constraint-Based Scheduling techniques. Following the principles of Constraint Programming, the book consists of three distinct parts: The first chapter introduces the basic principles of Constraint Programming and provides a model of the constraints that are the most often encountered in scheduling problems. Chapters 2, 3, 4, and 5 are focused on the propagation of resource constraints, which usually are responsibl...

  19. Morozov-type discrepancy principle for nonlinear ill-posed problems under -condition

    Indian Academy of Sciences (India)

    M Thamban Nair

    2015-05-01

    For proving the existence of a regularization parameter under a Morozov-type discrepancy principle for Tikhonov regularization of nonlinear ill-posed problems, it is required to impose additional nonlinearity assumptions on the forward operator. Lipschitz continuity of the Freéchet derivative and requirement of the Lipschitz constant to depend on a source condition is one such restriction (Ramlau P, Numer. Funct. Anal. Optim. 23(1&22) (2003) 147–172). Another nonlinearity condition considered by Scherzer (Computing, 51 (1993) 45–60) was by requiring the forward operator to be close to a linear operator in a restricted sense. A seemingly natural nonlinear assumption which appears in many applications which attracted attention in various contexts of the study of nonlinear problems is the so-called -condition. However, a Morozov-type discrepancy principle together with -condition does not seem to have been studied, except in a recent paper by the author (Bull. Aust. Math. Soc. 79 (2009) 337–342), where error estimates under a general source condition is derived, by assuming the existence of the parameter. In this paper, the existence of the parameter satisfying a Morozov-type discrepancy principle is proved under the -condition on the forward operator, by assuming the source condition as in the papers of Scherzer (Computing, 51 (1993) 45–60) and Ramlau (Numer. Funct. Anal. Optim. 23(1&22) (2003) 147–172). This source condition is, in fact, a special case of the source condition in the author’s paper (Bull. Aust. Math. Soc. 79 (2009) 337–342).

  20. An interactive approach based on a discrete differential evolution algorithm for a class of integer bilevel programming problems

    Science.gov (United States)

    Li, Hong; Zhang, Li; Jiao, Yong-Chang

    2016-07-01

    This paper presents an interactive approach based on a discrete differential evolution algorithm to solve a class of integer bilevel programming problems, in which integer decision variables are controlled by an upper-level decision maker and real-value or continuous decision variables are controlled by a lower-level decision maker. Using the Karush--Kuhn-Tucker optimality conditions in the lower-level programming, the original discrete bilevel formulation can be converted into a discrete single-level nonlinear programming problem with the complementarity constraints, and then the smoothing technique is applied to deal with the complementarity constraints. Finally, a discrete single-level nonlinear programming problem is obtained, and solved by an interactive approach. In each iteration, for each given upper-level discrete variable, a system of nonlinear equations including the lower-level variables and Lagrange multipliers is solved first, and then a discrete nonlinear programming problem only with inequality constraints is handled by using a discrete differential evolution algorithm. Simulation results show the effectiveness of the proposed approach.

  1. The viscous surface-internal wave problem: nonlinear Rayleigh-Taylor instability

    CERN Document Server

    Wang, Yanjin

    2011-01-01

    We consider the free boundary problem for two layers of immiscible, viscous, incompressible fluid in a uniform gravitational field, lying above a rigid bottom in a three-dimensional horizontally periodic setting. The effect of surface tension is either taken into account at both free boundaries or neglected at both. We are concerned with the Rayleigh-Taylor instability, so we assume that the upper fluid is heavier than the lower fluid. When the surface tension at the free internal interface is below a critical value, which we identify, we establish that the problem under consideration is nonlinearly unstable.

  2. Multiple positive solutions for singular semipositone nonlinear integral boundary-value problems on infinite intervals

    Directory of Open Access Journals (Sweden)

    Ying Wang

    2015-03-01

    Full Text Available In this article, we study the existence of multiple positive solutions for singular semipositone boundary-value problem (BVP with integral boundary conditions on infinite intervals. By using the properties of the Green's function and the Guo-Krasnosel'skii fixed point theorem, we obtain the existence of multiple positive solutions under conditions concerning the nonlinear functions. The method in this article can be used for a large number of problems. We illustrate the validity of our results with an example in the last section.

  3. POSITIVE SOLUTIONS OF A NONLINEAR THREE-POINT EIGENVALUE PROBLEM WITH INTEGRAL BOUNDARY CONDITIONS

    Directory of Open Access Journals (Sweden)

    FAOUZI HADDOUCHI

    2015-11-01

    Full Text Available In this paper, we study the existence of positive solutions of a three-point integral boundary value problem (BVP for the following second-order differential equation u''(t + \\lambda a(tf(u(t = 0; 0 0 is a parameter, 0 <\\eta < 1, 0 <\\alpha < 1/{\\eta}. . By using the properties of the Green's function and Krasnoselskii's fixed point theorem on cones, the eigenvalue intervals of the nonlinear boundary value problem are considered, some sufficient conditions for the existence of at least one positive solutions are established.

  4. Verified solutions of two-point boundary value problems for nonlinear oscillators

    Science.gov (United States)

    Bünger, Florian

    Using techniques introduced by Nakao [4], Oishi [5, 6] and applied by Takayasu, Oishi, Kubo [11, 12] to certain nonlinear two-point boundary value problems (see also Rump [7], Chapter 15), we provide a numerical method for verifying the existence of weak solutions of two-point boundary value problems of the form -u″ = a(x, u) + b(x, u)u‧, 0 b are functions that fulfill some regularity properties. The numerical approximation is done by cubic spline interpolation. Finally, the method is applied to the Duffing, the van der Pol and the Toda oscillator. The rigorous numerical computations were done with INTLAB [8].

  5. Nonlinear systems of differential inequalities and solvability of certain boundary value problems

    Directory of Open Access Journals (Sweden)

    Tvrdý Milan

    2001-01-01

    Full Text Available In the paper we present some new existence results for nonlinear second order generalized periodic boundary value problems of the form These results are based on the method of lower and upper functions defined as solutions of the system of differential inequalities associated with the problem and their relation to the Leray–Schauder topological degree of the corresponding operator. Our main goal consists in a fairly general definition of these functions as couples from . Some conditions ensuring their existence are indicated, as well.

  6. A mixed Newton-Tikhonov method for nonlinear ill-posed problems

    Institute of Scientific and Technical Information of China (English)

    Chuan-gang KANG; Guo-qiang HE

    2009-01-01

    Newton type methods are one kind of the efficient methods to solve nonlinear ill-posed problems,which have attracted extensive attention.However,computational cost of Newton type methods is high because practical problems are complicated.We propose a mixed Newton-Tikhonov method,i.e.,one step Newton-Tikhonov method with several other steps of simplified Newton-Tikhonov method.Convergence and stability of this method are proved under some conditions.Numerical experiments show that the proposed method has obvious advantages over the classical Newton method in terms of computational costs.

  7. An NE/SQP method for the bounded nonlinear complementarity problem

    Energy Technology Data Exchange (ETDEWEB)

    Gabriel, S.A. [Argonne National Lab., IL (United States). Mathematics and Computer Science Div.

    1995-05-30

    NE/SQP is a recent algorithm that has proven quite effective for solving the pure and mixed forms of the nonlinear complementarity problem (NCP). NE/SQP is robust in the sense that its direction-finding subproblems are always solvable; in addition, the convergence rate of this method is Q-quadratic. In this paper the author considers a generalized version of NE/SQP proposed by Pang and Qi, that is suitable for the bounded NCP. The author extends their work by demonstrating a stronger convergence result and then tests a proposed method on several numerical problems.

  8. Inverse problems and nonlinear evolution equations solutions, Darboux matrices and Weyl-Titchmarsh functions

    CERN Document Server

    Sakhnovich, Lev A; Roitberg, Inna Ya

    2013-01-01

    This monograph fits theclearlyneed for books with a rigorous treatment of theinverse problems for non-classical systems and that of initial-boundary-value problems for integrable nonlinear equations. The authorsdevelop a unified treatment of explicit and global solutions via the transfer matrix function in a form due to Lev A. Sakhnovich. The book primarily addresses specialists in the field. However, it is self-contained andstarts with preliminaries and examples, and hencealso serves as an introduction for advanced graduate students in the field.

  9. Event-Based Robust Control for Uncertain Nonlinear Systems Using Adaptive Dynamic Programming.

    Science.gov (United States)

    Zhang, Qichao; Zhao, Dongbin; Wang, Ding

    2016-10-18

    In this paper, the robust control problem for a class of continuous-time nonlinear system with unmatched uncertainties is investigated using an event-based control method. First, the robust control problem is transformed into a corresponding optimal control problem with an augmented control and an appropriate cost function. Under the event-based mechanism, we prove that the solution of the optimal control problem can asymptotically stabilize the uncertain system with an adaptive triggering condition. That is, the designed event-based controller is robust to the original uncertain system. Note that the event-based controller is updated only when the triggering condition is satisfied, which can save the communication resources between the plant and the controller. Then, a single network adaptive dynamic programming structure with experience replay technique is constructed to approach the optimal control policies. The stability of the closed-loop system with the event-based control policy and the augmented control policy is analyzed using the Lyapunov approach. Furthermore, we prove that the minimal intersample time is bounded by a nonzero positive constant, which excludes Zeno behavior during the learning process. Finally, two simulation examples are provided to demonstrate the effectiveness of the proposed control scheme.

  10. 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.

  11. 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.

  12. Improve Problem Solving Skills through Adapting Programming Tools

    Science.gov (United States)

    Shaykhian, Linda H.; Shaykhian, Gholam Ali

    2007-01-01

    There are numerous ways for engineers and students to become better problem-solvers. The use of command line and visual programming tools can help to model a problem and formulate a solution through visualization. The analysis of problem attributes and constraints provide insight into the scope and complexity of the problem. The visualization aspect of the problem-solving approach tends to make students and engineers more systematic in their thought process and help them catch errors before proceeding too far in the wrong direction. The problem-solver identifies and defines important terms, variables, rules, and procedures required for solving a problem. Every step required to construct the problem solution can be defined in program commands that produce intermediate output. This paper advocates improved problem solving skills through using a programming tool. MatLab created by MathWorks, is an interactive numerical computing environment and programming language. It is a matrix-based system that easily lends itself to matrix manipulation, and plotting of functions and data. MatLab can be used as an interactive command line or a sequence of commands that can be saved in a file as a script or named functions. Prior programming experience is not required to use MatLab commands. The GNU Octave, part of the GNU project, a free computer program for performing numerical computations, is comparable to MatLab. MatLab visual and command programming are presented here.

  13. Improve Problem Solving Skills through Adapting Programming Tools

    Science.gov (United States)

    Shaykhian, Linda H.; Shaykhian, Gholam Ali

    2007-01-01

    There are numerous ways for engineers and students to become better problem-solvers. The use of command line and visual programming tools can help to model a problem and formulate a solution through visualization. The analysis of problem attributes and constraints provide insight into the scope and complexity of the problem. The visualization aspect of the problem-solving approach tends to make students and engineers more systematic in their thought process and help them catch errors before proceeding too far in the wrong direction. The problem-solver identifies and defines important terms, variables, rules, and procedures required for solving a problem. Every step required to construct the problem solution can be defined in program commands that produce intermediate output. This paper advocates improved problem solving skills through using a programming tool. MatLab created by MathWorks, is an interactive numerical computing environment and programming language. It is a matrix-based system that easily lends itself to matrix manipulation, and plotting of functions and data. MatLab can be used as an interactive command line or a sequence of commands that can be saved in a file as a script or named functions. Prior programming experience is not required to use MatLab commands. The GNU Octave, part of the GNU project, a free computer program for performing numerical computations, is comparable to MatLab. MatLab visual and command programming are presented here.

  14. Multiobjective Interaction Programming Problem with Interaction Constraint for Two Players

    Directory of Open Access Journals (Sweden)

    Min Jiang

    2012-01-01

    Full Text Available This paper extends an existing cooperative multi-objective interaction programming problem with interaction constraint for two players (or two agents. First, we define an s-optimal joint solution with weight vector to multi-objective interaction programming problem with interaction constraint for two players and get some properties of it. It is proved that the s-optimal joint solution with weight vector to the multi-objective interaction programming problem can be obtained by solving a corresponding mathematical programming problem. Then, we define another s-optimal joint solution with weight value to multi-objective interaction programming problem with interaction constraint for two players and get some of its properties. It is proved that the s-optimal joint solution with weight vector to multi-objective interaction programming problem can be obtained by solving a corresponding mathematical programming problem. Finally, we build a pricing multi-objective interaction programming model for a bi-level supply chain. Numerical results show that the interaction programming pricing model is better than Stackelberg pricing model and the joint pricing model.

  15. A Semismooth Newton Method for Nonlinear Parameter Identification Problems with Impulsive Noise

    KAUST Repository

    Clason, Christian

    2012-01-01

    This work is concerned with nonlinear parameter identification in partial differential equations subject to impulsive noise. To cope with the non-Gaussian nature of the noise, we consider a model with L 1 fitting. However, the nonsmoothness of the problem makes its efficient numerical solution challenging. By approximating this problem using a family of smoothed functionals, a semismooth Newton method becomes applicable. In particular, its superlinear convergence is proved under a second-order condition. The convergence of the solution to the approximating problem as the smoothing parameter goes to zero is shown. A strategy for adaptively selecting the regularization parameter based on a balancing principle is suggested. The efficiency of the method is illustrated on several benchmark inverse problems of recovering coefficients in elliptic differential equations, for which one- and two-dimensional numerical examples are presented. © by SIAM.

  16. DNA computation model to solve 0-1 programming problem.

    Science.gov (United States)

    Zhang, Fengyue; Yin, Zhixiang; Liu, Bo; Xu, Jin

    2004-01-01

    0-1 programming problem is an important problem in opsearch with very widespread applications. In this paper, a new DNA computation model utilizing solution-based and surface-based methods is presented to solve the 0-1 programming problem. This model contains the major benefits of both solution-based and surface-based methods; including vast parallelism, extraordinary information density and ease of operation. The result, verified by biological experimentation, revealed the potential of DNA computation in solving complex programming problem.

  17. Enhancing Digital Fluency through a Training Program for Creative Problem Solving Using Computer Programming

    Science.gov (United States)

    Kim, SugHee; Chung, KwangSik; Yu, HeonChang

    2013-01-01

    The purpose of this paper is to propose a training program for creative problem solving based on computer programming. The proposed program will encourage students to solve real-life problems through a creative thinking spiral related to cognitive skills with computer programming. With the goal of enhancing digital fluency through this proposed…

  18. An Interval Maximum Entropy Method for Quadratic Programming Problem

    Institute of Scientific and Technical Information of China (English)

    RUI Wen-juan; CAO De-xin; SONG Xie-wu

    2005-01-01

    With the idea of maximum entropy function and penalty function methods, we transform the quadratic programming problem into an unconstrained differentiable optimization problem, discuss the interval extension of the maximum entropy function, provide the region deletion test rules and design an interval maximum entropy algorithm for quadratic programming problem. The convergence of the method is proved and numerical results are presented. Both theoretical and numerical results show that the method is reliable and efficient.

  19. Ensemble Kalman Filtering with Residual Nudging: An Extension to State Estimation Problems with Nonlinear Observation Operators

    KAUST Repository

    Luo, Xiaodong

    2014-10-01

    The ensemble Kalman filter (EnKF) is an efficient algorithm for many data assimilation problems. In certain circumstances, however, divergence of the EnKF might be spotted. In previous studies, the authors proposed an observation-space-based strategy, called residual nudging, to improve the stability of the EnKF when dealing with linear observation operators. The main idea behind residual nudging is to monitor and, if necessary, adjust the distances (misfits) between the real observations and the simulated ones of the state estimates, in the hope that by doing so one may be able to obtain better estimation accuracy. In the present study, residual nudging is extended and modified in order to handle nonlinear observation operators. Such extension and modification result in an iterative filtering framework that, under suitable conditions, is able to achieve the objective of residual nudging for data assimilation problems with nonlinear observation operators. The 40-dimensional Lorenz-96 model is used to illustrate the performance of the iterative filter. Numerical results show that, while a normal EnKF may diverge with nonlinear observation operators, the proposed iterative filter remains stable and leads to reasonable estimation accuracy under various experimental settings.

  20. Chaotic Neural Network Technique for "0-1" Programming Problems

    Institute of Scientific and Technical Information of China (English)

    王秀宏; 乔清理; 王正欧

    2003-01-01

    0-1 programming is a special case of the integer programming, which is commonly encountered in many optimization problems. Neural network and its general energy function are presented for 0-1 optimization problem. Then,the 0-1 optimization problems are solved by a neural network model with transient chaotic dynamics (TCNN). Numerical simulations of two typical 0-1 optimization problems show that TCNN can overcome HNN's main drawbacks that it suffers from the local minimum and can search for the global optimal solutions in to solveing 0-1 optimization problems.

  1. SUCCESSIVELY ITERATIVE TECHNIQUE OF SIGN-CHANGING SOLUTION TO A NONLINEAR THIRD-ORDER BOUNDARY VALUE PROBLEM

    Institute of Scientific and Technical Information of China (English)

    2012-01-01

    The iterative technique of sign-changing solution is studied for a nonlinear third-order two-point boundary value problem, where the nonlinear term has the time sin-gularity. By applying the monotonically iterative technique, an existence theorem is established and two useful iterative schemes are obtained.

  2. Analyticity of solutions of analytic non-linear general elliptic boundary value problems,and some results about linear problems

    Institute of Scientific and Technical Information of China (English)

    WANG Rouhuai

    2006-01-01

    The main aim of this paper is to discuss the problem concerning the analyticity of the solutions of analytic non-linear elliptic boundary value problems.It is proved that if the corresponding first variation is regular in Lopatinski(i) sense,then the solution is analytic up to the boundary.The method of proof really covers the case that the corresponding first variation is regularly elliptic in the sense of Douglis-Nirenberg-Volevich,and hence completely generalize the previous result of C.B.Morrey.The author also discusses linear elliptic boundary value problems for systems of ellip tic partial differential equations where the boundary operators are allowed to have singular integral operators as their coefficients.Combining the standard Fourier transform technique with analytic continuation argument,the author constructs the Poisson and Green's kernel matrices related to the problems discussed and hence obtain some representation formulae to the solutions.Some a priori estimates of Schauder type and Lp type are obtained.

  3. Refinement from a control problem to program

    DEFF Research Database (Denmark)

    Schenke, Michael; Ravn, Anders P.

    1996-01-01

    for a control task, exemplified by a steam boiler.The same formalism is used to refine requirements to a functional design.Through a suitable transformation this is taken to an event andaction based formalism. Finally components in this design for a distributedarchitecture are transformed to occam-like programs....

  4. Modeling Granular Materials as Compressible Non-Linear Fluids: Heat Transfer Boundary Value Problems

    Energy Technology Data Exchange (ETDEWEB)

    Massoudi, M.C.; Tran, P.X.

    2006-01-01

    We discuss three boundary value problems in the flow and heat transfer analysis in flowing granular materials: (i) the flow down an inclined plane with radiation effects at the free surface; (ii) the natural convection flow between two heated vertical walls; (iii) the shearing motion between two horizontal flat plates with heat conduction. It is assumed that the material behaves like a continuum, similar to a compressible nonlinear fluid where the effects of density gradients are incorporated in the stress tensor. For a fully developed flow the equations are simplified to a system of three nonlinear ordinary differential equations. The equations are made dimensionless and a parametric study is performed where the effects of various dimensionless numbers representing the effects of heat conduction, viscous dissipation, radiation, and so forth are presented.

  5. Analytical approximate technique for strongly nonlinear oscillators problem arising in engineering

    Directory of Open Access Journals (Sweden)

    Y. Khan

    2012-12-01

    Full Text Available In this paper, a novel method called generalized of the variational iteration method is presented to obtain an approximate analytical solution for strong nonlinear oscillators problem associated in engineering phenomena. This approach resulted in the frequency of the motion as a function of the amplitude of oscillation. It is determined that the method works very well for the whole range of parameters and an excellent agreement is demonstrated and discussed between the approximate frequencies and the exact one. The most significant features of this method are its simplicity and excellent accuracy for the whole range of oscillation amplitude values. Also, the results reveal that this technique is very effective and convenient for solving conservative oscillatory systems with complex nonlinearities. Results obtained by the proposed method are compared with Energy Balance Method (EBM and exact solution showed that, contrary to EBM, simply one or two iterations are enough for obtaining highly accurate results.

  6. Use Residual Correction Method and Monotone Iterative Technique to Calculate the Upper and Lower Approximate Solutions of Singularly Perturbed Non-linear Boundary Value Problems

    Directory of Open Access Journals (Sweden)

    Chi-Chang Wang

    2013-09-01

    Full Text Available This paper seeks to use the proposed residual correction method in coordination with the monotone iterative technique to obtain upper and lower approximate solutions of singularly perturbed non-linear boundary value problems. First, the monotonicity of a non-linear differential equation is reinforced using the monotone iterative technique, then the cubic-spline method is applied to discretize and convert the differential equation into the mathematical programming problems of an inequation, and finally based on the residual correction concept, complex constraint solution problems are transformed into simpler questions of equational iteration. As verified by the four examples given in this paper, the method proposed hereof can be utilized to fast obtain the upper and lower solutions of questions of this kind, and to easily identify the error range between mean approximate solutions and exact solutions.

  7. 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.

  8. Initial-value problem for the Gardner equation applied to nonlinear internal waves

    Science.gov (United States)

    Rouvinskaya, Ekaterina; Kurkina, Oxana; Kurkin, Andrey; Talipova, Tatiana; Pelinovsky, Efim

    2017-04-01

    The Gardner equation is a fundamental mathematical model for the description of weakly nonlinear weakly dispersive internal waves, when cubic nonlinearity cannot be neglected. Within this model coefficients of quadratic and cubic nonlinearity can both be positive as well as negative, depending on background conditions of the medium, where waves propagate (sea water density stratification, shear flow profile) [Rouvinskaya et al., 2014, Kurkina et al., 2011, 2015]. For the investigation of weakly dispersive behavior in the framework of nondimensional Gardner equation with fixed (positive) sign of quadratic nonlinearity and positive or negative cubic nonlinearity {eq1} partial η/partial t+6η( {1± η} )partial η/partial x+partial ^3η/partial x^3=0, } the series of numerical experiments of initial-value problem was carried out for evolution of a bell-shaped impulse of negative polarity (opposite to the sign of quadratic nonlinear coefficient): {eq2} η(x,t=0)=-asech2 ( {x/x0 } ), for which amplitude a and width x0 was varied. Similar initial-value problem was considered in the paper [Trillo et al., 2016] for the Korteweg - de Vries equation. For the Gardner equation with different signs of cubic nonlinearity the initial-value problem for piece-wise constant initial condition was considered in detail in [Grimshaw et al., 2002, 2010]. It is widely known, for example, [Pelinovsky et al., 2007], that the Gardner equation (1) with negative cubic nonlinearity has a family of classic solitary wave solutions with only positive polarity,and with limiting amplitude equal to 1. Therefore evolution of impulses (2) of negative polarity (whose amplitudes a were varied from 0.1 to 3, and widths at the level of a/2 were equal to triple width of solitons with the same amplitude for a 1) was going on a universal scenario with the generation of nonlinear Airy wave. For the Gardner equation (1) with the positive cubic nonlinearity coefficient there exist two one-parametric families of

  9. A Hartman-Nagumo inequality for the vector ordinary p-Laplacian and applications to nonlinear boundary value problems

    OpenAIRE

    Mawhin, Jean; Ure??a, Antonio J.

    2002-01-01

    A generalization of the well-known Hartman-Nagumo inequality to the case of the vector ordinary p-Laplacian and classical degree theory provide existence results for some associated nonlinear boundary value problems.

  10. A Hartman–Nagumo inequality for the vector ordinary -Laplacian and applications to nonlinear boundary value problems

    Directory of Open Access Journals (Sweden)

    Ureña Antonio J

    2002-01-01

    Full Text Available A generalization of the well-known Hartman–Nagumo inequality to the case of the vector ordinary -Laplacian and classical degree theory provide existence results for some associated nonlinear boundary value problems.

  11. Renormalization-group symmetries for solutions of nonlinear boundary value problems

    CERN Document Server

    Kovalev, V F

    2008-01-01

    Approximately 10 years ago, the method of renormalization-group symmetries entered the field of boundary value problems of classical mathematical physics, stemming from the concepts of functional self-similarity and of the Bogoliubov renormalization group treated as a Lie group of continuous transformations. Overwhelmingly dominating practical quantum field theory calculations, the renormalization-group method formed the basis for the discovery of the asymptotic freedom of strong nuclear interactions and underlies the Grand Unification scenario. This paper describes the logical framework of a new algorithm based on the modern theory of transformation groups and presents the most interesting results of application of the method to differential and/or integral equation problems and to problems that involve linear functionals of solutions. Examples from nonlinear optics, kinetic theory, and plasma dynamics are given, where new analytical solutions obtained with this algorithm have allowed describing the singular...

  12. Nonlinear Inverse Problem for an Ion-Exchange Filter Model: Numerical Recovery of Parameters

    Directory of Open Access Journals (Sweden)

    Balgaisha Mukanova

    2015-01-01

    Full Text Available This paper considers the problem of identifying unknown parameters for a mathematical model of an ion-exchange filter via measurement at the outlet of the filter. The proposed mathematical model consists of a material balance equation, an equation describing the kinetics of ion-exchange for the nonequilibrium case, and an equation for the ion-exchange isotherm. The material balance equation includes a nonlinear term that depends on the kinetics of ion-exchange and several parameters. First, a numerical solution of the direct problem, the calculation of the impurities concentration at the outlet of the filter, is provided. Then, the inverse problem, finding the parameters of the ion-exchange process in nonequilibrium conditions, is formulated. A method for determining the approximate values of these parameters from the impurities concentration measured at the outlet of the filter is proposed.

  13. 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.

  14. A Nonlinear Multiobjective Bilevel Model for Minimum Cost Network Flow Problem in a Large-Scale Construction Project

    Directory of Open Access Journals (Sweden)

    Jiuping Xu

    2012-01-01

    Full Text Available The aim of this study is to deal with a minimum cost network flow problem (MCNFP in a large-scale construction project using a nonlinear multiobjective bilevel model with birandom variables. The main target of the upper level is to minimize both direct and transportation time costs. The target of the lower level is to minimize transportation costs. After an analysis of the birandom variables, an expectation multiobjective bilevel programming model with chance constraints is formulated to incorporate decision makers’ preferences. To solve the identified special conditions, an equivalent crisp model is proposed with an additional multiobjective bilevel particle swarm optimization (MOBLPSO developed to solve the model. The Shuibuya Hydropower Project is used as a real-world example to verify the proposed approach. Results and analysis are presented to highlight the performances of the MOBLPSO, which is very effective and efficient compared to a genetic algorithm and a simulated annealing algorithm.

  15. AN ALGORITHM FOR FINDING GLOBAL MINIMUM OF NONLINEAR INTEGER PROGRAMMING

    Institute of Scientific and Technical Information of China (English)

    Wei-wenTian; Lian-shengZhang

    2004-01-01

    A filled function is proposed by R.Ge[2] for finding a global minimizer of a function of several continuous variables. In [4], an approach for finding a global integer minimizer of nonlinear flmction using the above filled function is given. Meanwhile a major obstacle is met: if ρ > 0 is small, and ‖xI- xI* is large, where xI - an integer point, xI* - a current local integer minimizer, then the value of the filled function almost equals zero. Thus it is difficult to recognize the size of the value of the filled flmction and can not to find the global integer minimizer of nonlinear function. In this paper, two new filled functions are proposed for finding global integer minimizer of nonlinear flmction, the new filled function improves some properties of the filled function proposed by R. Ge [2]. Some numerical results are given, which indicate the new filled function (4.1) to find global integer minimizer of nonlinear function is efficient.

  16. On semidefinite programming relaxations of the traveling salesman problem

    CERN Document Server

    de Klerk, Etienne; Sotirov, Renata; 10.1137/070711141

    2009-01-01

    We consider a new semidefinite programming (SDP) relaxation of the symmetric traveling salesman problem (TSP) that may be obtained via an SDP relaxation of the more general quadratic assignment problem (QAP). We show that the new relaxation dominates the one in [D. Cvetkovic, M. Cangalovic, and V. Kovacevic-Vujcic, Semidefinite programming methods for the symmetric traveling salesman problem, in Proc. 7th Int. IPCO Conference, Springer, London, 1999, pp. 126--136]. Unlike the bound of Cvetkovic et al., the new SDP bound is not dominated by the Held-Karp linear programming bound, or vice versa.

  17. Nonlinear gauge interactions: a possible solution to the "measurement problem" in quantum mechanics

    CERN Document Server

    Hansson, Johan

    2010-01-01

    Two fundamental, and unsolved problems in physics are: i) the resolution of the "measurement problem" in quantum mechanics ii) the quantization of strongly nonlinear (nonabelian) gauge theories. The aim of this paper is to suggest that these two problems might be linked, and that a mutual, simultaneous solution to both might exist. We propose that the mechanism responsible for the "collapse of the wave function" in quantum mechanics is the nonlinearities already present in the theory via nonabelian gauge interactions. Unlike all other models of spontaneous collapse, our proposal is, to the best of our knowledge, the only one which does not introduce any new elements into the theory. A possible experimental test of the model would be to compare the coherence lengths - here defined as the distance over which quantum mechanical superposition is still valid - for, \\textit{e.g}, electrons and photons in a double-slit experiment. The electrons should have a finite coherence length, while photons should have a much ...

  18. Local and Global Existence of Solutions to Initial Value Problems of Nonlinear Kaup-Kupershmidt Equations

    Institute of Scientific and Technical Information of China (English)

    Shuang Ping TAO; Shang Bin CUI

    2005-01-01

    This paper is devoted to studying the initial value problems of the nonlinear KaupKupershmidt equations (e)u/(e)t + α1u(e)2u/(e)x2+β(e)3u/(e)x3+γ(e)5u/( )x5= 0, (x, t) ∈ R2, and (e)u/(e)t+α2 (e)u/(e)x (e)2u/(e)x2+β(e)3u/(e)x3+γ(e)5u/(e)x5 = 0, (x, t) ∈R2. Several important Strichartz type estimates for the fundamental solution of the corresponding linear problem are established. Then we apply such estimates to prove the local and global existence of solutions for the initial value problems of the nonlinear Kaup-Kupershmidt equations. The results show that a local solution exists if the initial function u0(x) ∈ Hs(R), and s ≥ 5/4 for the first equation and s ≥ 301/108 for the second equation.

  19. Geochemical engineering problem identification and program description. Final report

    Energy Technology Data Exchange (ETDEWEB)

    Crane, C.H.; Kenkeremath, D.C.

    1981-05-01

    The Geochemical Engineering Program has as its goal the improvement of geochemical fluid management techniques. This document presents the strategy and status of the Geochemical Engineering Program. The magnitude and scope of geochemical-related problems constraining geothermal industry productivity are described. The goals and objectives of the DGE Geochemical Engineering Program are defined. The rationale and strategy of the program are described. The structure, priorities, funding, and management of specific elements within the program are delineated, and the status of the overall program is presented.

  20. A novel exact solution to transmission problem of electron wave in a nonlinear Kronig-Penney superlattice

    Science.gov (United States)

    Kong, Chao; Hai, Kuo; Tan, Jintao; Chen, Hao; Hai, Wenhua

    2016-03-01

    Nonlinear Kronig-Penney model has been frequently employed to study transmission problem of electron wave in a doped semiconductor superlattice or in a nonlinear electrified chain. Here from an integral equation we derive a novel exact solution of the problem, which contains a simple nonlinear map connecting transmission coefficient with system parameters. Consequently, we propose a scheme to manipulate electronic distribution and transmission by adjusting the system parameters. A new quantum coherence effect is evidenced by the strict expression of transmission coefficient, which results in the aperiodic electronic distributions and different transmission coefficients including the approximate zero transmission and total transmission, and the multiple transmissions. The method based on the concise exact solution can be applied directly to some nonlinear cold atomic systems and a lot of linear Kronig-Penney systems, and also can be extended to investigate electronic transport in different discrete nonlinear systems.

  1. Matlab A Practical Introduction to Programming and Problem Solving

    CERN Document Server

    Attaway, Stormy

    2011-01-01

    Assuming no knowledge of programming, this book presents both programming concepts and MATLAB's built-in functions, providing a perfect platform for exploiting MATLAB's extensive capabilities for tackling engineering problems. It starts with programming concepts such as variables, assignments, input/output, and selection statements, moves onto loops and then solves problems using both the 'programming concept' and the 'power of MATLAB' side-by-side. In-depth coverage is given to input/output, a topic that is fundamental to many engineering applications. Ancillaries available with the text: I

  2. Global well-posedness for nonlinear nonlocal Cauchy problems arising in elasticity

    Directory of Open Access Journals (Sweden)

    Hantaek Bae

    2017-02-01

    Full Text Available In this article, we prove global well-posedness for a family of one dimensional nonlinear nonlocal Cauchy problems arising in elasticity. We consider the equation $$ u_{tt}-\\delta Lu_{xx}=\\big(\\beta \\ast [(1-\\deltau+u^{2n+1}]\\big_{xx}\\,, $$ where $L$ is a differential operator, $\\beta$ is an integral operator, and $\\delta =0$ or 1. (Here, the case $\\delta=1$ represents the additional doubly dispersive effect. We prove the global well-posedness of the equation in energy spaces.

  3. The exact solutions of nonlinear problems by Homotopy Analysis Method (HAM

    Directory of Open Access Journals (Sweden)

    Hafiz Abdul Wahab

    2016-06-01

    Full Text Available The present paper presents the comparison of analytical techniques. We establish the existence of the phenomena of the noise terms in the perturbation series solution and find the exact solution of the nonlinear problems. If the noise terms exist, the Homotopy Analysis method gives the same series solution as in Adomian Decomposition Method as well as homotopy Perturbation Method (Wahab et al, 2015 and we get the exact solution using the initial guess in Homotopy Analysis Method using the results obtained by Adomian Decomposition Method.

  4. Smoothing Newton Algorithm for Nonlinear Complementarity Problem with a P* Function

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    By using a smoothing function, the P* nonlinear complementarity problem (P* NCP) can be reformulated as a parameterized smooth equation. A Newton method is proposed to solve this equation. The iteration sequence generated by the proposed algorithm is bounded and this algorithm is proved to be globally convergent under an assumption that the P* NCP has a nonempty solution set. This assumption is weaker than the ones used in most existing smoothing algorithms. In particular, the solution obtained by the proposed algorithm is shown to be a maximally complementary solution of the P* NCP without any additional assumption.

  5. THE DEMAND DISRUPTION MANAGEMENT PROBLEM FOR A SUPPLY CHAIN SYSTEM WITH NONLINEAR DEMAND FUNCTIONS

    Institute of Scientific and Technical Information of China (English)

    Minghui XU; Xiangtong QI; Gang YU; Hanqin ZHANG; Chengxiu GAO

    2003-01-01

    This paper addresses the problem of handling the uncertainty of demand in aone-supplier-one-retailer supply chain system. Demand variation often makes the real productiondifferent from what is originally planned, causing a deviation cost from the production plan. Assumethe market demand is sensitive to the retail price in a nonlinear form, we show how to effectivelyhandle the demand uncertainty in a supply chain, both for the case of centralized-decision-makingsystem and the case of decentralized-decision-making system with perfect coordination.

  6. ALE Fractional Step Finite Element Method for Fluid-Structure Nonlinear Interaction Problem

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    A computational procedure is developed to solve the problems of coupled motion of a structure and a viscous incompressible fluid. In order to incorporate the effect of the moving surface of the structure as well as the free surface motion, the arbitrary Lagrangian-Eulerian formulation is employed as the basis of the finite element spatial discretization. For numerical integration in time, the fraction step method is used. This method is useful because one can use the same linear interpolation function for both velocity and pressure. The method is applied to the nonlinear interaction of a structure and a tuned liquid damper. All computations are performed with a personal computer.

  7. New implicit method for analysis of problems in nonlinear structural dynamics

    Directory of Open Access Journals (Sweden)

    Gholampour A. A.

    2011-06-01

    Full Text Available In this paper a new method is proposed for direct time integration of nonlinear structural dynamics problems. In the proposed method the order of time integration scheme is higher than the conventional Newmark’s family of methods. This method assumes second order variation of the acceleration at each time step. Two variable parameters are used to increase the stability and accuracy of the method. The result obtained from this new higher order method is compared with two implicit methods; namely the Wilson-θ and the Newmark’s average acceleration methods.

  8. A Reduced Basis Framework: Application to large scale non-linear multi-physics problems

    Directory of Open Access Journals (Sweden)

    Daversin C.

    2013-12-01

    Full Text Available In this paper we present applications of the reduced basis method (RBM to large-scale non-linear multi-physics problems. We first describe the mathematical framework in place and in particular the Empirical Interpolation Method (EIM to recover an affine decomposition and then we propose an implementation using the open-source library Feel++ which provides both the reduced basis and finite element layers. Large scale numerical examples are shown and are connected to real industrial applications arising from the High Field Resistive Magnets development at the Laboratoire National des Champs Magnétiques Intenses.

  9. Existence of Positive Solutions to Boundary Value Problem for a Nonlinear Fractional Differential Equation

    Institute of Scientific and Technical Information of China (English)

    SONG Li-mei; WENG Pei-xuan

    2012-01-01

    In this paper,we study a Dirichlet-type boundary value problem(BVP) of nonlinear fractional differential equation with an order α ∈ (3,4],where the fractional derivative D0α+ is the standard Riemann-Liouville fractional derivative.By constructing the Green function and investigating its properties,we obtain some criteria for the existence of one positive solution and two positive solutions for the above BVP.The Krasnosel'skii fixedpoint theorem in cones is used here.We also give an example to illustrate the applicability of our results.

  10. A (k, n-k) Conjugate Boundary Value Problem with Semip ositone Nonlinearity

    Institute of Scientific and Technical Information of China (English)

    Yao Qing-liu; Shi Shao-yun

    2015-01-01

    The existence of positive solution is proved for a (k, n−k) conjugate boundary value problem in which the nonlinearity may make negative values and may be singular with respect to the time variable. The main results of Agarwal et al. (Agarwal R P, Grace S R, O’Regan D. Semipositive higher-order differential equa-tions. Appl. Math. Letters, 2004, 14: 201–207) are extended. The basic tools are the Hammerstein integral equation and the Krasnosel’skii’s cone expansion-compression technique.

  11. Constrained non-linear optimization in 3D reflexion tomography; Problemes d'optimisation non-lineaire avec contraintes en tomographie de reflexion 3D

    Energy Technology Data Exchange (ETDEWEB)

    Delbos, F.

    2004-11-01

    Reflexion tomography allows the determination of a subsurface velocity model from the travel times of seismic waves. The introduction of a priori information in this inverse problem can lead to the resolution of a constrained non-linear least-squares problem. The goal of the thesis is to improve the resolution techniques of this optimization problem, whose main difficulties are its ill-conditioning, its large scale and an expensive cost function in terms of CPU time. Thanks to a detailed study of the problem and to numerous numerical experiments, we justify the use of a sequential quadratic programming method, in which the tangential quadratic programs are solved by an original augmented Lagrangian method. We show the global linear convergence of the latter. The efficiency and robustness of the approach are demonstrated on several synthetic examples and on two real data cases. (author)

  12. A solution procedure for mixed-integer nonlinear programming formulation of supply chain planning with quantity discounts under demand uncertainty

    Science.gov (United States)

    Yin, Sisi; Nishi, Tatsushi

    2014-11-01

    Quantity discount policy is decision-making for trade-off prices between suppliers and manufacturers while production is changeable due to demand fluctuations in a real market. In this paper, quantity discount models which consider selection of contract suppliers, production quantity and inventory simultaneously are addressed. The supply chain planning problem with quantity discounts under demand uncertainty is formulated as a mixed-integer nonlinear programming problem (MINLP) with integral terms. We apply an outer-approximation method to solve MINLP problems. In order to improve the efficiency of the proposed method, the problem is reformulated as a stochastic model replacing the integral terms by using a normalisation technique. We present numerical examples to demonstrate the efficiency of the proposed method.

  13. Measurement problem in Program Universe. Revision

    Energy Technology Data Exchange (ETDEWEB)

    Noyes, H.P.; Gefwert, C.; Manthey, M.J.

    1985-07-01

    The ''measurement problem'' of contemporary physics is in our view an artifact of its philosophical and mathematical underpinnings. We describe a new philosophical view of theory formation, rooted in Wittgenstein, and Bishop's and Martin-Loef's constructivity, which obviates such discussions. We present an unfinished, but very encouraging, theory which is compatible with this philosophical framework. The theory is based on the concepts of counting and combinatorics in the framework provided by the combinatorial hierarchy, a unique hierarchy of bit strings which interact by an operation called discrimination. Measurement criteria incorporate c, h-bar and m/sub p/ or (not ''and'') G. The resulting theory is discrete throughout, contains no infinities, and, as far as we have developed it, is in agreement with quantum mechanical and cosmological fact. 15 refs.

  14. Measurement problem in Program Universe. Revision

    Science.gov (United States)

    Noyes, H. P.; Gefwert, C.; Manthey, M. J.

    1985-07-01

    The measurement problem of contemporary physics is in our view an artifact of its philosophical and mathematical underpinnings. We describe a new philosophical view of theory formation, rooted in Wittgenstein, and Bishop's and Martin-Loef's constructivity, which obviates such discussions. We present an unfinished, but very encouraging, theory which is compatible with this philosophical framework. The theory is based on the concepts of counting and combinatorics in the framework provided by the combinatorial hierarchy, a unique hierarchy of bit strings which interact by an operation called discrimination. Measurement criteria incorporate c, h-bar and m/sub p/ or (not and) G. The resulting theory is discrete throughout, contains no infinities, and, as far as we have developed it, is in agreement with quantum mechanical and cosmological fact.

  15. Comparison of linear, mixed integer and non-linear programming methods in energy system dispatch modelling

    DEFF Research Database (Denmark)

    Ommen, Torben Schmidt; Markussen, Wiebke Brix; Elmegaard, Brian

    2014-01-01

    differences and differences between the solution found by each optimisation method. One of the investigated approaches utilises LP (linear programming) for optimisation, one uses LP with binary operation constraints, while the third approach uses NLP (non-linear programming). The LP model is used...... of selected units by 23%, while for a non-linear approach the increase can be higher than 39%. The results indicate a higher coherence between the two latter approaches, and that the MLP (mixed integer programming) optimisation is most appropriate from a viewpoint of accuracy and runtime. © 2014 Elsevier Ltd...

  16. An approach for solving linear fractional programming problems ...

    African Journals Online (AJOL)

    An approach for solving linear fractional programming problems. ... Journal of the Nigerian Association of Mathematical Physics. Journal Home · ABOUT · Advanced Search ... Open Access DOWNLOAD FULL TEXT Subscription or Fee Access ...

  17. The Environmental Justice Collaborative Problem-Solving Cooperative Agreement Program

    Science.gov (United States)

    The Environmental Justice Collaborative Problem-Solving (CPS) Cooperative Agreement Program provides financial assistance to eligible organizations working on or planning to work on projects to address local environmental and/or public health issues

  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. A Hybrid Dynamic Programming Method for Concave Resource Allocation Problems

    Institute of Scientific and Technical Information of China (English)

    姜计荣; 孙小玲

    2005-01-01

    Concave resource allocation problem is an integer programming problem of minimizing a nonincreasing concave function subject to a convex nondecreasing constraint and bounded integer variables. This class of problems are encountered in optimization models involving economies of scale. In this paper, a new hybrid dynamic programming method was proposed for solving concave resource allocation problems. A convex underestimating function was used to approximate the objective function and the resulting convex subproblem was solved with dynamic programming technique after transforming it into a 0-1 linear knapsack problem. To ensure the convergence, monotonicity and domain cut technique was employed to remove certain integer boxes and partition the revised domain into a union of integer boxes. Computational results were given to show the efficiency of the algorithm.

  20. Composite nonlinear feedback control for output regulation problem of linear discrete-time systems with input saturation

    Institute of Scientific and Technical Information of China (English)

    Chongwen Wang; Xing Chu; Weiyao Lan

    2014-01-01

    Transient performance for output regulation problems of linear discrete-time systems with input saturation is addressed by using the composite nonlinear feedback (CNF) control tech-nique. The regulator is designed to be an additive combination of a linear regulator part and a nonlinear feedback part. The linear regulator part solves the regulation problem independently which produces a quick output response but large oscil ations. The non-linear feedback part with wel-tuned parameters is introduced to improve the transient performance by smoothing the oscil atory convergence. It is shown that the introduction of the nonlinear feedback part does not change the solvability conditions of the linear discrete-time output regulation problem. The effectiveness of transient improvement is il ustrated by a numeric example.