Relaxation methods for monotropic programs

We 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 (1987) to ensure finite convergence to near optimality. As special cases we obtain the methods in Bertsekas, Hosein and Tseng (1987) for network flow programs and the methods in Tseng and Bertsekas (1987) for linear programs.

[1]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[2]  D. Bertsekas,et al.  A DESCENT NUMERICAL METHOD FOR OPTIMIZATION PROBLEMS WITH NONDIFFERENTIABLE COST FUNCTIONALS , 1973 .

[3]  E. Polak.  Introduction to linear and nonlinear programming , 1973 .

[4]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[5]  Nesa L'abbe Wu,et al.  Linear programming and extensions , 1981 .

[6]  R. Rockafellar.  MONOTROPIC PROGRAMMING: DESCENT ALGORITHMS AND DUALITY , 1981 .

[7]  Claude Lemaréchal,et al.  Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions , 1982, Math. Program..

[8]  J. Strodiot,et al.  A linearly constrained algorithm not requiring derivative continuity , 1984 .

[9]  Éva Tardos,et al.  A strongly polynomial minimum cost circulation algorithm , 1985, Comb..

[10]  Paul Tseng,et al.  Relaxation methods for monotropic programming problems , 1986 .

[11]  Paul Tseng,et al.  Relaxation Methods for Linear Programs , 1987, Math. Oper. Res..

[12]  Decision Systems.,et al.  Relaxation Method for Linear Programs with Side Constraints , 1987 .

[13]  D. Bertsekas,et al.  Relaxation methods for network flow problems with convex arc costs , 1987 .

[14]  Paul Tseng,et al.  Relaxation methods for problems with strictly convex separable costs and linear constraints , 1987, Math. Program..

[15]  Eliane R. Panier,et al.  An active set method for solving linearly constrained nonsmooth optimization problems , 1987, Math. Program..

[16]  Robert Mifflin.  An implementation of an algorithm for univariate minimization and an application to nested optimization , 1988, Math. Program..

[17]  Paul Tseng,et al.  Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems , 1988, Oper. Res..

[18]  Paul Tseng,et al.  Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints , 1991, Math. Oper. Res..

[19]  R. Rockafellar.  The Elementary Vectors of a Subspace of RiY , 2022 .