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

DOI10.4310/CIS.2002.V2.N3.A5MaRDI QIDQ817396zbMATH OpenOpenAlexFDO

Authors Sandra Ricardo, Shintaro Yoshizawa, Uwe 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) Programming in abstract spaces (90C48) Automated systems (robots, etc.) in control theory (93C85) Jordan algebras (algebras, triples and pairs) (17C99)

Recommendations

• Euclidean Jordan algebras and interior-point algorithms
• A full-Newton step interior-point algorithm for symmetric cone convex quadratic optimization
• Jordan-algebraic aspects of nonconvex optimization over symmetric cones
• Several Jordan-algebraic aspects of optimization†
• Linear systems in Jordan algebras and primal-dual interior-point algorithms

Cited in

(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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817396)