Geometric design of the tangent term in landing algorithms for orthogonality constraints
We propose a family a metrics over the set of full-rank $n\times p$ real matrices, and apply them to the landing framework for optimization under orthogonality constraints. The family of metrics we propose is a natural extension of the $β$-metric, defined on the Stiefel manifold.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
A second-order method landing on the Stiefel manifold via Newton$\unicode{x2013}$Schulz iteration
Retraction-free approaches offer attractive low-cost alternatives to Riemannian methods on the Stiefel manifold, but they are often first-order, which may limit the efficiency under high-accuracy requirements. To this en…
Graph Convolutional Networks from the Perspective of Sheaves and the Neural Tangent Kernel
Graph convolutional networks are a popular class of deep neural network algorithms which have shown success in a number of relational learning tasks. Despite their success, graph convolutional networks exhibit a number o…
Relational ReasoningFast and accurate optimization on the orthogonal manifold without retraction
We consider the problem of minimizing a function over the manifold of orthogonal matrices. The majority of algorithms for this problem compute a direction in the tangent space, and then use a retraction to move in that d…
Descent & Landing Trajectory and Guidance Algorithms with Divert Capabilities for Moon Landing
This paper presents the preliminary design of the descent and landing trajectory of the ESA Argonaut lunar lander. The mission scenario and driving system constraints are presented and accounted for in the design of a fu…
Visual Environment Assessment for Safe Autonomous Quadrotor Landing
Autonomous identification and evaluation of safe landing zones are of paramount importance for ensuring the safety and effectiveness of aerial robots in the event of system failures, low battery, or the successful comple…