Family of algorithms for solving convex programming problems
From MaRDI portal
Publication:3903970
DOI10.1007/BF01068900zbMath0455.65045MaRDI QIDQ3903970
Naum Z. Shor, V. I. Gershovich
Publication date: 1979
Published in: Cybernetics (Search for Journal in Brave)
Related Items
Stochastic ellipsoid methods for robust control: Multiple updates and multiple cuts, A deep cut ellipsoid algorithm for convex programming: Theory and applications, Using two successive subgradients in the ellipsoid method for nonlinear programming, Method of simple-body centroids, Optimization of computations, General models in min-max continuous location: Theory and solution techniques, An ellipsoid algorithm for nonlinear programming, A class of rank-two ellipsoid algorithms for convex programming, Method of ellipsoids, its generalizations and applications, Method of obtaining estimates in quadratic extremal problems with Boolean variables, Convergence of a cyclic ellipsoid algorithm for systems of linear equalities, Investigation of optimization methods and their applications