The Weighted Nonnegative Least-Squares Problem with Implicitly Characterized Points

DOI10.1287/OPRE.2018.1793zbMATH Open1455.90126OpenAlexW2947905139WikidataQ127764859 ScholiaQ127764859MaRDI QIDQ5129182FDOQ5129182

Authors: Ali Fattahi, Sriram Dasu, Reza Ahmadi 

Publication date: 26 October 2020

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.2018.1793

Recommendations

• The solvability and the original set of the weighted total least squares problem
• On the solution of constrained and weighted linear least squares problems
• The linear nonnegative least squares problem and its equivalence with the complementarity problem and the fixed point problem
• Implicitly-weighted total least squares
• On weighted linear least-squares problems related to interior methods for convex quadratic programming
• scientific article; zbMATH DE number 465451
• On the weighting method for least squares problems with linear equality constraints
• The element-wise weighted total least-squares problem
• New characterization for nonlinear weighted best simultaneous approximation
• scientific article; zbMATH DE number 1294721

zbMATH Keywords

high-dimensional statisticsFrank-Wolfehigh-dimensional analyticsnonnegative least-squares

Mathematics Subject Classification ID

Convex programming (90C25)

Cites Work

• Convex optimization theory.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Random projections for the nonnegative least-squares problem
• Mass customization and ``forecasting options' penetration rates problem

This page was built for publication: The Weighted Nonnegative Least-Squares Problem with Implicitly Characterized Points

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