Regret analysis of an online majorized semi-proximal ADMM for online composite optimization
type: Item
instance of: scholarly article
title: Regret analysis of an online majorized semi-proximal ADMM for online composite optimization
author: Zehao Xiao
author: Liwei Zhang
published in: Journal of Global Optimization
publication date: 2024-07-08T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 62J12
zbMATH DE Number: 7878115
zbMATH Keywords: online majorized semi-proximal alternating direction method of multiplier
zbMATH Keywords: objective regret
zbMATH Keywords: constraint violation regret
zbMATH Keywords: online composite optimization
zbMATH Keywords: linear constraints
MaRDI profile type: Publication
cites work: Prediction, Learning, and Games
cites work: An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
cites work: An Online Convex Optimization Approach to Proactive Network Resource Allocation
cites work: Q3996569
cites work: The robustness of the \(p\)-norm algorithms
cites work: Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
cites work: Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
cites work: Q2933999
cites work: Efficient algorithms for online decision problems
cites work: Exponentiated gradient versus gradient descent for linear predictors
cites work: Fast Algorithms for Large-Scale Generalized Distance Weighted Discrimination
cites work: A majorized ADMM with indefinite proximal terms for linearly constrained convex composite optimization
cites work: Q5405197
cites work: Convex Analysis
cites work: Online Learning and Online Convex Optimization
cites work: Q4864293
cites work: Sparsity and Smoothness Via the Fused Lasso
cites work: Online gradient descent learning algorithms
cites work: A Low Complexity Algorithm with $O(\sqrt{T})$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term Constraints
DOI: 10.1007/S10898-024-01365-5
description: scientific article; zbMATH DE number 7878115