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 20 of 425 for “"Rate of convergence"”.
-
Rate of convergence in nonlinear programming
The rate of convergence is a useful measure of the performance of an algorithm. Knowledge of the rate can help determine which algorithm is best suited for a given problem. This research is a study of the rate of convergence of a few algorithms used for nonlinear programming problems. The …
-
A Rate of Convergence for Learning Theory with Consensus
… problem with consensus that arises in the study of estimation and control strategies for distributed sensor networks. Each node i for i = 1, . . . , n of the sensor network collects independent and identically distributed local measurements {z i} := {z i j}j∈N := {(x i j , yi j )}j∈N ⊆ X × Y := Z …
-
Convergence and Rate of Convergence of Approximate Greedy-Type Algorithms
In this dissertation we study the questions of convergence and rate of convergence of greedy-type algorithms under imprecise step evaluations. Such algorithms are in demand as the issue of calculation errors appears naturally in applications. We address the question of strong convergence of the …
-
RATE OF CONVERGENCE OF MAXIMUM LIKELIHOOD ESTIMATORS UNDER RELAXED SMOOTHNESS CONDITIONS ON THE LIKELIHOOD FUNCTION
This report reviews literature on the rate of convergence of maximum likelihood estimators and establishes a Central Limit Theorem, which yields an O(1/sqrt(n)) rate of convergence of the maximum likelihood estimator under somewhat relaxed smoothness conditions. These conditions include the …
-
Investigation of the rate of convergence in the two sample nonparametric empirical Bayes approach to an estimation problem
… a finite second moment. We observe the value x, of a preliminary random variable X, which has an unknown distribution which is conditional on θ. Using x and our past experience we are asked to estimate the value of θ with a squared error loss function. After we have made our decision we are given …
-
Limit Theorems for L-functions in Analytic Number Theory
We use the method of Radziwill and Soundararajan to prove Selberg’s central limit theorem for the real part of the logarithm of the Riemann zeta function on the critical line in the multivariate case. This gives an alternate proof of a result of Bourgade. An upshot of the method is to determine a …
-
A wavelet-based CMAC for enhanced multidimensional learning
… and associative, allowing for rapid learning convergence with an ease of implementation in either hardware or software. The rate of convergence of the network is determined largely by the choice of the receptive field shape and the generalization parameter. This research contains a rigorous …
-
Volterra difference equations
"This dissertation consists of five papers in which discrete Volterra equations of different types and orders are studied and results regarding the behavior of their solutions are established. The first paper presents some fundamental results about subexponential sequences. It also illustrates the …
-
A modified penalty term for the sequential unconstrained minimization technique for convex programming problems
… Problems is modified by the introduction of an exponent in the penalty term. The exponent is introduced to increase the rate of convergence of the method for nonlinear problems with solutions on the boundary of one or more constraints. Convergence to the solution of the constrained problem …
-
On issues of equalization with the decorrelation algorithm : fast converging structures and finite-precision
To increase the rate of convergence of the blind, adaptive, decision feedback equalizer based on the decorrelation criterion, structures have been proposed which dramatically increase the complexity of the equalizer. The complexity of an algorithm has a direct bearing on the cost of implementing …
-
Distributing points on the sphere: partitions, separation, quadrature and energy
This thesis concentrates on a set of problems and approaches relating to the generation and analysis of spherical codes. The work was conducted at the University of New South Wales between 2002 and 2006, during a short visit to Vanderbilt University in 2004, and at the University of Sydney in 2006. …
-
Euler schemes for accretive operators on Banach spaces
… space. We give an upper bound for the norm of the difference of two solutions of Euler schemes with this accretive operator. This concrete estimate also works for the problem with a non-zero right-hand side in the Cauchy problem and is a generalization of a famous result by Kobayashi. We …
-
Approximation of the Generalized Singular Value Expansion
… an expansion that expresses $T$ and $L$ in terms of a common orthonormal basis. Under certain hypotheses on discretization, the GSVE of an approximate operator pair $(T_j,L_j)$, where $T_j:X_j \to Y_j$ and $L_j:X_j \to Z_j$, converges to the GSVE of $(T,L)$. Error estimates establish a rate of …
-
Numerical solutions of rough differential equations and stochastic differential equations
… that the existing (naive) Euler scheme has the rate of convergence $n^{1-2H}$. Since the limit $H \rightarrow \frac12$ of the SDE corresponds to a Stratonovich SDE driven by standard Brownian motion, and the naive Euler scheme is the extension of the classical Euler scheme for It\^o SDEs for …
-
Spectral collocation method for compact integral operators
… smooth kernels and weakly singular kernels of the form $\frac{1}{|t-s|^\mu}, \; 0<\mu<1. $ We prove that 1) for integral equations, the convergence rate depends on the smoothness of true solutions $y(t)$. If $y(t)$ satisfies condition (R): $\|y^{(k)}\|_{L^\infty[0,T]}\leq ck!R^{-k}$}, we …
-
Κατανεμημένοι αλγόριθμοι διάχυσης για το πρόβλημα της εξισορρόπησης φορτίου
The aim of the PhD thesis is the design and the analysis of new diffusion methods for the load balancing problem in order to accelerate their rate of convergence. In particular, two new diffusion methods have been developed, the (Extrapolated) Average Diffusion method and the Generalized Diffusion …
-
Semiparametric Multivariate Density Estimation Using Copulas and Shape-Constraints
Maximum likelihood estimation of a log-concave density has certain advantages over other nonparametric approaches, such as kernel density estimation, which requires a bandwidth selection. Furthermore, finding the optimal bandwidth gets more difficult as a dimension increases. On the other hand, the …
-
Parallel Implementations of the Frank-Wolfe Algorithms for the Traffic Assignment Problem
… The traffic assignment problem is one algorithm of great importance to planners because it provides insight into how traffic will flow within the network. The Frank-Wolfe algorithm is a traditional solution method for this optimization problem, but it has been characterized by its slow rate of …
-
Greedy Algorithms and Incoherent Systems
This dissertation concerns estimates on the size of sets that have small coherence among the elements, the latest best upper bound on the rate of convergence of greedy expansions, and explicit formulas for approximants from the Pure Greedy Algorithm.
-
A branch, price, and cut approach to solving the maximum weighted independent set problem
… weight-independent set problem (MWISP) is one of the most well-known and well-studied NP-hard problems in the field of combinatorial optimization. In the first part of the dissertation, I explore efficient branch-and-price (B&P) approaches to solve MWISP exactly. B&P is a useful …
Page 1 of 22