The following pages link to (Q4097094):
Displaying 33 items.
- On the computational complexity of membership problems for the completely positive cone and its dual (Q461444) (← links)
- Synthesis of cutting and separating planes in a nonsmooth optimization method (Q747314) (← links)
- A relaxed version of Karmarkar's method (Q1108926) (← links)
- A new linear programming algorithm - better or worse than the simplex method? (Q1153837) (← links)
- Complexity analysis of a linear complementarity algorithm based on a Lyapunov function (Q1184351) (← links)
- Complexity of circumscribed and inscribed ellipsoid methods for solving equilibrium economical models (Q1207805) (← links)
- Methods of centers for variational inequalities and linear programming (Q1294369) (← links)
- A deep cut ellipsoid algorithm for convex programming: Theory and applications (Q1315434) (← links)
- Algorithms for approximate calculation of the minimum of a convex function from its values (Q1358455) (← links)
- Set variational inequalities (Q1366827) (← links)
- State estimation in continuous dynamic systems by the ellipsoid method (Q1385769) (← links)
- The generalized ellipsoid method (Q1616251) (← links)
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization (Q1644014) (← links)
- Classical complexity and quantum entanglement (Q1886316) (← links)
- A modification of the inscribed ellipsoid method (Q1900254) (← links)
- State estimation by the ellipsoid method from continuous-time linear observations (Q1918763) (← links)
- Complexity estimates of some cutting plane methods based on the analytic barrier (Q1922694) (← links)
- A look at the past and present of optimization - an editorial (Q1926685) (← links)
- Approximating the volume of convex bodies (Q2368127) (← links)
- On the complexity of quasiconvex integer minimization problem (Q2423784) (← links)
- Comparison of bundle and classical column generation (Q2476993) (← links)
- An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming (Q2638936) (← links)
- Numerical methods for the resource allocation problem in a computer network (Q2662812) (← links)
- On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming (Q2821802) (← links)
- Solving Linear Programming with Constraints Unknown (Q3448779) (← links)
- Variable metric relaxation methods, part II: The ellipsoid method (Q3683896) (← links)
- On the non-polynomiality of the relaxation method for systems of linear inequalities (Q3929533) (← links)
- Convergence of a cyclic ellipsoid algorithm for systems of linear equalities (Q3931030) (← links)
- Modifications and implementation of the ellipsoid algorithm for linear programming (Q3934131) (← links)
- A new approach to the investigation of evolution differential equations in Banach spaces (Q4322161) (← links)
- An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix (Q5086010) (← links)
- Subgradient ellipsoid method for nonsmooth convex problems (Q6038646) (← links)
- Unified representation of the classical ellipsoid method (Q6066038) (← links)
