An ADMM based method for underdetermined box-constrained integer least squares problems

DOI10.1080/10556788.2023.2285492MaRDI QIDQ6586913zbMATH OpenFDO

Authors Xiao-Wen Chang, Tianchi Ma

Publication date 13 August 2024

Published in Optimization Methods \& Software (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Applications of statistics in engineering and industry; control charts (62P30) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Solving ellipsoid-constrained integer least squares problems
• Linearized alternating direction method for constrained linear least-squares problem.
• An interior-point method for solving box-constrained underdetermined nonlinear systems
• 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

Cites work

• A general system for heuristic minimization of convex functions over non-convex sets
• A simple effective heuristic for embedded mixed-integer quadratic programming
• Algorithms for the shortest and closest lattice vector problems
• An effective branch-and-bound algorithm for convex quadratic integer programming
• Capacity scaling in MIMO wireless systems under correlated fading
• Closest point search in lattices
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Effects of the LLL Reduction on the Success Probability of the Babai Point and on the Complexity of Sphere Decoding
• Factoring polynomials with rational coefficients
• Fast lattice point enumeration with minimal overhead
• scientific article; zbMATH DE number 804575 (Why is no real title available?)
• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems
• Maximum likelihood sequence estimation from the lattice viewpoint
• MLAMBDA: a modified LAMBDA method for integer least-squares estimation
• On maximum-likelihood detection and the search for the closest lattice point
• On the sphere-decoding algorithm I. Expected complexity
• Partial regularisation approach for detection problems in underdetermined linear systems

This page was built for publication: An ADMM based method for underdetermined box-constrained integer least squares problems

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