Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Goal programming algorithm for a type of least absolute value regression problem

From MaRDI portal
Publication:2574293
Jump to:navigation, search

zbMATH Open1162.62389MaRDI QIDQ2574293FDOQ2574293


Authors: Kuiran Shi, Tiaojun Xiao, Weirong Zhang Edit this on Wikidata


Publication date: 21 November 2005

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)





Recommendations

  • scientific article
  • scientific article
  • An efficient method for solving linear goal programming problems
  • An Algorithm for Solving the Linear Goal Programming Problem by Solving Its Dual
  • scientific article
  • scientific article; zbMATH DE number 3904357
  • scientific article; zbMATH DE number 3974724
  • scientific article; zbMATH DE number 147744
  • A least-squares primal-dual algorithm for solving linear programming problems


Mathematics Subject Classification ID

Linear regression; mixed models (62J05) Applications of mathematical programming (90C90)



Cited In (3)

  • Algorithm 615: the best subset of parameters in leasst absolute value regression
  • Title not available (Why is that?)
  • A linked list data structure for a simple linear regression algorithm





This page was built for publication: Goal programming algorithm for a type of least absolute value regression problem

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2574293&oldid=15329923"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 07:06. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki