Family of algorithms for solving convex programming problems

DOI10.1007/BF01068900MaRDI QIDQ3903970zbMATH OpenFDO

Authors V. I. Gershovich, N. Z. Shor

Publication date 1979

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01068900

zbMATH Keywords

cutoff schemesrate of convergence

Mathematics Subject Classification ID

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

Cited in

(14)

• 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
• Symmetry of convex sets and its applications to the extremal ellipsoids of convex bodies
• Stochastic ellipsoid methods for robust control: Multiple updates and multiple cuts
• The ellipsoid method redux

This page was built for publication: Family of algorithms for solving convex programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3903970)