Cover Image

An ideal-sparse generalized moment problem reformulation for completely positive tensor decomposition exploiting maximal cliques of multi-hypergraphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Huang, Pengfei, Bai, Minru
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

An accelerated semi-proximal ADMM with applications to multi-block sparse optimization problems
by: Liu, Peng, et al.
Published: (2025)

Moment-SOS relaxations for moment and tensor recovery problems
by: Huang, Lei, et al.
Published: (2024)

The large-scale charging scheduling problem for fleet batteries: Lagrangian decomposition with time-block reformulations
by: Fotedar, Sunney, et al.
Published: (2025)

Efficient Low Rank Matrix Recovery With Flexible Group Sparse Regularization
by: Yu, Quan, et al.
Published: (2024)

Rank-sparsity decomposition for planted quasi clique recovery
by: Abdulsalaam, Sakirudeen A., et al.
Published: (2022)

New reformulations for 0-1 quadratic programming problem using quadratic nonconvex reformulation techniques and valid inequalities
by: Lu, Cheng, et al.
Published: (2026)

Optimality conditions for bilevel programs via Moreau envelope reformulation
by: Bai, Kuang, et al.
Published: (2023)

Fast algorithm for sparse least trimmed squares via trimmed-regularized reformulation
by: Yagishita, Shotaro
Published: (2024)

On contention resolution for the hypergraph matching, knapsack, and $k$-column sparse packing problems
by: Sergeev, Ivan
Published: (2024)

Tractable reformulations of DRO problems over structured optimal transport ambiguity sets
by: Chaouach, Lotfi M., et al.
Published: (2025)

An equivalent reformulation and multi-proximity gradient algorithms for a class of nonsmooth fractional programming
by: Zhou, Junpeng, et al.
Published: (2023)

A Hybrid Registration and Fusion Method for Hyperspectral Super-resolution
by: Yang, Kunjing, et al.
Published: (2024)

First-order algorithms for robust optimization problems via convex-concave saddle-point Lagrangian reformulation
by: Postek, Krzysztof, et al.
Published: (2021)

Convex NMPC reformulations for a special class of nonlinear multi-input systems with application to rank-one bilinear networks
by: Klädtke, Manuel, et al.
Published: (2023)

Concave tents: a new tool for constructing concave reformulations of a large class of nonconvex optimization problems
by: Gabl, Markus
Published: (2024)

MIQCQP reformulation of the ReLU neural networks Lipschitz constant estimation problem
by: Sbihi, Mohammed, et al.
Published: (2024)

Tensor factorization based method for low rank matrix completion and its application on tensor completion
by: Yu, Quan, et al.
Published: (2022)

A reformulation-enumeration MINLP algorithm for gas network design
by: Li, Yijiang, et al.
Published: (2023)

Hyperspectral super-resolution via low rank tensor triple decomposition
by: Cui, Xiaofei, et al.
Published: (2023)

Edge downgrades in the maximal covering location problem
by: Baldomero-Naranjo, Marta, et al.
Published: (2025)

Upgrading edges in the maximal covering location problem
by: Baldomero-Naranjo, Marta, et al.
Published: (2024)

Presolving and cutting planes for the generalized maximal covering location problem
by: Lv, Wei, et al.
Published: (2024)

Sparse symmetric generalized inverses for sparse symmetric matrices
by: Machado, Ananias, et al.
Published: (2026)

On computing sparse universal solvers for key problems in statistics
by: Machado, Ananias Sousa, et al.
Published: (2025)

On maximal positive invariant set computation for rank-deficient linear systems
by: Gheorghe, Bogdan, et al.
Published: (2026)

Theoretical and numerical comparison of seven single-level reformulations for bilevel programs
by: Li, Yu-Wei, et al.
Published: (2025)

Subspace power method for symmetric tensor decomposition
by: Kileel, Joe, et al.
Published: (2019)

Solving moment and polynomial optimization problems on Sobolev spaces
by: Henrion, Didier, et al.
Published: (2024)

A sparse approximation of the Lieb functional with moment constraints
by: Ehrlacher, Virginie, et al.
Published: (2023)

Minmax regret maximal covering location problems with edge demands
by: Baldomero-Naranjo, Marta, et al.
Published: (2024)

Bilevel linear optimization belongs to NP and admits polynomial-size KKT-based reformulations
by: Buchheim, Christoph
Published: (2023)

Generalized cyclic symmetric decompositions for the matrix multiplication tensor
by: Vermeylen, Charlotte, et al.
Published: (2024)

Adaptive sieving: A dimension reduction technique for sparse optimization problems
by: Yuan, Yancheng, et al.
Published: (2023)

Solving unbounded optimal control problems with the moment-SOS hierarchy *
by: Sehnalová, Karolına, et al.
Published: (2025)

A decomposition method in the multivariate feedback particle filter via tensor product Hermite polynomials
by: Wang, Ruoyu, et al.
Published: (2025)

A reformulation to Embedding a Neural Network in a linear program without integer variables
by: -de-Alba, Héctor G., et al.
Published: (2024)

A novel strong duality-based reformulation for trilevel infrastructure models in energy systems development
by: Herrala, Olli, et al.
Published: (2023)

Multi-product maximal covering second-level facility location problem
by: Baldomero-Naranjo, Marta, et al.
Published: (2024)

Sectoral and spatial decomposition methods for multi-sector capacity expansion models
by: Parolin, Federico, et al.
Published: (2025)

A Riemannian rank-adaptive method for higher-order tensor completion in the tensor-train format
by: Vermeylen, Charlotte, et al.
Published: (2024)