scientific article; zbMATH DE number 3516928
From MaRDI portal
Publication:4097094
zbMath0329.90054MaRDI QIDQ4097094
D. B. Yudin, Arkadi Nemirovski
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The generalized ellipsoid method, Approximating the volume of convex bodies, Classical complexity and quantum entanglement, Solving Linear Programming with Constraints Unknown, Computational efficiency of the simplex embedding method in convex nondifferentiable optimization, An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming, A modification of the inscribed ellipsoid method, Algorithms for approximate calculation of the minimum of a convex function from its values, A relaxed version of Karmarkar's method, Set variational inequalities, State estimation by the ellipsoid method from continuous-time linear observations, An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix, Numerical methods for the resource allocation problem in a computer network, Complexity estimates of some cutting plane methods based on the analytic barrier, State estimation in continuous dynamic systems by the ellipsoid method, A look at the past and present of optimization - an editorial, Subgradient ellipsoid method for nonsmooth convex problems, Unified representation of the classical ellipsoid method, A new approach to the investigation of evolution differential equations in Banach spaces, On the complexity of quasiconvex integer minimization problem, A new linear programming algorithm - better or worse than the simplex method?, On the computational complexity of membership problems for the completely positive cone and its dual, Complexity analysis of a linear complementarity algorithm based on a Lyapunov function, Comparison of bundle and classical column generation, Complexity of circumscribed and inscribed ellipsoid methods for solving equilibrium economical models, Synthesis of cutting and separating planes in a nonsmooth optimization method, On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming, Methods of centers for variational inequalities and linear programming, 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, Variable metric relaxation methods, part II: The ellipsoid method, A deep cut ellipsoid algorithm for convex programming: Theory and applications
