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 1250 for “"convex"”.
-
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 …
-
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.
-
Reconstructing convex sets
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1985.
-
Convex Network Flows
… Our problem formulation, which we call the convex flow problem, only assumes that the constraints on the flows over each edge are in some convex set. The objective is to maximize a sum of concave utility functions---one for the net flow at every node and one for each edge flow---subject to …
-
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 modeling with priors
… derived. The resulting approximations are convex and thus have only global minima and can be solved efficiently. The functional relationships amongst data are given as sums of nonlinear kernels that are expressive enough to approximate any mapping. Depending on the specifics of the prior, …
-
Robust boosting via convex optimization
In dieser Arbeit werden statistische Lernprobleme betrachtet. Lernmaschinen extrahieren Informationen aus einer gegebenen Menge von Trainingsmustern, so daß sie in der Lage sind, Eigenschaften von bisher ungesehenen Mustern - z.B. eine Klassenzugehörigkeit - vorherzusagen. Wir betrachten den Fall, …
-
Convex decomposition of indoor scenes
Submission published under a 24 month embargo labeled 'Closed Access', the embargo will last until 2024-12-01
-
Subgradient methods for convex minimization
… of an objective cost function that is convex but not differentiable. Such a minimization arises, for example, in model construction, system identification, neural networks, pattern classification, and various assignment, scheduling, and allocation problems. To solve convex but not …
-
Constrained control using convex optimization
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 1997.
-
Subspace identification via convex optimization
In this thesis we consider convex optimization-based approaches to the classical problem of identifying a subspace from noisy measurements of a random process taking values in the subspace. We focus on the case where the measurement noise is component-wise independent, known as the factor analysis …
-
Fourier decoupling for convex sequences
… transform sup- ported in a neighborhood of a convex sequence [formula], where [formula] and 𝑔 : [0, 1] → R is a 𝐶² function satisfying 𝑔′(𝑥) > 0, 𝑔′′(𝑥) > 0 for every 𝑥 ∈ [0, 1]. We utilize the wave packet structure of functions with frequency support in a neigh- borhood of an arithmetic …
-
Convex Modeling Techniques for Aircraft Control
The need to design a controller that self-schedules itself during the flight of an aircraft has been an active area of research. New methods have been developed beyond the traditional gain-scheduling approach. One such design method leads to a linear parameter varying (LPV) controller that changes …
-
Successive convex approximation: analysis and applications
… locally tight upper bounds of f or strictly convex local approximations of f. Different block selection rules are considered such as cyclic (Gauss-Seidel), greedy (Gauss-Southwell), randomized, or even multiple (Parallel) simultaneous blocks. We characterize the convergence conditions and …
-
Convex hulls of planar random walks
… the perimeter length Ln and the area An of the convex hull of the first n steps of a planar random walk, this thesis study n -> ∞ mean and variance asymptotics and establish distributional limits. The results apply to random walks both with drift (the mean of random walk increments) and with no …
Page 1 of 63