Image de couverture de livre

Tight Semidefinite Relaxations for Verifying Robustness of Neural Networks

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Azuma, Godai, Kim, Sunyoung, Yamashita, Makoto
Format:	Preprint
Publié:	2025
Sujets:	Optimization and Control 62M45, 90C20, 90C22, 90C25, 90C26
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Separable QCQPs and Their Exact SDP Relaxations
par: Kojima, Masakazu, et autres
Publié: (2026)

Constructing QCQP Instances Equivalent to Their SDP Relaxations
par: Kojima, Masakazu, et autres
Publié: (2025)

Extending Exact Convex Relaxations of Quadratically Constrained Quadratic Programs
par: Kojima, Masakazu, et autres
Publié: (2025)

T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
par: Marumo, Hiroki, et autres
Publié: (2024)

Dual Spectral Projected Gradient Method for Generalized Log-det Semidefinite Programming
par: Namchaisiri, Charles, et autres
Publié: (2024)

Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems
par: Arima, Naohiko, et autres
Publié: (2023)

Exact SDP relaxations for a class of quadratic programs with finite and infinite quadratic constraints
par: Arima, Naohiko, et autres
Publié: (2024)

A new dual spectral projected gradient method for log-determinant semidefinite programming with hidden clustering structures
par: Namchaisiri, Charles, et autres
Publié: (2024)

An Exceptionally Difficult Binary Quadratic Optimization Problem with Symmetry: a Challenge for The Largest Unsolved QAP Instance Tai256c
par: Fujii, Koichi, et autres
Publié: (2023)

Beyond binarity: Semidefinite programming for ternary quadratic problems
par: de Meijer, Frank, et autres
Publié: (2026)

Globally Solving Concave Quadratic Programs via Doubly Nonnegative Relaxation
par: Qu, Zheng, et autres
Publié: (2023)

Relaxations of KKT Conditions do not Strengthen Finite RLT and SDP-RLT Bounds for Nonconvex Quadratic Programs
par: Yildirim, E. Alper
Publié: (2025)

Exact Convex Reformulations of Linear Neural Networks via Completely Positive Lifting
par: Prakhya, Karthik, et autres
Publié: (2026)

On the convexity for the range set of two quadratic functions
par: Nguyen, Huu-Quang, et autres
Publié: (2025)

Solving Sparsity Constrained PCA, Regression, and QCQP via the Spartrahedron
par: Cifuentes, Diego, et autres
Publié: (2026)

DC Semidefinite Programming and Cone Constrained DC Optimization: Theory and Local Search Methods
par: Dolgopolik, M. V.
Publié: (2021)

Solving Sparse MIQCQPs: Application to the Unit Commitment Problem with ACOPF Constraints
par: Gómez-Casares, Ignacio, et autres
Publié: (2025)

A Low-rank Augmented Lagrangian Method for Polyhedral-SDP and Moment-SOS Relaxations of Polynomial Optimization
par: Hou, Di, et autres
Publié: (2025)

Parabolic Approximation & Relaxation for MINLP
par: Göß, Adrian, et autres
Publié: (2024)

Clash of MINLP Relaxations: Piecewise Linear vs. Global Parabolic
par: Göß, Adrian
Publié: (2026)

Nesterov's Accelerated Jacobi-Type Methods for Large-scale Symmetric Positive Semidefinite Linear Systems
par: Liang, Ling, et autres
Publié: (2024)

A Moment-SOS Hierarchy for Robust Polynomial Matrix Inequality Optimization with SOS-Convexity
par: Guo, Feng, et autres
Publié: (2023)

A constraint-based approach to function interpolation, with application to performance estimation for weakly convex optimisation
par: Rubbens, Anne, et autres
Publié: (2024)

Interpolation Conditions for Linear Operators and Applications to Performance Estimation Problems
par: Bousselmi, Nizar, et autres
Publié: (2023)

Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices
par: Tang, Tianyun, et autres
Publié: (2024)

cuHALLaR: A GPU Accelerated Low-Rank Augmented Lagrangian Method for Large-Scale Semidefinite Programming
par: Aguirre, Jacob M., et autres
Publié: (2025)

A squared smoothing Newton method for semidefinite programming
par: Liang, Ling, et autres
Publié: (2023)

Interval-Valued Optimization Problems for Strongly LU-E-Invex and Strongly LU-E-Preinvex Functions
par: Tauheed, et autres
Publié: (2026)

Low solution rank of the matrix LASSO under RIP with consequences for rank-constrained algorithms
par: McRae, Andrew D.
Publié: (2024)

A Bilevel Hierarchy of Strengthened Complex Moment Relaxations for Complex Polynomial Optimization
par: Wang, Jie
Publié: (2024)

Non-Attainment of Minima in Non-Polyhedral Conic Optimization: A Robust SOCP Example
par: Nguyen, Vinh
Publié: (2025)

A Riemannian Accelerated Proximal Gradient Method
par: Feng, Shuailing, et autres
Publié: (2025)

Exploiting Sign Symmetries in Minimizing Sums of Rational Functions
par: Guo, Feng, et autres
Publié: (2024)

Nonconvergence of a sum-of-squares hierarchy for global polynomial optimization based on push-forward measures
par: Slot, Lucas, et autres
Publié: (2024)

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

Sparse Polynomial Optimization with Unbounded Sets
par: Huang, Lei, et autres
Publié: (2024)

Sparse Polynomial Matrix Optimization
par: Miller, Jared, et autres
Publié: (2024)

A minimal face constant rank constraint qualification for reducible conic programming
par: Andreani, Roberto, et autres
Publié: (2023)

Decentralized projected Riemannian stochastic recursive momentum method for nonconvex optimization
par: Deng, Kangkang, et autres
Publié: (2024)

A conditional gradient homotopy method with applications to Semidefinite Programming
par: Dvurechensky, Pavel, et autres
Publié: (2022)