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 150 for “"Convex functions"”.
-
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 …
-
Optimal transportation and barycenter problems via convex functions
… transportation is approached by studying the convex functions underlying optimal transports, listing convex functions for known transports and introduce new cases. Chapter six develops barycentric applications. The rst section develops 2-Wasserstein barycenter results. Using a xed-point …
-
A Robust Control Perspective on Optimization of Strongly-Convex Functions
… requires neither non-negative definite storage functions nor hard IQCs. Then we show that linear rate analysis of a given deterministic first-order method is equivalent to uniform stability analysis of a related scaled system. This enables derivation of linear rate analysis conditions using …
-
A sharp bound for the fourth coefficient for bounded convex functions
… for the fourth coefficient for bounded univalent convex functions considered as a subclass of Schlicht functions. In so doing, we reduce the maximal configuration for this functional to no more than three proper sides using Julia Variational Techniques, and we then examine some of the possible …
-
Maximizing the generalized Fekete-Szego functional over a class of hyperbolically convex functions
… functional over the class of hyperbolically convex functions. In trying to find the extremal, the Julia variational formula will be used to reduce the problem to mappings having no more than two proper sides. We will then find a range of t-values for which the one-sided mapping is extremal …
-
Estimation And Inference For Convex Functions And Computational Efficiency In High Dimensional Statistics
… inference for the minimizer and the minimum of convex functions, and the means for other statistical problems, like computational concerns in high dimensional statistics. In this dissertation, we consider both optimization-related problems.Estimation and inference for the minimizer and minimum …
-
Convex regression and its extensions to learning a Bregman divergence and difference of convex functions
Nonparametric convex regression has been extensively studied over the last two decades. It has been shown any Lipschitz convex function can be approximated with arbitrarily accuracy with a max of linear functions. Using this framework, in this thesis we generalize convex regression to learning an …
-
Best Approximation With Geometric Constraints
… Lp approximation to a function in Lp (0,1) by convex functions, (m, n)-convex functions, (m, n)-convex functions and (m, n)-convex splines, for 1 < p < ∞ , and best uniform approximation to a continuous function by convex functions, quasi-convex functions and piecewise monotone functions.
-
Optimization, Convergence, and Duality
… a notion of convergence for a sequence of convex functions was studied by Wijsman, Mosco, and Joly. This convergence, not comparable to pointwise convergence, has several important properties: it is preserved under the Fenchel transform, and it is equivalent to a convergence which can be …
-
Convex and Nonconvex Optimization Techniques for Multifacility Location and Clustering
… optimization methods for solving nonsmooth nonconvex problems with applications to multifacility location and clustering. A variational geometric approach is used for developing calculus rules for subgradients and Fenchel conjugates of convex functions that are not necessarily differentiable in …
-
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 …
-
Convexity and curvature in Lorentzian geometry
… these curvature bound conditions together with convex functions are effective means to study the geometry of space-times. Chapter 3 explores the relation between convex functions and geodesic connectedness of space-times. We give geometric-topological proofs of geodesic connectedness for classes …
-
Γεωμετρικές εκδοχές λήμματος Schwarz και ημιομάδες ολόμορφων συναρτήσεων
… and contain basic notation regarding holomorphic functions and Potential Theory. In the third chapter, already known aspects of Schwarz’s lemma are presented. Furthermore, we prove two monotonicity theorems for convex functions and a geometric version of Schwarz’s lemma for total absolute …
-
Automated reasoning in first-order real vector spaces
… metric spaces, continuity, and multivariate convex functions, which, by necessity, involves the formalisation of a selection of classically significant and useful mathematical theorems. Notable formalisations include the first mechanical proof of the Cauchy-Schwarz inequality in a first-order …
Page 1 of 8