User talk:KadMath

Welcome!
Hi, KadMath. Welcome to Wikipedia! Thank you for your contributions. I hope you like the place and decide to stay. Our intro page contains a lot of helpful material for new users—please check it out! If you need help, visit Questions, ask me on my talk page, or place   on this page, followed by your question, and someone will show up shortly to answer your questions. Q VVERTYVS (hm?) 18:22, 13 June 2015 (UTC)


 * As I've told 194.199.253.245 already, I'd like to see the changes you'd like to make to Non-negative least squares discussed on its talk page, in accordance with the WP:BRD rule. I've already reverted the edits by you and two anonymous users multiple times. Please discuss instead of removing/replacing information from the article without edit summaries. Q VVERTYVS (hm?) 18:22, 13 June 2015 (UTC)

Hello : In "nonnegative least squares" page, section "algorithms", I have read that Lawson and Hanson, authors of NNLS algorithm (1974),has generalized it in 1995 to BLVS : the problem is that Abdelkader Agha has generalized it before them to "Moindres Carrés sous Contraintes de Bornes" (MCCB), with upper and lower bounds αᵢ ≤ xᵢ ≤ βᵢ, in doctoral thesis (1991), University of Paris-Dauphine. See please the following link : http://www.theses.fr/1991PA090016. Thank you.KadMath (talk) 13:03, 16 June 2015 (UTC)


 * The text was not claiming they invented it in 1995. A 1986 paper by Hanson already considered this variant and gave an algorithm for it. Q VVERTYVS (hm?) 14:25, 16 June 2015 (UTC)

I insist and I specify : the paper of 1986 is not a generalization of NNLS! Lawson and Hanson solved the regression pb with linear constraints by method using penalty function approach. MCCB is a true generalization of NNLS ( NNLS handles the case 0=αᵢ ≤ xᵢ ≤ βᵢ=infinity). If you are mathematician, if you know NNLS and if you want, i will send you more precision.KadMath (talk) 17:43, 16 June 2015 (UTC)

I still await an answer. Thank you.KadMath (talk) 08:58, 18 June 2015 (UTC)

If I have no answer in 3 days, I shall consider that the debate is closed and I would make the rectification.KadMath (talk) 08:13, 28 June 2015 (UTC)


 * There's nothing to rectify. The article doesn't claim anymore that BVLS was invented by Lawson and Hanson, which was a mistake by yours truly. It now just describes the existence of the problem, and cites the standard (122 citations on GScholar) algorithm for it, Stark and Parker. I don't see why we need to cite a thesis, in French, that is not available online, and that has not been cited by anyone (not even in the survey paper by Chen). Q VVERTYVS (hm?) 08:54, 28 June 2015 (UTC)

June 2015
Please refrain from making unconstructive edits to Wikipedia, as you did at Non-negative least squares. Your edits appear to be disruptive and have been reverted or removed. Please ensure you are familiar with Wikipedia's policies and guidelines, and please do not continue to make edits that appear disruptive, until the dispute is resolved through consensus. Continuing to edit disruptively could result in loss of editing privileges. ''Please discuss your additions on the talk page. I've already reverted your unexplained edits three times; this is starting to look like an edit war.'' Q VVERTYVS (hm?) 07:05, 16 June 2015 (UTC)
 * If you are engaged in an article content dispute with another editor then please discuss the matter with the editor at their talk page, or the article's talk page. Alternatively you can read Wikipedia's dispute resolution page, and ask for independent help at one of the relevant notice boards.
 * If you are engaged in any other form of dispute that is not covered on the dispute resolution page, please seek assistance at Wikipedia's Administrators' noticeboard/Incidents.