Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming

DOI10.1007/978-3-319-66706-5_11zbMATH Open1421.90170OpenAlexW2749325905MaRDI QIDQ5233243FDOQ5233243

Authors: Alexandre Maréchal, David Monniaux, M. Perin 

Publication date: 16 September 2019

Published in: Static Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-66706-5_11

Recommendations

• A scaling algorithm for optimizing arbitrary functions over vertices of polytopes
• Minimizing Piecewise-Concave Functions Over Polyhedra
• An affine scaling method for optimization problems with polyhedral constraints
• Simplicial algorithms for minimizing polyhedral functions
• A unifying polyhedral approximation framework for convex optimization
• An efficient algorithm for minimizing a multivariate polyhedral function along a line
• Optimization and approximation for polyhedra in separable Hilbert spaces
• Polyhedral functions and multiparametric linear programming
• scientific article; zbMATH DE number 1305444
• scientific article; zbMATH DE number 1537598

zbMATH Keywords

projectionpolyhedraparametric linear programming

Mathematics Subject Classification ID

Linear programming (90C05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cited In (4)

• Title not available (Why is that?)
• Static Analysis
• Some ways to reduce the space dimension in polyhedra computations
• Revisiting polyhedral analysis for hybrid systems

Uses Software

• Apron
• PPL
• PAGAI
• Verimag Polyhedra Library

This page was built for publication: Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming

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