Copertina

An Exceptionally Difficult Binary Quadratic Optimization Problem with Symmetry: a Challenge for The Largest Unsolved QAP Instance Tai256c

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Fujii, Koichi, Kim, Sunyoung, Kojima, Masakazu, Mittelmann, Hans D., Shinano, Yuji
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Optimization and Control 90C20, 90C22, 90C26
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Extending Exact Convex Relaxations of Quadratically Constrained Quadratic Programs
di: Kojima, Masakazu, et al.
Pubblicazione: (2025)

Constructing QCQP Instances Equivalent to Their SDP Relaxations
di: Kojima, Masakazu, et al.
Pubblicazione: (2025)

Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems
di: Arima, Naohiko, et al.
Pubblicazione: (2023)

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

Separable QCQPs and Their Exact SDP Relaxations
di: Kojima, Masakazu, et al.
Pubblicazione: (2026)

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

Tight Semidefinite Relaxations for Verifying Robustness of Neural Networks
di: Azuma, Godai, et al.
Pubblicazione: (2025)

Solving Sparse MIQCQPs: Application to the Unit Commitment Problem with ACOPF Constraints
di: Gómez-Casares, Ignacio, et al.
Pubblicazione: (2025)

Globally Solving Concave Quadratic Programs via Doubly Nonnegative Relaxation
di: Qu, Zheng, et al.
Pubblicazione: (2023)

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

Extended Triangle Inequalities for Nonconvex Box-Constrained Quadratic Programming
di: Anstreicher, Kurt M., et al.
Pubblicazione: (2025)

Exploiting Sign Symmetries in Minimizing Sums of Rational Functions
di: Guo, Feng, et al.
Pubblicazione: (2024)

Error Bounds for Rank-one Double Nonnegative Reformulations of QAP and Exact Penalties
di: Qian, Yitian, et al.
Pubblicazione: (2024)

Multiobjective Programming and Weighting Scalar Problem
di: Ivanov, Vsevolod I.
Pubblicazione: (2025)

Lagrangian Reformulation for Nonconvex Optimization: Tailoring Problems to Specialized Solvers
di: Quintero, Rodolfo A., et al.
Pubblicazione: (2024)

Outer Approximation Scheme for Weakly Convex Constrained Optimization Problems
di: Bednarczuk, Ewa M., et al.
Pubblicazione: (2024)

Optimality Conditions and Duality for Multiobjective Fractional Bilevel Optimization Problems
di: Lara, Felipe, et al.
Pubblicazione: (2025)

On the Convexity of the Solution Set of Linear Complementarity Problem over Tensor Spaces
di: Sharma, Sonali, et al.
Pubblicazione: (2026)

Optimistic Bilevel Optimization with Composite Lower-Level Problem
di: Solla, Mattia, et al.
Pubblicazione: (2026)

First and Second Order Necessary and Sufficient Optimality Conditions of Fritz John Type for Vector Problems over Cones
di: Ivanov, Vsevolod I.
Pubblicazione: (2024)

On a minimization problem of the maximum generalized eigenvalue: properties and algorithms
di: Nishioka, Akatsuki, et al.
Pubblicazione: (2023)

Minimizing and Maximizing the Shannon Entropy for Fixed Marginals
di: Franke, Paula, et al.
Pubblicazione: (2025)

Clust-Splitter - an Efficient Nonsmooth Optimization-Based Algorithm for Clustering Large Datasets
di: Lampainen, Jenni, et al.
Pubblicazione: (2025)

New vector transport operators extending a Riemannian CG algorithm to generalized Stiefel manifold with low-rank applications
di: Wang, Xuejie, et al.
Pubblicazione: (2023)

Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Terms
di: Bestuzheva, Ksenia, et al.
Pubblicazione: (2022)

Clash of MINLP Relaxations: Piecewise Linear vs. Global Parabolic
di: Göß, Adrian
Pubblicazione: (2026)

New results on the local-nonglobal minimizers of the generalized trust-region subproblem
di: Ai, Wenbao, et al.
Pubblicazione: (2024)

Parabolic Approximation & Relaxation for MINLP
di: Göß, Adrian, et al.
Pubblicazione: (2024)

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

On Tackling High-Dimensional Nonconvex Stochastic Optimization via Stochastic First-Order Methods with Non-smooth Proximal Terms and Variance Reduction
di: Xie, Yue, et al.
Pubblicazione: (2025)

A Stochastic Quasi-Newton Method in the Absence of Common Random Numbers
di: Menickelly, Matt, et al.
Pubblicazione: (2023)

Benign landscapes of low-dimensional relaxations for orthogonal synchronization on general graphs
di: McRae, Andrew D., et al.
Pubblicazione: (2023)

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

Sparse Polynomial Matrix Optimization
di: Miller, Jared, et al.
Pubblicazione: (2024)

Hidden convexity of quadratic systems and its application to quadratic programming
di: Huy, Nguyen Quang, et al.
Pubblicazione: (2026)

Riemannian Gradient Method with Momentum
di: Leggio, Filippo, et al.
Pubblicazione: (2026)

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

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

Norm-induced Cuts: Outer Approximation for Lipschitzian Constraint Functions
di: Göß, Adrian, et al.
Pubblicazione: (2024)

Decentralized projected Riemannian stochastic recursive momentum method for nonconvex optimization
di: Deng, Kangkang, et al.
Pubblicazione: (2024)