Dominique Orban

CoRR, 2024

2023

On GSOR, the Generalized Successive Overrelaxation Method for Double Saddle-Point Problems.

[BibT_eX]

[DOI]

SIAM J. Sci. Comput., October, 2023

Krylov.jl: A Julia basket of hand-picked Krylov methods.

[BibT_eX]

[DOI]

J. Open Source Softw., October, 2023

Properties of semi-conjugate gradient methods for solving unsymmetric positive definite linear systems.

[BibT_eX]

[DOI]

Optim. Methods Softw., September, 2023

GPMR: An Iterative Method for Unsymmetric Partitioned Linear Systems.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., March, 2023

MinAres: An Iterative Solver for Symmetric Linear Systems.

[BibT_eX]

[DOI]

CoRR, 2023

A Levenberg-Marquardt Method for Nonsmooth Regularized Least Squares.

[BibT_eX]

[DOI]

Aleksandr Y. Aravkin

Robert J. Baraldi

CoRR, 2023

2022

PDENLPModels.jl: An NLPModel API for Optimization Problems with PDE-Constraints.

[BibT_eX]

[DOI]

Tangi Migot

Abel Soares Siqueira

J. Open Source Softw., December, 2022

A Proximal Quasi-Newton Trust-Region Method for Nonsmooth Regularized Optimization.

[BibT_eX]

[DOI]

Aleksandr Y. Aravkin

Robert J. Baraldi

SIAM J. Optim., 2022

Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number.

[BibT_eX]

[DOI]

Alexandre Ghannad

Optim. Methods Softw., 2022

DCISolver.jl: A Julia Solver for Nonlinear Optimization using Dynamic Control of Infeasibility.

[BibT_eX]

[DOI]

Tangi Migot

Abel Soares Siqueira

J. Open Source Softw., 2022

A Stochastic Proximal Method for Nonsmooth Regularized Finite Sum Optimization.

[BibT_eX]

[DOI]

Dounia Lakhmiri

Andrea Lodi

CoRR, 2022

A semi-conjugate gradient method for solving unsymmetric positive definite linear systems.

[BibT_eX]

[DOI]

CoRR, 2022

Computing a Sparse Projection into a Box.

[BibT_eX]

[DOI]

CoRR, 2022

2021

Constraint-Preconditioned Krylov Solvers for Regularized Saddle-Point Systems.

[BibT_eX]

[DOI]

Daniela di Serafino

SIAM J. Sci. Comput., 2021

TriCG and TriMR: Two Iterative Methods for Symmetric Quasi-definite Systems.

[BibT_eX]

[DOI]

Tiphaine Bonniot de Ruisselet

SIAM J. Sci. Comput., 2021

Adaptive First- and Second-Order Algorithms for Large-Scale Machine Learning.

[BibT_eX]

[DOI]

Sanae Lotfi

Andrea Lodi

CoRR, 2021

A Julia implementation of Algorithm NCL for constrained optimization.

[BibT_eX]

[DOI]

Ding Ma

CoRR, 2021

2020

Implementing a Smooth Exact Penalty Function for General Constrained Nonlinear Optimization.

[BibT_eX]

[DOI]

Michael P. Friedlander

SIAM J. Sci. Comput., 2020

Implementing a Smooth Exact Penalty Function for Equality-Constrained Nonlinear Optimization.

[BibT_eX]

[DOI]

Michael P. Friedlander

SIAM J. Sci. Comput., 2020

BiLQ: An Iterative Method for Nonsymmetric Linear Systems with a Quasi-Minimum Error Property.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2020

A regularized interior-point method for constrained linear least squares.

[BibT_eX]

[DOI]

Mohsen Dehghani

Andrew Lambe

Tiphaine Bonniot de Ruisselet

INFOR Inf. Syst. Oper. Res., 2020

Stochastic Damped L-BFGS with Controlled Norm of the Hessian Approximation.

[BibT_eX]

[DOI]

Sanae Lotfi

Andrea Lodi

CoRR, 2020

A regularization method for constrained nonlinear least squares.

[BibT_eX]

[DOI]

Abel Soares Siqueira

Comput. Optim. Appl., 2020

2019

A Tridiagonalization Method for Symmetric Saddle-Point Systems.

[BibT_eX]

[DOI]

Alfredo Buttari

Daniel Ruiz

David Titley-Péloquin

SIAM J. Sci. Comput., 2019

LNLQ: An Iterative Method for Least-Norm Problems with an Error Minimization Property.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2019

LSLQ: An Iterative Method for Linear Least-Squares with an Error Minimization Property.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2019

Euclidean-Norm Error Bounds for SYMMLQ and CG.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2019

The Conjugate Residual Method in Linesearch and Trust-Region Methods.

[BibT_eX]

[DOI]

Marie-Ange Dahito

SIAM J. Optim., 2019

2018

A Regularized Factorization-Free Method for Equality-Constrained Optimization.

[BibT_eX]

[DOI]

Sylvain Arreckx

SIAM J. Optim., 2018

2017

A primal-dual regularized interior-point method for semidefinite programming.

[BibT_eX]

[DOI]

A. Dehghani

Jean-Louis Goffin

Optim. Methods Softw., 2017

2016

Customizing the solution process of COIN-OR's linear solvers with Python.

[BibT_eX]

[DOI]

Mehdi Towhidi

Math. Program. Comput., 2016

2015

Limited-memory LDL⊤ factorization of symmetric quasi-definite matrices with application to constrained optimization.

[BibT_eX]

[DOI]

Numer. Algorithms, 2015

CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization.

[BibT_eX]

[DOI]

Philippe L. Toint

Comput. Optim. Appl., 2015

2014

Projected Krylov Methods for Saddle-Point Systems.

[BibT_eX]

[DOI]

Tyrone Rees

SIAM J. Matrix Anal. Appl., 2014

Bounds on Eigenvalues of Matrices Arising from Interior-Point Methods.

[BibT_eX]

[DOI]

Chen Greif

Erin Moulding

SIAM J. Optim., 2014

Optimization of algorithms with OPAL.

[BibT_eX]

[DOI]

Kien-Cong Dang

Math. Program. Comput., 2014

2013

From global to local convergence of interior methods for nonlinear optimization.

[BibT_eX]

[DOI]

Paul Armand

Joël Benoist

Optim. Methods Softw., 2013

Efficient use of parallelism in algorithmic parameter optimization applications.

[BibT_eX]

[DOI]

Cong-Kien Dang

Optim. Lett., 2013

Trajectory-following methods for large-scale degenerate convex quadratic programming.

[BibT_eX]

[DOI]

Daniel P. Robinson

Math. Program. Comput., 2013

2012

An <sub>1</sub> Elastic Interior-Point Method for Mathematical Programs with Complementarity Constraints.

[BibT_eX]

[DOI]

Zoumana Coulibaly

SIAM J. Optim., 2012

A primal-dual regularized interior-point method for convex quadratic programs.

[BibT_eX]

[DOI]

Michael P. Friedlander

Math. Program. Comput., 2012

2010

Convexity and Concavity Detection in Computational Graphs: Tree Walks for Convexity Assessment.

[BibT_eX]

[DOI]

Robert Fourer

Chandrakant Maheshwari

Arnold Neumaier

Hermann Schichl

INFORMS J. Comput., 2010

A new version of the Improved Primal Simplex for degenerate linear programs.

[BibT_eX]

[DOI]

Vincent Raymond

François Soumis

Comput. Oper. Res., 2010

DrAmpl: a meta solver for optimization problem analysis.

[BibT_eX]

[DOI]

Robert Fourer

Comput. Manag. Sci., 2010

Algorithmic Parameter Optimization of the DFO Method with the OPAL Framework.

[BibT_eX]

[DOI]

Cong-Kien Dang

Proceedings of the Software Automatic Tuning, From Concepts to State-of-the-Art Results, 2010

2008

Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming.

[BibT_eX]

[DOI]

Paul Armand

Joël Benoist

Comput. Optim. Appl., 2008

2006

Finding Optimal Algorithmic Parameters Using Derivative-Free Optimization.

[BibT_eX]

[DOI]

SIAM J. Optim., 2006

An interior algorithm for nonlinear optimization that combines line search and trust region steps.

[BibT_eX]

[DOI]

Math. Program., 2006

2005

Sensitivity of trust-region algorithms to their parameters.

[BibT_eX]

[DOI]

4OR, 2005

2003

CUTEr and SifDec: A constrained and unconstrained testing environment, revisited.

[BibT_eX]

[DOI]

Philippe L. Toint

ACM Trans. Math. Softw., 2003

GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization.

[BibT_eX]

[DOI]

Philippe L. Toint

ACM Trans. Math. Softw., 2003

2002

Componentwise fast convergence in the solution of full-rank systems of nonlinear equations.

[BibT_eX]

[DOI]

Math. Program., 2002

Properties of the Log-Barrier Function on Degenerate Nonlinear Programs.

[BibT_eX]

[DOI]

Stephen J. Wright