Skip to content
VuFind
English
Deutsch
Español
Français
Italiano
日本語
Nederlands
Português
Português (Brasil)
中文(简体)
中文(繁體)
Türkçe
עברית
Gaeilge
Cymraeg
Ελληνικά
Català
Euskara
Русский
Čeština
Suomi
Svenska
polski
Dansk
slovenščina
اللغة العربية
বাংলা
Galego
Tiếng Việt
Hrvatski
हिंदी
Հայերէն
Українська
Sámegiella
Монгол
Language
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
A new perspective on the compl...
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Permanent link
A new perspective on the complexity of interior point methods for linear programming
Show other versions (1)
Bibliographic Details
Main Authors:
Cartis, C
,
Hauser, R
Format:
Report
Published:
2007
Holdings
Description
Other Versions (1)
Similar Items
Staff View
Similar Items
A new perspective on the complexity of interior point methods for linear programming
by: Cartis, C, et al.
Published: (2007)
Some New Results Concerning the Primal-Dual Path-Following Interior Point Algorithm for Linear Programming
by: Cartis, C
Published: (2005)
On the convergence of a primal-dual second-order corrector interior point algorithm for linear programming
by: Cartis, C
Published: (2005)
Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming
by: Cartis, C
Published: (2009)
Some Disadvantages of a Mehrotra-Type Primal-Dual Corrector Interior Point Algorithm for Linear Programming
by: Cartis, C
Published: (2004)