Free-steering relaxation methods for problems with strictly convex costs and linear constraints

Mathematics of Operations Research

Volumn 22, Issue 2, 1997, Pages 326-349

  Kiwiel, Krzysztof C ^a  

^a SYSTEMS RESEARCH INSTITUTE   (Poland)

Author keywords

B functions; Convex programming; Dual coordinate ascent; Entropy maximization; Nondifferentiable optimization; Relaxation methods

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; FUNCTIONS; PROBLEM SOLVING;

CONVEX PROGRAMMING PROBLEM; FREE STEERING RELAXATION METHODS; LINEAR CONSTRAINTS;

MATHEMATICAL PROGRAMMING;

EID: 0031146730     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.22.2.326     Document Type: Article

References (56)

1. Bauschke, H. H., J. M. Borwein (1996). Legendre functions and the method of random Bregman projection. J. Convex Anal. (to appear).
2. Brown, J. B., P. J. Chase, A. O. Pittenger (1993). Order independence and factor convergence in iterative scaling. Linear Algebra Appl. 190 1-38.
3. Bertsekas, D. P., J. N. Tsitsiklis (1989). Parallel and Distributed Computation: Numerical Methods, Prentice-Hail, Englewood Cliffs, NJ.
4. _, P. A. Hosein, P. Tseng (1987). Relaxation methods for network flow problems with convex arc costs. SIAM J. Control Optim. 25 1219-1243.
5. Bregman, L. M. (1967). The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. Zh. Vychisl. Mat. i Mat. Fiz. 7 620-631 (Russian). English transl, in U.S.S.R. Comput. Math. and Math. Phys. 7 200-217.
6. Bregman, L. M. (1967). The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. Zh. Vychisl. Mat. i Mat. Fiz. 7 620-631 (Russian). English transl, in U.S.S.R. Comput. Math. and Math. Phys. 7 200-217.
7. Censor, Y. (1981). Row-action methods for huge and sparse systems and their applications. SIAM Rev. 23 444-466.
8. _ (1988). Parallel application of biock-iterative methods in medical imaging and radiation therapy. Math. Programming 42 307-325.
9. _, A. R. De Pierro, T. Elfving, G. T. Herman, A. N. Iusem (1990). On iterative methods for linearly constrained entropy maximization. A. Wakulicz, ed., Numerical Analysis and Mathematical Modelling, Banach Center Publications, vol. 24, PWN - Polish Scientific Publishers, Warsaw, 145-163.
10. _, _, A. N. Iusem (1991). Optimization of Burg's entropy over linear constraints. Appl. Numer. Math. 7 151-165.
11. _, G. T. Herman (1987). On some optimization techniques in image reconstruct from projections. Appl. Numer. Math. 3 365-391.
12. _, A. Lent (1981). An iterative row action method for interval convex programming. J. Optim. Theory Appl. 34 321-353.
13. _, _ (1987). Optimization of "log x" entropy over linear equality constraints. SIAM J. Control Optim. 25 921-933.
14. _, S. A. Zenios (1991). Interval-constrained matrix balancing. Linear Algebra Appl. 150 393-421.
15. _, _ (1992). Proximal minimization algorithm with D-functions. J. Optim. Theory Appl. 73 451-464.
16. Chen, G., M. Teboulle (1993). Convergence analysis of a proximal-like minimization algorithm using Bregman functions. SIAM J. Optim. 3 538-543.
17. Darroch, J. N., D. Ratclif (1972). Generalized iterative scaling for log-linear models. Ann. Math. Statist. 43 1470-1480.
18. De Pierro, A. R., A. N. Iusem (1986). A relaxed version of Bregman's method for convex programming. J. Optim. Theory Appl. 51 421-440.
19. Eckstein, J. (1993). Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming. Math. Oper. Res. 18 202-226.
20. Elfving, T. (1980). On some methods for entropy maximization and matrix scaling. Linear Algebra Appl. 34 321-339.
21. _ (1989). An algorithm for maximum entropy image reconstruction from noisy data. Math. Comput. Modelling 12 729-745.
22. Erlander, S. (1981). Entropy in linear programs. Math. Programming 21 137-151.
23. Falk, J. E. (1967). Lagrange multipliers and nonlinear programming. J. Math. Anal. Appl. 19 141-159.
24. Fläm, S. D., J. Zowe (1990). Relaxed outer projections, weighted averages and convex feasibility. BIT 30 289-300.
25. Golshtein, E. G., N. V. Tretyakov (1989). Modified Lagrange Functions; Theory and Optimization Methods, Nauka, Moscow (Russian).
26. Herman, G. T., A. Lent (1978). A family of iterative quadratic optimization algorithms for pairs of inequalities with application in diagnostic radiology. Math. Programming Stud. 9 15-29.
27. Hildreth, C. (1957). A quadratic programming procedure. Naval Res. Logist. Quart. 4 79-85. Erratum, ibid., p. 361.
28. Iusem, A. N. (1991). On dual convergence and the rate of primal convergence of Bregman's convex programming method. SIAM J. Optim. 1 401-423.
29. Kiwiel, K. C. (1994). Free-steering relaxation methods for problems with strictly convex costs and linear constraints, WP-94-89, International Institute for Applied Systems Analysis, Laxenburg, Austria, September 1994. Revised July 1995 and March 1996.
30. _ (1995). Block-iterative surrogate projection methods for convex feasibility problems. Linear Algebra Appl. 215 225-260.
31. _ (to appear). Proximal minimization methods with generalized Bregman functions, WP-95-24, International Institute for Applied Systems Analysis, Laxenburg, Austria, March 1995. Siam J. Optim.
32. Kruithof, J. (1937). Calculation of telephone traffic. De Ingenieur (E. Elektrotechnik 3) 52 E15-E25.
33. Lamond, B., F. Stewart (1981). Bregman's balancing method. Transportation Res. B 15 239-249.
34. Lent, A., Y. Censor (1980). Extensions of Hildreth's row-action method for quadratic programming. SIAM J. Control Optim. 18 444-454.
35. Lemaréchal, C., R. Mifflin (1982). Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions. Math. Programming 24 241-256.
36. Lin, Y. Y., J.-S. Pang (1987). Iterative methods for large convex quadratic programs: A survey. SIAM J. Control Optim. 25 383-411.
37. Luo, Z.-Q., P. Tseng (1992a). Error bound and convergence analysis of matrix splitting algorithms for the affine variational inequality problem. SIAM J. Optim. 2 43-54.
38. _, _ (1992b). On the convergence of the coordinate descent method for convex differentiable minimization. J. Optim. Theory Appl. 72 7-35.
39. _, _ (1992c). On the linear convergence of descent methods for convex essentially smooth minimization. SIAM J. Control Optim. 30 408-425.
40. _, _ (1993a). Error bound and reduced-gradient projection algorithms for convex minimization over a polyhedral set. SIAM J. Optim. 3 43-59.
41. _, _ (1993b). On the convergence rate of dual ascent methods for linearly constrained convex minimization. Math. Oper. Res. 18 846-867.
42. Mangasarian, O. L. (1984). Sparsity-preserving SOR algorithms for separable quadratic and linear programming problems. Comput. Oper. Res. 11 105-112.
43. Mifflin, R. (1987). An implementation of an algorithm for univariate minimization and an application to nested optimization. Math. Programming Stud. 31 155-166.
44. Nielsen, S. S., S. A. Zenios (1992). Massively parallel algorithms for singly constrained convex programs. ORSA J. Comput. 4 166-181.
45. _, _ (1993a). A massively parallel algorithm for nonlinear stochastic network problems. Oper. Res. 41 319-337.
46. _, _ (1993b). Proximal minimizations with D-functions and the massively parallel solution of linear network program. Comput. Optim. Appl. 1 375-398.
47. Rockafellar, R. T. (1970), Convex Analysis, Princeton University Press, Princeton, NJ.
48. _ (1984). Network Flows and Monotropic Optimization, Wiley, New York.
49. Teboulle, M. (1992). Entropic proximal mappings with applications to nonlinear programming. Math. Oper. Res. 17 670-690.
50. Tseng, P. (1990). Dual ascent methods for problems with strictly convex costs and linear constraints: A unified approach. SIAM J. Control Optim. 28 214-242.
51. _ (1991). Descent methods for convex essentially smooth minimization. J. Optim. Theory Appl. 71 425-463.
52. _, D. P. Bertsekas (1987). Relaxation methods for problems with strictly convex separable costs and linear constraints. Math. Programming 38 303-321.
53. _, _ (1991). Relaxation methods for problems with strictly convex costs and linear constraints. Math. Oper. Res. 16 462-481.
54. Zenios, S. A. (1991). On the fine-grain decomposition of multicommodity transportation problems. SIAM J. Optim. 1 643-669.
55. _, Y. Censor (1991a). Massively parallel row-action algorithms for some nonlinear transportation problems. SIAM J. Optim. 1 373-400.
56. _, _ (1991b). Parallel computing with block-iterative image reconstruction algorithms. Appl. Numer. Math. 7 399-415.