Least squares with a quadratic constraint

DOI10.1007/BF01396656zbMath0437.65031MaRDI QIDQ1141460

Walter Gander

Publication date: 1981

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132703

zbMATH Keywords

algorithmsleast squaresinequality constraintquadratic constraintdual normal equationsexistence and unicity of a solution

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (37)

Parameterized eigensolution technique for solving constrained least squares problems^∗ ⋮ On Local Minimizers of Nonconvex Homogeneous Quadratically Constrained Quadratic Optimization with at Most Two Constraints ⋮ Optimization landscape in the simplest constrained random least-square problem ⋮ On inhomogeneous eigenvalue problems. I ⋮ Variational analysis of an extended eigenvalue problem ⋮ Optimal estimation from limited noisy data ⋮ A projection technique for partitioning the nodes of a graph ⋮ A constrained eigenvalue problem ⋮ Noise reconstruction for the inversion heat conduction problem ⋮ Sensor network localization with imprecise distances ⋮ Hidden convexity in some nonconvex quadratically constrained quadratic programming ⋮ The backus-gilbert method revisited: background, implementation and examples ⋮ New zero-finders for trust-region computations ⋮ Solving inverse cone-constrained eigenvalue problems ⋮ Discrete ill-posed least-squares problems with a solution norm constraint ⋮ Solving large-scale constrained least-squares problems. ⋮ Quadratic minimisation problems in statistics ⋮ Efficient determination of the hyperparameter in regularized total least squares problems ⋮ Least squares problems with absolute quadratic constraints ⋮ Algorithms for the computation of functionals defined on the solution of a discrete ill-posed problem ⋮ A unifying convergence analysis of second-order methods for secular equations ⋮ Quadratically constrained least squares and quadratic problems ⋮ A direct method for a regularized least-squares problem ⋮ Solving quadratically constrained least squares using black box solvers ⋮ A spectral clustering method for microarray data ⋮ Semidefinite programming and combinatorial optimization ⋮ On condition numbers for least squares with quadric inequality constraint ⋮ Unnamed Item ⋮ Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations ⋮ Trust-region and other regularisations of linear least-squares problems ⋮ A survey on variational characterizations for nonlinear eigenvalue problems ⋮ Fitting conics of specific types to data ⋮ Matrix pencils and existence conditions for quadratic programming with a sign-indefinite quadratic equality constraint ⋮ Indefinite abstract splines with a quadratic constraint ⋮ Regularized total least squares based on quadratic eigenvalue problem solvers ⋮ On local nonglobal minimum of trust-region subproblem and extension ⋮ Tikhonov regularization and the L-curve for large discrete ill-posed problems

Cites Work

• Unnamed Item
• Unnamed Item
• Smoothing by spline functions.
• Once again: The least square problem
• An Algorithm for Least-Squares Estimation of Nonlinear Parameters
• Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
• Generalizing the Singular Value Decomposition
• Algorithms for the regularization of ill-conditioned least squares problems
• On the Stationary Values of a Second-Degree Polynomial on the Unit Sphere
• A Note on a Theorem of Forsythe and Golub

This page was built for publication: Least squares with a quadratic constraint