A general solution to least squares problems with box constraints and its applications

DOI10.1155/2016/3934872zbMath1400.65033OpenAlexW2432892838WikidataQ59131212 ScholiaQ59131212MaRDI QIDQ1793094

Yueyang Teng, Shouliang Qi, Yan Kang, Dayu Xiao, Lisheng Xu, Jian Hua Li

Publication date: 12 October 2018

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2016/3934872

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10)

Related Items (2)

Sparse approximation over the cube ⋮ An efficient Hessian based algorithm for singly linearly and box constrained least squares regression

Uses Software

• D-ADMM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• On the convergence properties of the EM algorithm
• Improved solution for ill-posed linear systems using a constrained optimization ruled by a penalty: evaluation in nuclear medicine tomography
• 10.1162/15324430152748218
• Projected Landweber method and preconditioning
• D-ADMM: A Communication-Efficient Distributed Algorithm for Separable Optimization
• Bayesian regularization and nonnegative deconvolution for room impulse response estimation
• Penalized maximum likelihood image restoration with positivity constraints: multiplicative algorithms
• A convergent non-negative deconvolution algorithm with Tikhonov regularization
• A general method to devise maximum-likelihood signal restoration multiplicative algorithms with non-negativity constraints.

This page was built for publication: A general solution to least squares problems with box constraints and its applications