Cover Image

A Dual Riemannian ADMM Algorithm for Low-Rank SDPs with Unit Diagonal

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Wang, Jie, Hu, Liangbing, Xia, Bican
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control Primary, 90C22, Secondary, 90C23, 90C30
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Solving Low-Rank Semidefinite Programs via Manifold Optimization
by: Wang, Jie, et al.
Published: (2023)

A Bilevel Hierarchy of Strengthened Complex Moment Relaxations for Complex Polynomial Optimization
by: Wang, Jie
Published: (2024)

Efficiency and Convergence Insights in Large-Scale Optimization Using the Improved Inexact-Newton-Smart Algorithm and Interior-Point Framework
by: Renani, Neda Bagheri, et al.
Published: (2025)

The Augmented Mixing Method: Computing High-Accuracy Primal-Dual Solutions to Large-Scale SDPs via Column Updates
by: Brosch, Daniel, et al.
Published: (2025)

Optimization of Closed-Loop Shallow Geothermal Systems Using Analytical Models
by: Heinzel, Oliver, et al.
Published: (2026)

A more efficient reformulation of complex SDP as real SDP
by: Wang, Jie
Published: (2023)

Weighted Geometric Mean, Minimum Mediated Set, and Optimal Simple Second-Order Cone Representation
by: Wang, Jie
Published: (2022)

A Moment-QSOS Hierarchy for a Class of Quaternion Polynomial Optimization Problems
by: Liu, Yanqing, et al.
Published: (2026)

Exploiting Sign Symmetries in Minimizing Sums of Rational Functions
by: Guo, Feng, et al.
Published: (2024)

A Moment-SOS Hierarchy for Robust Polynomial Matrix Inequality Optimization with SOS-Convexity
by: Guo, Feng, et al.
Published: (2023)

A Low-rank Augmented Lagrangian Method for Polyhedral-SDP and Moment-SOS Relaxations of Polynomial Optimization
by: Hou, Di, et al.
Published: (2025)

ZOBA: An Efficient Single-loop Zeroth-order Bilevel Optimization Algorithm
by: Rando, Marco, et al.
Published: (2026)

An Inexact Modified Quasi-Newton Method for Nonsmooth Regularized Optimization
by: Allaire, Nathan, et al.
Published: (2025)

Stratification for Nonlinear Semidefinite Programming
by: Bao, Chenglong, et al.
Published: (2026)

Sparse convex relaxations in polynomial optimization
by: Averkov, Gennadiy, et al.
Published: (2024)

Sparse Polynomial Matrix Optimization
by: Miller, Jared, et al.
Published: (2024)

Sparse Polynomial Optimization with Unbounded Sets
by: Huang, Lei, et al.
Published: (2024)

CCOpt: an Open-Source Solver for Large-Scale Mathematical Programs with Complementarity Constraints
by: Pozharskiy, Anton, et al.
Published: (2026)

A sensitivity-based method for bilevel optimization problems: Theoretical analysis and computational performance
by: Nolasco, Eduardo, et al.
Published: (2025)

Optimistic Bilevel Optimization with Composite Lower-Level Problem
by: Solla, Mattia, et al.
Published: (2026)

A parameter-free approach for solving SOS-convex semi-algebraic fractional programs
by: Yang, Chengmiao, et al.
Published: (2024)

Solving Sparse MIQCQPs: Application to the Unit Commitment Problem with ACOPF Constraints
by: Gómez-Casares, Ignacio, et al.
Published: (2025)

Nonconvergence of a sum-of-squares hierarchy for global polynomial optimization based on push-forward measures
by: Slot, Lucas, et al.
Published: (2024)

Sum-of-squares hierarchies for polynomial optimization and the Christoffel-Darboux kernel
by: Slot, Lucas
Published: (2021)

Bound tightening in lifted formulations: (sub)solver-dependent impact on performance in RLT-based algorithms
by: González-Díaz, Julio, et al.
Published: (2025)

Duality attainment and strict feasibility of the generalized moment problem and its relaxations
by: Halaseh, Sami, et al.
Published: (2026)

The link between $1$-norm approximation and effective Positivstellensatze for the hypercube
by: de Klerk, Etienne, et al.
Published: (2024)

An Overview of Convergence Rates for Sum of Squares Hierarchies in Polynomial Optimization
by: Laurent, Monique, et al.
Published: (2024)

A Structured Proximal Stochastic Variance Reduced Zeroth-order Algorithm
by: Rando, Marco, et al.
Published: (2025)

A Highly Efficient Adaptive-Sieving-Based Algorithm for the High-Dimensional Rank Lasso Problem
by: Bai, Xiaoning, et al.
Published: (2022)

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

A low-rank augmented Lagrangian method for doubly nonnegative relaxations of mixed-binary quadratic programs
by: Hou, Di, et al.
Published: (2025)

Dual certificates of primal cone membership
by: Lee, Joonyeob, et al.
Published: (2025)

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

Disjunctive Sum of Squares
by: Ahmadi, Amir Ali, et al.
Published: (2026)

A minimal face constant rank constraint qualification for reducible conic programming
by: Andreani, Roberto, et al.
Published: (2023)

Long-Step Path-Following Algorithm for Quantum Information Theory: Some Numerical Aspects and Applications
by: Faybusovich, Leonid, et al.
Published: (2019)

Sum-of-squares certificates for symmetric polynomials on the hypercube: a counterexample to a conjecture of De Klerk and Laurent
by: Polak, Sven
Published: (2026)

Penalty-Free SDDP: Feasibility Cuts for Robust Multi-Stage Stochastic Optimization in Energy Planning
by: Freitas, Guilherme, et al.
Published: (2025)

Optimal routing and transmission strategies for UAV reconnaissance missions with detection threats
by: Badenbroek, Riley, et al.
Published: (2024)