Stochastic proximal ADMM for stochastic tensor Tucker optimization with deterministic constraints

Leveraging Tucker low-rank decomposition for dimensionality reduction and over-fitting mitigation, this study investigates stochastic tensor Tucker optimization problems subject to deterministic constraints, with an emphasis on designing a Stochastic Proximal Alternating Direction Method of Multipliers (SPADMM). Instead of treating the underlying polynomial structures as general smooth nonlinear functions, we introduce block conservative functions based on the tensor Tucker decomposition, and further analyse the convergence rate and high probability performance for the proposed stochastic algorithm. Both numerical tests and background/foreground separation experiments demonstrate that our approach is promising in time efficiency and solution accuracy.

Authors

Institutions

Publication Details

Journal
Optimization
Published
2026-09-01
DOI
https://doi.org/10.1080/02331934.2026.2726393
Primary Topic
Tensor decomposition and applications
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Stochastic proximal ADMM for stochastic tensor Tucker optimization with deterministic constraints

Ziyan Luo, Xiongwei Guo
Optimization
Tensor decomposition and applications
article

Stochastic proximal ADMM for stochastic tensor Tucker optimization with deterministic constraints

Ziyan Luo, Xiongwei Guo
article en

Abstract

Leveraging Tucker low-rank decomposition for dimensionality reduction and over-fitting mitigation, this study investigates stochastic tensor Tucker optimization problems subject to deterministic constraints, with an emphasis on designing a Stochastic Proximal Alternating Direction Method of Multipliers (SPADMM). Instead of treating the underlying polynomial structures as general smooth nonlinear functions, we introduce block conservative functions based on the tensor Tucker decomposition, and further analyse the convergence rate and high probability performance for the proposed stochastic algorithm. Both numerical tests and background/foreground separation experiments demonstrate that our approach is promising in time efficiency and solution accuracy.

Optimization
Beijing Jiaotong University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 11%
Tensor decomposition and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.