Newton's method for overdetermined systems of equations
From MaRDI portal
Publication:4955863
DOI10.1090/S0025-5718-99-01115-1zbMath0949.65061OpenAlexW2019363796MaRDI QIDQ4955863
Michael Shub, Jean-Pierre Dedieu
Publication date: 22 May 2000
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-99-01115-1
convergenceNewton's methodHilbert spacescontinuation methodoverdetermined systemsparameter-dependent systemscomplexity upper bound estimates
Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15) Numerical algorithms for specific classes of architectures (65Y10)
Related Items
Certification for polynomial systems via square subsystems ⋮ Extended Newton methods for conic inequalities: approximate solutions and the extended Smale \(\alpha\)-theory ⋮ On semilocal convergence analysis for two-step Newton method under generalized Lipschitz conditions in Banach spaces ⋮ A heuristic method for certifying isolated zeros of polynomial systems ⋮ Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\) ⋮ Convergence analysis of the Gauss-Newton-type method for Lipschitz-like mappings ⋮ Well posedness of ODE's and continuity equations with nonsmooth vector fields, and applications ⋮ Extended Newton-type method and its convergence analysis for nonsmooth generalized equations ⋮ Local convergence analysis of the Gauss-Newton method under a majorant condition ⋮ Minimization methods for approximating tensors and their comparison ⋮ Extending the applicability of the Gauss-Newton method under average Lipschitz-type conditions ⋮ Probabilistic condition number estimates for real polynomial systems. I: A broader family of distributions ⋮ Overdetermined Weierstrass iteration and the nearest consistent system ⋮ Convergence criterion of Newton's method for singular systems with constant rank derivatives ⋮ Kantorovich's type theorems for systems of equations with constant rank derivatives ⋮ Local convergence analysis of inexact Gauss-Newton method for singular systems of equations under majorant and center-majorant condition ⋮ Numerical Evidence for a Conjecture in Real Algebraic Geometry ⋮ Determining dimension of the solution component that contains a computed zero of a polynomial system ⋮ Local convergence of the Gauss-Newton method for injective-overdetermined systems of equations under a majorant condition ⋮ Computing multiple roots of inexact polynomials ⋮ The numerical factorization of polynomials ⋮ Regularization and Matrix Computation in Numerical Polynomial Algebra ⋮ A new nonmonotone line-search trust-region approach for nonlinear systems ⋮ On the mathematical foundations of learning ⋮ On the solution of systems of equations with constant rank derivatives ⋮ Kronecker's and Newton's approaches to solving: a first comparison ⋮ Convergence behavior of Gauss-Newton's method and extensions of the Smale point estimate theory ⋮ Improved local convergence analysis of inexact Newton-like methods under the majorant condition ⋮ Newton's method with deflation for isolated singularities of polynomial systems ⋮ An efficient line search trust-region for systems of nonlinear equations ⋮ On the convergence of extended Newton-type method for solving variational inclusions ⋮ Nearest multivariate system with given root multiplicities ⋮ Gauss-Newton methods with approximate projections for solving constrained nonlinear least squares problems ⋮ Convergence of the Gauss–Newton method for a special class of systems of equations under a majorant condition ⋮ Some lower bounds for the complexity of continuation methods ⋮ Local convergence analysis of inexact Gauss-Newton like methods under majorant condition ⋮ Convergence properties of a restricted Newton-type method for generalized equations with metrically regular mappings ⋮ Newton's method for analytic systems of equations with constant rank derivatives ⋮ On simple double zeros and badly conditioned zeros of analytic functions of 𝑛 variables
Cites Work
- Circle fitting by linear and nonlinear least squares
- On generalized Newton algorithms: Quadratic convergence, path-following and error analysis
- Complexity of Bezout's theorem. V: Polynomial time
- Complexity of Bezout's theorem. III: Condition number and packing
- On the efficiency of algorithms of analysis
- Optimization Techniques on Riemannian Manifolds
- Condition Number Analysis for Sparse Polynomial Systems
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
- Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
- Multihomogeneous Newton methods
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Newton's method for overdetermined systems of equations
