A secant method for nonlinear least-squares minimization
From MaRDI portal
Publication:434156
DOI10.1007/s10589-010-9336-4zbMath1245.90128OpenAlexW2129835959MaRDI QIDQ434156
Publication date: 10 July 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-010-9336-4
Related Items
Jacobian-free implicit inner-iteration preconditioner for nonlinear least squares problems, Structured two-point stepsize gradient methods for nonlinear least squares, Secant variable projection method for solving nonnegative separable least squares problems, A structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squares, Superlinearly convergent exact penalty methods with projected structured secant updates for constrained nonlinear least squares, A new sampling strategy willow tree method with application to path-dependent option pricing, Solving nonlinear equations with the Newton–Krylov method based on automatic differentiation, A brief survey of methods for solving nonlinear least-squares problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized inverses: theory and computations
- Some Convergence Properties of Broyden’s Method
- Testing Unconstrained Optimization Software
- The Efficient Computation of Structured Gradients using Automatic Differentiation
- Trust Region Methods
- A Class of Methods for Solving Nonlinear Simultaneous Equations
- A Family of Variable-Metric Methods Derived by Variational Means
- A new approach to variable metric algorithms
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- Conditioning of Quasi-Newton Methods for Function Minimization
- The Convergence of an Algorithm for Solving Sparse Nonlinear Systems
