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 12 of 12 for “"Polynomial convergence"”.
-
Inexact Interior-Point Methods for Large Scale Linear and Convex Quadratic Semidefinite Programming
… convex programming problems to high accuracy in polynomial time. In practice, the difficulty faced by interior-point methods is to compute the search direction from a linear system in each iteration. Classical interior-point methods use a direct solver such as Cholesky factorization to store and …
-
The bottleneck traveling salesman problem
… and computational results which indicate a polynomial convergence time for the assignment problem based algorithm when applied to problems with independent costs. Similar arguments and computational results show that problems with symmetric and euclidian costs are more difficult to solve. As …
-
Quasiperiodicity and Chaos
… and prove that these averages have super-polynomial convergence to the Birkhoff average. We also show how this accelerated convergence of the ergodic averages over quasiperiodic trajectories enable us to compute the rotation number, Fourier series and Lyapunov exponents of quasiperiodic …
-
Adaptive Functional Data Analysis
… local linear manifold smoothing that achieves a polynomial convergence rate and adapts to the intrinsic data geometry even when functional data are observed intermittently and contaminated by noise, in contrast to the logarithm rate in nonparametric functional regression literature. We …
-
Enhancing optimization algorithms for non-convex settings : federated and decentralized learning
… allows us to provide, for the first time, polynomial convergence rate guarantees with respect to the last iterate. Our experimental validation demonstrates that our proposed method efficiently escapes saddle points, achieving superior performance compared to existing decentralized …
-
Convergence Rates of Random Discrete Model Curves Approaching SLE Curves in the Scaling Limit
… and S. Smirnov provided a framework for showing convergence of discrete model interfaces to the corresponding SLE curves. They show that given a uniform bound on specific crossing probabilities one can deduce that the interface has subsequential scaling limits that can be described almost surely …
-
The Use of Preconditioned Iterative Linear Solvers in Interior-Point Methods and Related Topics
… the algorithmic iterations of the IPMs can be polynomially bounded by n and the logarithm of the desired accuracy. We also expand the scope of the LP and CQP algorithms to incorporate a family of preconditioners, of which MWB is a member, to determine an approximate solution to the normal …
-
Optimization Dynamics in Mildly Overparametrized Models
… with minimal requirements: feature learning, polynomial size, and polynomial convergence time. We refer to these as mildly overparametrized models.</p><p>Analyzing the training dynamics of these mildly overparametrized models offers valuable insights into the underlying mechanisms, allowing us …
-
Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems
… path, hence, still guaranteeing the global convergence of the method under strict feasibility assumption. The number of iterations necessary to find 2-approximate solution of the problem matches the best known iteration bounds for these types of methods. The preliminary implementation of the …
-
Infeasible Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems
… path, hence, still guaranteeing the global convergence of the method under strict feasibility assumption. The number of iterations necessary to find -approximate solution of the problem matches the best known iteration bounds for these types of methods. The preliminary implementation of the …
-
Surface shape regions as manifestations of a socio-economic phenomenon : a solution to the choropleth mapping problem.
… Lagrange interpolation. It is called a Lagrange polynomial in xy. Each internal intersection of the grid is the (2,2) element of a 3 x 3 matrix extracted from the grid. We compute a Lagrange polynomial in xy for each 3 x 3 matrix. Then we use this polynomial to measure the curvatures and classify …
-
Analysis of infinite dimensional dynamical systems associated to functional differential equations.
… functionals. Fortunately, we could obtain polynomial stability of the steady-state in a particular case of unbounded variable delay, namely, the proportional delay. However, the exponential stability of stationary solutions to Navier-Stokes equation with unbounded variable delay still seems …