Copertina

An accelerated semi-proximal ADMM with applications to multi-block sparse optimization problems

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Liu, Peng, Chen, Liang, Bai, Minru
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

An ideal-sparse generalized moment problem reformulation for completely positive tensor decomposition exploiting maximal cliques of multi-hypergraphs
di: Huang, Pengfei, et al.
Pubblicazione: (2025)

An accelerated proximal bundle method for convex optimization
di: Liao, Feng-Yi, et al.
Pubblicazione: (2025)

Integral control of the proximal gradient method for unbiased sparse optimization
di: Cerone, V., et al.
Pubblicazione: (2025)

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

Unifying restart accelerated gradient and proximal bundle methods
di: Liang, Jiaming
Pubblicazione: (2025)

An inexact Bregman proximal point method and its acceleration version for unbalanced optimal transport
di: Chen, Xiang, et al.
Pubblicazione: (2024)

A sparse ADMM-based solver for linear MPC subject to terminal quadratic constraint
di: Krupa, Pablo, et al.
Pubblicazione: (2021)

An accelerated proximal PRS-SQP algorithm with dual ascent-descent procedures for smooth composite optimization
di: Jin, Jiachen, et al.
Pubblicazione: (2025)

A multilevel proximal trust-region method for nonsmooth optimization with applications
di: Baraldi, Robert, et al.
Pubblicazione: (2025)

Convergence for nonconvex ADMM, with applications to CT imaging
di: Barber, Rina Foygel, et al.
Pubblicazione: (2020)

Non-homogeneous stochastic linear-quadratic optimal control problems with multi-dimensional state and regime switching
di: Chen, Yuyang, et al.
Pubblicazione: (2024)

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

Adaptive sieving with semismooth Newton proximal augmented Lagrangian algorithm for multi-task Lasso problems
di: Lin, Lanyu, et al.
Pubblicazione: (2025)

Primal-dual proximal bundle and conditional gradient methods for convex problems
di: Liang, Jiaming
Pubblicazione: (2024)

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

Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem
di: Liu, Juan, et al.
Pubblicazione: (2024)

Stochastic ADMM with batch size adaptation for nonconvex nonsmooth optimization
di: Jin, Jiachen, et al.
Pubblicazione: (2025)

Learning to accelerate distributed ADMM using graph neural networks
di: Doerks, Henri, et al.
Pubblicazione: (2025)

Decentralized non-convex optimization via bi-level SQP and ADMM
di: Stomberg, Gösta, et al.
Pubblicazione: (2022)

A polynomial-time solvable class of sparse box-constrained polynomial optimization problems
di: Khajavirad, Aida
Pubblicazione: (2026)

An efficient sieving based secant method for sparse optimization problems with least-squares constraints
di: Li, Qian, et al.
Pubblicazione: (2023)

A variable smoothing for Nonconvexly constrained nonsmooth optimization with application to sparse spectral clustering
di: Kume, Keita, et al.
Pubblicazione: (2023)

Parameter-free proximal bundle methods with adaptive stepsizes for hybrid convex composite optimization problems
di: Monteiro, Renato D. C., et al.
Pubblicazione: (2024)

Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems
di: Nabou, Yassine, et al.
Pubblicazione: (2025)

An inertial ADMM for a class of nonconvex composite optimization with nonlinear coupling constraints
di: Hien, Le Thi Khanh, et al.
Pubblicazione: (2022)

Universal subgradient and proximal bundle methods for convex and strongly convex hybrid composite optimization
di: Guigues, Vincent, et al.
Pubblicazione: (2024)

A Unified Inexact Stochastic ADMM for Composite Nonconvex and Nonsmooth Optimization
di: Zeng, Yuxuan, et al.
Pubblicazione: (2024)

An over-relaxed ADMM for separable convex programming and its applications to statistical learning
di: Ni, Renyuan
Pubblicazione: (2024)

An inexact variable metric proximal linearization method for composite optimization on manifolds
di: He, Hao, et al.
Pubblicazione: (2025)

Curvature accelerated decentralized non-convex optimization for high-dimensional machine learning problems
di: Yi, Dingran, et al.
Pubblicazione: (2025)

Distributed accelerated proximal conjugate gradient methods for multi-agent constrained optimization problems
di: Gebrie, Anteneh Getachew
Pubblicazione: (2023)

A block-coordinate descent framework for non-convex composite optimization. Application to sparse precision matrix estimation
di: Lauga, Guillaume
Pubblicazione: (2026)

Convergence rates for an inexact linearized ADMM for nonsmooth nonconvex optimization with nonlinear equality constraints
di: Bourkhissi, Lahcen El, et al.
Pubblicazione: (2025)

A relative-error inexact ADMM splitting algorithm for convex optimization with inertial effects
di: Alves, M. Marques, et al.
Pubblicazione: (2024)

An application of the mean motion problem to time-optimal control
di: Dalin, Omri, et al.
Pubblicazione: (2025)

An inexact $q$-order regularized proximal Newton method for nonconvex composite optimization
di: Liu, Ruyu, et al.
Pubblicazione: (2023)

Term-sparse polynomial optimization for the design of frame structures
di: Handa, Marouan, et al.
Pubblicazione: (2025)

Augmented Lagrangian methods for infeasible convex optimization problems and diverging proximal-point algorithms
di: Andrews, Roland, et al.
Pubblicazione: (2025)

Projected proximal gradient trust-region algorithm for nonsmooth optimization
di: Dao, Minh N., et al.
Pubblicazione: (2025)

An adaptive ADMM with regularized spectral penalty for sparse portfolio selection
di: Xu, Xin
Pubblicazione: (2025)