The following pages link to (Q4051879):
Displaying 50 items.
- OSQP: An Operator Splitting Solver for Quadratic Programs (Q78613) (← links)
- Generation of interior points and polyhedral representations of cones in \(\mathbb R^N\) cut by \(M\) planes sharing a common point (Q261538) (← links)
- On the lexicographic centre of multiple objective optimization (Q274101) (← links)
- Deciding probabilistic automata weak bisimulation: theory and practice (Q282105) (← links)
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods (Q340007) (← links)
- Some LCPs solvable in strongly polynomial time with Lemke's algorithm (Q344960) (← links)
- Models of opinion control for agents in social networks (Q376507) (← links)
- Implementing the simplex method as a cutting-plane method, with a view to regularization (Q377719) (← links)
- A polynomial arc-search interior-point algorithm for linear programming (Q378268) (← links)
- Interior point methods 25 years later (Q439546) (← links)
- On the number of solutions generated by the dual simplex method (Q439907) (← links)
- Recent development in computational complexity characterization of Nash equilibrium (Q458453) (← links)
- Artificial-free simplex algorithm based on the non-acute constraint relaxation (Q470802) (← links)
- The average number of pivot steps of the simplex-algorithm based on a generalized rotation-symmetry-model (Q486944) (← links)
- Exterior point simplex-type algorithms for linear and network optimization problems (Q492840) (← links)
- Ragnar Frisch and interior-point methods (Q497438) (← links)
- An exponential lower bound for Cunningham's rule (Q507321) (← links)
- On the number of iterations of local improvement algorithms (Q594546) (← links)
- The worst-case running time of the random simplex algorithm is exponential in the height (Q671935) (← links)
- The double pivot simplex method (Q684156) (← links)
- Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods (Q709179) (← links)
- On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes (Q713305) (← links)
- Quantitative simulations by matrices (Q729815) (← links)
- Reducing the size and number of linear programs in a dynamic Gröbner basis algorithm (Q744015) (← links)
- Approximating linear programming is log-space complete for P (Q750289) (← links)
- An interior feasible direction method with constraint projections for linear programming (Q804468) (← links)
- The decomposition principle and algorithms for linear programming (Q806964) (← links)
- A quadratically convergent method for linear programming (Q808185) (← links)
- Conflict-driven satisfiability for theory combination: lemmas, modules, and proofs (Q832719) (← links)
- Recognizing one-dimensional Euclidean preference profiles (Q845009) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Construction and analysis of projected deformed products (Q848669) (← links)
- Efficient GPU-based implementations of simplex type algorithms (Q902763) (← links)
- Exponential lower bounds for finding Brouwer fixed points (Q911230) (← links)
- An exponential example for Terlaky's pivoting rule for the criss-cross simplex method (Q911455) (← links)
- Decomposed block Cholesky factorization in the Karmarkar algorithm. Solving a class of super large LP problems (Q914546) (← links)
- Unique sink orientations of grids (Q930596) (← links)
- A simpler and tighter redundant Klee-Minty construction (Q941030) (← links)
- The colourful feasibility problem (Q944700) (← links)
- George B. Dantzig and systems optimization (Q951088) (← links)
- George Dantzig's impact on the theory of computation (Q951091) (← links)
- The complex interior-boundary method for linear and nonlinear programming with linear constraints (Q979276) (← links)
- A redundant Klee-Minty construction with all the redundant constraints touching the feasible region (Q1003486) (← links)
- Computing monotone disjoint paths on polytopes (Q1016050) (← links)
- Intelligent gradient search in linear programming (Q1071647) (← links)
- Methods for a network design problem in solar power systems (Q1086150) (← links)
- A new family of exponential LP problems (Q1097169) (← links)
- A simplex variant solving an m\(\times d\) linear program in O(min(m 2,d 2)) expected number of pivot steps (Q1100853) (← links)
- A multiplicative barrier function method for linear programming (Q1101008) (← links)
- Completely unimodal numberings of a simple polytope (Q1107444) (← links)
