Imagen de Portada

Cuts and semidefinite liftings for the complex cut polytope

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Sinjorgo, Lennart, Sotirov, Renata, Anjos, Miguel F.
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control 52B05, 60G35, 90C20, 90C22
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

On convergence of a $q$-random coordinate constrained algorithm for non-convex problems
por: Ghaffari-Hadigheh, Alireza, et al.
Publicado: (2022)

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

Getting to the Root of the Problem: Sums of Squares for Limits of Trees
por: Brosch, Daniel, et al.
Publicado: (2024)

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

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

On the geometry of circumcentric directions of cones
por: Bello-Cruz, Yunier
Publicado: (2026)

Improved approximation ratios for the Quantum Max-Cut problem on general, triangle-free and bipartite graphs
por: Gribling, Sander, et al.
Publicado: (2025)

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

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

The Boolean polynomial polytope with multiple choice constraints
por: Shao, Sihong, et al.
Publicado: (2024)

Determining inscribability of polytopes via rank minimization based on slack matrices
por: Chen, Yiwen, et al.
Publicado: (2025)

Unimodular polytopes and column number bounds on polytopal totally unimodular matrices via Seymour's decomposition theorem
por: Nill, Benjamin
Publicado: (2024)

On cone partitions for the min-cut and max-cut problems with non-negative edges
por: Nikolaev, Andrei V., et al.
Publicado: (2023)

The Geometry of Linear Program Compression: An Exact Characterization and Learning Algorithm
por: Ye, Yuhan, et al.
Publicado: (2026)

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

Zeroth-order Random Subspace Algorithm for Non-smooth Convex Optimization
por: Nozawa, Ryota, et al.
Publicado: (2024)

On Circuit Imbalance and 0/1 Circuits for Coloring and Spanning Forest Problems
por: Borgwardt, Steffen, et al.
Publicado: (2025)

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

Dimension-Free Descriptions of Convex Sets
por: Levin, Eitan, et al.
Publicado: (2023)

On the Hardness of Short and Sign-Compatible Circuit Walks
por: Borgwardt, Steffen, et al.
Publicado: (2024)

Semidefinite approximations for bicliques and biindependent pairs
por: Laurent, Monique, et al.
Publicado: (2023)

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

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

On the Diameter of a 2-Sum of Polyhedra
por: Borgwardt, Steffen, et al.
Publicado: (2023)

Hidden convexity, optimization, and algorithms on rotation matrices
por: Ramachandran, Akshay, et al.
Publicado: (2023)

On seeded subgraph-to-subgraph matching: The ssSGM Algorithm and matchability information theory
por: Meng, Lingyao, et al.
Publicado: (2023)

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

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

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

Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming
por: Nikolaev, Andrei V., et al.
Publicado: (2022)

SDP Approach to Quadratic Vertex-Disjoint Paths Problem
por: Xu, Mingming, et al.
Publicado: (2026)

Asymmetry in the Complexity of the Multi-Commodity Network Pricing Problem
por: Bui, Quang Minh, et al.
Publicado: (2022)

Average-case thresholds for exact regularization of linear programs
por: Friedlander, Michael P., et al.
Publicado: (2025)

The Gittins index is optimal for dynamic allocation with conditionally independent filtrations
por: Wang, Christopher
Publicado: (2023)

On the Semidefinite Representability of Continuous Quadratic Submodular Minimization With Applications to Moment Problems
por: Burer, Samuel, et al.
Publicado: (2025)

Strong Variational Sufficiency for Nonlinear Semidefinite Programming and its Implications
por: Wang, Shiwei, et al.
Publicado: (2022)

The Non-Substitution Theorem, Uniqueness of Solution and Convex combinations of basic optimal solutions for linear optimization
por: Lahiri, Somdeb
Publicado: (2024)

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