A branch and bound algorithm for constrained least squares

DOI10.1080/03610919308813095zbMATH Open0775.65024OpenAlexW2024187661MaRDI QIDQ3135469FDOQ3135469

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 factorization method for the solution of constrained linear least squares problems allowing subsequent data changes
• Title not available (Why is that?)
• Archetypal Analysis
• An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
• Convex quadratic programming with one constraint and bounded variables
• Algorithms for the solution of quadratic knapsack problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Restricted Least Squares Problem
• A Branch-and-Bound Solution of a Restricted Least Squares Problem
• On the constrained linear least-squares problem: A personal view

Cited In (6)

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

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)