Copertina

A semidefinite programming hierarchy for covering problems in discrete geometry

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Riener, Cordian, Rolfes, Jan, Vallentin, Frank
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Optimization and Control Metric Geometry 90C22, 90C34, 90C48
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

A Safe Approximation Based on Mixed-Integer Optimization for Non-Convex Distributional Robustness Governed by Univariate Indicator Functions
di: Dienstbier, Jana, et al.
Pubblicazione: (2023)

A Positive Semidefinite Safe Approximation of Multivariate Distributionally Robust Constraints Determined by Simple Functions
di: Dienstbier, J., et al.
Pubblicazione: (2023)

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

Bounding the density of spherical polygon packings
di: Filho, Fernando Mário de Oliveira, et al.
Pubblicazione: (2026)

A preconditioned augmented Lagrangian method for solving semidefinite programming problems
di: Tang, Tianyun, et al.
Pubblicazione: (2026)

A squared smoothing Newton method for semidefinite programming
di: Liang, Ling, et al.
Pubblicazione: (2023)

T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
di: Marumo, Hiroki, et al.
Pubblicazione: (2024)

Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices
di: Tang, Tianyun, et al.
Pubblicazione: (2024)

Second-order sequential optimality conditions for nonlinear semidefinite optimization problems
di: Li, Huimin, et al.
Pubblicazione: (2025)

A new dual spectral projected gradient method for log-determinant semidefinite programming with hidden clustering structures
di: Namchaisiri, Charles, et al.
Pubblicazione: (2024)

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

Beyond binarity: Semidefinite programming for ternary quadratic problems
di: de Meijer, Frank, et al.
Pubblicazione: (2026)

Improved semidefinite programming bounds for the maximum $k$-colorable subgraph problem
di: Barkel, Mathijs, et al.
Pubblicazione: (2026)

Convergence rates of S.O.S hierarchies for polynomial semidefinite programs
di: Tran, Hoang Anh, et al.
Pubblicazione: (2024)

Sum-of-squares hierarchies for polynomial optimization and the Christoffel-Darboux kernel
di: Slot, Lucas
Pubblicazione: (2021)

Some optimality conditions of set-valued optimization problems in locally convex topological vector spaces
di: Zeng, Renying
Pubblicazione: (2024)

A structured L-BFGS method and its application to inverse problems
di: Mannel, Florian, et al.
Pubblicazione: (2023)

Nonconvergence of a sum-of-squares hierarchy for global polynomial optimization based on push-forward measures
di: Slot, Lucas, et al.
Pubblicazione: (2024)

Solving exact and noisy rank-one tensor completion with semidefinite programming
di: Cifuentes, Diego, et al.
Pubblicazione: (2025)

Copositive Matrices with Ordered Off-Diagonal Entries
di: Blekherman, Grigoriy, et al.
Pubblicazione: (2026)

SDP bounds on the stability number via ADMM and intermediate levels of the Lasserre hierarchy
di: Sinjorgo, Lennart, et al.
Pubblicazione: (2025)

A globally convergent SQP-type method with least constraint violation for nonlinear semidefinite programming
di: Fu, Wenhao, et al.
Pubblicazione: (2023)

A minimal face constant rank constraint qualification for reducible conic programming
di: Andreani, Roberto, et al.
Pubblicazione: (2023)

A Riemannian Accelerated Proximal Gradient Method
di: Feng, Shuailing, et al.
Pubblicazione: (2025)

A parameter-free approach for solving SOS-convex semi-algebraic fractional programs
di: Yang, Chengmiao, et al.
Pubblicazione: (2024)

A low-rank augmented Lagrangian method for doubly nonnegative relaxations of mixed-binary quadratic programs
di: Hou, Di, et al.
Pubblicazione: (2025)

A Set-Valued Lagrange Theorem based on a Process for Convex Vector Programming
di: García-Castaño, Fernando, et al.
Pubblicazione: (2024)

Exact SDP relaxations for a class of quadratic programs with finite and infinite quadratic constraints
di: Arima, Naohiko, et al.
Pubblicazione: (2024)

Variational Poisson Denoising via Augmented Lagrangian Methods
di: Kanzow, Christian, et al.
Pubblicazione: (2023)

Characterizing nonconvex boundaries via scalarization
di: Ma, Jin, et al.
Pubblicazione: (2025)

On exactness of SDP relaxation for the maximum cut problem
di: Bhardwaj, Avinash, et al.
Pubblicazione: (2025)

Lagrange Multipliers, Duality, and Sensitivity in Set-Valued Convex Programming via Pointed Closed Convex Processes
di: García-Castaño, Fernando, et al.
Pubblicazione: (2024)

Optimizing Flexibility in Power Systems by Maximizing the Region of Manageable Uncertainties
di: Zingler, Aron, et al.
Pubblicazione: (2024)

The exact subgraph hierarchy and its vertex-transitive variant for the stable set problem for Paley graphs
di: Gaar, Elisabeth, et al.
Pubblicazione: (2024)

On generators of $k$-PSD closures of the positive semidefinite cone
di: Bhardwaj, Avinash, et al.
Pubblicazione: (2024)

Duality attainment and strict feasibility of the generalized moment problem and its relaxations
di: Halaseh, Sami, et al.
Pubblicazione: (2026)

Computational complexity of sum-of-squares bounds for copositive programs
di: Palomba, Marilena, et al.
Pubblicazione: (2025)

A structured L-BFGS method with diagonal scaling and its application to image registration
di: Mannel, Florian, et al.
Pubblicazione: (2024)

Distance geometry with and without the graph
di: Liberti, Leo, et al.
Pubblicazione: (2024)