Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints

DOI10.1287/moor.16.3.462zbMath0755.90067OpenAlexW1989970904MaRDI QIDQ3986751

Dimitri P. Bertsekas, Paul Tseng

Publication date: 27 June 1992

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

Full work available at URL: https://doi.org/10.1287/moor.16.3.462

zbMATH Keywords

strict convexitylinear constraintsrelaxation methodsdual coordinate ascent methodnondifferentiable nonseparable objective

Mathematics Subject Classification ID

Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Dual coordinate ascent methods for non-strictly convex minimization, Influence of forecasting electricity prices in the optimization of complex hydrothermal systems, Testing unconditional and conditional independence via mutual information, Cyclic coordinate descent in hydrothermal nonsmooth problems, Cyclic coordinate descent in a class of bang-singular-bang problems, On the linear convergence of the alternating direction method of multipliers, An application of the algorithm of the cyclic coordinate descent in multidimensional optimization problems with constrained speed, 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, Estimation and inference for the counterfactual distribution and quantile functions in continuous treatment models