Publication:4097094
From MaRDI portal
zbMath0329.90054MaRDI QIDQ4097094
Arkadi Nemirovski, D. B. Yudin
Publication date: 1976
Related Items
A new approach to the investigation of evolution differential equations in Banach spaces, A relaxed version of Karmarkar's method, A new linear programming algorithm - better or worse than the simplex method?, Complexity analysis of a linear complementarity algorithm based on a Lyapunov function, Complexity of circumscribed and inscribed ellipsoid methods for solving equilibrium economical models, Methods of centers for variational inequalities and linear programming, A deep cut ellipsoid algorithm for convex programming: Theory and applications, Algorithms for approximate calculation of the minimum of a convex function from its values, Set variational inequalities, State estimation in continuous dynamic systems by the ellipsoid method, Classical complexity and quantum entanglement, A modification of the inscribed ellipsoid method, State estimation by the ellipsoid method from continuous-time linear observations, Complexity estimates of some cutting plane methods based on the analytic barrier, Approximating the volume of convex bodies, Comparison of bundle and classical column generation, An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming, Variable metric relaxation methods, part II: The ellipsoid method, On the non-polynomiality of the relaxation method for systems of linear inequalities, Convergence of a cyclic ellipsoid algorithm for systems of linear equalities, Modifications and implementation of the ellipsoid algorithm for linear programming
