On iterative methods for solving nonlinear least squares problems over convex sets
From MaRDI portal
Publication:2535481
DOI10.1007/BF02771609zbMath0183.18004MaRDI QIDQ2535481
Publication date: 1967
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Related Items (6)
A method for computing the tension parameters in convexitity-preserving spline-in-tension interpolation ⋮ An algorithm for constructing convexity and monotonicity-preserving splines in tension ⋮ Hybrid method for nonlinear least-square problems without calculating derivatives ⋮ A minimal norm corrected underdetermined Gauß-Newton procedure ⋮ Minimization methods with constraints ⋮ Pseudoinverse operators and recursive calculation of pseudosolutions in Hilbert spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Newton's method for convex programming and Tschebyscheff approximation
- A Newton-Raphson method for the solution of systems of equations
- Proximity Maps for Convex Sets
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- A Class of Iterative Procedures for Linear Inequalities
- On a Theorem Used in Nonlinear Least Squares
- Iterative Methods for Solving Nonlinear Least Squares Problems
- Iterative Solution of Nonlinear Optimal Control Problems
- Contributions to the Theory of Generalized Inverses
This page was built for publication: On iterative methods for solving nonlinear least squares problems over convex sets