Searcharxiv⌕ Search

arXiv · 2611.14885

An Inexact Augmented Lagrangian Method for Semidefinite Complementarity Optimization

Abstract

Semidefinite complementarity constraints arise in applications such as inverse semidefinite programming and rank-constrained matrix optimization. We develop a structure-preserving augmented Lagrangian method (SPALM) for mathematical programs with these constraints. The method augments the smooth constraints and retains matrix complementarity in its subproblems. We handle these subproblems by an inexact proximal alternating framework with verifiable descent and stationarity conditions. With vanishing absolute subproblem errors, feasible accumulation points of infinite outer sequences are asymptotically M-stationary. Under AM-regularity, these points are M-stationary. We prove that active-set SDCMPCC-LICQ is sufficient for this regularity. For each AL subproblem, the full stationarity residual converges to zero along infinite accepted inner sequences if the initial sublevel set is bounded, the proximal parameters are bounded above and away from zero, and the block errors vanish. If the block errors are also square-summable, an $O(T^{-1/2})$ best-residual bound holds over $T$ accepted iterations. Huber-Stiefel and fixed-basis procedures generate feasible matrix candidates, whose acceptance is verified by descent tests and computable limiting-normal certificates. For rank-constrained correlation matrix approximation, we construct a lifting that preserves the projected feasible set and global optimal value and satisfies active-set SDCMPCC-LICQ at every feasible point. The stationarity guarantees apply to this lifted model. Finite-budget experiments on this lifting and a single-equality observation-fitting inverse SDP meet the prescribed numerical feasibility and stationarity tests in all 120 runs.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wanqi Hou, Yanzhen Peng, Chao Ding. 2026-11-11. An Inexact Augmented Lagrangian Method for Semidefinite Complementarity Optimization. https://searcharxiv.com/abs/2611.14885

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

First-order methods for stochastic and finite-sum convex optimization with deterministic constraints

In this paper, we study a class of stochastic and finite-sum convex optimization problems with deterministic constraints. Existing methods typically aim to find an $ε$-$expected\ feasible\ stochastic\ optimal$ solution, in which both the expected constraint violation and the expected optimality gap are within a prescribed tolerance $ε$. However, in many practical applications, constraints must be nearly satisfied with certainty, rendering such solutions potentially unsuitable due to the risk of substantial violations. To address this issue, we propose stochastic first-order methods for finding an $ε$-$surely\ feasible\ stochastic\ optimal$ ($ε$-SFSO) solution, where the constraint violation is deterministically bounded by $ε$ and the expected optimality gap is at most $ε$. Our methods apply an accelerated stochastic gradient (ASG) scheme or a modified variance-reduced ASG scheme $only\ once$ to a sequence of quadratic penalty subproblems with appropriately chosen penalty parameters. We establish first-order oracle complexity bounds for the proposed methods in computing an $ε$-SFSO solution. Preliminary numerical results are presented to illustrate the performance of the proposed methods.

math.OC↗

Attention's forward pass and Frank-Wolfe

We study the hardmax limit of self-attention dynamics for token embeddings obtained in the zero-temperature ($β\to+\infty$) regime, and relate it to the finite-$β$ setting. In this limit, the update rule can be viewed as a Frank-Wolfe step for a quadratic objective over the convex hull of the current token embeddings. When the key-query matrix is negative semidefinite, the method linearly contracts all tokens to a single cluster at the origin. When it is positive semidefinite, extending the hardmax rule to the entire convex hull induces a Voronoi diagram: vertices are stationary, interior points remain in their initial cells, and each token moves along a straight line toward its cell's vertex, yielding (super-)exponential convergence. As a byproduct, we also establish well-posedness of the associated ODE limit in this regime. Returning to the finite-$β$ regime, we model self-attention dynamics as a Markov chain and prove dynamic metastability: with high probability, interior tokens reach near-vertex configurations in a constant number of steps and remain within a small neighborhood for times that grow exponentially in the inverse temperature $β$, before ultimately collapsing to the origin. Thus, the hardmax dynamics accurately approximate the finite-$β$ process over exponentially long time horizons.

math.OC↗

Finite de Finetti for convex bodies and Polynomial Optimization

We study polynomial optimization over convex bodies with separately affine objectives and local affine equality and inequality constraints. We construct a convergent hierarchy of conic relaxations with explicit finite-level error bounds of order $n^{-1/2}$ at level $n$, complemented by a constructive rounding scheme that produces feasible points. The relaxation bounds and rounded objective values bracket the optimum at the same rate. The analytic ingredient is a finite de Finetti representation theorem for arbitrary proper cones: bipartite marginals of symmetric extensions in maximal tensor products are $O(n^{-1/2})$-close, in base norm, to points of the minimal tensor product. Its proof combines a uniform, monogamy-type bound on a variational mutual information based on Frenkel's relative entropy with classical conditioning and informationally complete measurements. We apply the framework to the assemblage relaxation of two-player non-local games in general probabilistic theories. For polytopic state spaces, the hierarchy consists of linear programs, and experiments on the Clauser--Horne--Shimony--Holt (CHSH) game provide a numerical proof of concept for the outer approximations and feasible rounding procedure.

math.OC↗