Jean-Louis Goffin
BEng Universit茅 Libre de Bruxelles
MSc Universit茅 Libre de Bruxelles
MS University of California at Berkeley
PhD University of California at Berkeley
Dr. Jean-Louis Goffin joined 缅北强奸's Faculty of Management in 1976. He had previously been an Assistant Professor at l'脡cole des Hautes 脡tudes Commerciales in Montreal.
Dr. Goffin taught undergraduate and graduate courses, including Operations Research, Applied Optimization, Simulation of Management Systems, Data Models and Decisions, and Operations Management.
The extension of interior point methods to the context of column generation and cutting plane methods has led to a very competitive new methodology for large scale optimization, the Analytic Center Cutting Plane Method (ACCPM). A computer code has been developed with LOGILAB and has been applied to the solution of linear or nonlinear network design problems, of multi-item inventory problems with setup costs and times, and to the computation of economic equilibria.
Dr. Goffin's work appeared in such journals as Management Science, Mathematical Programming, Mathematics of Operations Research, Contemporary Accounting Research, SIAM Journal on Optimization, Discrete Applied Mathematics, European Journal of Operations Research, Operations Research Letters, Linear Algebra and its Applications, Computational Optimization and Applications, Mathematical Methods of Operations Research, and Journal of Optimization Theory and Applications. He also delivered more than forty lectures or seminars in the last five years at a variety of prestigious Universities, or Conferences.
He was awarded numerous research grants, including more than twenty-five years of funding by both FCAR and NSERC.
In 1980, Dr. Goffin co-founded the Groupe d'脡tudes et de Recherches en Analyse des D茅cisions (G脡RAD), a Montreal-based inter-university research center. In 1980/81, he was a Visiting Scholar with the Department of Operations Research at Stanford University and in 1987/88, a Visiting Professor at the Center for Operations Research and Econometrics at the Universit茅 Catholique de Louvain. He was also an associate member of the Department of Mathematics at 缅北强奸, and LOGILAB, HEC, University of Geneva.
Dr. Goffin made significant contributions to a number of associations in his field. He co-directed the International Symposium on Mathematical Programming in 1979. He sat on the Editorial Board of Computational Optimization and Applications, and was Guest Editor for special issues of the Mathematical Programming Journal of Studies.
- Teaching Assistant, University of California at Berkeley, Graduate Course in Network Flows and Graphs
- Professeur Adjoint, Methodes Quantitatives, Ecole des Hautes Etudes Commerciales, Universite de Montreal
- Professeur visiteur,聽CORE, Universite Catholique de Louvain, Louvain-la Neuve, Belgium
- Papers in Peer-Reviewed Journals
- Papers in Technical & Professional Publications
- Books and Edited Volumes
Papers in Peer-Reviewed Journals
M. R. Oskoorouchi and J.-L. Goffin, "The Analytic Center Cutting Plane Method with Semidefinite Cuts",聽SIAM Journal on Optimization, 13(4): pp 1029-1053. (electronic publication: 2003).
F. Sharifi Mokhtarian and J.-L. Goffin, "An Analytic Center Quadratic Cut Method for the Convex Quadratic Feasibility Problem",聽Mathematical Programming, Ser. A., 93, 2002, pp. 305-325.
J.-L. Goffin and J.-P. Vial, "Convex nondifferentiable optimization: a survey focused on the analytic center cutting plane method", Optimization Methods and Software, 2002.
Goffin, J.-L. and Vial, J.-P. "Multiple cuts in the analytic center cutting plane method", SIAM Journal on Optimization, Volume 11, Number 1, 2001, pp. 266-288 (published in electronic form in 2000).
Sharifi Mokhtarian, F.聽and Goffin, J.-L. "A Path-Following Cutting Plane Method for some Monotone Variational Inequalities", Optimization, Volume 48, pp. 333-351, 2000.聽
J.-L. Goffin and J.-P. Vial, "A two-cut approach in the analytic center cutting plane method", Mathematical Methods of Operations Research vol. 49 (1999) 1, 149-169.
J.-L. Goffin and K. Kiwiel, "Convergence of a simple subgradient level method", Mathematical Programming, vol. 85 (1999) 1, 207-211.
M. Denault and J.-L. Goffin, "On a Primal-Dual Analytic Center Cutting Plane Method for Variational Inequalities", Computational Optimization and Applications, vol. 12, pp127-156, 1999.
J.-L. Goffin and J.-P. Vial, "Shallow, Deep and Very Deep Cuts in with the Analytic Center Cutting Plane Method", Mathematical Programming, vol. 84 1999 pp 89-103.
J.-L. Goffin and F. Shari Mokhtarian , "Using the Primal Dual Infeasible Newton Method in the Analytic Center Method for Problems Defned by Deep Cutting Planes", Journal of Optimization Theory and Applications, vol. 101, 35-58, April 1999.
F. Sharifi Mokhtarian and J.-L. Goffin, " A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems" , SlAM Journal on Optimization, vol. 8 No.4, November 1998, pp 1108-1131
F. Sharifi Mokhtarian and J.-L. Goffin, "Long-Step Interior-Point Algorithms for a Class of Variational Inequalities with Monotone Operators," Journal of Optimization Theory and Applications, v. 97, no. 1, April 1998, pp. 181-210.
O.du Merle, J.-L. Goffin and J.-P. Vial, "On Improvements to the Analytic Center Cutting Plane Method," Computational Optimization and Applications, 11, pp. 37-52, 1998.
(and Z.-Q., Luo, Y. Ye) "Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems", SIAM Journal on Optimization, v. 6, no. 3, 1996, pp. 638-652.聽
(and Bahn, O., du Merle O., Vial, J.P.) "A Cutting Plane Method from Analytic Centers for Stochastic Programming", in Nondifferentiable and large scale optimization, Mathematical Programming, Series B, eds. Goffin, J.L. and Vial, J.P. v. 69, 1995, pp. 45-73.聽
(O.Bahn, J.P. Vial and O. du Merle, "Experimental Behavior of an Interior Point Cutting Plane Algorithm for Convex Programming: An Application to Geometric Programming", Discrete Applied Mathematics, v. 49, (1994), pp. 3-23.聽
(J.P. Vial), "Short Steps with Karmarkar's Projective Algorithm for Linear Programming", SIAM Journal on Optimization, v. 4 (1994), pp. 193-207.聽
(Vial, J.-P.) "On the Computation of Weighted Analytic Centers and Dual Ellipsoids with the Projective Algorithm", Mathematical Programming, v. 60 (1993), pp. 81-92.聽
(Haurie, A., Vial, J.P. and Zhu, D.L.) "Using Central Prices in the Decomposition of Linear Programs", European Journal of Operational Research, v. 64 (1993), pp. 393-409.聽
(Haurie, A. and Vial, J.P.) "Decomposition and Nondifferentiable Optimization with the Projective Algorithm", Management Science, v. 38, no. 2 (February 1992), pp. 284-302.聽
(Vial, J.P.) "Cutting Planes and Column Generation Techniques with the Projective Algorithm", Journal of Optimization Theory and Applications, (June 1990), pp. 409-429.聽
"Affine and Projective Transformations in Nondifferentiable Optimization", Trends in Mathematical Optimization, (K.-H. Hoffmann, J.-B. Hiriart-Urruty, C. Lemar茅chal and J. Zowe) eds., International Series of Numerical Mathematics, Birkhauser Verlag, Basel-Boston, v. 84 (1988), pp. 79-91.聽
(and Amey, L.R.) "Joint Product Decisions: The variable proportions case", Contemporary Accounting Research, (Fall 1988), pp. 174-198.聽
Papers in Technical & Professional Publications
J.-L. Goffin, J. Gondzio, R. Sarkissian and J.-P. Vial, "Solving Nonlinear Multicommodity Flows Problems by the Analytic Center Cutting Plane Method", Mathematical Programming, Series B,聽vol 76聽1 (1997) pp 131--154.聽
Books and Edited Volumes
(Vial, J.P.), eds., Nondifferentiable and Large Scale Optimization, Mathematical Programming, Series B, v. 69, 1995.聽
Chapters in Books
S. Elhedhli, J.-L. Goffin and J.-P. Vial, "Nondifferentiable Optimization: Introduction, Applications and Algorithms", in "Encyclopedia on Optimization:", C. Floudas and P. Pardalos, editors, Kluwer Academic Publishers (2001).
S. Elhedhli, J.-L. Goffin and J.-P. Vial, "Nondifferentiable Optimization: Introduction, Cutting Plane Methods",聽in "Encyclopedia on Optimization:", C. Floudas and P. Pardalos, editors, Kluwer Academic Publishers (2001).
du Merle, O., Goffin, J.-L., Trouiller, C. and Vial, J.-P. "A Lagrangian Relaxation of the Capacitated Multi-Item Lot Sizing Problem Solved with an Interior Point Cutting Plane Algorithm", in "Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems",聽P.M. Pardalos, Editor, Kluwer Academic Publishers, Nonconvex Optimization and its Applications, Volume 42, May 2000.
(Luo, Z.Q. and Ye, Y.), "On the complexity of a column generation algorithm for Convex of quasiconvex Feasibility Problems", in Large Scale Optimization: State of the Art, W.W. Hager, D.W. Hearn and P.M. Pardalos, eds., Kluwer Academic Publishers B.V., 1994, pp. 182-191.聽
"The Relaxation Method for Linear Inequalities", in I.J. Schoenberg Selected Papers, v. 1, Carl de Boor ed., Birkhauser, Boston-Basel, 1988, pp. 87-88.聽
Research Reports
Denault, M., Goffin, J.-L, "Solving Variational Inequalities with a Quadratic Cut Method: A Primal-Dual, Jacobian-Free Approach", octobre 2002 Pages 22, GERAD Technical Report G-2002-58. (accepted in "Computers and Operations Research").
Elhedhli, S. and Goffin, J.-L.,聽" The Integration of an Interior-Point Cutting Plane Method within a Branch-and-Price Algorithm", April 2001, GERAD Technical Report聽G-2001-19, 30 pages. Accepted in "Mathematical Programming".
F. Sharifi Mokhtarian and J.-L. Goffin, "An Analytic Center Quadratic Cut Method for the Convex Quadratic Feasibility Problem", GERAD Tech. report G--2000--18, 19pp., April 2000
O. du Merle, J.-L. Goffin, C. Trouiller and J.-P. Vial, "A Lagranagian Relaxation of the Capacitated Multi-Item Lot Sizing Problem Solved with an Interior Point Cutting Plane Algorithm", HEC, U. of Geneva Tech. Report, March 1996; Extended abstract, Procceedings of the Workshop on Production Planning and Control, Mons, Belgium, September 1996.聽
F. Sharifi Mokhtarian and J.-L. Goffin, "Long-Step Interior-Point Algorithms for a Class of Variational Inequalities with Monotone Operators", GERAD Tech. Report, March 1996.聽
J.-L. Goffin, O. du Merle, and J.-P. Vial, "On the Comparative Behavior of Kelley's Cutting Plane Method and the Analytic Center Cutting Plane Method", LOGILAB--HEC, U. of Geneva Tech. Report, March 1996; also GERAD Tech. Report G--96--12.聽
J.-L. Goffin and P. Marcotte, and D. Zhu, "Two Cutting Plane Methods for Pseudomonotone Variational Inequalities", Publication du CRT, June 1995, submitted; revised December 1995.聽
J.-L. Goffin, "Using the Primal Dual Infeasible Newton Method in the Analytic Center Method for Problems Defined by Deep Cutting Planes", Cahier du GERAD G-94-41, ISSN: 0711-2440, 24 pp, September 1994.聽
Conference Proceedings
F. Sharifi Mokhtarian and J.-L. Goffin, "An Analytic Center Self-Concordant Cut Method for the Convex Feasibility Problem",聽in the proceedings of ACAGO, Samos, Greece, June 2000; Kluwer Publishers (2001).聽
