Relaxation methods for monotropic programs

Relaxation methods for monotropic programs

0.00 Avg rating0 Votes
Article ID: iaor1991708
Country: Netherlands
Volume: 46
Issue: 2
Start Page Number: 127
End Page Number: 151
Publication Date: Feb 1990
Journal: Mathematical Programming (Series A)
Authors: ,
Keywords: programming: convex
Abstract:

The authors propose a dual descent method for the problem of minimizing a convex, possibly nondifferentiable, separable cost subject to linear constraints. The method has properties reminiscent of the Gauss-Seidel method in numerical analysis and uses the •-complementary slackness mechanism introduced in Bertsekas, Hosein and Tseng to ensure finite convergence to near optimality. As special cases the authors obtain the methods in Bertsekas, Hosein and Tseng for network flow programs and the methods in Tseng and Bertsekas for linear programs.

Reviews

Required fields are marked *. Your email address will not be published.