Newton's algorithm in Euclidean Jordan algebras, with applications to robotics

DOI10.4310/CIS.2002.v2.n3.a5zbMath1087.68673OpenAlexW1996889705MaRDI QIDQ817396

Shintaro Yoshizawa, Sandra Ricardo, Uwe R. Helmke

Publication date: 16 March 2006

Published in: Communications in Information and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4310/cis.2002.v2.n3.a5

zbMATH Keywords

convex optimization problemdamped Newton algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Automated systems (robots, etc.) in control theory (93C85) Programming in abstract spaces (90C48) Jordan algebras (algebras, triples and pairs) (17C99)

Related Items (4)

An efficient damped Newton-type algorithm with globalization strategy on Riemannian manifolds ⋮ Damped Newton's method on Riemannian manifolds ⋮ Extended commutation principles for normal decomposition systems ⋮ Optimization Methods on Riemannian Manifolds via Extremum Seeking Algorithms

This page was built for publication: Newton's algorithm in Euclidean Jordan algebras, with applications to robotics