Local results for the Gauss-Newton method on constrained rank-deficient nonlinear least squares
From MaRDI portal
Publication:4813613
DOI10.1090/S0025-5718-03-01611-9zbMATH Open1050.65059OpenAlexW1972721213MaRDI QIDQ4813613FDOQ4813613
Authors: Jerry Eriksson, Mårten Gulliksson 
Publication date: 13 August 2004
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-03-01611-9
Recommendations
- On solving nonlinear least-squares problems in case of rankdeficient Jacobians
- Publication:5751869
- Rank-deficient nonlinear least squares problems and subset selection
- Gauss-Newton methods with approximate projections for solving constrained nonlinear least squares problems
- Regularization methods for uniformly rank-deficient nonlinear least-squares problems
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rank-Deficient and Discrete Ill-Posed Problems
- The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables Separate
- Title not available (Why is that?)
- Title not available (Why is that?)
- A weighted pseudoinverse, generalized singular values, and constrained least squares problems
- Perturbation theory for pseudo-inverses
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms for the regularization of ill-conditioned least squares problems
- A new linesearch algorithm for nonlinear least squares problems
- Regularization tools for training large feed-forward neural networks using automatic differentiation∗
- Algorithms for Constrained and Weighted Nonlinear Least Squares
- KKT conditions for rank-deficient nonlinear least-square problems with rank-deficient nonlinear constraints
Cited In (16)
- A new algorithm for solving all the real roots of a nonlinear system of equations in a given feasible region
- Solving rank-deficient separable nonlinear equations
- Regularization methods for uniformly rank-deficient nonlinear least-squares problems
- Rank-deficient nonlinear least squares problems and subset selection
- Title not available (Why is that?)
- Local convergence analysis of proximal Gauss-Newton method for penalized nonlinear least squares problems
- KKT conditions for rank-deficient nonlinear least-square problems with rank-deficient nonlinear constraints
- On convergence of a truncated Gauss-Newton method for solving underdetermined nonlinear least squares problems
- Sensor network localization, Euclidean distance matrix completions, and graph realization
- On solving nonlinear least-squares problems in case of rankdeficient Jacobians
- Inverse functions of polynomials and its applications to initialize the search of solutions of polynomials and polynomial systems
- An algorithm to initialize the search of solutions of polynomial systems
- Truncated Gauss–Newton algorithms for Ill-conditioned nonlinear least squares problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- A doubly relaxed minimal-norm Gauss-Newton method for underdetermined nonlinear least-squares problems
Uses Software
This page was built for publication: Local results for the Gauss-Newton method on constrained rank-deficient nonlinear least squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4813613)
