Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach

This publication has 46 references indexed in Scilit:

• Parallel application of block-iterative methods in medical imaging and radiation therapy
  Mathematical Programming, 1988
• Relaxation Methods for Network Flow Problems with Convex Arc Costs
  SIAM Journal on Control and Optimization, 1987
• A lagrangean relaxation algorithm for the constrained matrix problem
  Naval Research Logistics Quarterly, 1986
• An iterative row-action method for interval convex programming
  Journal of Optimization Theory and Applications, 1981
• Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
  Management Science, 1981
• Minimum norm problems over transportation polytopes
  Linear Algebra and its Applications, 1980
• On the RAS-algorithm
  Computing, 1979
• Dualität und Approximation bei konvexen Optimierungsproblemen
  ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1978
• The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming
  USSR Computational Mathematics and Mathematical Physics, 1967
• Proof of the convergence of Sheleikhovskii's method for a problem with transportation constraints
  USSR Computational Mathematics and Mathematical Physics, 1967