arXiv subjects

Estefanía Loayza-Romero

Publications and source records attributed to Estefanía Loayza-Romero.

5 recordsLinked to original sources

arXiv2026

Retraction based regression methods on Riemannian manifolds

Geodesic regression generalizes classical regression models to manifold-valued data by replacing affine models in Euclidean spaces with geodesic models on Riemannian manifolds. In this paper, we set up a framework for regression based on retractions instead of the Riemannian exponential map and its corresponding retraction-based distance. The associated optimization problem is posed on a subset of the tangent bundle which is why we additionally construct retractions on the tangent bundle induced by retractions on the underlying manifold. Our approach yields a more flexible formulation which is applicable beyond settings where the exponential map can be computed efficiently. As a proof of concept, we apply the developed framework to the (n-1)-dimensional p-norm sphere using the retraction by normalization to define the regression problem. The resulting optimization problem is solved using the Riemannian steepest descent method.

math.OC↗

arXiv2024

A general formulation of reweighted least squares fitting

We present a generalized formulation for reweighted least squares approximations. The goal of this article is twofold: firstly, to prove that the solution of such problem can be expressed as a convex combination of certain interpolants when the solution is sought in any finite-dimensional vector space; secondly, to provide a general strategy to iteratively update the weights according to the approximation error and apply it to the spline fitting problem. In the experiments, we provide numerical examples for the case of polynomials and splines spaces. Subsequently, we evaluate the performance of our fitting scheme for spline curve and surface approximation, including adaptive spline constructions.

math.NA↗

arXiv2024

Multi-level Optimal Control with Neural Surrogate Models

Optimal actuator and control design is studied as a multi-level optimisation problem, where the actuator design is evaluated based on the performance of the associated optimal closed loop. The evaluation of the optimal closed loop for a given actuator realisation is a computationally demanding task, for which the use of a neural network surrogate is proposed. The use of neural network surrogates to replace the lower level of the optimisation hierarchy enables the use of fast gradient-based and gradient-free consensus-based optimisation methods to determine the optimal actuator design. The effectiveness of the proposed surrogate models and optimisation methods is assessed in a test related to optimal actuator location for heat control.

math.OC↗

arXiv2023

A Discretize-Then-Optimize Approach to PDE-Constrained Shape Optimization

We consider discretized two-dimensional PDE-constrained shape optimization problems, in which shapes are represented by triangular meshes. Given the connectivity, the space of admissible vertex positions was recently identified to be a smooth manifold, termed the manifold of planar triangular meshes. The latter can be endowed with a complete Riemannian metric, which allows large mesh deformations without jeopardizing mesh quality; see arXiv:2012.05624. Nonetheless, the discrete shape optimization problem of finding optimal vertex positions does not, in general, possess a globally optimal solution. To overcome this ill-possedness, we propose to add a mesh quality penalization term to the objective function. This allows us to simultaneously render the shape optimization problem solvable, and keep track of the mesh quality. We prove the existence of a globally optimal solution for the penalized problem and establish first-order necessary optimality conditions independently of the chosen Riemannian metric. Because of the independence of the existence results of the choice of the Riemannian metric, we can numerically study the impact of different Riemannian metrics on the steepest descent method. We compare the Euclidean, elasticity, and a novel complete metric, combined with Euclidean and geodesic retractions to perform the mesh deformation.

math.OC↗

arXiv2022

A Manifold of Planar Triangular Meshes with Complete Riemannian Metric

Shape spaces are fundamental in a variety of applications including image registration, morphing, matching, interpolation, and shape optimization. In this work, we consider two-dimensional shapes represented by triangular meshes of a given connectivity. We show that the collection of admissible configurations representable by such meshes form a smooth manifold. For this manifold of planar triangular meshes we propose a geodesically complete Riemannian metric. It is a distinguishing feature of this metric that it preserves the mesh connectivity and prevents the mesh from degrading along geodesic curves. We detail a symplectic numerical integrator for the geodesic equation in its Hamiltonian formulation. Numerical experiments show that the proposed metric keeps the cell aspect ratios bounded away from zero and thus avoids mesh degradation along arbitrarily long geodesic curves.

math.NA↗