Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Combined projected gradient algorithm for linear programming

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

DOI10.1080/10556780600627552zbMath1113.90097OpenAlexW1973338922MaRDI QIDQ5481683

Guangting Chen, Wei Li, Ping-Qi Pan

Publication date: 10 August 2006

Published in: Optimization Methods and Software (Search for Journal in Brave)

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

zbMATH Keywords

linear programmingprojectioninterior point methodleast squares problemQR factorizationpivot method


Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)


Related Items

Dual–primal algorithm for linear optimization, An interesting characteristic of phase-1 of dual–primal algorithm for linear programming


Uses Software

  • NETLIB LP Test Set


Cites Work

  • Unnamed Item
  • A projective simplex method for linear programming
  • Pivot rules for linear programming: A survey on recent theoretical developments
  • Pivot versus interior point methods: Pros and cons
  • A basis-defiency-allowing variation of the simplex method for linear programming
  • Commentary—Progress in Linear Programming
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5481683&oldid=30037747"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 7 March 2024, at 04:02.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki