scientific article; zbMATH DE number 1859212

zbMath1175.90287MaRDI QIDQ4789195

Jackie C. K. Ho, Tunçel, Levent

Publication date: 23 April 2003

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexitylinear programminginterior-point methodscomplexity measures

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Sensitivity, stability, well-posedness (49K40) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Interior-point methods (90C51)

Related Items (4)

A complementarity partition theorem for multifold conic systems ⋮ Improved complexity results on solving real-number linear feasibility problems ⋮ Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP ⋮ A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix

This page was built for publication: