Cover Image

Bounding the density of spherical polygon packings

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Filho, Fernando Mário de Oliveira, Spomer, Andreas, Vallentin, Frank
Format:	Preprint
Published:	2026
Subjects:	Metric Geometry Optimization and Control 52C17, 90C23, 90C30
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Solving clustered low-rank semidefinite programs arising from polynomial optimization
by: Leijenhorst, Nando, et al.
Published: (2022)

Optimality and uniqueness of the $D_4$ root system
by: de Laat, David, et al.
Published: (2024)

A semidefinite programming hierarchy for covering problems in discrete geometry
by: Riener, Cordian, et al.
Published: (2023)

Obtuse almost-equiangular sets
by: Bachoc, Christine, et al.
Published: (2025)

Optimization hierarchies for distance-avoiding sets in compact spaces
by: Bekker, Bram, et al.
Published: (2023)

Bound tightening in lifted formulations: (sub)solver-dependent impact on performance in RLT-based algorithms
by: González-Díaz, Julio, et al.
Published: (2025)

The density of planar sets avoiding unit distances
by: Ambrus, Gergely, et al.
Published: (2022)

Commutation principles for nonsmooth variational problems on Euclidean Jordan algebras
by: Jeong, Juyoung, et al.
Published: (2024)

Generalized Reduced Jacobian Method
by: Maghri, M. El, et al.
Published: (2025)

Sparse Polynomial Optimization with Unbounded Sets
by: Huang, Lei, et al.
Published: (2024)

A Moment-SOS Hierarchy for Robust Polynomial Matrix Inequality Optimization with SOS-Convexity
by: Guo, Feng, et al.
Published: (2023)

Sparse Polynomial Matrix Optimization
by: Miller, Jared, et al.
Published: (2024)

Geometric commutation principle for weakly spectral sets in Euclidean Jordan algebras
by: Jeong, Juyoung
Published: (2024)

PANOC-lite: A simpler and more efficient algorithm for composite minimization
by: Bodard, Alexander, et al.
Published: (2026)

Solving Low-Rank Semidefinite Programs via Manifold Optimization
by: Wang, Jie, et al.
Published: (2023)

A Dual Riemannian ADMM Algorithm for Low-Rank SDPs with Unit Diagonal
by: Wang, Jie, et al.
Published: (2025)

Set optimization - a rather short introduction
by: Hamel, Andreas H., et al.
Published: (2014)

Revisiting the Geometrically Decaying Step Size: Linear Convergence for Smooth or Non-Smooth Functions
by: Kim, Jihun
Published: (2025)

Optimization Problems with Difference of Tangentially Convex Functions under Uncertainty
by: Mashkoorzadeh, Feryal, et al.
Published: (2026)

Finding directional stationary points of DC programs
by: Thi, Hoai An Le, et al.
Published: (2026)

Analyzing the speed of convergence in nonsmooth optimization via the Goldstein subdifferential with application to descent methods
by: Gebken, Bennet
Published: (2024)

Using second-order information in gradient sampling methods for nonsmooth optimization
by: Gebken, Bennet
Published: (2022)

Interval-Valued Optimization Problems for Strongly LU-E-Invex and Strongly LU-E-Preinvex Functions
by: Tauheed, et al.
Published: (2026)

Extensions of polynomial plank covering theorems
by: Glazyrin, Alexey, et al.
Published: (2022)

Quantifying the Safety of Trajectories using Peak-Minimizing Control
by: Miller, Jared, et al.
Published: (2023)

Sparse convex relaxations in polynomial optimization
by: Averkov, Gennadiy, et al.
Published: (2024)

Characterizing nonconvex boundaries via scalarization
by: Ma, Jin, et al.
Published: (2025)

Bounding the density of binary sphere packing
by: Fernique, Thomas, et al.
Published: (2025)

Illumination number of 3-dimensional cap bodies
by: Arman, Andrii, et al.
Published: (2025)

On Computing and Pricing of Adjustable Robust Chemical Process Designs
by: Schwientek, Jan, et al.
Published: (2025)

The Least Singular Value Function in Variational Analysis
by: Jelitte, Mario, et al.
Published: (2025)

A Riemannian Variational and Spectral Framework for High-Dimensional Sphere Packing: Barrier-Dynamics Reconciliation, Periodic Rigidity, and Discrete-Time Guarantees
by: Alpay, Faruk, et al.
Published: (2025)

Optimal Subgradient Methods for Lipschitz Convex Optimization with Error Bounds
by: Wang, Alex L.
Published: (2025)

Fast convergence of Frank-Wolfe algorithms on polytopes
by: Wirth, Elias, et al.
Published: (2024)

A three-term Polak-Ribière-Polyak conjugate gradient method for vector optimization
by: Lin, Guangxuan, et al.
Published: (2025)

A new problem qualification based on approximate KKT conditions for Lipschitzian optimization with application to bilevel programming
by: Käming, Isabella, et al.
Published: (2024)

The link between $1$-norm approximation and effective Positivstellensatze for the hypercube
by: de Klerk, Etienne, et al.
Published: (2024)

A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization
by: Mansueto, Pierluigi
Published: (2025)

Stratification for Nonlinear Semidefinite Programming
by: Bao, Chenglong, et al.
Published: (2026)

On the existence and the stability of solutions in nonconvex vector optimization
by: Van Nghi, Tran, et al.
Published: (2025)