Relaxation methods for monotropic programs

DOI10.1007/BF01585734zbMath0694.90077MaRDI QIDQ909583

Dimitri P. Bertsekas, Paul Tseng

Publication date: 1990

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

linear constraintsconvex, possibly nondifferentiable, separable costdual descent methodelementary vectormonotropic programTucker tableau

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Linear programming (90C05) Deterministic network models in operations research (90B10)

Related Items

A survey on the continuous nonlinear resource allocation problem, An ε-Relaxation method for generalized separable convex cost network flow problems, On the convergence of the affine-scaling algorithm, Implementation and test of auction methods for solving generalized network flow problems with separable convex cost, Descent methods for convex essentially smooth minimization

Uses Software

• RELAX4

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A strongly polynomial minimum cost circulation algorithm
• Relaxation methods for problems with strictly convex separable costs and linear constraints
• An implementation of an algorithm for univariate minimization and an application to nested optimization
• Relaxation Methods for Network Flow Problems with Convex Arc Costs
• An active set method for solving linearly constrained nonsmooth optimization problems
• Relaxation Methods for Linear Programs
• Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
• Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions
• Convex Analysis