A branch and bound algorithm for constrained least squares

DOI10.1080/03610919308813095zbMath0775.65024OpenAlexW2024187661MaRDI QIDQ3135469

Adele Cutler

Publication date: 7 October 1993

Published in: Communications in Statistics - Simulation and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03610919308813095

Mathematics Subject Classification ID

Linear regression; mixed models (62J05) Probabilistic methods, stochastic differential equations (65C99)

Related Items (6)

Asymptotics for multisample statistics ⋮ On the use of archetypes as benchmarks ⋮ Applications of bivariate and univariate local lyapunov exponents ⋮ A fast algorithm for non-negativity model selection ⋮ A least squares algorithm for a mixture model for compositional data. ⋮ A study of the different methods usually employed to compute the fractal dimension

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for the solution of quadratic knapsack problems
• An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
• On the constrained linear least-squares problem: A personal view
• A factorization method for the solution of constrained linear least squares problems allowing subsequent data changes
• Convex quadratic programming with one constraint and bounded variables
• A Branch-and-Bound Solution of a Restricted Least Squares Problem
• Archetypal Analysis
• A Restricted Least Squares Problem

This page was built for publication: A branch and bound algorithm for constrained least squares