Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 11 of 11 for “"discrete approximations"”.
-
Discrete Approximations, Relaxations, and Applications in Quadratically Constrained Quadratic Programming
… for a chemical plant. We model the problem as a discrete-time nonconvex MIQCP, then approximate this model as a MILP using a discretization-based approach. We combine a rolling horizon approach with the discretization of individual chemical property specifications to deal with long scheduling …
-
Estimates for the rate of convergence of finite element approximations of the solution of a time-dependent variational inequality
… to analyse two types of general finite element approximations to the solution of a time-dependent variational inequality. The two types of approximations considered are the following: 1. Semi-discrete approximations, in which only the spatial domain is discretised by finite elements; 2. fully …
-
Optimal Strategy Imitation Learning from Differential Games
… modeled and solved as a differential game using discrete approximations; these games yield an optimal control policy for both players and can be used to model adversarial driving scenarios rather than average ones, so that autonomous vehicles will be safer on the road in more situations. Further, …
-
The Numerical approximation of minimal surfaces with free boundaries by finite elements
… an efficient method for finding and calculating discrete approximations to following disc-type minimal surfaces with free boundaries: Solution of the Plateau Problem corresponding to a supporting surface S, Solution of the Thread Problem. In both case, the problem is reformulated and the highly …
-
Variational analysis and optimal control of the sweeping process
… optimality conditions is based on the method of discrete approximations and advanced tools of variational analysis and generalized differentiation. The final results obtained are given in terms of the initial data of the controlled sweeping process and are illustrated by nontrivial examples.</p>
-
Finite-Difference Approximations And Optimal Control Of Differential Inclusions
… differential inclusions. We develop finite-discrete approximations of differential inclusions by using the implicit Euler scheme and the Runge-Kutta scheme for approximating time derivatives, while an appropriate well-posedness of such approximations is justified. Our principal result …
-
Optimal finite-thrust spacecraft trajectories using direct transcription and nonlinear programming
… spacecraft trajectories. These methods use discrete approximations to the state and control histories, and a discretization of the equations of motion to derive a mathematical programming problem which approximates the optimal control problem, and which is solved numerically. This conversion …
-
Cellular automata models for excitable media
… excitable media. First, general "masks" as discrete approximations to the diffusion equation are examined, showing how to calculate the diffusion coefficient from the elements of the mask. The mask is then combined with a thresholding operation to simulate the propagation of waves (shock …
-
Formulation, analysis and solution algorithms for a model of gradient plasticity within a discontinuous Galerkin framework
… of both the continuous-in-time and fully-discrete approximations; the error estimates obtained correspond to those for the conventional Galerkin approximations of the classical problem. The focus of the analysis is on those properties of the problem that would ensure existence of a unique …
-
Topic Modeling for Inferring Brain States from Electroencephalography (EEG) Signals
… In the LDA topic model, topics are modeled as discrete distributions over a finite vocabulary of words. Modeling data spanning a continuous domain with the LDA requires discrete approximations of the continuous data, which can lead to loss of information and may not represent the true structure …
-
An augmented Lagrangian algorithm for optimization with equality constraints in Hilbert spaces
Since augmented Lagrangian methods were introduced by Powell and Hestenes, this class of methods has been investigated very intensively. While the finite dimensional case has been treated in a satisfactory manner, the infinite dimensional case is studied much less. The general approach to solve an …