Fault secure multiple-valued logic networks. - James E. Smith; Jean-Pierre Dussault (MVL, 1978)

A high level synthesis tool for MOS chip design. - Jean-Pierre Dussault; Chi-Chang Liaw; Michael M. Tong (DAC, 1984)

Convex quadratic programming with one constraint and bounded variables. - Jean-Pierre Dussault; Jacques A. Ferland; Bernard Lemaire (Math. Program., 1986)

A two parameter mixed interior-exterior penalty algorithm. - Abdelhamid Benchakroun; Jean-Pierre Dussault; Abdelatif Mansouri (Math. Methods Oper. Res., 1995)

Unification of basic and composite nondifferentiable optimization. - Jean-Pierre Dussault; Youssou Gningue (Math. Program., 1995)

Combining the Stochastic Counterpart and Stochastic Approximation Methods. - Jean-Pierre Dussault; Donald Labrecque; Pierre L'Ecuyer; Reuven Y. Rubinstein (Discret. Event Dyn. Syst., 1997)

On the Superlinear Convergence Order of the Logarithmic Barrier Algorithm. - Jean-Pierre Dussault; Abdellatif Elafia (Comput. Optim. Appl., 2001)

Augmented non-quadratic penalty algorithms. - Jean-Pierre Dussault (Math. Program., 2004)

Optimization of a Billiard Player - Position Play. - Jean-Pierre Dussault; Jean-François Landry (ACG, 2006)

Optimization of a Billiard Player - Tactical Play. - Jean-Pierre Dussault; Jean-François Landry (Computers and Games, 2006)

A smoothing heuristic for a bilevel pricing problem. - Jean-Pierre Dussault; Patrice Marcotte; Sébastien Roch; Gilles Savard (Eur. J. Oper. Res., 2006)

Robust descent in differentiable optimization using automatic finite differences. - Jean-Pierre Dussault; Benoit Hamelin (Optim. Methods Softw., 2006)

AI Optimization of a Billiard Player. - Jean-François Landry; Jean-Pierre Dussault (J. Intell. Robotic Syst., 2007)

Iterative CT reconstruction of real data with metal artifact reduction. - Benoit Hamelin; Yves Goussard; David Gendron; Jean-Pierre Dussault; Guy Cloutier; Gilles Beaudoin; Gilles Soulez (ISBI, 2008)

Asymptotic analysis of the trajectories of the logarithmic barrier algorithm without constraint qualifications. - Abdellatif El Afia; Abdelhamid Benchakroun; Jean-Pierre Dussault; Khalid El Yassini (RAIRO Oper. Res., 2008)

La différentiation automatique et son utilisation en optimisation. - Jean-Pierre Dussault (RAIRO Oper. Res., 2008)

Improved convergence order for augmented penalty algorithms. - Jean-Pierre Dussault (Comput. Optim. Appl., 2009)

A New Regularization Scheme for Mathematical Programs with Complementarity Constraints. - Abdeslam Kadrani; Jean-Pierre Dussault; Abdelhamid Benchakroun (SIAM J. Optim., 2009)

Comparison of optimization techniques for regularized statistical reconstruction in X-ray tomography. - Benoit Hamelin; Yves Goussard; Jean-Pierre Dussault (IPTA, 2010)

Billiards: an optimization challenge. - Jean-François Landry; Jean-Pierre Dussault; Philippe Mahey (C3S2E, 2011)

Improved asymptotic analysis for SUMT methods. - Jean-Pierre Dussault (FedCSIS, 2011)

Local path-following property of inexact interior methods in nonlinear programming. - Paul Armand; Joël Benoist; Jean-Pierre Dussault (Comput. Optim. Appl., 2012)

A robust controller for a two-layered approach applied to the game of billiards. - Jean-François Landry; Jean-Pierre Dussault; Philippe Mahey (Entertain. Comput., 2012)

The Chebyshev-Shamanskii Method for Solving Systems of Nonlinear Equations. - Bilel Kchouk; Jean-Pierre Dussault (J. Optim. Theory Appl., 2013)

A Heuristic-Based Planner and Improved Controller for a Two-Layered Approach for the Game of Billiards. - Jean-François Landry; Jean-Pierre Dussault; Philippe Mahey (IEEE Trans. Comput. Intell. AI Games, 2013)

On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians. - Bilel Kchouk; Jean-Pierre Dussault (Numer. Algorithms, 2014)

A new family of high-order directions for unconstrained optimization inspired by Chebyshev and Shamanskii methods. - Bilel Kchouk; Jean-Pierre Dussault (Optim. Methods Softw., 2014)

Improvements to the Linear Optimization Models of Patrol Scheduling for Mobile Targets. - Jean-François Landry; Jean-Pierre Dussault; Eric Beaudry (Canadian AI, 2015)

A globally convergent algorithm for MPCC. - Abdeslam Kadrani; Jean-Pierre Dussault; Abdelhamid Benchakroun (EURO J. Comput. Optim., 2015)

Revisiting motion compensation models in PET image reconstruction. - Maxime Toussaint; Jean-Pierre Dussault; Roger Lecomte (ISBI, 2016)

A Straight Approach to Planning for 14.1 Billiards. - Jean-François Landry; Jean-Pierre Dussault; Eric Beaudry (IEEE Trans. Comput. Intell. AI Games, 2016)

A note on robust descent in differentiable optimization. - Jean-Pierre Dussault (Oper. Res. Lett., 2017)

Convergence properties of a first order regularized-penalized method for MPCC. - Abdeslam Kadrani; Jean-Pierre Dussault; Hicham Azizi (LOPAL, 2018)

ARCq: a new adaptive regularization by cubics. - Jean-Pierre Dussault (Optim. Methods Softw., 2018)

A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem. - Jean-Pierre Dussault; Mathieu Frappier; Jean Charles Gilbert (EURO J. Comput. Optim., 2019)

A Unified Efficient Implementation of Trust-region Type Algorithms for Unconstrained Optimization. - Jean-Pierre Dussault (INFOR Inf. Syst. Oper. Res., 2020)

On Approximate Stationary Points of the Regularized Mathematical Program with Complementarity Constraints. - Jean-Pierre Dussault; Mounir Haddou; Abdeslam Kadrani; Tangi Migot (J. Optim. Theory Appl., 2020)

Exact computation of an error bound for the balanced linear complementarity problem with unique solution. - Jean-Pierre Dussault; Jean Charles Gilbert (Math. Program., 2023)

Scalable adaptive cubic regularization methods. - Jean-Pierre Dussault; Tangi Migot; Dominique Orban (Math. Program., 2024)

On the B-differential of the componentwise minimum of two affine vector functions. - Jean-Pierre Dussault; Jean Charles Gilbert; Baptiste Plaquevent-Jourdain (Math. Program. Comput., 2025)