Feature Article—The Ellipsoid Method: A Survey
From MaRDI portal
Cited in
(64)- 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 \,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
- A simple and fast algorithm for convex decomposition in relax-and-round mechanisms
- An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
- Fast finite methods for a system of linear inequalities
- A unifying geometric solution framework and complexity analysis for variational inequalities
- An improved ellipsoid method for solving convex differentiable optimization problems
- Convergence analysis of sliding mode trajectories in multi-objective neural networks learning
- Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games
- Dynamic state feedback controller and observer design for dynamic artificial neural network models
- Better lower and upper bounds for the minimum rainbow subgraph problem
- A minmax regret linear regression model under uncertainty in the dependent variable
- Computing Walrasian equilibria: fast algorithms and structural properties
- Presynthesis of bounded choice-free or fork-attribution nets
- Solving nonlinear principal-agent problems using bilevel programming
- A note on two fixed point problems
- Iterant recombination with one-norm minimization for multilevel Markov chain algorithms via the ellipsoid method
- General models in min-max continuous location: Theory and solution techniques
- Numerical detection of Gaussian entanglement and its application to the identification of bound entangled Gaussian states
- Circumscribed ellipsoid algorithm for fixed-point problems
- The sphere method and the robustness of the ellipsoid algorithm
- An ellipsoid algorithm for nonlinear programming
- Graph implementations for nonsmooth convex programs
- 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
- Robust model reduction of uncertain systems maintaining uncertainty structure
- 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
- Goffin's algorithm for zonotopes
- Symmetry of convex sets and its applications to the extremal ellipsoids of convex bodies
- Newton-ellipsoid polynomiography
- Book Review: The basic George B. Dantzig
- State bounding with ellipsoidal set description of the uncertainty
- On complexity of the translational-cut algorithm for convex minimax problems
- Subgradient ellipsoid method for nonsmooth convex problems
- Stochastic ellipsoid methods for robust control: Multiple updates and multiple cuts
- Revisiting security estimation for LWE with hints from a geometric perspective
- Projection of a Point onto a Convex Set via Charged Balls Method
- 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
- Quadratic convex-concave minimax optimization
- The ellipsoid method redux
- A polynomial algorithm for minimum quadratic cost flow problems
- Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities
This page was built for publication: Feature Article—The Ellipsoid Method: A Survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3929391)
