Explicit and implicit enforcing -- randomized optimization

DOI10.1007/3-540-45506-X_3MaRDI QIDQ4542175zbMATH OpenFDO

Authors B. Gärtner, Emo Welzl

Publication date 4 August 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45506-X_3

zbMATH Keywords

geometric optimizationpolynomial combinatorial linear programming algorithm

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05)

Recommendations

• A combinatorial bound for linear programming and related problems
• Linear programming — Randomization and abstract frameworks
• A subexponential bound for linear programming
• Geometric applications of a randomized optimization technique
• scientific article; zbMATH DE number 1857642

Cited in

(6)

• A complexity analysis of policy iteration through combinatorial matrices arising from unique sink orientations
• A randomized cutting plane method with probabilistic geometric convergence
• Randomized Post-optimization for t-Restrictions
• The domination heuristic for LP-type problems
• Realizability makes a difference: a complexity gap for sink-finding in USOs
• Realizability in Matoušek unique sink orientations: characterization and complexity gap

This page was built for publication: Explicit and implicit enforcing -- randomized optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542175)