Applying a Newton method to strictly convex separable network quadratic programs

SIAM Journal on Optimization

Volumn 8, Issue 3, 1998, Pages 728-745

  Sun, J ^a   Kuo, H ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b NONE   (Taiwan)

Author keywords

Network quadratic programming; Newton's method; Nonsmooth optimization; Penalty method; Piecewise quadratic programming

Indexed keywords

EID: 0032347873     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623494265359     Document Type: Article

References (36)

1. D. P. BERTSEKAS, P. A. HOSEIN, AND P. TSENG. Relaxation methods for network flow problems with convex arc costs, SIAM J. Control Optim., 25 (1987), pp. 1219-1243.
2. N. BOLAND, C. J. GOH, AND A. I MEES, An algorithm for solving quadratic network flow problems, Appl. Math. Lett., 4 (1991), pp. 61-64.
3. P. M. CAMERINI, G. GALBIATI, AND F. MAFFIOLI, Algorithms for finding optimum trees: Description, use and evaluation, Ann. Oper. Res., 13 (1988), pp. 265-397.
4. H.-G. CHEN, Forward-Backward Splitting Techniques: Theory and Applications, Ph.D. dissertation, Department of Applied Mathematics, University of Washington, Seattle, 1994.
5. H.-G. CHEN AND R. T. ROCKAFELLAR, Convergence rates in forward-backward splitting, SIAM J. Optim., 7 (1997), pp. 421-444.
6. V. CHVATAL, Linear Programming, Freeman & Co. New York, 1983.
7. F. H. CLARKE, Optimization and Nonsmooth Analysis, John Wiley and Sons, New York, 1983.
8. M. COLLINS, L. COOPER, R. HELGASON, J. KENNINGTON, AND L. LEBLANC, Solving the pipe network analysis problem using optimization techniques, Management Sciences, 24 (1978), pp. 747-760.
9. A. R. CONN, Constrained optimization using a nondifferentiable penalty function, SIAM J. Numer. Anal., 10 (1976), pp. 760-784.
10. R. S. DEMBO, A primal truncated Newton algorithm with application to nonlinear network optimization, Math. Programming, 31 (1987), pp. 43-72.
11. R. S. DEMBO AND J. G. KLINCEWICZ, A scaled reduced gradient algorithm for network flow problems with convex separable costs, Math. Programming, 15 (1981), pp. 125-147.
12. R. S. DEMBO, J. M. MULVEY, AND S. A. ZENIOS, Large-scale nonlinear network models and their application, Oper. Res., 37 (1989), pp. 353-372.
13. J. B. DENNIS, Mathematical Programming and Electrical Networks, John Wiley and Sons, New York, 1959.
14. M. FRANK AND P. WOLFE, An algorithm for quadratic programming, Naval Res. Logist., 33 (1956), pp. 95-110.
15. D. GABAY, Applications of the method of multipliers to variational inequalities, in Augmented Lagrangian Methods: Applications to the Solution of Boundary Value Problems, M. Fortin and G. Glowinski, eds., North-Holland, Amsterdam, 1983.
16. A. B. GAMBLE, A. R. CONN, AND W. R. PULLEYBLANK, A network penalty problem, Math. Programming, 50 (1991), pp. 53-73.
17. A. A GOLDSTEIN, Constructive Real Analysis, Harper and Row, New York, 1967.
18. G. H. GOLUB AND C. F. VAN LOAN, Matrix Computations, The Johns Hopkins University Press, Baltimore, MD, 1983.
19. W. H. HAGER AND D. W. HEARN, Application of the dual active set algorithm to quadratic network optimization, Comput. Optim. Appl., 1 (1993), pp. 349-373.
20. M. IRI, Flows, Transportation and Scheduling, Academic Press, New York, 1969.
21. J. L. KENNINGTON AND R. V. HELGASON, Algorithms for Network Programming, John Wiley & Sons, New York, 1980.
22. J. G. KLINCEWICZ, A Newton method for convex separable network flow problems, Networks, 13 (1983), pp. 427-442.
23. D. KLINGMAN, A. NAPIER, AND J. STUTZ, NETGEN: A program for generating large scale capacited assignment, transportation, and minimum cost flow network problems, Management Sciences, 20 (1974), pp. 814-821.
24. H. MARKOWITZ, Portfolio Selection, John Wiley and Sons, New York, 1959.
25. R. MIFFLIN, An algorithm for constrained optimization with semismooth functions, Math. Oper. Res., 2 (1977), pp. 191-207.
26. J. M. MULVEY, Nonlinear network models in finance, Adv. Math. Program. Finan. Plann., 1 (1987), pp. 253-271.
27. J.-S. PANG, S.-P. HAN, AND N. RANGARAJ, Minimization of locally Lipschitzian functions, SIAM J. Optim., 1 (1991), pp. 57-82.
28. L. QI AND J. SUN, A nonsmooth version of Newton's method, Math. Programming, 58 (1993), pp. 353-367.
29. L. QI AND J. SUN, A trust region method for minimization of locally Lipschitzian functions, Math. Programming, 66 (1994), pp. 25-43.
30. R. T. ROCKAFELLAR, Convex Analysis, Princeton University Press, Princeton, NJ, 1970.
31. R. T. ROCKAFELLAR, Network Flows and Monotropic Optimization, John Wiley and Sons, New York, 1984.
32. J. SUN, A study on monotropic piecewise quadratic programming, in Recent Developments in Mathematical Programming, H. I. Kumar, ed., Gordon and Breach Science Publishers, Melbourne, Australia, 1991, pp. 213-236.
33. J. SUN, On piecewise quadratic Newton and trust region problems, Math. Programming, 76 (1997), pp. 451-467.
34. 1-convex programming, Math. Programming, 57 (1992), pp. 239-257.
35. J. SUN AND K. TSAI, A simplex method and its implementation for network piecewise linear programming, Asia-Pacific J. Oper. Res., 14 (1997), pp. 55-68.
36. J. SUN, K. TSAI, AND L. QI, A simplex method for network programs with convex separable piecewise linear costs and its application to stochastic transshipment problems, in Network Optimization Problems: Algorithms, Applications and Complexity, D. Z. Du and P. M. Pardalos, eds., World Scientific Publishing Co. London, UK, 1993, pp. 281-300.