Vial J.-P.

J.-P. Vial

Information about the author J.-P. Vial will soon be added to the site.
Found 13 papers in total
Solving large-scale linear multicommodity flow problems with an active set strategy and proximal-analytic center cutting-plane method
Solving large-scale linear multicommodity flow problems with an active set strategy and proximal-analytic center cutting-plane method
2006
In this paper, we propose to solve the linear multicommodity flow problem using a...
Warm start and ϵ-subgradients in a cutting plane scheme for black-angular linear programs
Warm start and ϵ-subgradients in a cutting plane scheme for black-angular linear programs
1999
This paper addresses the issues involved with an interior point-based decomposition...
On improvements to the analytic center cutting plane method
On improvements to the analytic center cutting plane method
1998
In this paper, we explore a weakness of a specific implementation of the analytic...
A two-cut approach in the analytic center cutting plane method
A two-cut approach in the analytic center cutting plane method
1999
We analyze the two cut generation scheme in the analytic center cutting plane method....
Shallow, deep and very deep cuts in the analytic center cutting plane method
Shallow, deep and very deep cuts in the analytic center cutting plane method
1999
The analytic center cutting plane (ACCPM) methods aims to solve nondifferentiable...
Using an interior point method for the master problem in a decomposition approach
Using an interior point method for the master problem in a decomposition approach
1997
We address some of the issues that arise when an interior point method is used to...
ACCPM – A library for convex optimization based on an analytic center cutting plane method
ACCPM – A library for convex optimization based on an analytic center cutting plane method
1996
A software review.
A path-following version of the Todd–Burrell procedure for linear progamming
A path-following version of the Todd–Burrell procedure for linear progamming
1997
We propose a path-following version of the Todd–Burrell procedure to solve...
Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
1997
The paper deals with nonlinear multicommodity flow problems with convex costs. A...
Long-step primal-dual target-following algorithms for linear programming
Long-step primal-dual target-following algorithms for linear programming
1996
In this paper the authors propose a long-step target-following methodology for linear...
A cutting plane method from analytic centers for stochastic programming
A cutting plane method from analytic centers for stochastic programming
1995
The stochastic linear programming problem with recourse has a dual block-angular...
Todd’s low-complexity algorithm is a predictor-corrector path-following method
Todd’s low-complexity algorithm is a predictor-corrector path-following method
1992
The authors show that Todd’s low-complexity algorithm for linear programming...
A projective algorithm for linear programming with no regularity condition
A projective algorithm for linear programming with no regularity condition
1992
The combined phase I-phase II projective algorithm of de Ghellinck and Vial solves any...
Papers per page: