Multihomogeneous Newton methods

Jean-Pierre Dedieu; Mike Shub

doi:10.1090/s0025-5718-99-01114-x

Mathematics of Computation

Paper

01 Jan 2000

Multihomogeneous Newton methods

Download paper

Abstract

We study multihomogeneous analytic functions and a multihomogeneous Newton's method for finding their zeros. We give a convergence result for this iteration and we study two examples: the evaluation map and the generalized eigenvalue problem.

Paper

A globally convergent lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds

A.R. Conn, Nick Gould, et al.

Mathematics of Computation

Paper

A remark on an algorithm for best L^p approximation

Charles Micchelli

Journal of Approximation Theory

Paper

Multiparameter parallel search branch switching

Michael E. Henderson

International Journal of Bifurcation and Chaos in Applied Sciences and Engineering

Paper

Vertex-Ant-Walk - A robust method for efficient exploration of faulty graphs

Vladimir Yanovski, Israel A. Wagner, et al.

Ann. Math. Artif. Intell.

View all publications

Abstract

Related

A globally convergent lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds

A remark on an algorithm for best Lp approximation

Multiparameter parallel search branch switching

Vertex-Ant-Walk - A robust method for efficient exploration of faulty graphs

A remark on an algorithm for best L^p approximation