| Publication | Date of Publication | Type |
|---|
A low-rank augmented Lagrangian method for doubly nonnegative relaxations of mixed-binary quadratic programs
Operations Research | 2026-07-16 | Paper |
Convex Relaxations for the Optimization of Markov Processes
(available as arXiv preprint) | 2026-07-10 | Paper |
Stiefel optimization is NP-hard
Optimization Letters | 2026-07-02 | Paper |
Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices
SIAM Journal on Optimization | 2026-02-12 | Paper |
On the efficient computation of proximal operators of affine-constrained nonconvex functions
(available as arXiv preprint) | 2026-01-01 | Paper |
A preconditioned augmented Lagrangian method for solving semidefinite programming problems
(available as arXiv preprint) | 2026-01-01 | Paper |
RiNNAL+: a Riemannian ALM solver for SDP-RLT relaxations of mixed-binary quadratic programs
Mathematical Programming Computation | 2026-01-01 | Paper |
Optimization over convex polyhedra via Hadamard parametrizations
Mathematical Programming. Series A. Series B | 2025-12-11 | Paper |
A Bregman ADMM for Bethe variational problem
(available as arXiv preprint) | 2025-01-01 | Paper |
A low-rank augmented Lagrangian method for doubly nonnegative relaxations of mixed-binary quadratic programs
(available as arXiv preprint) | 2025-01-01 | Paper |
An Exact Penalty Approach for Equality Constrained Optimization over a Convex Set
(available as arXiv preprint) | 2025-01-01 | Paper |
RiNNAL+: a Riemannian ALM Solver for SDP-RLT Relaxations of Mixed-Binary Quadratic Programs
(available as arXiv preprint) | 2025-01-01 | Paper |
A Quadratically Convergent Alternating Projection Method for Nonconvex Sets
(available as arXiv preprint) | 2025-01-01 | Paper |
A Low-rank Augmented Lagrangian Method for Polyhedral-SDP and Moment-SOS Relaxations of Polynomial Optimization
(available as arXiv preprint) | 2025-01-01 | Paper |
A feasible method for general convex low-rank SDP problems
SIAM Journal on Optimization | 2024-07-16 | Paper |
A Riemannian dimension-reduced second-order method with application in sensor network localization
SIAM Journal on Scientific Computing | 2024-06-26 | Paper |
A Feasible Method for Solving an SDP Relaxation of the Quadratic Knapsack Problem
Mathematics of Operations Research | 2024-03-05 | Paper |
Solving graph equipartition SDPs on an algebraic variety
Mathematical Programming. Series A. Series B | 2024-02-21 | Paper |
Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices
(available as arXiv preprint) | 2024-01-01 | Paper |
Optimization over convex polyhedra via Hadamard parametrizations
(available as arXiv preprint) | 2024-01-01 | Paper |
| A feasible method for general convex low-rank SDP problems | 2023-12-13 | Paper |
| Self-adaptive ADMM for semi-strongly convex problems | 2023-09-30 | Paper |
| A Riemannian Dimension-reduced Second Order Method with Application in Sensor Network Localization | 2023-04-20 | Paper |
Minimizing cycles in tournaments and normalized q-norms
Combinatorial Theory | 2022-11-23 | Paper |
Monochromatic subgraphs in iterated triangulations
The Electronic Journal of Combinatorics | 2020-11-05 | Paper |
