Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes

DOI10.1007/s11750-013-0294-8zbMath1311.52012OpenAlexW1990499859MaRDI QIDQ5965567

Jean-Baptiste Hiriart-Urruty

Publication date: 28 November 2013

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-013-0294-8

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Combinatorial aspects of simplicial complexes (05E45)

Related Items (3)

Decomposition techniques for bilinear saddle point problems and variational inequalities with affine monotone operators ⋮ Convergent Algorithms for a Class of Convex Semi-infinite Programs ⋮ A Multilevel Proximal Gradient Algorithm for a Class of Composite Optimization Problems

Cites Work

• The Hirsch conjecture has been disproved: an interview with Francisco Santos
• Potpourri of Conjectures and Open Questions in Nonlinear Analysis and Optimization
• A new series of conjectures and open questions in optimization and matrix analysis

This page was built for publication: Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes