Cover Image

RiNNAL+: a Riemannian ALM Solver for SDP-RLT Relaxations of Mixed-Binary Quadratic Programs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hou, Di, Tang, Tianyun, Toh, Kim-Chuan
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

A Quadratically Convergent Alternating Projection Method for Nonconvex Sets
by: Xiao, Nachuan, et al.
Published: (2025)

On the efficient computation of proximal operators of affine-constrained nonconvex functions
by: Hou, Di, et al.
Published: (2026)

Convergence Analysis of a Relative-type Inexact Preconditioned Proximal ALM for Convex Nonlinear Programming
by: Yang, Lei, et al.
Published: (2025)

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

An Exact Penalty Approach for Equality Constrained Optimization over a Convex Set
by: Xiao, Nachuan, et al.
Published: (2025)

ripALM: A Relative-Type Inexact Proximal Augmented Lagrangian Method for Linearly Constrained Convex Optimization
by: Zhu, Jiayi, et al.
Published: (2024)

Optimization over convex polyhedra via Hadamard parametrizations
by: Tang, Tianyun, et al.
Published: (2024)

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

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

On the Exactness of SDP Relaxation for Quadratic Assignment Problem
by: Ling, Shuyang
Published: (2024)

Accelerating nuclear-norm regularized low-rank matrix optimization through Burer-Monteiro decomposition
by: Lee, Ching-pei, et al.
Published: (2022)

A Tight SDP Relaxation for the Cubic-Quartic Regularization Problem
by: Zhou, Jinling, et al.
Published: (2025)

A Bregman ADMM for Bethe variational problem
by: Khoo, Yuehaw, et al.
Published: (2025)

Learning to Relax Nonconvex Quadratically Constrained Quadratic Programs
by: Dedeoglu, Muge, et al.
Published: (2025)

CDOpt: A Python Package for a Class of Riemannian Optimization
by: Xiao, Nachuan, et al.
Published: (2022)

Enhancing Quadratic Programming Solvers via Quadratic Nonconvex Reformulation
by: Lu, Cheng, et al.
Published: (2025)

Automatic Generation of Explicit Quadratic Programming Solvers
by: Schaller, Maximilian, et al.
Published: (2025)

ML-Guided Primal Heuristics for Mixed Binary Quadratic Programs
by: Huang, Weimin, et al.
Published: (2026)

Efficient Digital Quadratic Unconstrained Binary Optimization Solvers for SAT Problems
by: Fong, Robert Simon, et al.
Published: (2024)

LCQPow -- A Solver for Linear Complementarity Quadratic Programs
by: Hall, Jonas, et al.
Published: (2022)

Stochastic Bregman Subgradient Methods for Nonsmooth Nonconvex Optimization Problems
by: Ding, Kuangyu, et al.
Published: (2024)

Inexact Bregman Proximal Gradient Method and its Inertial Variant with Absolute and Partial Relative Stopping Criteria
by: Yang, Lei, et al.
Published: (2021)

Efficient Primal Heuristics for Mixed Binary Quadratic Programs Using Suboptimal Rounding Guidance
by: Huang, Weimin, et al.
Published: (2025)

Exactness of the DNN Relaxation for Random Standard Quadratic Programs
by: Chen, Xin
Published: (2026)

On the SDP Relaxation of Direct Torque Finite Control Set Model Predictive Control
by: Hartmann, Luca M., et al.
Published: (2024)

An SDP Relaxation for the Sparse Integer Least Squares Problem
by: Del Pia, Alberto, et al.
Published: (2022)

A High-Performant Multi-Parametric Quadratic Programming Solver
by: Arnström, Daniel, et al.
Published: (2024)

Approximating Dispatchable Regions in Three-Phase Radial Networks with Conditions for Exact SDP Relaxation
by: Fang, Bohang, et al.
Published: (2025)

On the convergence rates of moment-SOS hierarchies approximation of truncated moment sequences
by: Tran, Hoang Anh, et al.
Published: (2025)

A Randomized Algorithm for Sparse PCA based on the Basic SDP Relaxation
by: Del Pia, Alberto, et al.
Published: (2025)

On exploration of an interior mirror descent flow for stochastic nonconvex constrained problem
by: Ding, Kuangyu, et al.
Published: (2025)

Differentiation Through Black-Box Quadratic Programming Solvers
by: Magoon, Connor W., et al.
Published: (2024)

On the B-subdifferential of proximal operators of affine-constrained $\ell_1$ regularizer
by: Li, Xudong, et al.
Published: (2025)

An Inexact Bregman Proximal Difference-of-Convex Algorithm with Two Types of Relative Stopping Criteria
by: Yang, Lei, et al.
Published: (2024)

Robust principal component analysis with rank and cardinality regularization under matrix factorization
by: Li, Wenjing, et al.
Published: (2026)

A Sparse Smoothing Newton Method for Solving Discrete Optimal Transport Problems
by: Hou, Di, et al.
Published: (2023)

Wasserstein distributionally robust optimization and its tractable regularization formulations
by: Chu, Hong T. M., et al.
Published: (2024)

Separable QCQPs and Their Exact SDP Relaxations
by: Kojima, Masakazu, et al.
Published: (2026)