Suchergebnisse - Alternating randomized proximal gradient algorithm

Zeroth-order single-loop algorithms for nonconvex-linear minimax problems von Shen, Jingjing, Wang, Ziqi, Xu, Zi

“… . Furthermore, we propose a zeroth-order alternating randomized proximal gradient algorithm for block-wise nonsmooth nonconvex-linear minimax problems and its corresponding iteration complexity is O K 3 2 ε …”
Volltext

Variational Analysis Perspective on Linear Convergence of Some First Order Methods for Nonsmooth Convex Optimization Problems von Ye, Jane J., Yuan, Xiaoming, Zeng, Shangzhi, Zhang, Jin

“… ), the proximal alternating linearized minimization (PALM) algorithm and the randomized block coordinate proximal gradient method (R-BCPGM …”
Volltext

Smoothing randomized block-coordinate proximal gradient algorithms for nonsmooth nonconvex composite optimization von Li, Xue, Bian, Wei

“… ) algorithm and a Bregman randomized block-coordinate proximal gradient (B-RBCPG) algorithm for minimizing the sum of two nonconvex nonsmooth functions, one of which is block separable …”
Volltext

A Distributed Proximal Alternating Direction Multiplier Method for Multiblock Nonsmooth Composite Optimization von Zhou, Yuan, Guo, Luyao, Shi, Xinli, Cao, Jinde

“… To tackle this problem, we propose a novel distributed proximal alternating direction multiplier method (ADMM …”
Volltext

Derivative-free Alternating Projection Algorithms for General Nonconvex-Concave Minimax Problems von Xu, Zi, Wang, Ziqi, Shen, Jingjing, Dai, Yuhong

“… Moreover, we propose a zeroth-order block alternating randomized proximal gradient algorithm (ZO-BAPG …”
Volltext

Inertial accelerated stochastic mirror descent for large-scale generalized tensor CP decomposition von Liu, Zehui, Wang, Qingsong, Cui, Chunfeng, Xia, Yong

“… This paper explores generalized tensor CP decomposition, employing the Bregman distance as the proximal term and introducing an inertial accelerated block randomized stochastic mirror descent algorithm (iTableSMD …”
Volltext

Random block-coordinate methods for inconsistent convex optimisation problems von Staudigl, Mathias, Jacquot, Paulin

“… Lying midway between the celebrated Chambolle–Pock primal-dual algorithm and Tseng’s accelerated proximal gradient method, we establish global convergence of the last iterate as well as optimal O ( 1 / k ) and O ( 1 / k 2 …”
Volltext

Low-order Optimization Algorithms: Iteration Complexity and Applications von Gao, Xiang

“… Efficiency and scalability have become the new norms to evaluate optimization algorithms in the modern era of big data analytics …”
Volltext

Adaptive Catalyst for Smooth Convex Optimization von Ivanova, Anastasiya, Pasechnyuk, Dmitry, Grishchenko, Dmitry, Shulgin, Egor, Gasnikov, Alexander, Matyukhin, Vladislav

“… In this paper, we present a generic framework that allows accelerating almost arbitrary non-accelerated deterministic and randomized algorithms for smooth convex optimization problems …”
Volltext

Efficiency of Coordinate Descent Methods For Structured Nonconvex Optimization von Deng, Qi, Lan, Chenghao

“… First, by extending randomized CD to nonsmooth nonconvex settings, we develop a coordinate subgradient method that randomly updates block-coordinate variables by using block composite subgradient mapping …”
Volltext