scientific article; zbMATH DE number 776084
From MaRDI portal
Publication:4840104
zbMath0828.90084MaRDI QIDQ4840104
Tamás Terlaky, Cornelis Roos, Dick den Hertog
Publication date: 14 August 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
interior point methodpolynomial algorithmcomplexity analysislogarithmic barrier methodcolumn generation and deletion
Related Items
A logarithmic barrier cutting plane method for convex programming, Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem, A cutting plane algorithm for convex programming that uses analytic centers, A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme, A constraint-reduced variant of Mehrotra's predictor-corrector algorithm, Adaptive constraint reduction for convex quadratic programming, A polynomial time constraint-reduced algorithm for semidefinite optimization problems, Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming
