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 11 of 11 for “"polyhedral cones"”.
-
Cost-Minizming Networks and Polyhedral Cones
… fluid clusters in space by cost-minimizing polyhedral surfaces, where “cost” is a weighted area. We also discuss planar configurations of immiscible fluid clusters modeled by costminimizing networks, where cost is a weighted length. We give necessary and sufficient conditions for local …
-
Solid Angle Measure Approximation Methods for Polyhedral Cones
Polyhedral cones are of interest in many fields, like geometry and optimization. A simple, yet fundamental question we may ask about a cone is how large it is. As cones are unbounded, we consider their solid angle measure: the proportion of space that they occupy. Beyond dimension three, definitive …
-
Convex cones, polyhedral sets and polytopes applied to linear systems and linear programming
<p>This study, explores the subject of convex cones, polyhedral sets, polytopes and their relationship to linear systems and linear programming. This paper begins with the theory of convex sets. At this point necessary definitions, examples, and theorems of convexity are stated. These theorems and …
-
Domination and Decomposition in Multiobjective Programming
… structure is defined in terms of different cones. Using concepts from linear algebra and convex analysis, a well known result relating nondominated points for polyhedral cones with Pareto solutions is generalized to nonpolyhedral cones that are induced by positively homogeneous functions, …
-
On some deterministic properties of stochastic gradient descent and random projection sequences
… by Meshulam for affine subspaces in ℝⁿ, to polyhedral sets in infinite-dimensional Hilbert spaces. We also note that certain assumptions are necessary to guarantee boundedness for affine subspaces in infinite-dimensional spaces. To address this problem, we introduce the so-called innate …
-
Truncation maps and geometry of deep learning
… the action of ReLU layers in terms of cones and polyhedral cones, and to construct explicit zero-loss classifiers for clustered, sequentially linearly separable, and certain non-separable data sets. Second, the dissertation analyzes training dynamics by comparing standard gradient flow …
-
Reduction, Projection, and Simplification of Metabolic Networks
… make use of (mixed integer) linear optimisation, polyhedral cones, linear algebra, and oriented matroids.
-
Polyhedral domains for abstract interpretation in logic programming
… The focus of this thesis is on the use of two polyhedral domains as a means of capturing these properties of interest in logic programs. This thesis demonstrates how polyhedra can be employed to capture analyses that relate to dependency information with respect to some measure of size. …
-
Polyhedral Domains for Abstract Interpretation in Logic Programming
… The focus of this thesis is on the use of two polyhedral domains as a means of capturing these properties of interest in logic programs. This thesis demonstrates how polyhedra can be employed to capture analyses that relate to dependency information with respect to some measure of size. …
-
Quality Representation in Multiobjective Programming
… programs with solution sets determined by convex cones. The Bilevel Controlled Spacing (BCS) method has a bilevel structure with the lower-level generating the nondominated points and the upper-level controlling the spacing. The Constraint Controlled Spacing (CCS) method is based on the …
-
CONVEX OPTIMIZATION METHODS FOR ROBUST AND DETERMINISTIC OPTIMAL POWER FLOW PROBLEMS
… positive semidefinite matrices from without by a polyhedral cone. A recursive method is also developed, which refines said polyhedral cone in those regions that are important for optimization\ to improve the performance of the relaxation. The practical value of our method is that one can obtain a …