2009 |
12 | EE | Samir Elhedhli,
Jean-Louis Goffin,
Jean-Philippe Vial:
Nondifferentiable Optimization.
Encyclopedia of Optimization 2009: 2584-2590 |
11 | EE | Samir Elhedhli,
Jean-Louis Goffin,
Jean-Philippe Vial:
Nondifferentiable Optimization: Cutting Plane Methods.
Encyclopedia of Optimization 2009: 2590-2595 |
2008 |
10 | EE | Yu. Nesterov,
Jean-Philippe Vial:
Confidence level solutions for stochastic programming.
Automatica 44(6): 1559-1568 (2008) |
9 | EE | J. Thénié,
Jean-Philippe Vial:
Step decision rules for multistage stochastic programming: A heuristic approach.
Automatica 44(6): 1569-1584 (2008) |
2004 |
8 | EE | Claude Tadonki,
Jean-Philippe Vial:
Efficient Algorithm for Linear Pattern Separation.
International Conference on Computational Science 2004: 679-682 |
7 | EE | Yu. Nesterov,
Jean-Philippe Vial:
Augmented self-concordant barriers and nonlinear optimization problems with finite complexity.
Math. Program. 99(1): 149-174 (2004) |
1996 |
6 | | 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: 131-154 (1996) |
1995 |
5 | | O. Bahn,
O. Du Merle,
Jean-Louis Goffin,
Jean-Philippe Vial:
A cutting plane method from analytic centers for stochastic programming.
Math. Program. 69: 45-73 (1995) |
1994 |
4 | | O. Bahn,
Jean-Louis Goffin,
Jean-Philippe Vial,
O. Du Merle:
Experimental Behavior of an Interior Point Cutting Plane Algorithm for Convex Programming: An Application to Geometric Programming.
Discrete Applied Mathematics 49(1-3): 3-23 (1994) |
1993 |
3 | | Jean-Louis Goffin,
Jean-Philippe Vial:
On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm.
Math. Program. 60: 81-92 (1993) |
1992 |
2 | | Kees Roos,
Jean-Philippe Vial:
A polynomial method of approximate centers for linear programming.
Math. Program. 54: 295-305 (1992) |
1986 |
1 | | Guy de Ghellinck,
Jean-Philippe Vial:
A Polynomial Newton Method for Linear Programming.
Algorithmica 1(4): 425-453 (1986) |