Variable target value method for nondifferentiable optimization

Operations Research Letters

Volumn 26, Issue 1, 2000, Pages 1-8

  Sherali, Hanif D ^a   Choi, Gyunghyun ^a   Tuncbilek, Cihan H ^a  

^a VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; OPTIMIZATION; STRATEGIC PLANNING;

CONJUGATE SUBGRADIENT METHODS; DEFLECTED SUBGRADIENT DIRECTIONS; NONDIFFERENTIABLE OPTIMIZATION; SUBGRADIENT ALGORITHMS; VARIABLE TARGET VALUE METHODS;

OPERATIONS RESEARCH;

EID: 0034135343     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(99)00063-2     Document Type: Article

References (20)

1. Bazaraa M.S., Sherali H.D. On the choice of step sizes in subgradient optimization. Eur. J. Oper. Res. 7:1981;380-388.
2. U.G. Brännlund, On relaxation methods for nonsmooth convex optimization, Ph.D. Thesis, Kungliga Tekniska Hogskolan, S-100 44 Stockholm, Sweden, 1993.
3. Camerini P.M., Fratta L., Maffioli F. On improving relaxation methods by modified gradient techniques. Math. Programm. Study. 3:1975;26-34.
4. Goffin J.L. On the convergence rate of subgradient methods. Math. Programm. 13:1977;329-347.
5. J.L. Goffin, K.C. Kiwiel, Convergence of a simple subgradient level method, GERAD Report G-96-56, 1998, Math. Programm., to appear.
6. Held M., Karp R.M. The traveling salesman problem and minimum spanning trees: part II. Math. Programm. 1:1971;6-25.
7. Held M., Wolfe P., Crowder H.D. Validation of subgradient optimization. Math. Programm. 6:1974;62-88.
8. W. Hock, K. Schittkowski, Test examples for nonlinear programming codes, Lecture Notes in Economics and Mathematical Systems, Vol. 187, Springer, Berlin, 1981.
9. Kim S., Ahn H., Cho S. Variable target value subgradient method. Math. Programm. 49:1991;359-369.
10. K.C. Kiwiel, Methods of Descent of Nondifferentiable Optimization, Lecture Notes in Mathematics, Vol. 1133, Springer, Berlin, 1985.
11. Kiwiel K.C. Proximity control in bundle methods for convex nondifferentiable minimization. Math. Programm. 46:1990;105-122.
12. Kiwiel K.C. The efficiency of subgradient projection methods for convex optimization, part I: general level methods; part II: implementations and extensions. SIAM J. Control Optim. 34(2):1996;660-697.
13. Kiwiel K.C. Subgradient method with entropic projections for convex nondifferentiable minimization. J. Optim. Theory Appl. 96(1):1998;159-173.
14. A.N. Kulikov, V.R. Fazylov, Convex optimization with prescribed accuracy, USSR Comput. Maths. Math. Phys. 30(3) (1990) 16-22. (Zh. Vychisl Mat. i Fiz. 30(5) (1990) 663-671.).
15. A.N. Kulikov, V.R. Fazylov, Convex optimization with prescribed accuracy, USSR Comput. Maths. Math. Phys. 30(3) (1990) 16-22. (Zh. Vychisl Mat. i Fiz. 30(5) (1990) 663-671.).
16. C. Lemarechal, Numerical experiments in nonsmooth optimization, in: E.A. Nurminski (Ed.), Progress in Nondifferentiable Optimization, Pergamon Press, Oxford, 1982, pp. 61-84.
17. C. Lemarechal, R. Mifflin, Nonsmooth optimization, Proceedings of an IIASA Workshop, March 28-April 8, 1977, Pergamon Press, Oxford, 1978.
18. Polyak B.T. A general method for solving extremal problems. Sov. Math. 8:1967;593-597.
19. Sherali H.D., Ulular O. A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems. Appl. Math. Optim. 20:1989;193-221.
20. H.D. Sherali, G. Choi, Z. Ansari, Memoryless and limited memory space dilation and reduction algorithms, Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, 1998.