scientific article; zbMATH DE number 4170640

MaRDI QIDQ3496153zbMATH OpenFDO

Authors E. G. Gol'Shtejn, Arkadi Nemirovski, Yuri Nesterov

Publication date 1990

zbMATH Keywords

surveypolynomial algorithmsregularized problempath-following methodsnonrigid formulation

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60) Decomposition methods (49M27)

Recommendations

• scientific article; zbMATH DE number 4049377
• A new polynomial-time algorithm for linear programming
• scientific article; zbMATH DE number 4016589
• scientific article; zbMATH DE number 4062817
• scientific article; zbMATH DE number 4062814

Cited in

(7)

• scientific article; zbMATH DE number 911787 (Why is no real title available?)
• A regularized simplex method
• Le traitement des solutions quasi optimales en programmation linéaire continue : une synthèse
• Numerical inclusion of optimum point for linear programming
• A new view of some fundamental results in optimization
• scientific article; zbMATH DE number 1855673 (Why is no real title available?)
• scientific article; zbMATH DE number 4001870 (Why is no real title available?)

This page was built for publication:

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