A branch and bound algorithm for constrained least squares

DOI10.1080/03610919308813095MaRDI QIDQ3135469zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• A Branch-and-Bound Solution of a Restricted Least Squares Problem
• A factorization method for the solution of constrained linear least squares problems allowing subsequent data changes
• A Restricted Least Squares Problem
• Algorithms for the solution of quadratic knapsack problems
• An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
• Archetypal Analysis
• Convex quadratic programming with one constraint and bounded variables
• scientific article; zbMATH DE number 3678917 (Why is no real title available?)
• scientific article; zbMATH DE number 3490719 (Why is no real title available?)
• scientific article; zbMATH DE number 3551729 (Why is no real title available?)
• scientific article; zbMATH DE number 883145 (Why is no real title available?)
• On the constrained linear least-squares problem: A personal view

Cited in

(6)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3135469)