Thesis (Ph. D.)--University of Alberta, 2010. / Title from pdf file main screen (viewed on July 30, 2010). A thesis submitted to the Faculty of Graduate Studies and Research in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Applied Mathematics, Department of Mathematical and Statistical Sciences, University of Alberta. Includes bibliographical references.

Thesis (M.S.)--University of Central Florida, 2009. / Adviser: Joseph J. LaViola Jr. Includes bibliographical references (p. 79-84).

Applications of accuracy certificates for problems with convex structure   This dissertation addresses the efficient generation and potential applications of accuracy certificates in the framework of “black-box-represented” convex optimization problems - convex problems where the objective and the constraints are represented by  “black boxes” which, given on input a value x of the argument, somehow (perhaps in a fashion unknown to the user) provide on output the values and the derivatives of the objective and the constraints at x. The main body of the dissertation can be split into three parts.  In the first part, we provide our background --- state of the art of the theory of accuracy certificates for black-box-represented convex optimization. In the second part, we extend the toolbox of black-box-oriented convex optimization algorithms with accuracy certificates by equipping with these certificates a state-of-the-art algorithm for large-scale nonsmooth black-box-represented problems with convex structure, specifically, the Non-Euclidean Restricted Memory Level (NERML) method. In the third part, we present several novel academic applications of accuracy certificates. The dissertation is organized as follows: In Chapter 1, we motivate our research goals and present a detailed summary of our results. In Chapter 2, we outline the relevant background, specifically, describe four generic black-box-represented generic problems with convex structure (Convex Minimization, Convex-Concave Saddle Point, Convex Nash Equilibrium, and Variational Inequality with Monotone Operator), and outline the existing theory of accuracy certificates for these problems. In Chapter 3, we develop techniques for equipping with on-line accuracy certificates the state-of-the-art NERML algorithm for large-scale nonsmooth problems with convex structure, both in the cases when the domain of the problem is a simple solid and in the case when the domain is given by Separation oracle. In Chapter 4, we develop  several novel academic applications of accuracy certificates, primarily to (a) efficient certifying emptiness of the intersection of finitely many solids given by Separation oracles, and (b) building efficient algorithms for convex minimization over solids given by Linear Optimization oracles (both precise and approximate). In Chapter 5, we apply accuracy certificates to efficient decomposition of “well structured” convex-concave saddle point problems, with applications to computationally attractive decomposition of a large-scale LP program with the constraint matrix which becomes block-diagonal after eliminating a relatively small number of possibly dense columns (corresponding to “linking variables”) and possibly dense rows (corresponding to “linking constraints”).

The non-resonant bounded uniserial representations of Vec(R) form a certain class of extensions composed of tensor density modules, all of whose subquotients are indecomposable. The problem of classifying the extensions with a given composition series is reduced via cohomological methods to computing the solution of a certain system of polynomial equations in several variables derived from the cup equations for the extension. Using this method, we classify all non-resonant bounded uniserial extensions of Vec(R) up to length 6. Beyond this length, all such extensions appear to arise as subquotients of extensions of arbitrary length, many of which are explained by the psuedodifferential operator modules. Others are explained by a wedge construction and by the pseudodifferential operator cocycle discovered by Khesin and Kravchenko.

Orientador: Waldyr Alves Rodrigues Junior / Dissertação (mestrado profissional) - Universidade Estadual de Campinas, Instituto de Matemática, Estatistica e Computação Cientifica / Made available in DSpace on 2018-08-15T23:09:32Z (GMT). No. of bitstreams: 1 Resende_AdrianaSouza_M.pdf: 17553204 bytes, checksum: a66cefe30e9957cc4351e03d3aec35b2 (MD5) Previous issue date: 2010 / Resumo: O presente trabalho tem a intenção de apresentar por intermédio de uma linguagem unificada alguns conceitos de cálculo vetorial, álgebra linear (matrizes e transformações lineares) e também algumas idéias elementares sobre os grupos de rotações em duas e três dimensões e seus grupos de recobrimento, que geralmente são tratados como "fragmentos" em várias modalidades de cursos no ensino superior. Acreditamos portanto que nosso texto possas ser útil para alunos dos cursos de graduação dos cursos de Engenharia, Física, Matemática e interessados em Matemática em geral. A linguagem unificada à que nos referimos acima é obtida com a introdução do conceitos das álgebras geométricas (ou de Clifford) onde, como veremos, é possível fornecer uma formulação algébrica elegante aos conceitos de vetores, planos e volumes orientados e definir para tais objetos o produto escalar, os produtos contraídos à esquerda e à direita, o produto exterior (associado, como veremos, em casos particulares ao produto vetorial) e finalmente o produto geométrico (Clifford), o que permite o uso desses conceitos para a solução de inúmeros problemas de geometria analítica no R ² e no R ³. Procuramos ilustrar todos estes conceitos com vários exemplos e exercícios com graus variáveis de dificuldades. Nossa apresentação é bem próxima àquela do livro de Lounesto, e de fato muitas seções são traduções (eventualmente seguidas de comentários) de seções daquele livro. Contudo, em muitos lugares, acreditamos que nossa apresentação esclarece e completa as correspondentes do livro de Lounesto / Abstract: This paper aims to present using an unified language a few concepts of vector calculus, linear algebra (matrices and linear transformations) and also some basic ideas about the groups of rotations in two and three dimensions and their covering group, which generally are treated as "fragments" in various types of courses in higher education. We believe therefore that our text should be useful to students of undergraduate courses like Engineering, Physics, Mathematics and people interested in Mathematics in general. The unified language that we refer to above is obtained by introducing the concept of geometric (or Clifford) algebra where, as we shall see, it is possible to give an elegant algebraic formulation to the concepts of vectors, oriented planes and oriented volumes, and to define to those objects the scalar product, the right and left contracted products, the exterior product (associated, as we shall see, in particular cases to the vector product) and finally the geometric (Clifford) product, and moreover, to use those concepts to solve may problems of analytic geometry in R ² and R ³. We illustrated all those concepts with several examples and exercises with variable degrees of difficulties. Our presentation is nearly the one in Lounesto's book, and in fact some sections are no more than translations (eventually with commentaries) from sections of that book. However, in many places, we believe that our presentation clarify nd completement the corresponding ones in Lounesto's book / Mestrado / Ágebra / Mestre em Matemática