ACCPM - a library for convex optimization based on an analytic center cutting plane method

European Journal of Operational Research

Volumn 94, Issue 1, 1996, Pages 206-211

  Gondzio, J ^a   du Merle, O ^a   Sarkissian, R ^a   Vial, J P ^a  

^a UNIVERSITY OF GENEVA   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; C (PROGRAMMING LANGUAGE); COMPUTER SOFTWARE; FORTRAN (PROGRAMMING LANGUAGE); FUNCTIONS; OPERATIONS RESEARCH; PIECEWISE LINEAR TECHNIQUES; PROBLEM SOLVING;

ANALYTIC CENTER; CUTTING PLANE METHOD; INTERIOR POINT ALGORITHM; LARGE SCALE CONVEX OPTIMIZATION;

OPTIMIZATION;

EID: 0030270964     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(96)00169-5     Document Type: Article

References (17)

1. E. Anderson Z. Bai C. Bischof J. Demmel J. Dongarra J. Du Croz A. Greenbaum S. Hammarling A. McKenney S. Ostrouchov D. Sorensen LAPACK Users' Guide 1992 SIAM Philadelphia
2. O. Bahn J.-L. Goffin J.-P. Vial O. du Merle Experimental behaviour of an interior point cutting plane algorithm for convex programming: an application to geometric programming Discrete Applied Mathematics 49 1994 3 23
3. O. Bahn O. du Merle J.-L. Goffin J.-P. Vial A cutting plane method from analytic centers for stochastic programming Mathematical Programming 69 1995 45 73
4. G.B. Dantzig P. Wolfe The decomposition algorithm for linear programming Econometrica 29 4 1961 767 778
5. G. de Ghellinck J.-P. Vial A polynomial Newton method for linear programming Algorithmica 1 1986 425 453
6. O. du Merle Interior points and cutting palnes: a development and implementation of methods for convex optimization and large scale structured linear programming Ph.D Thesis 1995 Department of Management Studies, University of Geneva Geneva, Switzerland (in French)
7. O. du Merle J.-L. Goffin J.-P. Vial On the comparative behavior of Kelley's Cutting Plane Method and the Analytic Center Cutting Plane Method Technical Report 1996.4 March 1996 Department of Management Studies, University of Geneva Switzerland
8. J.-L. Goffin J.-P. Vial Cutting planes and column generation techniques with the projective algorithm Journal of Optimization Theory and Applications 65 1990 409 429
9. J.-L. Goffin A. Haurie J.-P. Vial Decomposition and nondifferentiable optimization with the projective algorithm Management Science 38 2 1992 284 302
10. J.-L. Goffin J. Gondzio J.-P. Vial D.L. Zhu Using central prices in the decomposition of linear programs European Journal of Operational Research 64 1993 393 409
11. J.-L. Goffin J. Gondzio R. Sarkissian J.-P. Vial Solving nonlinear multicommodity flow problems by the analytic center cutting plane method Technical Report 1994.21 Mathematical Programming September 1994 Department of Management Studies, University of Geneva (to appear)
12. J. Gondzio Implementing Cholesky factorization for interior point methods of linear programming Optimization 27 1993 121 140
13. J. Gondzio T. Terlaky A computational view of interior point methods for linear programming J.E. Beasley Advances in Linear and Integer Programming 1996 Oxford University Press Oxford, England 106 147
14. J. Gondzio O. du Merle R. Sarkissian J.-P. Vial An advanced implementation of the analytic center cutting plane method and its applications Technical Report December 1995 Department of Management Studies, University of Geneva (in preparation)
15. J. Gondzio R. Sarkissian J.-P. Vial Using an interior point method for the master problem in a decomposition approach Technical Report 1995.30 October 1995 Department of Management Studies, University of Geneva Switzerland revised in May 1996, to appear in European Journal of Operational Research
16. J.E. Kelley The cutting plane method for solving convex programs Journal of the SIAM 8 1960 703 712
17. C. Roos J.-P. Vial Interior point methods J.E. Beasley Advances in Linear and Integer Programming 1996 Oxford University Press Oxford, England Chapter 3