The volume algorithm revisited: Relation with bundle methods

Mathematical Programming, Series B

Volumn 94, Issue 1, 2002, Pages 41-69

  Bahiense, L ^a   Maculan, N ^a   Sagastizabal C ^b,c  

^a FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^b IMPA   (Brazil)

^c INRIA ROCQUENCOURT   (France)

Author keywords

Bundle methods; Steiner problems; Volume algorithm

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; MATHEMATICAL PROGRAMMING; MEASUREMENT THEORY; PROBLEM SOLVING;

BUNDLE METHODS; REVISED FORMULATION (RVA); STEINER PROBLEMS; VOLUME ALGORITHMS (VA);

ALGORITHMS;

EID: 0345275423     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-002-0357-3     Document Type: Article

References (22)

1. Bahiense, L., Barahona, F., Porto. O.: Solving Steiner tree problems in graphs with Lagrangian relaxation. Accepted for publication in J. Combinatorial Optim. 2002
2. Barahona, F., Anbil, R.: The volume algorithm: producing primal solutions with a subgradient method. Math. Program. 87(3, Ser. A), 385-399 (2000)
3. Barboza, E., Aragao, M.V., Ribeiro, C.: Preprocessing Steiner problems from VLSI layout. Networks 40, 38-50 (2002)
4. Bonnans, J.F., Gilbert, J.Ch., Lemaréchal, C., Sagastizábal, C.: Numerical Optimization. Theoretical and Practical Aspects. Springer-Verlag, Berlin, to appear in 2003
5. Claus, A., Maculan, N.: Une nouvelle formulation du Problème de Steiner sur un graphe. Tech. Rep. 280, Centre de Recherche sur les Transports, Université de Montréal, 1983
6. Garey, M.R., Johnson, D.S.: The Rectilinear Steiner tree problem is NP-complete. SIAM J. Appl. Math. 32, 826-834 (1977)
7. Hiriart-Urruty, J.B., Lemaréchal, C.: Convex analysis and minimization algorithms. Number 305-306 in Grand, der math. Wiss. Springer-Verlag, Berlin, 1993
8. Hwang, F.K., Richards, D.S.: Steiner tree problems. Networks 22, 55-89 (1992)
9. Hwang, F.K., Richards, D.S., Winter, P.: The Steiner tree problem. In North Holland, ed. Ann. Dis. Math. Vol. 53, 1992
10. Karp, R.M.: Reducibility among combinatorial problems. In: R.E. Miller, J.W. Thatcher (eds), Complexity of Computer Computations, pp. 85-103. Plenum Press, 1972
11. Knopp, K.: Infinite Sequences and Series. Dover Publications Inc., New York, 1956
12. Koch, T., Martin, A.: Solving Steiner tree problems in graphs tooptimality. Networks 32, 207-232 (1998)
13. Korpelevich, G.M.: The extragradient method for finding saddle points and other problems. Matecon 12, 747-756 (1976)
14. Lemaréchal, C.: An extension of Davidon methods to nondifferentiable problems. Math. Program. Study 3, 95-109 (1975)
15. Maculan, N.: The Steiner problem in graphs. Ann. Dis. Math. 31, 185-212 (1987)
16. Shor, N.: Minimization Methods for Non-differentiable Functions. Springer-Verlag, Berlin, 1985
17. Solodov, M.V., Svaiter, B.F.: A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator. Set-Valued Analysis 7, 323-345 (1999)
18. Takahashi, H., Matsuyama, A.: An approximate solution for the Steiner problem in graphs. Math. Japon. 24(6), 573-577 (1979/80)
19. Tseng, P.: A modified forward-backward splitting method for maximal monotone mappings. SIAM J. Control Optim. 38, 431-446 (2000)
20. Winter, P.: Steiner problems in networks: a survey. Networks 17, 129-167 (1987)
21. Wolfe, P.: A method of conjugate subgradients for minimizing nondifferentiable functions. Math. Program. Study 3, 145-173 (1975)
22. Wong, R.T.: A dual ascent approach for Steiner tree problems on a directed graph. Math. Program. 28, 271-287 (1984)