Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach

DOI10.1137/0328011zbMath0692.49025OpenAlexW1977229458MaRDI QIDQ3034446

Paul Tseng

Publication date: 1990

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0328011

zbMATH Keywords

parallel computationstrictly convexnetwork flowquadratic programentropy maximizationblock coordinate ascent methoddual coordinate ascent methodsdual gradient methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of reduced gradient type (90C52)

Related Items

Data parallel computing for network-structured optimization problems, Dual coordinate ascent methods for non-strictly convex minimization, On the Complexity Analysis of the Primal Solutions for the Accelerated Randomized Dual Coordinate Ascent, Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies, A parallel descent algorithm for convex programming, Adaptive block coordinate DIRECT algorithm, Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm, Numerical Structure of the Hessian of the Lagrange Dual Function for a Class of Convex Problems, Matrix scaling, entropy minimization, and conjugate duality. II: The dual problem, Greedy and randomized versions of the multiplicative Schwarz method, Decomposition algorithm for convex differentiable minimization, A survey on the continuous nonlinear resource allocation problem, An Alternating Direction Method of Multipliers for Optimal Control Problems Constrained with Elliptic Equations, On the linear convergence of the alternating direction method of multipliers, Application of the alternating direction method of multipliers to separable convex programming problems, Schwarz iterative methods: infinite space splittings, Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité, On Adaptive Sketch-and-Project for Solving Linear Systems, Multimarginal Optimal Transport with a Tree-Structured Cost and the Schrödinger Bridge Problem, Error bounds and convergence analysis of feasible descent methods: A general approach, Descent methods for convex essentially smooth minimization, On the convergence of the coordinate descent method for convex differentiable minimization, A unified description of iterative algorithms for traffic equilibria