default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDominique Orban
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j48]Jean-Pierre Dussault, Tangi Migot, Dominique Orban
:
Scalable adaptive cubic regularization methods. Math. Program. 207(1): 191-225 (2024)- [j47]Aleksandr Y. Aravkin, Robert J. Baraldi, Dominique Orban:
A Levenberg-Marquardt Method for Nonsmooth Regularized Least Squares. SIAM J. Sci. Comput. 46(4): 2557- (2024) - [i20]João Sousa Pinto, Dominique Orban:
Primal-Dual iLQR. CoRR abs/2403.00748 (2024) - [i19]Na Huang, Yu-Hong Dai, Dominique Orban, Michael A. Saunders:
An inexact augmented Lagrangian algorithm for unsymmetric saddle-point systems. CoRR abs/2404.14636 (2024) - [i18]João Sousa Pinto, Dominique Orban:
An efficient algorithm for solving linear equality-constrained LQR problems. CoRR abs/2407.05433 (2024) - [i17]Youssef Diouane, Mohamed Laghdaf Habiboullah, Dominique Orban:
A Proximal Modified Quasi-Newton Method for Nonsmooth Regularized Optimization. CoRR abs/2409.19428 (2024) - [i16]Youssef Diouane, Selime Gürol, Oussama Mouhtal, Dominique Orban:
An Efficient Scaled spectral preconditioner for sequences of symmetric positive definite linear systems. CoRR abs/2410.02204 (2024) - 2023
- [j46]Alexis Montoison, Dominique Orban:
Krylov.jl: A Julia basket of hand-picked Krylov methods. J. Open Source Softw. 8(90): 5187 (2023) - [j45]Na Huang, Yu-Hong Dai, Dominique Orban, Michael A. Saunders:
Properties of semi-conjugate gradient methods for solving unsymmetric positive definite linear systems. Optim. Methods Softw. 38(5): 887-913 (2023) - [j44]Alexis Montoison, Dominique Orban:
GPMR: An Iterative Method for Unsymmetric Partitioned Linear Systems. SIAM J. Matrix Anal. Appl. 44(1): 293-311 (2023) - [j43]Na Huang, Yu-Hong Dai, Dominique Orban, Michael A. Saunders:
On GSOR, the Generalized Successive Overrelaxation Method for Double Saddle-Point Problems. SIAM J. Sci. Comput. 45(5): 2185- (2023) - [i15]Aleksandr Y. Aravkin, Robert J. Baraldi, Dominique Orban:
A Levenberg-Marquardt Method for Nonsmooth Regularized Least Squares. CoRR abs/2301.02347 (2023) - [i14]Alexis Montoison, Dominique Orban, Michael A. Saunders:
MinAres: An Iterative Solver for Symmetric Linear Systems. CoRR abs/2310.01757 (2023) - 2022
- [j42]Tangi Migot, Dominique Orban, Abel Soares Siqueira:
DCISolver.jl: A Julia Solver for Nonlinear Optimization using Dynamic Control of Infeasibility. J. Open Source Softw. 7(69): 3991 (2022) - [j41]Tangi Migot, Dominique Orban, Abel Soares Siqueira:
PDENLPModels.jl: An NLPModel API for Optimization Problems with PDE-Constraints. J. Open Source Softw. 7(80): 4736 (2022) - [j40]Alexandre Ghannad, Dominique Orban, Michael A. Saunders:
Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number. Optim. Methods Softw. 37(4): 1344-1369 (2022) - [j39]Aleksandr Y. Aravkin, Robert J. Baraldi, Dominique Orban:
A Proximal Quasi-Newton Trust-Region Method for Nonsmooth Regularized Optimization. SIAM J. Optim. 32(2): 900-929 (2022) - [i13]Dominique Orban:
Computing a Sparse Projection into a Box. CoRR abs/2204.05429 (2022) - [i12]Na Huang, Yu-Hong Dai, Dominique Orban, Michael A. Saunders:
A semi-conjugate gradient method for solving unsymmetric positive definite linear systems. CoRR abs/2206.02951 (2022) - [i11]Dounia Lakhmiri, Dominique Orban, Andrea Lodi:
A Stochastic Proximal Method for Nonsmooth Regularized Finite Sum Optimization. CoRR abs/2206.06531 (2022) - [i10]Na Huang, Yu-Hong Dai, Dominique Orban, Michael A. Saunders:
On GSOR, the Generalized Successive Overrelaxation Method for Double Saddle-Point Problems. CoRR abs/2208.07499 (2022) - 2021
- [j38]Daniela di Serafino, Dominique Orban:
Constraint-Preconditioned Krylov Solvers for Regularized Saddle-Point Systems. SIAM J. Sci. Comput. 43(2): A1001-A1026 (2021) - [j37]Alexis Montoison, Dominique Orban:
TriCG and TriMR: Two Iterative Methods for Symmetric Quasi-definite Systems. SIAM J. Sci. Comput. 43(4): A2502-A2525 (2021) - [i9]Ding Ma, Dominique Orban, Michael A. Saunders:
A Julia implementation of Algorithm NCL for constrained optimization. CoRR abs/2101.02164 (2021) - [i8]Alexis Montoison, Dominique Orban:
GPMR: An Iterative Method for Unsymmetric Partitioned Linear Systems. CoRR abs/2111.07007 (2021) - [i7]Sanae Lotfi, Tiphaine Bonniot de Ruisselet, Dominique Orban, Andrea Lodi:
Adaptive First- and Second-Order Algorithms for Large-Scale Machine Learning. CoRR abs/2111.14761 (2021) - 2020
- [j36]Dominique Orban, Abel Soares Siqueira:
A regularization method for constrained nonlinear least squares. Comput. Optim. Appl. 76(3): 961-989 (2020) - [j35]Mohsen Dehghani, Andrew Lambe, Dominique Orban:
A regularized interior-point method for constrained linear least squares. INFOR Inf. Syst. Oper. Res. 58(2): 202-224 (2020) - [j34]Alexis Montoison, Dominique Orban:
BiLQ: An Iterative Method for Nonsymmetric Linear Systems with a Quasi-Minimum Error Property. SIAM J. Matrix Anal. Appl. 41(3): 1145-1166 (2020) - [j33]Ron Estrin, Michael P. Friedlander, Dominique Orban, Michael A. Saunders:
Implementing a Smooth Exact Penalty Function for Equality-Constrained Nonlinear Optimization. SIAM J. Sci. Comput. 42(3): A1809-A1835 (2020) - [j32]Ron Estrin, Michael P. Friedlander, Dominique Orban, Michael A. Saunders:
Implementing a Smooth Exact Penalty Function for General Constrained Nonlinear Optimization. SIAM J. Sci. Comput. 42(3): A1836-A1859 (2020) - [i6]Alexis Montoison, Dominique Orban:
TriCG and TriMR: Two Iterative Methods for Symmetric Quasi-Definite Systems. CoRR abs/2008.12863 (2020) - [i5]Sanae Lotfi, Tiphaine Bonniot de Ruisselet, Dominique Orban, Andrea Lodi:
Stochastic Damped L-BFGS with Controlled Norm of the Hessian Approximation. CoRR abs/2012.05783 (2020)
2010 – 2019
- 2019
- [j31]Marie-Ange Dahito, Dominique Orban:
The Conjugate Residual Method in Linesearch and Trust-Region Methods. SIAM J. Optim. 29(3): 1988-2025 (2019) - [j30]Ron Estrin, Dominique Orban, Michael A. Saunders:
Euclidean-Norm Error Bounds for SYMMLQ and CG. SIAM J. Matrix Anal. Appl. 40(1): 235-253 (2019) - [j29]Ron Estrin, Dominique Orban, Michael A. Saunders:
LSLQ: An Iterative Method for Linear Least-Squares with an Error Minimization Property. SIAM J. Matrix Anal. Appl. 40(1): 254-275 (2019) - [j28]Ron Estrin, Dominique Orban, Michael A. Saunders:
LNLQ: An Iterative Method for Least-Norm Problems with an Error Minimization Property. SIAM J. Matrix Anal. Appl. 40(3): 1102-1124 (2019) - [j27]Alfredo Buttari, Dominique Orban, Daniel Ruiz, David Titley-Péloquin:
A Tridiagonalization Method for Symmetric Saddle-Point Systems. SIAM J. Sci. Comput. 41(5): S409-S432 (2019) - [i4]Daniela di Serafino, Dominique Orban:
Constraint-Preconditioned Krylov Solvers for Regularized Saddle-Point Systems. CoRR abs/1910.02552 (2019) - [i3]Alexis Montoison, Dominique Orban:
BiLQ: An Iterative Method for Nonsymmetric Linear Systems with a Quasi-Minimum Error Property. CoRR abs/1910.02598 (2019) - [i2]Ron Estrin, Michael P. Friedlander, Dominique Orban, Michael A. Saunders:
Implementing a smooth exact penalty function for equality-constrained nonlinear optimization. CoRR abs/1910.04300 (2019) - [i1]Ron Estrin, Michael P. Friedlander, Dominique Orban, Michael A. Saunders:
Implementing a smooth exact penalty function for general constrained nonlinear optimization. CoRR abs/1912.02093 (2019) - 2018
- [j26]Sylvain Arreckx, Dominique Orban:
A Regularized Factorization-Free Method for Equality-Constrained Optimization. SIAM J. Optim. 28(2): 1613-1639 (2018) - 2017
- [j25]A. Dehghani, Jean-Louis Goffin, Dominique Orban:
A primal-dual regularized interior-point method for semidefinite programming. Optim. Methods Softw. 32(1): 193-219 (2017) - 2016
- [j24]Mehdi Towhidi, Dominique Orban:
Customizing the solution process of COIN-OR's linear solvers with Python. Math. Program. Comput. 8(4): 377-391 (2016) - 2015
- [j23]Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint:
CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization. Comput. Optim. Appl. 60(3): 545-557 (2015) - [j22]Dominique Orban:
Limited-memory LDL⊤ factorization of symmetric quasi-definite matrices with application to constrained optimization. Numer. Algorithms 70(1): 9-41 (2015) - 2014
- [j21]Charles Audet, Kien-Cong Dang, Dominique Orban:
Optimization of algorithms with OPAL. Math. Program. Comput. 6(3): 233-254 (2014) - [j20]Chen Greif, Erin Moulding, Dominique Orban:
Bounds on Eigenvalues of Matrices Arising from Interior-Point Methods. SIAM J. Optim. 24(1): 49-83 (2014) - [j19]Nicholas I. M. Gould, Dominique Orban, Tyrone Rees:
Projected Krylov Methods for Saddle-Point Systems. SIAM J. Matrix Anal. Appl. 35(4): 1329-1343 (2014) - 2013
- [j18]Nicholas I. M. Gould, Dominique Orban, Daniel P. Robinson:
Trajectory-following methods for large-scale degenerate convex quadratic programming. Math. Program. Comput. 5(2): 113-142 (2013) - [j17]Charles Audet, Cong-Kien Dang, Dominique Orban:
Efficient use of parallelism in algorithmic parameter optimization applications. Optim. Lett. 7(3): 421-433 (2013) - [j16]Paul Armand, Joël Benoist, Dominique Orban:
From global to local convergence of interior methods for nonlinear optimization. Optim. Methods Softw. 28(5): 1051-1080 (2013) - 2012
- [j15]Michael P. Friedlander, Dominique Orban:
A primal-dual regularized interior-point method for convex quadratic programs. Math. Program. Comput. 4(1): 71-107 (2012) - [j14]Zoumana Coulibaly, Dominique Orban:
An 1 Elastic Interior-Point Method for Mathematical Programs with Complementarity Constraints. SIAM J. Optim. 22(1): 187-211 (2012) - 2010
- [j13]Robert Fourer, Dominique Orban:
DrAmpl: a meta solver for optimization problem analysis. Comput. Manag. Sci. 7(4): 437-463 (2010) - [j12]Vincent Raymond, François Soumis, Dominique Orban:
A new version of the Improved Primal Simplex for degenerate linear programs. Comput. Oper. Res. 37(1): 91-98 (2010) - [j11]Robert Fourer, Chandrakant Maheshwari, Arnold Neumaier, Dominique Orban, Hermann Schichl:
Convexity and Concavity Detection in Computational Graphs: Tree Walks for Convexity Assessment. INFORMS J. Comput. 22(1): 26-43 (2010) - [p1]Charles Audet, Cong-Kien Dang, Dominique Orban:
Algorithmic Parameter Optimization of the DFO Method with the OPAL Framework. Software Automatic Tuning, From Concepts to State-of-the-Art Results 2010: 255-274
2000 – 2009
- 2008
- [j10]Paul Armand, Joël Benoist, Dominique Orban:
Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming. Comput. Optim. Appl. 41(1): 1-25 (2008) - 2006
- [j9]Richard A. Waltz, José Luis Morales, Jorge Nocedal, Dominique Orban:
An interior algorithm for nonlinear optimization that combines line search and trust region steps. Math. Program. 107(3): 391-408 (2006) - [j8]Charles Audet, Dominique Orban:
Finding Optimal Algorithmic Parameters Using Derivative-Free Optimization. SIAM J. Optim. 17(3): 642-664 (2006) - 2005
- [j7]Nicholas I. M. Gould, Dominique Orban, Annick Sartenaer, Philippe L. Toint:
Sensitivity of trust-region algorithms to their parameters. 4OR 3(3): 227-241 (2005) - 2003
- [j6]Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint:
GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization. ACM Trans. Math. Softw. 29(4): 353-372 (2003) - [j5]Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint:
CUTEr and SifDec: A constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. 29(4): 373-394 (2003) - 2002
- [j4]Stephen J. Wright, Dominique Orban:
Properties of the Log-Barrier Function on Degenerate Nonlinear Programs. Math. Oper. Res. 27(3): 585-613 (2002) - [j3]Nicholas I. M. Gould, Dominique Orban, Annick Sartenaer, Philippe L. Toint:
Componentwise fast convergence in the solution of full-rank systems of nonlinear equations. Math. Program. 92(3): 481-508 (2002) - 2001
- [j2]Nicholas I. M. Gould, Dominique Orban, Annick Sartenaer, Philippe L. Toint:
Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming. SIAM J. Optim. 11(4): 974-1002 (2001) - 2000
- [j1]Andrew R. Conn, Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint:
A primal-dual trust-region algorithm for non-convex nonlinear programming. Math. Program. 87(2): 215-249 (2000)
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-11-08 20:28 CET 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:
