Tighter yet more tractable relaxations and nontrivial instance generation for sparse standard quadratic optimization

Documenti analoghi

• Relaxations of KKT Conditions do not Strengthen Finite RLT and SDP-RLT Bounds for Nonconvex Quadratic Programs
  di: Yildirim, E. Alper
  Pubblicazione: (2025)
• Feature selection in linear SVMs via a hard cardinality constraint: a scalable SDP decomposition approach
  di: Bomze, Immanuel, 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)
• Spectral Outer-Approximation Algorithms for Binary Semidefinite Problems
  di: de Roux, Daniel, et al.
  Pubblicazione: (2025)
• A low-rank augmented Lagrangian method for doubly nonnegative relaxations of mixed-binary quadratic programs
  di: Hou, Di, et al.
  Pubblicazione: (2025)