Feature Article—The Ellipsoid Method: A Survey
From MaRDI portal
Publication:3929391
DOI10.1287/opre.29.6.1039zbMath0474.90056MaRDI QIDQ3929391
Michael J. Todd, Donald Goldfarb, Robert G. Bland
Publication date: 1981
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.29.6.1039
68Q25: Analysis of algorithms and problem complexity
65K05: Numerical mathematical programming methods
90C05: Linear programming
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
Related Items
State bounding with ellipsoidal set description of the uncertainty, On complexity of the translational-cut algorithm for convex minimax problems, Inductively inferring valid logical models of continuous-state dynamical systems, Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems, A polynomial algorithm for minimum quadratic cost flow problems, Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities, On the complexity of a pivot step of the revised simplex algorithm, Intelligent gradient search in linear programming, The general problem solving algorithm and its implementation, A new O(n\(\cdot \log \,n)\) algorithm for computing the intersection of convex polygons, A relaxed version of Karmarkar's method, A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming, An appraisal of computational complexity for operations researchers, Projection algorithms for linear programming, Optimal, constant I/O similarity scaling for full-information and state- feedback control problems, Recurrent neural networks for linear programming: Analysis and design principles, Processors selection and traffic splitting in a parallel processors system, Method of centers for minimizing generalized eigenvalues, Robust stability and performance analysis of uncertain systems using linear matrix inequalities, A deep cut ellipsoid algorithm for convex programming: Theory and applications, Using two successive subgradients in the ellipsoid method for nonlinear programming, A branch bound method for subset sum problem, Block-iterative surrogate projection methods for convex feasibility problems, Simplices by point-sliding and the Yamnitsky-Levin algorithm, Fast finite methods for a system of linear inequalities, A unifying geometric solution framework and complexity analysis for variational inequalities, A note on two fixed point problems, General models in min-max continuous location: Theory and solution techniques, The sphere method and the robustness of the ellipsoid algorithm, An ellipsoid algorithm for nonlinear programming, Parameter set estimation for non-linear systems, A class of rank-two ellipsoid algorithms for convex programming, Application of the ellipsoid method in an interactive procedure for multicriteria linear programming, Karmarkar's projective method for linear programming: a computational survey, Variable metric relaxation methods, part II: The ellipsoid method, On the complexity of the surrogate dual of 0–1 programming, Linear Programming Approach to Solve Geometric Programming Problem, Modifications and implementation of the ellipsoid algorithm for linear programming
