Relaxation methods for strictly convex regularizations of piecewise linear programs

Applied Mathematics and Optimization

Volumn 38, Issue 3, 1998, Pages 239-259

  Kiwiel, K 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; COMPUTER SOFTWARE; ENTROPY; NONLINEAR PROGRAMMING; OPTIMIZATION; RELAXATION PROCESSES;

CONVEX PROGRAMMING;

CONSTRAINT THEORY;

EID: 11744321022     PISSN: 00954616     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002459900090     Document Type: Article

References (41)

1. Bertsekas DP (1982) Projected Newton methods for optimization problems with simple constraints. SIAM J Control Optim 20:221-246
2. Bertsekas DP, Gafni EM (1983) Projected Newton methods and optimization of multicommodity flows. IEEE Trans Automat Control 28:1090-1096
3. Bertsekas DP, Tsitsiklis JN (1989) Parallel and Distributed Computation: Numerical Methods. Prentice-Hall, Englewood Cliffs, NJ
4. Bregman LM (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 (in Russian). English transl, in USSR Comput Math and Math Phys 7:200-217
5. Bregman LM (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 (in Russian). English transl, in USSR Comput Math and Math Phys 7:200-217
6. Censor Y (1981) Row-action methods for huge and sparse systems and their applications. SIAM Rev 23:444-466
7. Censor Y (1988) Parallel application of block-iterative methods in medical imaging and radiation therapy. Math Programming 42:307-325
8. Censor Y, De Pierre AR, Elfving T, Herman GT, Iusem AN (1990) On iterative methods for linearly constrained entropy maximization. In Wakulicz A, ed (1990) Numerical Analysis and Mathematical Modelling, Banach Center Publications, vol 24. PWN - Polish Scientific Publishers, Warsaw, pp 145-163
9. Censor Y, De Pierro AR, Iusem AN (1991) Optimization of Burg's entropy over linear constraints. Appl Numer Math 7:151-165
10. Censor Y, Lent A (1981) An iterative row-action method for interval convex programming. J Optim Theory Appl 34:321-353
11. Censor Y, Zenios SA (1991) Interval-constrained matrix balancing. Linear Algebra Appl 150:393-421
12. Darroch JN, Ratclif D (1972) Generalized iterative scaling for log-linear models. Ann Math Statist 43:1470-1480
13. 1 problems. Linear Algebra Appl 154-156:793-818
14. De Pierro AR, Iusem AN (1986) A relaxed version of Bregman's method for convex programming. J Optim Theory Appl 51:421-440
15. Elfving T (1989) An algorithm for maximum entropy image reconstruction from noisy data. Math Comput Modelling 12:729-745
16. Erlander S (1981) Entropy in linear programs. Math Programming 21:137-151
17. Ferris MC, Mangasarian OL (1991) Finite perturbation of convex programs. Appl Math Optim 23:263-273
18. Fletcher R (1987) Practical Methods of Optimization, 2nd edn. Wiley, Chichester
19. Gafni EM, Bertsekas DP (1984) Two-metric projection methods for constrained optimization. SIAM J Control Optim 22:936-964
20. Hildreth C (1957) A quadratic programming procedure. Naval Res Logist Quart 4:79-85. Erratum, ibid, p 361
21. Hiriart-Urruty JB, Lemaréchal C (1993) Convex Analysis and Minimization Algorithms. Springer-Verlag, Berlin
22. Kiwiel KC (1985) Methods of Descent for Nondifferentiable Optimization. Lecture Notes in Mathematics 1133. Springer-Verlag, Berlin
23. Kiwiel KC (1996) A bundle Bregman proximal method for convex nondifferentiable minimization. Tech report, Systems Research Institute, Warsaw
24. Kiwiel KC (1997) Free-steering relaxation methods for problems with strictly convex costs and linear constraints. Math Oper Res 22:326-349
25. Kruithof J (1937) Calculation of telephone traffic. De Ingenieur (E Elektrotechnik 3) 52:E15-E25
26. Lamond B, Stewart F (1981) Bregman's balancing method. Transportation Res B 15:239-249
27. Lin YY, Pang JS (1987) Iterative methods for large convex quadratic programs: a survey. SIAM J Control Optim 25:383-411
28. Luo Z-Q. Tseng P (1992) On the convergence of the coordinate descent method for convex differentiable minimization. J Optim Theory Appl 72:7-35
29. Luo Z-Q, Tseng P (1992) On the linear convergence of descent methods for convex essentially smooth minimization. SIAM J Control Optim 30:408-425
30. Luo Z-Q, Tseng P (1993) Error bound and reduced-gradient projection algorithms for convex minimization over a polyhedral set. SIAM J Optim 3:43-59
31. Mangasarian OL (1984) Sparsity-preserving SOR algorithms for separable quadratic and linear programming problems. Comput Oper Res 11:105-112
32. Nielsen SS, Zenios SA (1993) A massively parallel algorithm for nonlinear stochastic network problems. Oper Res 41:319-337
33. Polyak BT (1983) Introduction to Optimization. Nauka, Moscow. English transl (1987) Optimization Software Inc. New York
34. Polyak BT (1983) Introduction to Optimization. Nauka, Moscow. English transl (1987) Optimization Software Inc. New York
35. 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
36. Tseng P (1991) Descent methods for convex essentially smooth minimization. J Optim Theory Appl 71:425-463
37. Tseng P, Bertsekas DP (1987) Relaxation methods for problems with strictly convex separable costs and linear constraints. Math Programming 38:303-321
38. Tseng P, Bertsekas DP (1991) Relaxation methods for problems with strictly convex costs and linear constraints. Math Oper Res 16:462-481
39. Zenios SA (1991) On the fine-grain decomposition of multicommodity transportation problems. SIAM J Optim 1:643-669
40. Zenios SA, Censor Y (1991) Massively parallel row-action algorithms for some nonlinear transportation problems. SIAM J Optim 1:373-400
41. Zenios SA, Censor Y (1991) Parallel computing with block-iterative image reconstruction algorithms. Appl Numer Math 7:399-415