Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.36827

The Geometry of Optimal Max-Cut SDP Solutions

Avinash Bhardwaj·Chen Chen·Vishnu Narayanan
View original source ↗Read source document ↗Export metadata ↓

Abstract

When the semidefinite relaxation of Max-Cut is exact, its optimal cut sign vectors lie in the kernel of the optimal dual slack. We study when they span this kernel and which matrices can occur as certificates with this property. Our main result realizes every doubly nonnegative matrix with positive diagonal and rational kernel, after sufficiently large even replication, as such a certificate. Replication preserves rank, complete positivity, and cp-rank when finite. In particular, connected exact instances with non-completely-positive sign-spanned slacks exist at every rank at least three, including an explicit fourteen-vertex example. We also characterize the arithmetic obstruction: some positive column replication has a sign-spanned kernel if and only if the original kernel is rational. For arbitrary real kernels, we determine the eventual spanning deficit. A multiplicity formula separates the contributions of repeated-column blocks and their feasible sums. Further results distinguish cut spans from optimal-face geometry, characterize orthogonal extremality through uniform complete graphs and Hadamard matrices, and give determinant bounds supporting exact finite classifications.

Explore related subjects

math.OC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Avinash Bhardwaj, Chen Chen, Vishnu Narayanan. 2026-09-29. The Geometry of Optimal Max-Cut SDP Solutions. https://arxiv.org/abs/2609.36827

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adaptive Extremum Seeking Control via the RMSprop Optimizer

Extremum Seeking Control (ESC) is a well-known set of continuous time algorithms for model-free optimization of a cost function. One issue for ESCs is the convergence rates of parameters to extrema of unknown cost functions. The local convergence rate depends on the second, or sometimes higher, order derivatives of the unknown cost function. To mitigate this dependency, we propose the use of the RMSprop optimizer for ESCs as RMSprop is an adaptive gradient-based optimizer which attempts to have a normalized convergence rate in all parameters. Practical stability results are given for this RMSprop ESC (RMSpESC). In particular notability, the proof of practical stability uses Lyapunov function based on observed contracting, attractive sets. Versions of this Lyapunov function could be applied to other areas of applications, in particular for interconnected systems.

math.OC↗
arXiv2026

A deterministic optimization algorithm for nonconvex and combinatorial bi-objective programming

Many practical multiobjective optimization (MOO) problems include discrete decision variables and/or nonlinear model equations and exhibit disconnected or smooth but nonconvex Pareto surfaces. Scalarization methods, such as the weighted-sum and sandwich (SD) algorithms, are common approaches to solving MOO problems but may fail on nonconvex or discontinuous Pareto fronts. In the current work, motivated by the well-known normal boundary intersection (NBI) method and the SD algorithm, we present SDNBI, a new algorithm for bi-objective optimization (BOO) designed to address the theoretical and numerical challenges associated with the reliable solution of general nonconvex and discrete BOO problems. The main improvements in the algorithm are the effective exploration of the nonconvex regions of the Pareto front and, uniquely, the early identification of regions where no additional Pareto solutions exist. The performance of the SDNBI algorithm is assessed based on the accuracy of the approximation of the Pareto front constructed over the disconnected nonconvex objective domains. The new algorithm is compared with two MOO approaches, the modified NBI method and the SD algorithm, using published benchmark problems. The results indicate that the SDNBI algorithm outperforms the modified NBI and SD algorithms in solving convex, nonconvex-continuous, and combinatorial problems, both in terms of computational cost and of the overall quality of the Pareto-optimal set, suggesting that the SDNBI algorithm is a promising alternative for solving BOO problems.

math.OC↗
arXiv2026

ICNN-enhanced 2SP: Leveraging input convex neural networks for solving two-stage stochastic programming

Two-stage stochastic programming (2SP) offers a basic framework for modelling decision-making under uncertainty, yet scalability remains a challenge due to the computational complexity of recourse function evaluation. Existing learning-based methods like Neural Two-Stage Stochastic Programming (Neur2SP) employ neural networks (NNs) as recourse function surrogates but rely on computationally intensive mixed-integer programming (MIP) formulations. We propose ICNN-enhanced 2SP, a method that leverages Input Convex Neural Networks (ICNNs) to exploit linear programming (LP) representability in convex 2SP problems. By architecturally enforcing convexity and enabling exact inference through LP, our approach eliminates the need for integer variables inherent in the conventional MIP-based formulation while retaining an exact embedding of the ICNN surrogate within the 2SP framework. This results in a more computationally efficient alternative, and we show that good solution quality can be maintained. Comprehensive experiments reveal that ICNNs incur only marginally longer training times while achieving validation accuracy on par with their standard NN counterparts. Across benchmark problems, ICNN-enhanced 2SP often exhibits considerably faster solution times than the MIP-based formulations while preserving solution quality, with these advantages becoming significantly more pronounced as problem scale increases. For the most challenging instances, the method achieves speedups of up to 100$\times$ with solution quality superior to MIP-based formulations.

math.OC↗