Jean-Louis Goffin

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