Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints

DOI10.1287/MOOR.16.3.462zbMATH Open0755.90067OpenAlexW1989970904MaRDI QIDQ3986751FDOQ3986751

Paul Tseng, Dimitri P. Bertsekas

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

linear constraintsrelaxation methodsstrict convexitydual 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)

Cited In (18)

• Causal effect estimation for multivariate continuous treatments
• A unified description of iterative algorithms for traffic equilibria
• Estimation and inference for the counterfactual distribution and quantile functions in continuous treatment models
• Influence of forecasting electricity prices in the optimization of complex hydrothermal systems
• Descent methods for convex essentially smooth minimization
• Title not available (Why is that?)
• On the convergence of the coordinate descent method for convex differentiable minimization
• A class of problems for which cyclic relaxation converges linearly
• The relaxation method for certain type of pseudoconvex programming problems
• A continuous relaxation of the constrained \(\ell_2-\ell_0\) problem
• On the linear convergence of the alternating direction method of multipliers
• Testing unconditional and conditional independence via mutual information
• Relaxation methods for monotropic programs
• Cyclic coordinate descent in a class of bang-singular-bang problems
• An application of the algorithm of the cyclic coordinate descent in multidimensional optimization problems with constrained speed
• Cyclic coordinate descent in hydrothermal nonsmooth problems
• Dual coordinate ascent methods for non-strictly convex minimization
• Title not available (Why is that?)

This page was built for publication: Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3986751)