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 5109 for “"Convex"”.
-
Blind Demodulation via Convex and Non-Convex Programming
… of $x$ and $w$ are known which admits intuitive convex programs. For the generative prior case, we study a non-convex program, the empirical risk minimization program. For the case where the vectors have known signs and belong to known subspaces, we introduce the convex program BranchHull, which …
-
Theoretical analysis for convex and non-convex clustering algorithms
… [subscript i], and the entire distribution is a convex sum over all distributions [mathematical equation]. We assume that the data is Gaussian or sub-gaussian, and analyze two algorithms: 1) Expectation-Maximization algorithm, which is notoriously non-convex and sensitive to local optima, and 2) …
-
Subgradients of algebraically convex functions: a Galois connection relating convex sets and subgradients of convex functions
<p>Subgradients of convex functions have been defined in classical analysis for the Euclidean spaces. Here we describe a Galois connection between convex upsets and maximal homomorphisms (which are subgradient values), and interpret traditional results in terms of universal algebra, noting that …
-
Computational convex analysis : from continuous deformation to finite convex integration
After introducing concepts from convex analysis, we study how to continuously transform one convex function into another. A natural choice is the arithmetic average, as it is pointwise continuous; however, this choice fails to average functions with different domains. On the contrary, the proximal …
-
Farkas - type results for convex and non - convex inequality systems
… - type results for inequality systems involving convex and/or non - convex functions. To be able to give the desired results, we treat optimization problems which involve convex and composed convex functions or non - convex functions like DC functions or fractions. To be able to use the fruitful …
-
Evolving convex hypersurfaces
… The majority of the thesis concerns the case of convex hypersurfaces. Section I of the thesis concerns evolution equations which generalise, in a certain sense, the well-known mean curvature flow : We consider the motion of hypersurfaces in Euclidean space, where the speed is a function of the …
-
Convex Object Detection
Scene understanding has become a fundamental research area in computer vision. To achieve this task, localizing and recognizing different objects in space is paramount. From the seminal work of face detection by Viola-Jones using cascaded Haar features to the state-of-the-art deep neural networks, …
-
Convex lattice polygons
… deals with three main extremal problems on convex lattice polygons in the plane. A convex lattice polygon is the intersection of a compact convex set with the integer lattice (the set of all points with integer coordinates). Let P represent a convex lattice polygon.
-
Variational Convex Analysis
… theoretical and applied results for variational convex analysis. First we present the basic tools of analysis necessary to develop the core theory and applications. New results concerning duality principles for systems originally modeled by non-linear differential equations are shown in chapters …
-
Efficient algorithms for simple bilevel optimization : from convex to non-convex
… for simple bilevel optimization in both convex and nonconvex settings, with an emphasis on provable convergence and tight complexity guarantees. A unifying theme of this work is the use of cutting-plane–based approximations of the lower-level solution set, which enable practical and …
-
Measures and Barycenters of Measures on Convex Sets in Locally Convex Spaces
Made available in DSpace on 2014-12-09T22:17:44Z (GMT). No. of bitstreams: 1 6812141.pdf: 2004987 bytes, checksum: 728b6517d6fbafa17d0bcc5c614ae9f9 (MD5) Previous issue date: 1968
-
Convex and quadratic programming
<p>This paper deals primarily with the theory of convex and quadratic programming problems and discusses algorithmic procedures used in solving such problems.</p><p>A general overview of mathematical programming is given in Chapter I. It includes formulations of linear, convex, and quadratic …
Page 1 of 256