default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJean-Pierre Dussault
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j28]Jean-Pierre Dussault, Tangi Migot, Dominique Orban
:
Scalable adaptive cubic regularization methods. Math. Program. 207(1): 191-225 (2024)- 2023
- [j27]Jean-Pierre Dussault, Jean Charles Gilbert:
Exact computation of an error bound for the balanced linear complementarity problem with unique solution. Math. Program. 199(1): 1221-1238 (2023) - 2020
- [j26]Jean-Pierre Dussault:
A Unified Efficient Implementation of Trust-region Type Algorithms for Unconstrained Optimization. INFOR Inf. Syst. Oper. Res. 58(2): 290-309 (2020) - [j25]Jean-Pierre Dussault, Mounir Haddou, Abdeslam Kadrani, Tangi Migot:
On Approximate Stationary Points of the Regularized Mathematical Program with Complementarity Constraints. J. Optim. Theory Appl. 186(2): 504-522 (2020)
2010 – 2019
- 2019
- [j24]Jean-Pierre Dussault, Mathieu Frappier, Jean Charles Gilbert:
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. EURO J. Comput. Optim. 7(4): 359-380 (2019) - 2018
- [j23]Jean-Pierre Dussault:
ARCq: a new adaptive regularization by cubics. Optim. Methods Softw. 33(2): 322-335 (2018) - [c11]Abdeslam Kadrani, Jean-Pierre Dussault, Hicham Azizi:
Convergence properties of a first order regularized-penalized method for MPCC. LOPAL 2018: 12:1-12:6 - 2017
- [j22]Jean-Pierre Dussault:
A note on robust descent in differentiable optimization. Oper. Res. Lett. 45(5): 530-532 (2017) - 2016
- [j21]Jean-François Landry, Jean-Pierre Dussault, Eric Beaudry:
A Straight Approach to Planning for 14.1 Billiards. IEEE Trans. Comput. Intell. AI Games 8(2): 203-208 (2016) - [c10]Maxime Toussaint, Jean-Pierre Dussault, Roger Lecomte:
Revisiting motion compensation models in PET image reconstruction. ISBI 2016: 90-94 - 2015
- [j20]Abdeslam Kadrani, Jean-Pierre Dussault, Abdelhamid Benchakroun:
A globally convergent algorithm for MPCC. EURO J. Comput. Optim. 3(3): 263-296 (2015) - [c9]Jean-François Landry, Jean-Pierre Dussault, Eric Beaudry:
Improvements to the Linear Optimization Models of Patrol Scheduling for Mobile Targets. Canadian AI 2015: 30-41 - 2014
- [j19]Bilel Kchouk, Jean-Pierre Dussault:
On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians. Numer. Algorithms 66(4): 885-909 (2014) - [j18]Bilel Kchouk, Jean-Pierre Dussault:
A new family of high-order directions for unconstrained optimization inspired by Chebyshev and Shamanskii methods. Optim. Methods Softw. 29(1): 68-87 (2014) - 2013
- [j17]Bilel Kchouk, Jean-Pierre Dussault:
The Chebyshev-Shamanskii Method for Solving Systems of Nonlinear Equations. J. Optim. Theory Appl. 157(1): 148-167 (2013) - [j16]Jean-François Landry, Jean-Pierre Dussault, Philippe Mahey:
A Heuristic-Based Planner and Improved Controller for a Two-Layered Approach for the Game of Billiards. IEEE Trans. Comput. Intell. AI Games 5(4): 325-336 (2013) - 2012
- [j15]Paul Armand, Joël Benoist, Jean-Pierre Dussault:
Local path-following property of inexact interior methods in nonlinear programming. Comput. Optim. Appl. 52(1): 209-238 (2012) - [j14]Jean-François Landry, Jean-Pierre Dussault, Philippe Mahey:
A robust controller for a two-layered approach applied to the game of billiards. Entertain. Comput. 3(3): 59-70 (2012) - 2011
- [c8]Jean-François Landry, Jean-Pierre Dussault, Philippe Mahey:
Billiards: an optimization challenge. C3S2E 2011: 129-132 - [c7]Jean-Pierre Dussault:
Improved asymptotic analysis for SUMT methods. FedCSIS 2011: 247-253 - 2010
- [c6]Benoit Hamelin, Yves Goussard, Jean-Pierre Dussault:
Comparison of optimization techniques for regularized statistical reconstruction in X-ray tomography. IPTA 2010: 87-91
2000 – 2009
- 2009
- [j13]Jean-Pierre Dussault:
Improved convergence order for augmented penalty algorithms. Comput. Optim. Appl. 44(3): 373-383 (2009) - [j12]Abdeslam Kadrani, Jean-Pierre Dussault, Abdelhamid Benchakroun:
A New Regularization Scheme for Mathematical Programs with Complementarity Constraints. SIAM J. Optim. 20(1): 78-103 (2009) - 2008
- [j11]Jean-Pierre Dussault:
La différentiation automatique et son utilisation en optimisation. RAIRO Oper. Res. 42(2): 141-155 (2008) - [j10]Abdellatif El Afia, Abdelhamid Benchakroun, Jean-Pierre Dussault, Khalid El Yassini:
Asymptotic analysis of the trajectories of the logarithmic barrier algorithm without constraint qualifications. RAIRO Oper. Res. 42(2): 157-198 (2008) - [c5]Benoit Hamelin, Yves Goussard, David Gendron, Jean-Pierre Dussault, Guy Cloutier, Gilles Beaudoin, Gilles Soulez:
Iterative CT reconstruction of real data with metal artifact reduction. ISBI 2008: 1453-1456 - 2007
- [j9]Jean-François Landry, Jean-Pierre Dussault:
AI Optimization of a Billiard Player. J. Intell. Robotic Syst. 50(4): 399-417 (2007) - 2006
- [j8]Jean-Pierre Dussault, Patrice Marcotte, Sébastien Roch, Gilles Savard:
A smoothing heuristic for a bilevel pricing problem. Eur. J. Oper. Res. 174(3): 1396-1413 (2006) - [j7]Jean-Pierre Dussault, Benoit Hamelin:
Robust descent in differentiable optimization using automatic finite differences. Optim. Methods Softw. 21(5): 769-777 (2006) - [c4]Jean-Pierre Dussault, Jean-François Landry:
Optimization of a Billiard Player - Position Play. ACG 2006: 263-272 - [c3]Jean-Pierre Dussault, Jean-François Landry:
Optimization of a Billiard Player - Tactical Play. Computers and Games 2006: 256-270 - 2004
- [j6]Jean-Pierre Dussault:
Augmented non-quadratic penalty algorithms. Math. Program. 99(3): 467-486 (2004) - 2001
- [j5]Jean-Pierre Dussault, Abdellatif Elafia:
On the Superlinear Convergence Order of the Logarithmic Barrier Algorithm. Comput. Optim. Appl. 19(1): 31-53 (2001)
1990 – 1999
- 1997
- [j4]Jean-Pierre Dussault, Donald Labrecque, Pierre L'Ecuyer, Reuven Y. Rubinstein:
Combining the Stochastic Counterpart and Stochastic Approximation Methods. Discret. Event Dyn. Syst. 7(1): 5-28 (1997) - 1995
- [j3]Abdelhamid Benchakroun, Jean-Pierre Dussault, Abdelatif Mansouri:
A two parameter mixed interior-exterior penalty algorithm. Math. Methods Oper. Res. 41(1): 25-55 (1995) - [j2]Jean-Pierre Dussault, Youssou Gningue:
Unification of basic and composite nondifferentiable optimization. Math. Program. 70: 233-249 (1995)
1980 – 1989
- 1986
- [j1]Jean-Pierre Dussault, Jacques A. Ferland, Bernard Lemaire:
Convex quadratic programming with one constraint and bounded variables. Math. Program. 36(1): 90-104 (1986) - 1984
- [c2]Jean-Pierre Dussault, Chi-Chang Liaw, Michael M. Tong:
A high level synthesis tool for MOS chip design. DAC 1984: 308-314
1970 – 1979
- 1978
- [c1]James E. Smith, Jean-Pierre Dussault:
Fault secure multiple-valued logic networks. MVL 1978: 287-297
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
