Live briefing
Everything about Criss-cross algorithm
Method for mathematical optimization
In mathematical optimization, the criss-cross algorithm is any of a family of algorithms for linear programming. Variants of the criss-cross algorithm also solve more general problems with linear inequality constraints and nonlinear objective functions; there are criss-cross algorithms for linear-fractional programming problems, quadratic-programming problems, and linear complementarity problems. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Criss-cross algorithmA 5-minute orientation
- Read the landmark paper: Robust stability and a criss-cross algorithm for pseudospectraCited 59 times
- Go sideways: Klee–Minty cubeA closely related topic
- Go sideways: Bland's ruleA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Robust stability and a criss-cross algorithm for pseudospectra
A Visible-Infrared person re-identification algorithm based on skeleton Insight Criss-Cross network
Note—A Note on the Criss-Cross Algorithm
Criss-cross algorithm based on the most-obtuse-angle rule and deficient basis
Criss-Cross Algorithm Based on the Most-obtuse-angle Rule and Deficient Basis
📚 Books worth reading
Open Library didn't respond; try again in a moment.
🔗 Related topics
- Klee–Minty cube The Klee–Minty cube or Klee–Minty polytope (named after Victor Klee and George J. Minty) is a unit hypercube of variable dimension whose corners have been…
- Bland's rule In mathematical optimization, Bland's rule (also known as Bland's algorithm, Bland's anti-cycling rule or Bland's pivot rule) is an algorithmic refinement…
- Tamás Terlaky Tamás Terlaky is a Hungarian-Canadian-American professor of Industrial and Systems Engineering at Lehigh University. He is especially well known for his…
- Oriented matroid An oriented matroid is a mathematical structure that abstracts the properties of directed graphs, vector arrangements over ordered fields, and hyperplane…
- Linear complementarity problem In mathematical optimization theory, the linear complementarity problem (LCP) arises frequently in computational mechanics and encompasses the well-known…
- Komei Fukuda Komei Fukuda (Japanese: 福田 公明, 1951 - July 27, 2026) was a Japanese mathematician known for his contributions to optimization, polyhedral computation and…
- Linear programming Linear programming (LP), also called linear optimization, is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical…
- Vertex enumeration problem In mathematics, the vertex enumeration problem for a polytope, a polyhedral cell complex, a hyperplane arrangement, or some other object of discrete geometry…