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 26 for “"Riemannian optimization"”.

  1. Controller Synthesis through Riemannian Optimization

    … and closed-loop systems through the usage of Riemannian optimization. In the closed-loop setting, the space of dynamic output-feedback controllers is formulated as a Riemannian orbit manifold, enabling fast and intrinsic optimization without reliance on extrinsic parameterizations. We …

    washington Repository record for Controller Synthesis through Riemannian Optimization (opens in a new tab)

  2. Scalable second-order Riemannian optimization for K-means clustering

    Submission published under a 24 month embargo labeled 'Closed Access', the embargo will last until 2027-12-01

    uiuc Repository record for Scalable second-order Riemannian optimization for K-means clustering (opens in a new tab)

  3. Load flow and optimal power flow in power distribution systems - application of Riemannian optimization and holomorphic embedding

    … the first part of this dissertation, we utilize Riemannian optimization and present two solution methods. The first solution method is applicable to the LF problem and is shown to fall into the category of Riemannian approximate Newton methods, which guarantees descent at each iteration while …

    bu Repository record for Load flow and optimal power flow in power distribution systems - application of Riemannian optimization and holomorphic embedding (opens in a new tab)

  4. Constrained Optimization on SO(3), via Pseudospectral Collocation

    … and a manifold, and thus demands on-manifold optimization techniques to preserve its geometric structure. Riemannian optimization is enabled by mapping problems to the tangent space through equivariant transformations, with the Cayley map providing a computationally efficient coordinate …

    embry-riddle Repository record for Constrained Optimization on SO(3), via Pseudospectral Collocation (opens in a new tab)

  5. A Riemannian approach to large-scale constrained least-squares with symmetries

    This thesis deals with least-squares optimization on a manifold of equivalence relations, e.g., in the presence of symmetries which arise frequently in many applications. While least-squares cost functions remain a popular way to model large-scale problems, the additional symmetry constraint should …

    liege Repository record for A Riemannian approach to large-scale constrained least-squares with symmetries (opens in a new tab) Download PDF for A Riemannian approach to large-scale constrained least-squares with symmetries (opens in a new tab)

  6. Adaptive algorithms for identification of symmetric and positive definite matrices

    … manifold of SPD matrices is used to develop a Riemannian optimization based adaptive Kalman filter that ensure positive definiteness of the estimate. The convergence of the Riemannian optimization-based estimate and the adaptive Kalman filter is established under mild conditions of uniform …

    texas Repository record for Adaptive algorithms for identification of symmetric and positive definite matrices (opens in a new tab)

  7. Rigid Body Constrained Motion Optimization and Control on Lie Groups and Their Tangent Bundles

    … utilized. All these groups are Lie groups and Riemannian manifolds, and these identifications have profound implications for dynamics and controls. The trajectory optimization and optimal control problem on Riemannian manifolds presents significant opportunities for theoretical development. …

    embry-riddle Repository record for Rigid Body Constrained Motion Optimization and Control on Lie Groups and Their Tangent Bundles (opens in a new tab)

  8. Nonconvex Optimization Methods: Iteration Complexity And Applications

    Nowadays, optimization algorithms have become an essential tool for a large variety of applications in many fields. Despite the hardness of nonconvexity, a large number of these applications are dealing with nonconvex optimization problems. In this thesis, we shall focus on several different …

    umn Repository record for Nonconvex Optimization Methods: Iteration Complexity And Applications (opens in a new tab)

  9. Rayleigh–quotient optimization on tensor products of Grassmannians

    … computer vision, can be described as constrained optimization tasks on certain subsets of tensor products of vector spaces. In this work, we make use of techniques from Riemannian geometry and analyze optimization tasks on subsets of so-called simple tensors which can be equipped with a …

    wurz-thes Repository record for Rayleigh–quotient optimization on tensor products of Grassmannians (opens in a new tab)

  10. Eigenstructure of polynomial and rational matrices: perturbation theory and nearness problems

    … problems, we use a novel approach that relies on Riemannian optimization. This approach leads to computational algorithms that often outperform the competitors in terms of the running time as well as the quality of the output.

    aalto Repository record for Eigenstructure of polynomial and rational matrices: perturbation theory and nearness problems (opens in a new tab)

  11. Mind the Metric: Methods in Metric-Informed Machine Learning

    … quantum-graphical models using geometry-aware optimization. Specifically, we present an approach to learn hidden quantum Markov models (HQMMs) through Riemannian gradient descent on the Stiefel manifold. Moreover, we establish a hierarchy of expressiveness relationships between HQMMs and linear …

    washington Repository record for Mind the Metric: Methods in Metric-Informed Machine Learning (opens in a new tab)

  12. A Riemannian perspective on matrix recovery and constrained optimization

    … the minimization of a smooth cost function on a Riemannian manifold, which then allows us to employ the theoretically rigorous Riemannian optimization framework, that calls on differential geometry tools to construct feasible iterative algorithms on specific Riemannian manifolds. In particular, …

    oxford Repository record for A Riemannian perspective on matrix recovery and constrained optimization (opens in a new tab)

  13. SCALABLE MATCHING OF DEFORMED IMAGES

    … a systematic empirical study comparing classical optimization-based and deep learning paradigms, addressing instrumentation bias in the literature and providing practitioners with a principled framework for selecting appropriate methods. Second, we introduce FireANTs, a GPU-accelerated framework …

    penn Repository record for SCALABLE MATCHING OF DEFORMED IMAGES (opens in a new tab)

  14. Robust machine learning for complex data: enhancing efficiency and powering healthcare solutions

    … medical and computational domains. Effective optimization is crucial in data-driven research, especially as many machine learning methods suffer from non-convex or non-smooth optimization problems. My research explores the Proximal Alternating Linearized Minimization (PALM) technique for …

    colo-mines Repository record for Robust machine learning for complex data: enhancing efficiency and powering healthcare solutions (opens in a new tab)

  15. METRIC AND TAME GEOMETRY IN OPTIMIZATION

    Structure in optimization is traditionally studied through variational analysis. Structural results usually require convexity or other regularity conditions. However, contemporary optimization involves problems that lie beyond this traditional scope, especially in machine learning, both in …

    cornell Repository record for METRIC AND TAME GEOMETRY IN OPTIMIZATION (opens in a new tab)

  16. Acceleration in first-order optimization methods: promenading beyond convexity or smoothness, and applications

    <p>Acceleration in optimization is a term that is generally applied to optimization algorithms presenting some common methodology that enjoy convergence rates that improve over other more simple algorithms for the same problem. For example, Nesterov's Accelerated Gradient Descent improves over the …

    oxford Repository record for Acceleration in first-order optimization methods: promenading beyond convexity or smoothness, and applications (opens in a new tab)

  17. Scalable Algorithms for Hypergraph Analytics using Symmetric Tensor Decompositions

    … advances in numerical linear algebra, numerical optimization, as well as high-performance computing. State-of-the-art tensor libraries incorporate high-performance tensor methods for general sparse tensors; however, they lack specialized algorithms for sparse tensors that are symmetric. This …

    gatech Repository record for Scalable Algorithms for Hypergraph Analytics using Symmetric Tensor Decompositions (opens in a new tab)

  18. The Role of Riemannian Manifolds in Computer Vision: From Coding to Deep Metric Learning

    … manifold, respectively, two widely used types of Riemannian manifolds in computer vision. As our first objective, we examine image and video-based recognition applications where the local descriptors have the aforementioned Riemannian structures, namely the SPD or linear subspace structure. …

    anu Repository record for The Role of Riemannian Manifolds in Computer Vision: From Coding to Deep Metric Learning (opens in a new tab)

Page 1 of 2