Trust-region and other regularisations of linear least-squares problems
DOI10.1007/S10543-008-0206-8zbMATH Open1165.65019OpenAlexW2099760222WikidataQ58185764 ScholiaQ58185764MaRDI QIDQ1014897FDOQ1014897
Authors: J. Martínez 
Publication date: 29 April 2009
Published in: BIT (Search for Journal in Brave)
Full work available at URL: http://purl.org/net/epubs/work/43562
Recommendations
- On solving trust-region and other regularised subproblems in optimization
- A trust-region approach to the regularization of large-scale discrete forms of ill-posed problems
- A regularized interior-point method for constrained linear least squares
- Dual regularized total least squares solution from two-parameter trust-region algorithm
- On the Solution of the Tikhonov Regularization of the Total Least Squares Problem
Newton methodregularisationtrust-regionsecular equationlinear least squaresGolub-Kahan bi-diagonalisation algorithm
Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Interior-point methods (90C51) Ill-posedness and regularization problems in numerical linear algebra (65F22)
Cites Work
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- CUTEr and SifDec
- Solving the Trust-Region Subproblem using the Lanczos Method
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rank-Deficient and Discrete Ill-Posed Problems
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- A method for the solution of certain non-linear problems in least squares
- Title not available (Why is that?)
- Smoothing by spline functions. II
- Trust Region Methods
- Nonlinear programming without a penalty function or a filter
- Rank-one modification of the symmetric eigenproblem
- A trust-region approach to the regularization of large-scale discrete forms of ill-posed problems
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A trust region SQP algorithm for equality constrained parameter estimation with simple parameter bounds
- On the Implementation of an Algorithm for Large-Scale Equality Constrained Optimization
- Iterative methods for finding a trust-region step
- Modified Gauss–Newton scheme with worst case guarantees for global performance
- Minimizing a quadratic over a sphere
- Cubic regularization of Newton method and its global performance
- On the truncated conjugate gradient method
- Quadratically constrained least squares and quadratic problems
- Algorithms for the regularization of ill-conditioned least squares problems
- Least squares with a quadratic constraint
- Solving Ill-Conditioned and Singular Linear Systems: A Tutorial on Regularization
- Numerical solution of a secular equation
- Global convergence of SSM for minimizing a quadratic over a sphere
- Solving quadratically constrained least squares using black box solvers
- Large-scale PDE-constrained optimization
- Title not available (Why is that?)
Cited In (15)
- On efficiency of nonmonotone Armijo-type line searches
- Nonlinear stepsize control, trust regions and regularizations for unconstrained optimization
- On an adaptive regularization for ill-posed nonlinear systems and its trust-region implementation
- Exploiting Problem Structure in Derivative Free Optimization
- An iterative algorithm for large size least-squares constrained regularization problems
- An adaptive regularization method in Banach spaces
- A direct method for a regularized least-squares problem.
- On solving trust-region and other regularised subproblems in optimization
- Updating the regularization parameter in the adaptive cubic regularization algorithm
- On the convergence of an inexact Gauss-Newton trust-region method for nonlinear least-squares problems with simple bounds
- A trust-region approach to the regularization of large-scale discrete forms of ill-posed problems
- A regularizing trust region algorithm for nonlinear ill-posed problems
- Complexity bounds for second-order optimality in unconstrained optimization
- Stochastic variance-reduced cubic regularization methods
- Adaptive Regularization Algorithms with Inexact Evaluations for Nonconvex Optimization
Uses Software
This page was built for publication: Trust-region and other regularisations of linear least-squares problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014897)
