Copertina

Max-Min Bilinear Completely Positive Programs: A Semidefinite Relaxation with Tightness Guarantees

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Gao, Sarah Yini, Tang, Xindong, Yuan, Yancheng
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Optimization and Control 90C23, 15B48, 44A60, 90C22, 65K05
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Semidefinite approximations for bicliques and biindependent pairs
di: Laurent, Monique, et al.
Pubblicazione: (2023)

A structured L-BFGS method and its application to inverse problems
di: Mannel, Florian, et al.
Pubblicazione: (2023)

A structured L-BFGS method with diagonal scaling and its application to image registration
di: Mannel, Florian, et al.
Pubblicazione: (2024)

cuHALLaR: A GPU Accelerated Low-Rank Augmented Lagrangian Method for Large-Scale Semidefinite Programming
di: Aguirre, Jacob M., et al.
Pubblicazione: (2025)

On the Semidefinite Representability of Continuous Quadratic Submodular Minimization With Applications to Moment Problems
di: Burer, Samuel, et al.
Pubblicazione: (2025)

Generalized Nash equilibrium problems with quasi-linear constraints
di: Choi, Jiyoung, et al.
Pubblicazione: (2024)

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

Single Element Error Correction/ in a Euclidean Distance Matrix
di: Alfakih, Abdo, et al.
Pubblicazione: (2024)

A Vectorized Positive Semidefinite Penalty Method for Unconstrained Binary Quadratic Programming
di: Huo, Xinyue, et al.
Pubblicazione: (2024)

Exact Solutions for the NP-hard Wasserstein Barycenter Problem using a Doubly Nonnegative Relaxation and a Splitting Method
di: Jung, Woosuk L., et al.
Pubblicazione: (2023)

A globalization of L-BFGS and the Barzilai-Borwein method for nonconvex unconstrained optimization
di: Mannel, Florian
Pubblicazione: (2024)

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

Tight Semidefinite Relaxations for Verifying Robustness of Neural Networks
di: Azuma, Godai, et al.
Pubblicazione: (2025)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
di: Deng, Kangkang, et al.
Pubblicazione: (2024)

A User Manual for cuHALLaR: A GPU Accelerated Low-Rank Semidefinite Programming Solver
di: Aguirre, Jacob, et al.
Pubblicazione: (2025)

Efficient parameter-free restarted accelerated gradient methods for convex and strongly convex optimization
di: Sujanani, Arnesh, et al.
Pubblicazione: (2024)

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

Performance Estimation for Smooth and Strongly Convex Sets
di: Luner, Alan, et al.
Pubblicazione: (2024)

On Averaging and Extrapolation for Gradient Descent
di: Luner, Alan, et al.
Pubblicazione: (2024)

A Representation Optimization Dichotomy, Lie-Algebraic Policy Optimization
di: KC, Sooraj, et al.
Pubblicazione: (2026)

Semidefinite hierarchies for diagonal unitary invariant bipartite quantum states
di: Britz, Jonas, et al.
Pubblicazione: (2025)

Computational complexity of sum-of-squares bounds for copositive programs
di: Palomba, Marilena, et al.
Pubblicazione: (2025)

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

Grassmannian optimization is NP-hard
di: Lai, Zehua, et al.
Pubblicazione: (2024)

Convergence-Guaranteed Algorithms for l1/2-Regularized Quadratic Programs with Assignment Constraints
di: Xie, Lijun, et al.
Pubblicazione: (2025)

Robust Completion for Rank-1 Tensors with Noises
di: Nie, Jiawang, et al.
Pubblicazione: (2025)

Complexity-optimal and parameter-free first-order methods for finding stationary points of composite optimization problems
di: Kong, Weiwei
Pubblicazione: (2022)

General Optimal Step-size for ADMM-type Algorithms: Domain Parametrization and Optimal Rates
di: Ran, Yifan
Pubblicazione: (2023)

Tight Error Bounds for the Sign-Constrained Stiefel Manifold
di: Chen, Xiaojun, et al.
Pubblicazione: (2022)

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

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

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

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

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

Getting to the Root of the Problem: Sums of Squares for Limits of Trees
di: Brosch, Daniel, et al.
Pubblicazione: (2024)

Exactness and Effective Degree Bound of Lasserre's Relaxation for Polynomial Optimization over Finite Variety
di: Hua, Zheng, et al.
Pubblicazione: (2021)

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

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

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

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