Family of algorithms for solving convex programming problems

DOI10.1007/BF01068900zbMath0455.65045MaRDI QIDQ3903970

V. I. Gershovich, Naum Z. Shor

Publication date: 1979

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

rate of convergencecutoff schemes

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

Related Items

Using two successive subgradients in the ellipsoid method for nonlinear programming, Method of obtaining estimates in quadratic extremal problems with Boolean variables, Optimization of computations, Method of simple-body centroids, Stochastic ellipsoid methods for robust control: Multiple updates and multiple cuts, A class of rank-two ellipsoid algorithms for convex programming, An ellipsoid algorithm for nonlinear programming, Symmetry of convex sets and its applications to the extremal ellipsoids of convex bodies, General models in min-max continuous location: Theory and solution techniques, Convergence of a cyclic ellipsoid algorithm for systems of linear equalities, Method of ellipsoids, its generalizations and applications, Investigation of optimization methods and their applications, A deep cut ellipsoid algorithm for convex programming: Theory and applications