Pages that link to "Item:Q2931369"

The following pages link to A randomized polynomial-time simplex algorithm for linear programming (Q2931369):

Displaying 22 items.

• A simple randomised algorithm for convex optimisation (Q463726) (← links)
• The worst-case running time of the random simplex algorithm is exponential in the height (Q671935) (← links)
• George Dantzig's impact on the theory of computation (Q951091) (← links)
• Projective re-normalization for improving the behavior of a homogeneous conic linear system (Q1016122) (← links)
• Linear programming, the simplex algorithm and simple polytopes (Q1365056) (← links)
• A double-pivot simplex algorithm and its upper bounds of the iteration numbers (Q2214920) (← links)
• Guaranteed methods based on constrained zonotopes for set-valued state estimation of nonlinear discrete-time systems (Q2288615) (← links)
• A space decomposition-based deterministic algorithm for solving linear optimization problems (Q2306623) (← links)
• Moser's shadow problem (Q2327756) (← links)
• A characterization theorem and an algorithm for a convex hull problem (Q2341220) (← links)
• Bayesian knowledge base tuning (Q2353935) (← links)
• Geometric random edge (Q2364496) (← links)
• Set-valued state estimation of nonlinear discrete-time systems with nonlinear invariants based on constrained zonotopes (Q2665141) (← links)
• Random walks on polytopes and an affine interior point method for linear programming (Q2884302) (← links)
• Solving Totally Unimodular LPs with the Shadow Vertex Algorithm (Q2954993) (← links)
• (Q3128899) (← links)
• From Parity and Payoff Games to Linear Programming (Q3182965) (← links)
• (Q3363529) (← links)
• Linear programming — Randomization and abstract frameworks (Q4593969) (← links)
• A Friendly Smoothed Analysis of the Simplex Method (Q5129232) (← links)
• A simple polynomial-time rescaling algorithm for solving linear programs (Q5900037) (← links)
• An exponential lower bound for Zadeh's pivot rule (Q6038661) (← links)