Everything about LP-type problem
Generalization of linear programming
In the study of algorithms, an LP-type problem is an optimization problem that shares certain properties with low-dimensional linear programs and that may be solved by similar algorithms. LP-type problems include many important optimization problems that are not themselves linear programs, such as the problem of finding the smallest circle containing a given set of planar points. They may be solved by a combination of randomized algorithms in an amount of time that is linear in the number of elements defining the problem, and subexponential in the dimension of the problem. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: LP-type problemA 5-minute orientation
- Skim a recent paper: On a problem of Romanoff typeInfluential work since 2022
- Pick up a classic book: The Conspirators HierarchyThe most-reprinted book on the subject
- Read the landmark paper: The isometric extension problem in the unit spheres of lp(Г) (p >1) type spacesCited 41 times
- Go sideways: K-set (geometry)A closely related topic
- Go sideways: Emo WelzlA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
The isometric extension problem in the unit spheres of lp(Г) (p >1) type spaces
Parabolic Lp Dirichlet boundary value problem and VMO-type time-varying domains
Removing Degeneracy in LP-Type Problems Revisited
Carleman-type boundary-value problem in the class Lp(C)
Shephard Type Problem for Lp-mixed Blaschke-Minkowski homomorphisms
The Lp dual Minkowski type problem for mixed Hessian quotient type equations with p ≥ q
🆕 Influential since 2022
📚 Books worth reading
The Conspirators HierarchyJohn Coleman · 1992
Pseudo-Differential Operators, Generalized Functions and AsymptoticsShahla Molahajloo · 2013- 📕Panoramas of mathematicsBronisław Jakubczyk, Bogdan Ziemian · 1995
Celestial Navigation by H. O. 249John E. Milligan · 1974- 📕Derde Internationale Symposium over VuursteenF. H. G. Engelen, Netherlands) International Symposium on Flint (3rd 1979 Maastricht · 1981
A probability metrics approach to financial risk measuresS. T. Rachev · 2011
Using SCO UNIXGeoffrey T. LeBlond · 1990
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- K-set (geometry) In discrete geometry, a k-set of a finite point set S in the Euclidean plane is a subset of k elements of S that can be strictly separated from the remaining…
- Emo Welzl Emmerich (Emo) Welzl (born 4 August 1958 in Linz, Austria) is a computer scientist known for his research in computational geometry. He is a professor…
- Unique sink orientation In mathematics, a unique sink orientation is an orientation of the edges of a polytope such that, in every face of the polytope (including the whole polytope…
- Smallest-circle problem The smallest-circle problem (also known as minimum covering circle problem, bounding circle problem, least bounding circle problem, smallest enclosing…
- Kenneth L. Clarkson Kenneth Lee Clarkson is an American computer scientist known for his research in computational geometry. He is a researcher at the IBM Almaden Research…
- Bounding sphere In mathematics, given a non-empty set of objects of finite extension in d-dimensional space, for example a set of points, a bounding sphere, enclosing…
- Arrangement of lines In geometry, an arrangement of lines is the subdivision of the Euclidean plane formed by a finite set of lines. An arrangement consists of bounded and…
- Ellipsoid method In mathematical optimization, the ellipsoid method is an iterative method for minimizing convex functions over convex sets. The ellipsoid method generates…