Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints

DOI10.1287/moor.22.2.326zbMath0883.90100OpenAlexW2123825652MaRDI QIDQ4346226

Krzysztof C. Kiwiel

Publication date: 23 March 1998

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/bc7be0f6d043ca5aeef25ba97569c7fddf6504a8

zbMATH Keywords

global convergenceentropy maximizationlarge-scale applicationsdual coordinate ascent methods

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items

Revisiting linearized Bregman iterations under Lipschitz-like convexity condition ⋮ Extragradient and extrapolation methods with generalized Bregman distances for saddle point problems ⋮ Generalized Bregman projections in convex feasibility problems ⋮ Subgradient method with entropic projections for convex nondifferentiable minimization ⋮ On the Convergence of Gradient-Like Flows with Noisy Gradient Input ⋮ Learning in games with continuous action sets and unknown payoff functions ⋮ Dykstras algorithm with bregman projections: A convergence proof ⋮ Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming ⋮ Learning in Games via Reinforcement and Regularization ⋮ On the Convergence of Mirror Descent beyond Stochastic Convex Programming