The efficiency of subgradient projection methods for convex optimization, Part II: Implementations and extensions

SIAM Journal on Control and Optimization

Volumn 34, Issue 2, 1996, Pages 677-697

  Kiwiel, Krzysztof C ^a  

^a SYSTEMS RESEARCH INSTITUTE   (Poland)

Author keywords

Convex programming; Linear inequalities; Nondifferentiable (nonsmooth) optimization; Parallel computing; Relaxation methods; Subgradient optimization; Successive projections

Indexed keywords

PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING;

CONVEX PROGRAMMING; LINEAR EQUALITIES; NONDIFFERENTIABLE OPTIMIZATION; RELAXATION METHODS; SUCCESSIVE PROJECTIONS;

MATHEMATICAL PROGRAMMING;

EID: 0030104971     PISSN: 03630129     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0363012994261483     Document Type: Article

References (56)

1. S. AGMON, The relaxation method for linear inequalities, Canad. J. Math., 6 (1954), pp. 382-392.
2. R. AHARONI AND Y. CENSOR, Block-iterative projection methods for parallel computation of solutions to convex feasibility problems, Linear Algebra Appl., 120 (1989), pp. 165-175.
3. E. ALLEN, R. HELGASON, J. KENNINGTON, AND B. SHETTY, A generalization of Polyak's convergence result for subgradient optimization, Math. Programming, 37 (1987), pp. 309-317.
4. M. S. BAZARAA AND J. J. GOODE, A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality, European J. Oper. Res., 3 (1979), pp. 322-338.
5. M. S. BAZARAA AND H. D. SHERALI, On the choice of step size in subgradient optimization, European J. Oper. Res., 7 (1981), pp. 380-388.
6. D. P. BERTSEKAS AND J. N. TSITSIKLIS, Parallel and Distributed Computation: Numerical Methods, Prentice-Hall, Englewood Cliffs, NJ, 1989.
7. R. B. BLAND, D. GOLDFARB, AND M. J. TODD, The ellipsoid method: A survey, Oper. Res., 29 (1981), pp. 1039-1091.
8. n (Part 1), Handbook of Numerical Analysis, vol. I, P. G. Ciarlet and J. L. Lions, eds., North-Holland, Amsterdam, 1990, pp. 465-652.
9. U. BRÄNNLUND, On Relaxation Methods for Nonsmooth Convex Optimization, Ph.D. thesis, Department of Mathematics, Royal Institute of Technology, Stockholm, 1993.
10. A. CEGIELSKI, On a relaxation algorithm in convex optimization problems, tech. report, Institute of Mathematics, Higher College of Engineering, Zielona Góra, Poland, 1992.
11. P. M. CAMERINI, L. FRATTA, AND F. MAFFIOLI, On improving relaxation methods by modified gradient techniques, Math. Programming Stud., 3 (1975), pp. 26-34.
12. J. W. DANIEL, W. B. GRAGG, L. C. KAUFMAN, AND G. W. STEWART, Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization, Math. Comp., 30 (1976), pp. 772-795.
13. R. FLETCHER, Practical Methods of Optimization, 2nd ed., Wiley, Chichester, 1987.
14. P. E. GILL, W. MURRAY, AND M. H. WRIGHT, Numerical Linear Algebra and Optimization, Addison-Wesley, Redwood City, CA, 1991.
15. J.-L. GOFFIN, Nondifferentiable optimization and the relaxation method, in Nonsmooth Optimization, C. Lemaréchal and R. Mifflin, eds., Pergamon Press, Oxford, 1978, pp. 31-49.
16. Convergence results in a class of variable metric subgradient methods, in Non-linear Programming 4, O. L. Mangasarian, R. R. Meyer, and S. M. Robinson, eds., Academic Press, New York, 1981, pp. 283-326.
17. D. GOLDFARB AND M. J. TODD, Modifications and implementation of the ellipsoid algorithm for linear programming, Math. Programming, 23 (1982), pp. 1-19.
18. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, 2nd ed., The Johns Hopkins University Press, Baltimore, Maryland, 1989.
19. J.-B. HIRIART-URRUTY AND C. LEMARÉCHAL, Convex Analysis and Minimization Algorithms, Springer-Verlag, Berlin, 1993.
20. M. HELD, P. WOLFE, AND H. P. CROWDER, Validation of subgradient optimization, Math. Programming, 6 (1974), pp. 62-88.
21. A. N. IUSEM AND A. R. DE PIERRO, On the convergence of Han's method for convex programming with quadratic objective, Math. Programming, 52 (1991), pp. 265-284.
22. S. KIM, H. AHN, AND S.-C. CHO, Variable target value subgradient method, Math. Programming, 49 (1991), pp. 359-369.
23. S. KIM AND H. AHN, Convergence properties of the modified subgradient method of Camerini et al., Naval Res. Logist. Quart., 37 (1990), pp. 961-966.
24. S. KIM AND B.-S. UM, Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints, Optimization, 20 (1989), pp. 451-456.
25. An improved subgradient method for constrained nondifferentiable optimization, Oper. Res. Lett., 14 (1993), pp. 61-64.
26. K. C. KIWIEL, Methods of Descent for Nondifferentiable Optimization, Lecture Notes in Mathematics 1133, Springer-Verlag, Berlin, 1985.
27. A survey of bundle methods for nondifferentiable optimization, in Mathematical Programming: Recent Developments and Applications, M. Iri and K. Tanabe, eds., KTT/Kluwer, Tokyo, 1989, pp. 263-282.
28. Proximity control in bundle methods for convex nondifferentiable minimization, Math. Programming, 46 (1990), pp. 105-122.
29. The efficiency of subgradient projection methods for convex nondifferentiable optimization, Research report 1845, INRIA, Rocquencourt, 1993.
30. Block-iterative surrogate projection methods for convex feasibility problems, Linear Algebra Appl., 215 (1995), pp. 225-259.
31. The efficiency of subgradient projection methods for convex optimization, part I: General level methods, SIAM J. Control Optim., 34 (1996), pp. 660-676.
32. S. KIM, S. KOH, AND H. AHN, Two-direction subgradient method for non-differentiate optimization problems, Oper. Res. Lett., 6 (1987), pp. 43-46.
33. A. N. KULIKOV AND V. R. FAZILOV, Convex optimization with prescribed accuracy, Zh. Vychisl. Mat. i Mat. Fiz., 30 (1990), pp. 663-671. (In Russian.)
34. C. LEMARÉCHAL, Nondifferentiable optimization, in Optimization, Handbooks in Operations Research and Management Science, vol. 1, G. L. Nemhauser, A. H. G. Rinnooy-Kan, and M. J. Todd, eds., North-Holland, Amsterdam, 1989, pp. 529-572.
35. C. LEMARÉCHAL, A. S. NEMIROVSKII, AND YU. E. NESTEROV, New variants of bundle methods, Math. Programming, 69 (1995), pp. 111-147.
36. G. LOU AND S.-P. HAN, A parallel projection method for solving generalized linear least-squares problems, Numer. Math., 53 (1988), pp. 255-264.
37. T. MOTZKIN AND I. J. SCHOENBERG, The relaxation method for linear inequalities, Canad. J. Math., 6 (1954), pp. 393-404.
38. S. O. OKO, Surrogate methods for linear inequalities, J. Optim. Theory Appl., 72 (1992), pp. 247-268.
39. B. T. POLYAK, Minimization of unsmooth functional, Zh. Vychisl. Mat. i Mat. Fiz., 9 (1969), pp. 509-521. (In Russian.) English transl. in U.S.S.R. Comput. Math. and Math. Phys. 9 (1969), pp. 14-29.
40. B. T. POLYAK, Minimization of unsmooth functional, Zh. Vychisl. Mat. i Mat. Fiz., 9 (1969), pp. 509-521. (In Russian.) English transl. in U.S.S.R. Comput. Math. and Math. Phys. 9 (1969), pp. 14-29.
41. S. SARIN AND M. H. KARWAN, Computational evaluation of two subgradient search methods, Comput. Oper. Res., 14 (1987), pp. 241-247.
42. H. SCHRAMM AND J. ZOWE, A version of the bundle idea for minimizing a nonsmooth function: Conceptual idea, convergence analysis, numerical results, SIAM J. Optim., 2 (1992), pp. 121-152.
43. S. SEN AND H. D. SHERALI, A class of convergent primal-dual subgradient algorithms for decomposable convex programs, Math. Programming, 35 (1986), pp. 279-297.
44. M. B. SHCHEPAKIN, On a modification of a class of algorithms for mathematical programming, Zh. Vychisl. Mat. i Mat. Fiz., 19 (1979), pp. 1387-1395. (In Russian.)
45. On the method of orthogonal descent, Kibernetika, (1987), pp. 58-62. (In Russian.)
46. An algorithm of orthogonal descent for searching for the zero of a convex function, identification of unsolvability of the problem and the questions of the speed of convergence, Kibernetika, (1992), pp. 87-96. (In Russian.)
47. H. D. SHERALI AND D, C. MYERS, Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs, Discrete Appl. Math., 20 (1988), pp. 51-68.
48. N. Z. SHOR, Minimization Methods for Non-Differentiable Functions, Naukova Dumka, Kiev, 1979. (In Russian.) English transl., Springer-Verlag, Berlin, 1985.
49. H. D. SHERALI AND O. ULULAR, A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems, Appl. Math. Optim., 20 (1989), pp. 193-221.
50. S. SARIN, M. H. KARWAN, AND R. L. RADIN, A new surrogate-dual multiplier search procedure, Naval Res. Logist. Quart., 34 (1987), pp. 431-450.
51. J. E. SPINGARN, A projection method for least-squares solutions to overdetermined systems of linear inequalities, Linear Algebra Appl., 86 (1987), pp. 211-236.
52. J. TELGEN, On relaxation methods for systems of linear inequalities, European J. Oper. Res., 9 (1982), pp. 184-189.
53. M. J. TODD, Some remarks on the relaxation method for linear inequalities, Tech. report 419, Cornell Univ., Ithaca, 1979.
54. P. TSENG, Dual ascent methods for problems with strictly convex costs and linear constraints: A unified approach, SIAM J. Control Optim., 28 (1990), pp. 214-242.
55. further applications of a splitting algorithm to decomposition in variational inequalities and convex programming, Math. Programming, 48 (1990), pp. 249-263.
56. K. YANG AND K. G. MURTY, New iterative methods for linear inequalities, J. Optim. Theory Appl., 72 (1992), pp. 163-185.