Solving ellipsoid-constrained integer least squares problems

DOI10.1137/060660680MaRDI QIDQ3584147zbMATH OpenOpenAlexFDO

Authors Xiao-Wen Chang, Gene H. Golub

Publication date 19 August 2010

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/060660680

zbMATH Keywords

numerical examplessearch algorithmcommunicationsellipsoidal constraintinteger least squaresLLL reductiongeneralized QRZ factorizationQRZ factorization

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• An efficient algorithm for clustered integer least squares problems.
• Parallel Cholesky-based reduction for the weighted integer least squares problem
• Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems
• MLAMBDA: a modified LAMBDA method for integer least-squares estimation
• An improved LLL algorithm

Cited in

(6)

• MLAMBDA: a modified LAMBDA method for integer least-squares estimation
• An efficient algorithm for clustered integer least squares problems.
• Integer matrix approximation and data mining
• An ADMM based method for underdetermined box-constrained integer least squares problems
• Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems
• Circumscribed ellipsoid algorithm for fixed-point problems

This page was built for publication: Solving ellipsoid-constrained integer least squares problems

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