Publications
  1. Dussault, Jean-Pierre and Hamelin, Benoit, Implementation of High order Newton Algorithms (2004).
  2. Dussault, Jean-Pierre, High order Newton-penalty algorithms (2003).
  3. Dussault, Jean-Pierre and Hamelin, Benoit, Robust descent in differentiable optimization using automatic finite differences Technical report #301, Département de Mathématiques et d'Informatique, Faculté des Sciences, Université de Sherbrooke (2003).
  4. Dussault, J.-P., Improved convergence order for augmented penalty algorithms, (2003)
  5. Dussault, J.-P., Augmented  non-quadratic penalty algorithms,(2003)
  6. Elafia, A., Benchakroun, A., Dussault, J.-P.,Asymptotic analysis of the trajectories of the logarithmic barrier algorithm without differentiable objective function (2003)
  7. Elafia, A., Benchakroun, A., Dussault, J.-P., Asymptotic analysis of the trajectories of the logarithmic barrier algorithm without constraint qualifications(2003)
  8. Dussault, J.-P., Guèye, O. M., Mahey, P. Separable Augmented Lagrangian Algorithm with Multidimensional scaling for monotropic programming(2003)
  9. Dussault, J.-P., Guèye, O. M., Mahey, P. Numerical behavior of Separable Augmented Lagrangian Algorithm with Multidimensional scaling on the  convex multicommodity flow problems(2003)
  10. Dussault, J.-P., Convergence of implementable descent algorithms for unconstrained optimization, J.O.T.A.104(3): 739-745; Mar 2000.
  11. Dussault, J.-P., Elafia, A., On the convergence rate of the logarithmic barrier algorithm, Computational Optimization And Applications, Vol 19 No1, April 2001, pp 31-54.
  12. Egli, R., Dussault, J.-P.,  Technique butterfly généralisée, CORESA 2001, Dijon.
  13. Mahey, Ph., Dussault, J.-P.,  Hamdi, A, Adaptative scaling and convergence rates of a separable augmented Lagrangian algorithm in  Optimization, Nguyen, Strodiot, Tossings, Editors, Lecture Notes in Economics and Mathematical systems, vol 481 (2000), pp 278-287.
  14. Dussault, J.-P., Hai Shen, Bandrauk, A. Penalty methods in Hilbert spaces.
  15. Dussault, J.-P., Analysis of line rasterization with applications to polygon filling and Gouraud shaded Z-buffer.
  16. Dussault, J.-P., Analyse de trajectoires pour l'algorithme de barrière logarithmique.
  17. Dussault, J.-P., Pfister, Nicolas,  Modelization of flexible objects using constained optimization and B-spline surfaces dans les comptes-rendus des ateliers sur les fonctions splines et ondelettes, Centre de recherche mathématique, Université de Montréal (janvier 1996).
  18. Benchakroun, A., Dussault, J.-P., Mansouri, A., Un algorithme de point intérieur pour un problème de programmation nonlinéaire, INFOR35(3), août 1997.
  19. Dussault, J.-P., Labrecque,D., L'Ecuyer, P., Rubinstein, R.Y. Combining the Stochastic Counterpart and Stochastic Approximation Methods, Discrete Event Dynamic Systems: Theory and Applications.
  20. Dussault, J.-P., Augmented penalty algorithms, IMA Journal on Numerical Analysis, 18 1998.
  21. Hamdi, A, Mahey, Ph., Dussault, J.-P., A new decomposition method in nonconvex programming via separable augmented Lagrangians, in Recent advances in Optimization, Gritzmann, Horst, Sachs and Tichatschke, Editors, Lecture Notes in Economics and Mathematical systems, vol 452 (1997), pp 90-104.
  22. Dussault, J.-P., Numerical stability and efficiency of penalty algorithms, S.I.A.M. Journal on Numerical AnalysisVol. 32, No. 1, pp 296--317 , Fev. 1995.
  23. Benchakroun, A., Dussault, J.-P., Mansouri, A., A two-parameter mixed interior-exterior penalty algorithm, Z.O.R. Vol. 41 No. 1, 1995, pp 25 --55.
  24. Dussault, J.-P., Gningue, Y., Unification of basic and composite nondifferentiable optimization, Math. Prog 70 (1995) 233-249.
  25. Cominetti, R., Dussault, J.-P., A stable exponential penalty algorithm with superlinear convergence, J.O.T.A.Vol. 83 No. 2, Nov. 1994.
  26. Hai Shen, Dussault, J.-P.& Bandrauk, A. Optimal Pulse Shaping for Coherent Control by the Penalty Algorithm Chem. Phys. Lett (1994).
  27. Benchakroun, A., Dussault, J.-P., Mansouri, A., Pénalités mixtes: un algorithme superlinéairement convergent en deux étapes, R.A.I.R.O. recherche opérationnelle Vol 27 No 4, Déc. 1993.
  28. Dussault, J.-P., Fournier, G., On the convergence of the projected gradient method, J.O.T.A., Vol. 77 No. 1, avril 1993.
  29. Dussault. J.-P., Contraintes actives dans les inéquations variationnelles,Revista latino-ibero-americana de investigaciòn operativa Vol 3 No 2-3 Août-Déc 1993.
  30. Dussault, J.-P., Marcotte, P., A Sequential linear programming algorithmfor solving monotone Variational Inequalites, S.I.A.M. Journal on Control & Optimization, Vol. 27, Nov. 1989.
  31. Dussault, J.-P., Marcotte, P., Conditions de régularité pour les inéquations variationnelles, R.A.I.R.O. recherche opérationnelle, Janvier 1989.
  32. Dussault, J.-P., Marcotte, P., A note on a globally convergent Newton method for solving monotone variational inequalities, O.R. Letters, Vol. 6, No. 1, march 1987 pp 35-42.
  33. Dussault, J.-P., Ferland, J., Lemaire, B., Convex Quadratic Programming with one Constraint and Bounded Variables, Math. Prog., 1986.
  34. Withold Brostow, Jean-Pierre Dussault, and Bennett L. Fox. Construction of Voronoi Polyhedra. Journal of Computational Physics, 29:81--92, 1978.

Notes de cours


 

Acétates de conférences






Le contenu de cette page est la responsabilité de son auteur et n'engage en rien l'Université de Sherbrooke.