Jean-Louis Goffin

According to our database1, Jean-Louis Goffin authored at least 33 papers between 1973 and 2009.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2009
Nondifferentiable Optimization: Cutting Plane Methods.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Nondifferentiable Optimization.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

2007
A matrix generation approach for eigenvalue optimization.
Math. Program., 2007

2005
Exact solution of the centralized network design problem on directed graphs.
Networks, 2005

An Interior Point Cutting Plane Method for the Convex Feasibility Problem with Second-Order Cone Inequalities.
Math. Oper. Res., 2005

Efficient Production-Distribution System Design.
Manag. Sci., 2005

The Analytic-Center Cutting-Plane Method for Variational Inequalities: A Quadratic-Cut Approach.
INFORMS J. Comput., 2005

2004
The integration of an interior-point cutting plane method within a branch-and-price algorithm.
Math. Program., 2004

Solving variational inequalities with a quadratic cut method: a primal-dual, Jacobian-free approach.
Comput. Oper. Res., 2004

2003
The Analytic Center Cutting Plane Method with Semidefinite Cuts.
SIAM J. Optim., 2003

2002
Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method.
Optim. Methods Softw., 2002

An analytic center quadratic cut method for the convex quadratic feasibility problem.
Math. Program., 2002

2000
Multiple Cuts in the Analytic Center Cutting Plane Method.
SIAM J. Optim., 2000

1999
Shallow, deep and very deep cuts in the analytic center cutting plane method.
Math. Program., 1999

Convergence of a simple subgradient level method.
Math. Program., 1999

A two-cut approach in the analytic center cutting plane method.
Math. Methods Oper. Res., 1999

On a Primal-Dual Analytic Center Cutting Plane Method for Variational Inequalities.
Comput. Optim. Appl., 1999

1998
A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems.
SIAM J. Optim., 1998

On Improvements to the Analytic Center Cutting Plane Method.
Comput. Optim. Appl., 1998

1997
An analytic center cutting plane method for pseudomonotone variational inequalities.
Oper. Res. Lett., 1997

1996
Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems.
SIAM J. Optim., 1996

Solving nonlinear multicommodity flow problems by the analytic center cutting plane method.
Math. Program., 1996

1995
A cutting plane method from analytic centers for stochastic programming.
Math. Program., 1995

1994
Short Steps with Karmarkar's Projective Algorithm for Linear Programming.
SIAM J. Optim., 1994

Experimental Behavior of an Interior Point Cutting Plane Algorithm for Convex Programming: An Application to Geometric Programming.
Discret. Appl. Math., 1994

1993
On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm.
Math. Program., 1993

1984
Variable metric relaxation methods, part II: The ellipsoid method.
Math. Program., 1984

1983
Convergence Rates of the Ellipsoid Method on General Convex Functions.
Math. Oper. Res., 1983

1982
Convergence of a cyclic ellipsoid algorithm for systems of linear equalities.
Math. Program., 1982

On the non-polynomiality of the relaxation method for systems of linear inequalities.
Math. Program., 1982

1980
The Relaxation Method for Solving Systems of Linear Inequalities.
Math. Oper. Res., 1980

1977
On convergence rates of subgradient optimization methods.
Math. Program., 1977

1973
Necessary Conditions and Sufficient Conditions for Pareto Optimality in a Multicriterion Perturbed System.
Proceedings of the 5th Conference on Optimization Techniques, 1973


  Loading...