Conditional subgradient optimization - Theory and applications

European Journal of Operational Research

Volumn 88, Issue 2, 1996, Pages 382-403

  Larsson, Torbjörn ^a   Patriksson, Michael ^a   Strömberg, Ann Brith ^a  

^a LINKÖPING INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

Conditional subgradients; Convex programming; Lagrangean relaxation; Nonsmooth optimization; Subgradient methods

Indexed keywords

CALCULATIONS; CONVERGENCE OF NUMERICAL METHODS; MATHEMATICAL PROGRAMMING; OPTIMIZATION;

CONDITIONAL SUBGRADIENTS; CONVEX PROGRAMMING; LAGRANGEAN RELAXATION; NONSMOOTH OPTIMIZATION; SUBGRADIENT METHODS;

OPERATIONS RESEARCH;

EID: 0029754821     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(94)00200-2     Document Type: Article

References (47)

1. Allen, E.P. (1985), "Using two sequences of pure network problems to solve the multicommodity network flow problem", Dissertation, School of Engineering and Applied Science, Southern Methodist University, Dallas, TX.
2. Bertsekas, D.P., and Mitter, S.K. (1973), "A descent method for optimization problems with nondifferentiable cost functionals", SIAM Journal on Control 11, 637-652.
3. Bertsekas, D.P., and Tseng, P. (1988), "The RELAX codes for linear minimum cost network flow problems", Annals of Operations Research 13, 125-190.
4. Bihain, A., Nguyen, V.H., and Strodíot, J.-J. (1987), "A reduced subgradient algorithm", Mathematical Programming Study 30, 127-149.
5. Brucker, P. (1984), "An O(n) algorithm for quadratic knapsack problems", Operations Research Letters 3, 163-166.
6. Burke, J.V., and Ferris, M.C. (1993), "Weak sharp minima in mathematical programming", SIAM Journal on Control and Optimization 31, 1340-1359.
7. Burke, J.V., and Moré, J.J. (1988), "On the identification of active constraints", SIAM Journal on Numerical Analysis 25, 1197-1211.
8. Camerini, P.M., Fratta, L., and Maffioli, F. (1975), "On improving relaxation methods by modified gradient techniques", Mathematical Programming Study 3, 26-34.
9. Damberg, O. (1990), "Solving the traffic assignment problem - A new approach using the gap function", Masters Thesis, LiTH-MAT-EX-90-06, Department of Mathematics, Linköping Institute of Technology, Linköping, Sweden.
10. Dem'janov, V.F., and Šomesova, V.K. (1978), "Conditional subdifferentials of convex functions", Soviet Mathematics Doklady 19, 1181-1185.
11. Dem'yanov, V.F., and Shomesova, V.K. (1980), "Subdifferentials of functions on sets", Cybernetics 16/1, 24-31.
12. Dem'yanov, V.F., and Vasil'ev, L.V. (1985), Nondifferentiable Optimization, Optimization Software, New York, NY.
13. Ermol'ev, Yu.M. (1966), "Methods for solving nonlinear extremal problems", Cybernetics 2/4, 1-14.
14. Fisher, M.L. (1981), "The Lagrangian relaxation method for solving integer programming problems", Management Science 27, 1-18.
15. Fisher, M.L. (1985), "An applications oriented guide to Lagrangian relaxation", Interfaces 15, 10-21.
16. Fletcher, R. (1987), Practical Methods of Optimization, 2nd edn., Wiley, Chichester.
17. Geoffrion, A.M. (1974), "Lagrangean relaxation for integer programming", Mathematical Programming Study 2, 82-114.
18. Goffin, J.L. (1978), "Nondifferentiable optimization and the relaxation method", in: C. Lemaréchal and R. Mifflin (eds.), Nonsmooth Optimization (Proceedings of a IIASA Workshop, 1977), Pergamon Press, Oxford, 31-49.
19. Gould, F.J., and Tolle, W. (1971), "A necessary and sufficient qualification for constrained optimization", SIAM Journal on Applied Mathematics 20, 164-172.
20. Guignard, M. (1969), "Generalized Kuhn-Tucker conditions for mathematical programming problems in a Banach space", SIAM Journal on Control 10, 93-98.
21. Held, M., Wolfe, P., and Crowder, H.P. (1974), "Validation of subgradient optimization", Mathematical Programming 6, 62-88.
22. Kennington, J., and Shalaby, M. (1977), "An effective subgradient procedure for minimal cost multicommodity flow problems", Management Science 23, 994-1004.
23. Kim, S., and Um, B.-S. (1989), "Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints", Optimization 20, 451-456.
24. Korpelevič, G.M. (1979), "A relaxation method of solution for matrix games", Matematičeskie Metody Rešenija Ekonomičeskie Zadač (Moscow) 8, 21-31 (in Russian).
25. Lasdon, L.S. (1970), Optimization Theory for Large Systems, Macmillan, New York, NY.
26. Luenberger, D.G. (1984), Linear and Nonlinear Programming, 2nd edn., Addison-Wesley, Reading, MA.
27. Marsten, R.E. (1981), "The design of the XMP linear programming library", ACM Transactions on Mathematical Software 7, 481-497.
28. Minoux, M. (1986), Mathematical Programming: Theory and Algorithms, Wiley, Chichester.
29. Panier, E. (1987), "An active set method for solving linearly constrained nonsmooth optimization problems", Mathematical Programming 37, 269-292.
30. Polak, E., Mayne, D.Q., and Wardi, Y. (1983), "On the extension of constrained optimization algorithms from differentiable to nondifferentiable problems", SIAM Journal on Control and Optimization 21, 179-203.
31. Poljak, B.T. (1967), "A general method of solving extremum problems", Soviet Mathematics Doklady 8, 593-597.
32. Polyak, B.T. (1969), "Minimization of unsmooth functionals", USSR Computational Mathematics and Mathematical Physics 9, 14-29.
33. Polyak, B.T. (1979), "Sharp minima", Lecture Notes, Institute of Control Sciences, Moscow, USSR. Presented at the IIASA Workshop on Generalized Lagrangians and their Applications, IIASA, Laxenburg, Austria, 1979.
34. Polyak, B.T. (1987), Introduction to Optimization, Optimization Software, New York, NY.
35. Rockafellar, R.T. (1970), Convex Analysis, Princeton University Press, Princeton, NJ.
36. Rockafellar, R.T. (1981), The Theory of Subgradients and its Applications to Problems of Optimization: Convex and Nonconvex Functions, Heldermann Verlag, Berlin.
37. Rosen, J.B. (1960), "The gradient projection method for nonlinear programming, part I: linear constraints", Journal of the Society for Industrial and Applied Mathematics 8, 181-217.
38. Saviozzi, G. (1986), "Advanced start for the multicommodity network flow problem", Mathematical Programming Study 26, 221-224.
39. Shepilov, M.A. (1976), "Method of the generalized gradient for finding the absolute minimum of a convex function", Cybernetics 12, 547-553.
40. Shor, N.Z. (1985), Minimization Methods for Non-Differentiable Functions, translated from the Russian by K.C. Kiwiel and A. Ruszczyński, Springer-Verlag, Berlin.
41. Shor, N.Z. (1991), "The development of numerical methods for nonsmooth optimization in the USSR", in: J.K. Lenstra, A.H.G. Rinnoy Kan and A. Schrijver (eds.), History of Mathematical Programming: A Collection of Personal Reminiscences, North-Holland, Amsterdam, 135-139.
42. Sreedharan, V.P. (1987), "ε-subgradient projection algorithm", Journal of Approximation Theory 51, 27-46.
43. Strodiot, J.-J., Nguyen, V.H., and Heukemes, N. (1983), "ε-optimal solutions in nondifferentiable convex programming and some related questions", Matematical Programming 25, 307-328.
44. Svanberg, K., and Bååthe, O. (1985), "Computational experiments with different subgradient techniques", TRITA-MAT-1985-3, The Swedish Institute of Applied Mathematics, Sweden.
45. Tamarit Goerlich, J.M. (1988), "Improving feasible directions for a class of nondifferentiable functions", European Journal of Operational Research 34, 99-104.
46. von Hohenbalken, B. (1977), "Simplicial decomposition in nonlinear programming algorithms", Mathematical Programming 13, 49-68.
47. Zarantonello, E.H. (1971), "Projections on convex sets in Hilbert space and spectral theory", in: E.H. Zarantonello (ed.), Contributions to Nonlinear Functional Analysis (Proceedings of a Symposium Conducted by the Mathematics Research Center, University of Wisconsin, Madison, WI, April 1971), Academic Press, New York, NY, 237-424.