On the approximation of unbounded convex sets by polyhedra

DOI10.1007/s10957-022-02020-3zbMath1490.52008arXiv2207.06750OpenAlexW4220968412MaRDI QIDQ2671446

Daniel Dörfler

Publication date: 3 June 2022

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.06750

zbMATH Keywords

algorithmspolyhedral approximationconvex analysisspectrahedraunbounded sets

Mathematics Subject Classification ID

Semidefinite programming (90C22) Approximation methods and heuristics in mathematical programming (90C59) Polytopes and polyhedra (52B99) Approximation by convex sets (52A27)

Related Items (2)

Algorithms to Solve Unbounded Convex Vector Optimization Problems ⋮ Polyhedral approximation of spectrahedral shadows via homogenization

Uses Software

• Octave
• SDPT3
• BENSOLVE
• SHOT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving semidefinite-quadratic-linear programs using SDPT3
• Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming
• Primal and dual approximation algorithms for convex vector optimization problems
• An approximation algorithm for convex multi-objective programming problems
• Newton's method for convex programming and Tschebyscheff approximation
• Zur optimalen Approximation konvexer Hyperflächen durch Polyeder
• The efficiency of Hausdorff algorithms for approximating convex bodies by polytopes
• A vector linear programming approach for certain global optimization problems
• Tractability of convex vector optimization problems in the sense of polyhedral approximations
• Polyhedral approximation in mixed-integer convex optimization
• Analysis of an algorithm for approximating convex bodies
• Some geometric results in semidefinite programming
• Approximation methods in multiobjective programming
• Vector Optimization with Infimum and Supremum
• The Cutting-Plane Method for Solving Convex Programs
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Variational Analysis
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• The Supporting Hyperplane Method for Unimodal Programming
• Approximation by polygons and polyhedra
• Generating all vertices of a polyhedron is hard
• The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming

This page was built for publication: On the approximation of unbounded convex sets by polyhedra