The Condition Number of Riemannian Approximation Problems

DOI10.1137/20M1323527zbMath1462.90133arXiv1909.12186WikidataQ115246902 ScholiaQ115246902MaRDI QIDQ5857299

Paul Breiding, Nick Vannieuwenhoven

Publication date: 31 March 2021

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.12186

zbMATH Keywords

sensitivitysecond fundamental formcondition numberlocal minimizersWeingarten mapRiemannian least-squares problem

Mathematics Subject Classification ID

General theory of numerical analysis in abstract spaces (65J05) Sensitivity, stability, parametric optimization (90C31) Numerical computation of solutions to systems of equations (65H10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Differential invariants (local theory), geometric objects (53A55) Computational issues in computer and robotic vision (65D19)

Related Items (7)

Learning diagonal Gaussian mixture models and incomplete tensor decompositions ⋮ Algebraic compressed sensing ⋮ The condition number of many tensor decompositions is invariant under Tucker compression ⋮ Line Multiview Varieties ⋮ The average condition number of most tensor rank decomposition problems is infinite ⋮ Unnamed Item ⋮ Sensitivity of low-rank matrix recovery

Uses Software

• JDQR
• mctoolbox
• JDQZ
• Manopt

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Low-rank tensor completion by Riemannian optimization
• Geometric measures of convex sets and bounds on problem sensitivity and robustness for conic linear optimization
• Sur la théorie des enveloppes
• Condition numbers and error bounds in convex programming
• A geometric analysis of Renegar's condition number, and its interplay with conic curvature
• On condition numbers and the distance to the nearest ill-posed problem
• The geometry of ill-conditioning
• Numerical stability for solving nonlinear equations
• Theory of reconstruction from image motion
• Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system
• Convergence analysis of Riemannian Gauss-Newton methods and its connection with the geometric condition number
• Linear programming, complexity theory and elementary functional analysis
• Optimization on the hierarchical Tucker manifold - applications to tensor completion
• On manifolds of tensors of fixed TT-rank
• The normal singularities of a submanifold
• A Primal-Dual Algorithm for Solving Polyhedral Conic Systems with a Finite-Precision Machine
• A New Condition Measure, Preconditioners, and Relations Between Different Measures of Conditioning for Conic Linear Systems
• Riemannian Trust Regions with Finite-Difference Hessian Approximations are Globally Convergent
• Riemannian Optimization for High-Dimensional Tensor Completion
• Nonconvex Phase Synchronization
• Condition
• Low-Rank Matrix Completion by Riemannian Optimization
• Introduction to Smooth Manifolds
• Manopt, a Matlab toolbox for optimization on manifolds
• A Riemannian trust-region method for low-rank tensor completion
• Implicit Functions and Solution Mappings
• A Condition Number for Multifold Conic Systems
• Differential Topology
• The Minimum Norm Projection on C 2 -Manifolds in R n
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• Algebraic properties of multilinear constraints
• Templates for the Solution of Algebraic Eigenvalue Problems
• Non-Convex Phase Retrieval From STFT Measurements
• On Intrinsic Cramér-Rao Bounds for Riemannian Submanifolds and Quotient Manifolds
• The Condition Number of Join Decompositions
• Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
• Incorporating Condition Measures into the Complexity Theory of Linear Programming
• Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear Programs
• A Coordinate-Free Condition Number for Convex Programming
• A Data-Independent Distance to Infeasibility for Linear Conic Systems
• The Extrinsic Geometry of Dynamical Systems Tracking Nonlinear Matrix Projections
• A Riemannian Trust Region Method for the Canonical Tensor Rank Approximation Problem
• Riemannian Geometry
• An Extrinsic Look at the Riemannian Hessian
• A Theory of Condition
• On an Extension of Condition Number Theory to Nonconic Convex Optimization
• Set-valued analysis
• A new condition number for linear programming
• The Euclidean distance degree of an algebraic variety

This page was built for publication: The Condition Number of Riemannian Approximation Problems