Maximizing Slice-Volumes of Semialgebraic Sets using Sum-of-Squares Programming

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Miller, Jared, Meroni, Chiara, Tacchi, Matteo, Velasco, Mauricio
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866911790889172992
author Miller, Jared
Meroni, Chiara
Tacchi, Matteo
Velasco, Mauricio
author_facet Miller, Jared
Meroni, Chiara
Tacchi, Matteo
Velasco, Mauricio
contents This paper presents an algorithm to maximize the volume of an affine slice through a given semialgebraic set. This slice-volume task is formulated as an infinite-dimensional linear program in continuous functions, inspired by prior work in volume computation of semialgebraic sets. A convergent sequence of upper-bounds to the maximal slice volume are computed using the moment-Sum-of-Squares hierarchy of semidefinite programs in increasing size. The computational complexity of this scheme can be reduced by utilizing topological structure (in dimensions 2, 3, 4, 8) and symmetry. This numerical convergence can be accelerated through the introduction of redundant Stokes-based constraints. Demonstrations of slice-volume calculation are performed on example sets.
format Preprint
id arxiv_https___arxiv_org_abs_2403_04438
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Maximizing Slice-Volumes of Semialgebraic Sets using Sum-of-Squares Programming
Miller, Jared
Meroni, Chiara
Tacchi, Matteo
Velasco, Mauricio
Optimization and Control
Algebraic Geometry
This paper presents an algorithm to maximize the volume of an affine slice through a given semialgebraic set. This slice-volume task is formulated as an infinite-dimensional linear program in continuous functions, inspired by prior work in volume computation of semialgebraic sets. A convergent sequence of upper-bounds to the maximal slice volume are computed using the moment-Sum-of-Squares hierarchy of semidefinite programs in increasing size. The computational complexity of this scheme can be reduced by utilizing topological structure (in dimensions 2, 3, 4, 8) and symmetry. This numerical convergence can be accelerated through the introduction of redundant Stokes-based constraints. Demonstrations of slice-volume calculation are performed on example sets.
title Maximizing Slice-Volumes of Semialgebraic Sets using Sum-of-Squares Programming
topic Optimization and Control
Algebraic Geometry
url https://arxiv.org/abs/2403.04438