Feature Article—The Ellipsoid Method: A Survey
From MaRDI portal
Publication:3929391
DOI10.1287/opre.29.6.1039zbMath0474.90056OpenAlexW2003889804MaRDI QIDQ3929391
Donald Goldfarb, Michael J. Todd, 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
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Linear programming (90C05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Using two successive subgradients in the ellipsoid method for nonlinear programming, A branch bound method for subset sum problem, A simple and fast algorithm for convex decomposition in relax-and-round mechanisms, Block-iterative surrogate projection methods for convex feasibility problems, On the complexity of the surrogate dual of 0–1 programming, The general problem solving algorithm and its implementation, A new O(n\(\cdot \log \,n)\) algorithm for computing the intersection of convex polygons, An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming, A relaxed version of Karmarkar's method, Simplices by point-sliding and the Yamnitsky-Levin algorithm, Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities, A unifying geometric solution framework and complexity analysis for variational inequalities, A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming, A polynomial arc-search interior-point algorithm for linear programming, Stochastic ellipsoid methods for robust control: Multiple updates and multiple cuts, Karmarkar's projective method for linear programming: a computational survey, Subgradient ellipsoid method for nonsmooth convex problems, Numerical detection of Gaussian entanglement and its application to the identification of bound entangled Gaussian states, An improved ellipsoid method for solving convex differentiable optimization problems, Convergence analysis of sliding mode trajectories in multi-objective neural networks learning, Revisiting security estimation for LWE with hints from a geometric perspective, State bounding with ellipsoidal set description of the uncertainty, An appraisal of computational complexity for operations researchers, Inductively inferring valid logical models of continuous-state dynamical systems, A note on two fixed point problems, Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems, Circumscribed ellipsoid algorithm for fixed-point problems, 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, Better lower and upper bounds for the minimum rainbow subgraph problem, Linear Programming Approach to Solve Geometric Programming Problem, On complexity of the translational-cut algorithm for convex minimax problems, A minmax regret linear regression model under uncertainty in the dependent variable, Processors selection and traffic splitting in a parallel processors system, A class of rank-two ellipsoid algorithms for convex programming, Application of the ellipsoid method in an interactive procedure for multicriteria linear programming, The sphere method and the robustness of the ellipsoid algorithm, An ellipsoid algorithm for nonlinear programming, Graph Implementations for Nonsmooth Convex Programs, Symmetry of convex sets and its applications to the extremal ellipsoids of convex bodies, Computing Walrasian equilibria: fast algorithms and structural properties, Iterant recombination with one-norm minimization for multilevel Markov chain algorithms via the ellipsoid method, Newton–Ellipsoid polynomiography, Method of centers for minimizing generalized eigenvalues, Presynthesis of bounded choice-free or fork-attribution nets, Fast finite methods for a system of linear inequalities, A polynomial algorithm for minimum quadratic cost flow problems, Robust model reduction of uncertain systems maintaining uncertainty structure, Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games, Book Review: The basic George B. Dantzig, Robust stability and performance analysis of uncertain systems using linear matrix inequalities, General models in min-max continuous location: Theory and solution techniques, Modifications and implementation of the ellipsoid algorithm for linear programming, Dynamic state feedback controller and observer design for dynamic artificial neural network models, Variable metric relaxation methods, part II: The ellipsoid method, A deep cut ellipsoid algorithm for convex programming: Theory and applications, Unnamed Item, On the complexity of a pivot step of the revised simplex algorithm, Intelligent gradient search in linear programming, Solving nonlinear principal-agent problems using bilevel programming, Parameter set estimation for non-linear systems
