Jean-Louis Goffin

Publication Activity (10 Years)

Years Active: 1973-2007
Publications (10 Years): 0

Publications

Mohammad R. Oskoorouchi, Jean-Louis Goffin
A matrix generation approach for eigenvalue optimization. Math. Program. 109 (1) (2007)
Samir Elhedhli, Jean-Louis Goffin
Efficient Production-Distribution System Design. Manag. Sci. 51 (7) (2005)
Michel Denault, Jean-Louis Goffin
The Analytic-Center Cutting-Plane Method for Variational Inequalities: A Quadratic-Cut Approach. INFORMS J. Comput. 17 (2) (2005)
Mohammad R. Oskoorouchi, Jean-Louis Goffin
An Interior Point Cutting Plane Method for the Convex Feasibility Problem with Second-Order Cone Inequalities. Math. Oper. Res. 30 (1) (2005)
Fatma Gzara, Jean-Louis Goffin
Exact solution of the centralized network design problem on directed graphs. Networks 45 (4) (2005)
Samir Elhedhli, Jean-Louis Goffin
The integration of an interior-point cutting plane method within a branch-and-price algorithm. Math. Program. 100 (2) (2004)
Michel Denault, Jean-Louis Goffin
Solving variational inequalities with a quadratic cut method: a primal-dual, Jacobian-free approach. Comput. Oper. Res. 31 (5) (2004)
Mohammad R. Oskoorouchi, Jean-Louis Goffin
The Analytic Center Cutting Plane Method with Semidefinite Cuts. SIAM J. Optim. 13 (4) (2003)
Faranak Sharifi Mokhtarian, Jean-Louis Goffin
An analytic center quadratic cut method for the convex quadratic feasibility problem. Math. Program. 93 (2) (2002)
Jean-Louis Goffin, Jean-Philippe Vial
Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method. Optim. Methods Softw. 17 (5) (2002)
Jean-Louis Goffin, Jean-Philippe Vial
Multiple Cuts in the Analytic Center Cutting Plane Method. SIAM J. Optim. 11 (1) (2000)
Jean-Louis Goffin, Jean-Philippe Vial
A two-cut approach in the analytic center cutting plane method. Math. Methods Oper. Res. 49 (1) (1999)
Michel Denault, Jean-Louis Goffin
On a Primal-Dual Analytic Center Cutting Plane Method for Variational Inequalities. Comput. Optim. Appl. 12 (1-3) (1999)
Jean-Louis Goffin, Jean-Philippe Vial
Shallow, deep and very deep cuts in the analytic center cutting plane method. Math. Program. 84 (1) (1999)
Jean-Louis Goffin, Krzysztof C. Kiwiel
Convergence of a simple subgradient level method. Math. Program. 85 (1) (1999)
Faranak Sharifi Mokhtarian, Jean-Louis Goffin
A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems. SIAM J. Optim. 8 (4) (1998)
Olivier du Merle, Jean-Louis Goffin, Jean-Philippe Vial
On Improvements to the Analytic Center Cutting Plane Method. Comput. Optim. Appl. 11 (1) (1998)
Jean-Louis Goffin, Patrice Marcotte, Daoli Zhu
An analytic center cutting plane method for pseudomonotone variational inequalities. Oper. Res. Lett. 20 (1) (1997)
Jean-Louis Goffin, Jacek Gondzio, Robert Sarkissian, Jean-Philippe Vial
Solving nonlinear multicommodity flow problems by the analytic center cutting plane method. Math. Program. 76 (1996)
Jean-Louis Goffin, Zhi-Quan Luo, Yinyu Ye
Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems. SIAM J. Optim. 6 (3) (1996)
Olivier Bahn, Olivier du Merle, Jean-Louis Goffin, Jean-Philippe Vial
A cutting plane method from analytic centers for stochastic programming. Math. Program. 69 (1995)
Jean-Louis Goffin, Jean-Philippe Vial
Short Steps with Karmarkar's Projective Algorithm for Linear Programming. SIAM J. Optim. 4 (1) (1994)
Olivier Bahn, Jean-Louis Goffin, Jean-Philippe Vial, Olivier du Merle
Experimental Behavior of an Interior Point Cutting Plane Algorithm for Convex Programming: An Application to Geometric Programming. Discret. Appl. Math. 49 (1-3) (1994)
Jean-Louis Goffin, Jean-Philippe Vial
On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm. Math. Program. 60 (1993)
Jean-Louis Goffin
Variable metric relaxation methods, part II: The ellipsoid method. Math. Program. 30 (2) (1984)
Jean-Louis Goffin
Convergence Rates of the Ellipsoid Method on General Convex Functions. Math. Oper. Res. 8 (1) (1983)
Jean-Louis Goffin
Convergence of a cyclic ellipsoid algorithm for systems of linear equalities. Math. Program. 22 (1) (1982)
Jean-Louis Goffin
On the non-polynomiality of the relaxation method for systems of linear inequalities. Math. Program. 22 (1) (1982)
Jean-Louis Goffin
The Relaxation Method for Solving Systems of Linear Inequalities. Math. Oper. Res. 5 (3) (1980)
Jean-Louis Goffin
On convergence rates of subgradient optimization methods. Math. Program. 13 (1) (1977)
Jean-Louis Goffin, Alain Haurie
Necessary Conditions and Sufficient Conditions for Pareto Optimality in a Multicriterion Perturbed System. Optimization Techniques (1973)