Pages that link to "Item:Q3929391"
From MaRDI portal
The following pages link to Feature Article—The Ellipsoid Method: A Survey (Q3929391):
Displaying 50 items.
- A polynomial arc-search interior-point algorithm for linear programming (Q378268) (← links)
- Stochastic ellipsoid methods for robust control: Multiple updates and multiple cuts (Q608445) (← links)
- Inductively inferring valid logical models of continuous-state dynamical systems (Q673881) (← links)
- Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems (Q676010) (← links)
- A polynomial algorithm for minimum quadratic cost flow problems (Q761341) (← links)
- Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities (Q875498) (← links)
- On the complexity of a pivot step of the revised simplex algorithm (Q1068713) (← links)
- Intelligent gradient search in linear programming (Q1071647) (← links)
- The general problem solving algorithm and its implementation (Q1104126) (← links)
- A new O(n\(\cdot \log \,n)\) algorithm for computing the intersection of convex polygons (Q1107994) (← links)
- A relaxed version of Karmarkar's method (Q1108926) (← links)
- A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming (Q1123811) (← links)
- An appraisal of computational complexity for operations researchers (Q1173532) (← links)
- Projection algorithms for linear programming (Q1199509) (← links)
- Optimal, constant I/O similarity scaling for full-information and state- feedback control problems (Q1199850) (← links)
- Recurrent neural networks for linear programming: Analysis and design principles (Q1200825) (← links)
- Processors selection and traffic splitting in a parallel processors system (Q1203599) (← links)
- Method of centers for minimizing generalized eigenvalues (Q1260783) (← links)
- Robust stability and performance analysis of uncertain systems using linear matrix inequalities (Q1289389) (← links)
- A deep cut ellipsoid algorithm for convex programming: Theory and applications (Q1315434) (← links)
- Using two successive subgradients in the ellipsoid method for nonlinear programming (Q1337226) (← links)
- A branch bound method for subset sum problem (Q1343509) (← links)
- Block-iterative surrogate projection methods for convex feasibility problems (Q1347226) (← links)
- Simplices by point-sliding and the Yamnitsky-Levin algorithm (Q1366323) (← links)
- A simple and fast algorithm for convex decomposition in relax-and-round mechanisms (Q1634087) (← links)
- An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming (Q1653277) (← links)
- Fast finite methods for a system of linear inequalities (Q1819897) (← links)
- A unifying geometric solution framework and complexity analysis for variational inequalities (Q1919807) (← links)
- An improved ellipsoid method for solving convex differentiable optimization problems (Q1939709) (← links)
- Convergence analysis of sliding mode trajectories in multi-objective neural networks learning (Q1941589) (← links)
- Pseudo polynomial size LP formulation for calculating the least core value of weighted voting games (Q2070558) (← links)
- Dynamic state feedback controller and observer design for dynamic artificial neural network models (Q2097779) (← links)
- Better lower and upper bounds for the minimum rainbow subgraph problem (Q2250438) (← links)
- A minmax regret linear regression model under uncertainty in the dependent variable (Q2251555) (← links)
- Computing Walrasian equilibria: fast algorithms and structural properties (Q2288196) (← links)
- Presynthesis of bounded choice-free or fork-attribution nets (Q2304527) (← links)
- Solving nonlinear principal-agent problems using bilevel programming (Q2355956) (← links)
- A note on two fixed point problems (Q2465828) (← links)
- Iterant recombination with one-norm minimization for multilevel Markov chain algorithms via the ellipsoid method (Q2514448) (← links)
- General models in min-max continuous location: Theory and solution techniques (Q2564174) (← links)
- Numerical detection of Gaussian entanglement and its application to the identification of bound entangled Gaussian states (Q2681564) (← links)
- Circumscribed ellipsoid algorithm for fixed-point problems (Q3015053) (← links)
- The sphere method and the robustness of the ellipsoid algorithm (Q3039036) (← links)
- An ellipsoid algorithm for nonlinear programming (Q3040934) (← links)
- Graph Implementations for Nonsmooth Convex Programs (Q3054001) (← links)
- Parameter set estimation for non-linear systems (Q3151614) (← links)
- A class of rank-two ellipsoid algorithms for convex programming (Q3325476) (← links)
- Application of the ellipsoid method in an interactive procedure for multicriteria linear programming (Q3328300) (← links)
- Karmarkar's projective method for linear programming: a computational survey (Q3491310) (← links)
- Robust model reduction of uncertain systems maintaining uncertainty structure (Q3644840) (← links)
