Sökning: "ergodic sequences"
Visar resultat 1 - 5 av 8 avhandlingar innehållade orden ergodic sequences.
1. Conditional Subgradient Methods and Ergodic Convergence in Nonsmooth Optimization
Sammanfattning : The topic of the thesis is subgradient optimization methods in convex, nonsmooth optimization. These methods are frequently used, especially in the context of Lagrangean relaxation of large scale mathematical programs where they are remarkably often able to quickly identify near-optimal Lagrangean dual solutions. LÄS MER
2. Topics in convex and mixed binary linear optimization
Sammanfattning : This thesis concerns theory, algorithms, and applications for two problem classes within the realm of mathematical optimization; convex optimization and mixed binary linear optimization. To the thesis is appended five papers containing its main contributions. LÄS MER
3. Optimization of Maintenance Planning for Multi-Component Systems, and Primal-Dual Convergence Characterizations in Convex Optimization
Sammanfattning : This thesis considers two topics within mathematical programming. The first topic is an investigation into the behaviour of primal-dual subgradient algorithms with primal ergodic averaging in the case where it is not known a priori whether the primal program is consistent or not. LÄS MER
4. Limit Theorems for Ergodic Group Actions and Random Walks
Sammanfattning : This thesis consists of an introduction, a summary and 7 papers. The papers are devoted to problems in ergodic theory, equidistribution on compact manifolds and random walks on groups. In Papers A and B, we generalize two classical ergodic theorems for actions of abelian groups. LÄS MER
5. Certain results on the Möbius disjointness conjecture
Sammanfattning : We study certain aspects of the Möbius randomness principle and more specifically the Möbius disjointness conjecture of P. Sarnak. In paper A we establish this conjecture for all orientation preserving circle homeomorphisms and continuous interval maps of zero entropy. LÄS MER
