Newton's method for overdetermined systems of equations
From MaRDI portal
(Redirected from Publication:4955863)
Recommendations
- Convergence of Newton's method for a type of overdetermined systems
- Kantorovich type convergence of Newton's iteration for systems of nonlinear equations with constant rank derivatives
- Newton's method for analytic systems of equations with constant rank derivatives
- The theory of Newton's method
- Local convergence of the Gauss-Newton method for injective-overdetermined systems
Cites work
- Circle fitting by linear and nonlinear least squares
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Complexity of Bezout's theorem. III: Condition number and packing
- Complexity of Bezout's theorem. V: Polynomial time
- Complexity of Bezoutâs Theorem IV: Probability of Success; Extensions
- Condition Number Analysis for Sparse Polynomial Systems
- scientific article; zbMATH DE number 421657 (Why is no real title available?)
- scientific article; zbMATH DE number 434714 (Why is no real title available?)
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- scientific article; zbMATH DE number 4034691 (Why is no real title available?)
- scientific article; zbMATH DE number 3791008 (Why is no real title available?)
- scientific article; zbMATH DE number 46726 (Why is no real title available?)
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 3476451 (Why is no real title available?)
- Multihomogeneous Newton methods
- On generalized Newton algorithms: Quadratic convergence, path-following and error analysis
- On the efficiency of algorithms of analysis
- On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
- Optimization Techniques on Riemannian Manifolds
Cited in
(44)- Nearest multivariate system with given root multiplicities
- Some lower bounds for the complexity of continuation methods
- Newton's method for analytic systems of equations with constant rank derivatives
- A heuristic method for certifying isolated zeros of polynomial systems
- Well posedness of ODE's and continuity equations with nonsmooth vector fields, and applications
- Probabilistic condition number estimates for real polynomial systems. I: A broader family of distributions
- A new nonmonotone line-search trust-region approach for nonlinear systems
- An efficient line search trust-region for systems of nonlinear equations
- On semilocal convergence analysis for two-step Newton method under generalized Lipschitz conditions in Banach spaces
- Gauss-Newton methods with approximate projections for solving constrained nonlinear least squares problems
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- Extended Newton-type method and its convergence analysis for nonsmooth generalized equations
- Determining dimension of the solution component that contains a computed zero of a polynomial system
- Newton's method with deflation for isolated singularities of polynomial systems
- Numerical Evidence for a Conjecture in Real Algebraic Geometry
- On the mathematical foundations of learning
- Improved local convergence analysis of inexact Newton-like methods under the majorant condition
- On the convergence of extended Newton-type method for solving variational inclusions
- Extended Newton methods for conic inequalities: approximate solutions and the extended Smale -theory
- Conditions for Superlinear Convergence in l1 and l Solutions of Overdetermined Non-linear Equations
- Convergence of Newton's method for a type of overdetermined systems
- Regularization and matrix computation in numerical polynomial algebra
- Convergence analysis of the Gauss-Newton-type method for Lipschitz-like mappings
- On simple double zeros and badly conditioned zeros of analytic functions of đ variables
- Computing multiple roots of inexact polynomials
- scientific article; zbMATH DE number 3994925 (Why is no real title available?)
- Overdetermined Weierstrass iteration and the nearest consistent system
- Local convergence analysis of inexact Gauss-Newton method for singular systems of equations under majorant and center-majorant condition
- Convergence of the Gauss-Newton method for a special class of systems of equations under a majorant condition
- Local convergence of the Gauss-Newton method for injective-overdetermined systems of equations under a majorant condition
- The numerical factorization of polynomials
- On the solution of systems of equations with constant rank derivatives
- Kantorovich type convergence of Newton's iteration for systems of nonlinear equations with constant rank derivatives
- Convergence properties of a restricted Newton-type method for generalized equations with metrically regular mappings
- Kronecker's and Newton's approaches to solving: a first comparison
- Minimization methods for approximating tensors and their comparison
- Local convergence analysis of the Gauss-Newton method under a majorant condition
- Extending the applicability of the Gauss-Newton method under average Lipschitz-type conditions
- An Algorithm for the Intersection Problem of Planar Parametric Curves
- Local convergence analysis of inexact Gauss-Newton like methods under majorant condition
- Certification for polynomial systems via square subsystems
- 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
- Convergence behavior of Gauss-Newton's method and extensions of the Smale point estimate theory
This page was built for publication: Newton's method for overdetermined systems of equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4955863)
