default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Paul Armand
@article{DBLP:journals/ol/ArmandT22,
author = {Paul Armand and
Ngoc Nguyen Tran},
title = {Boundedness of the inverse of a regularized Jacobian matrix in constrained
optimization and applications},
journal = {Optim. Lett.},
volume = {16},
number = {8},
pages = {2359--2371},
year = {2022},
url = {https://doi.org/10.1007/s11590-021-01829-7},
doi = {10.1007/S11590-021-01829-7},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ol/ArmandT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jota/ArmandT21,
author = {Paul Armand and
Ngoc Nguyen Tran},
title = {Local Convergence Analysis of a Primal-Dual Method for Bound-Constrained
Optimization Without {SOSC}},
journal = {J. Optim. Theory Appl.},
volume = {189},
number = {1},
pages = {96--116},
year = {2021},
url = {https://doi.org/10.1007/s10957-021-01822-1},
doi = {10.1007/S10957-021-01822-1},
timestamp = {Thu, 29 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jota/ArmandT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jota/ArmandT19,
author = {Paul Armand and
Ngoc Nguyen Tran},
title = {An Augmented Lagrangian Method for Equality Constrained Optimization
with Rapid Infeasibility Detection Capabilities},
journal = {J. Optim. Theory Appl.},
volume = {181},
number = {1},
pages = {197--215},
year = {2019},
url = {https://doi.org/10.1007/s10957-018-1401-7},
doi = {10.1007/S10957-018-1401-7},
timestamp = {Tue, 07 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jota/ArmandT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/oms/ArmandT19,
author = {Paul Armand and
Ngoc Nguyen Tran},
title = {Rapid infeasibility detection in a mixed logarithmic barrier-augmented
Lagrangian method for nonlinear optimization},
journal = {Optim. Methods Softw.},
volume = {34},
number = {5},
pages = {991--1013},
year = {2019},
url = {https://doi.org/10.1080/10556788.2018.1528250},
doi = {10.1080/10556788.2018.1528250},
timestamp = {Thu, 24 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/oms/ArmandT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jota/ArmandO17,
author = {Paul Armand and
Riadh Omheni},
title = {A Mixed Logarithmic Barrier-Augmented Lagrangian Method for Nonlinear
Optimization},
journal = {J. Optim. Theory Appl.},
volume = {173},
number = {2},
pages = {523--547},
year = {2017},
url = {https://doi.org/10.1007/s10957-017-1071-x},
doi = {10.1007/S10957-017-1071-X},
timestamp = {Tue, 07 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jota/ArmandO17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/ArmandL17,
author = {Paul Armand and
Isa{\"{\i}} Lankoand{\'{e}}},
title = {An inexact proximal regularization method for unconstrained optimization},
journal = {Math. Methods Oper. Res.},
volume = {85},
number = {1},
pages = {43--59},
year = {2017},
url = {https://doi.org/10.1007/s00186-016-0561-1},
doi = {10.1007/S00186-016-0561-1},
timestamp = {Tue, 03 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mmor/ArmandL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/oms/ArmandO17,
author = {Paul Armand and
Riadh Omheni},
title = {A globally and quadratically convergent primal-dual augmented Lagrangian
algorithm for equality constrained optimization},
journal = {Optim. Methods Softw.},
volume = {32},
number = {1},
pages = {1--21},
year = {2017},
url = {https://doi.org/10.1080/10556788.2015.1025401},
doi = {10.1080/10556788.2015.1025401},
timestamp = {Thu, 24 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/oms/ArmandO17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/coap/ArmandBOP14,
author = {Paul Armand and
Jo{\"{e}}l Benoist and
Riadh Omheni and
Vincent Pateloup},
title = {Study of a primal-dual algorithm for equality constrained minimization},
journal = {Comput. Optim. Appl.},
volume = {59},
number = {3},
pages = {405--433},
year = {2014},
url = {https://doi.org/10.1007/s10589-014-9679-3},
doi = {10.1007/S10589-014-9679-3},
timestamp = {Tue, 14 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/coap/ArmandBOP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/ArmandB13,
author = {Paul Armand and
Jo{\"{e}}l Benoist},
title = {Uniform boundedness of the inverse of a Jacobian matrix arising in
regularized interior-point methods},
journal = {Math. Program.},
volume = {137},
number = {1-2},
pages = {587--592},
year = {2013},
url = {https://doi.org/10.1007/s10107-011-0498-3},
doi = {10.1007/S10107-011-0498-3},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/ArmandB13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/oms/ArmandBO13,
author = {Paul Armand and
Jo{\"{e}}l Benoist and
Dominique Orban},
title = {From global to local convergence of interior methods for nonlinear
optimization},
journal = {Optim. Methods Softw.},
volume = {28},
number = {5},
pages = {1051--1080},
year = {2013},
url = {https://doi.org/10.1080/10556788.2012.668905},
doi = {10.1080/10556788.2012.668905},
timestamp = {Thu, 24 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/oms/ArmandBO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/coap/ArmandBD12,
author = {Paul Armand and
Jo{\"{e}}l Benoist and
Jean{-}Pierre Dussault},
title = {Local path-following property of inexact interior methods in nonlinear
programming},
journal = {Comput. Optim. Appl.},
volume = {52},
number = {1},
pages = {209--238},
year = {2012},
url = {https://doi.org/10.1007/s10589-011-9406-2},
doi = {10.1007/S10589-011-9406-2},
timestamp = {Tue, 14 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/coap/ArmandBD12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cad/BouardPA11,
author = {Michel Bouard and
Vincent Pateloup and
Paul Armand},
title = {Pocketing toolpath computation using an optimization method},
journal = {Comput. Aided Des.},
volume = {43},
number = {9},
pages = {1099--1109},
year = {2011},
url = {https://doi.org/10.1016/j.cad.2011.05.008},
doi = {10.1016/J.CAD.2011.05.008},
timestamp = {Thu, 13 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cad/BouardPA11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jat/ArmandBB10,
author = {Paul Armand and
Jo{\"{e}}l Benoist and
Elsa Bousquet},
title = {Chebyshev approximation of the null function by an affine combination
of complex exponential functions},
journal = {J. Approx. Theory},
volume = {162},
number = {11},
pages = {2004--2020},
year = {2010},
url = {https://doi.org/10.1016/j.jat.2010.06.005},
doi = {10.1016/J.JAT.2010.06.005},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jat/ArmandBB10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eor/ArmandBBDOR09,
author = {Paul Armand and
Jo{\"{e}}l Benoist and
Elsa Bousquet and
Laurent Delage and
Serge Olivier and
Fran{\c{c}}ois Reynaud},
title = {Optimization of a one dimensional hypertelescope for a direct imaging
in astronomy},
journal = {Eur. J. Oper. Res.},
volume = {195},
number = {2},
pages = {519--527},
year = {2009},
url = {https://doi.org/10.1016/j.ejor.2008.02.002},
doi = {10.1016/J.EJOR.2008.02.002},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eor/ArmandBBDOR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/coap/ArmandBO08,
author = {Paul Armand and
Jo{\"{e}}l Benoist and
Dominique Orban},
title = {Dynamic updates of the barrier parameter in primal-dual methods for
nonlinear programming},
journal = {Comput. Optim. Appl.},
volume = {41},
number = {1},
pages = {1--25},
year = {2008},
url = {https://doi.org/10.1007/s10589-007-9095-z},
doi = {10.1007/S10589-007-9095-Z},
timestamp = {Tue, 14 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/coap/ArmandBO08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/ArmandB08,
author = {Paul Armand and
Jo{\"{e}}l Benoist},
title = {A local convergence property of primal-dual methods for nonlinear
programming},
journal = {Math. Program.},
volume = {115},
number = {2},
pages = {199--222},
year = {2008},
url = {https://doi.org/10.1007/s10107-007-0136-2},
doi = {10.1007/S10107-007-0136-2},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/ArmandB08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rairo/FerrisWA07,
author = {Michael C. Ferris and
Andrew J. Wathen and
Paul Armand},
title = {Limited memory solution of bound constrained convex quadratic problems
arising in video games},
journal = {{RAIRO} Oper. Res.},
volume = {41},
number = {1},
pages = {19--34},
year = {2007},
url = {https://doi.org/10.1051/ro:2007009},
doi = {10.1051/RO:2007009},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rairo/FerrisWA07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/coap/Armand03,
author = {Paul Armand},
title = {A Quasi-Newton Penalty Barrier Method for Convex Minimization Problems},
journal = {Comput. Optim. Appl.},
volume = {26},
number = {1},
pages = {5--34},
year = {2003},
url = {https://doi.org/10.1023/A:1025589804531},
doi = {10.1023/A:1025589804531},
timestamp = {Tue, 14 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/coap/Armand03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/ArmandGJ02,
author = {Paul Armand and
Jean Charles Gilbert and
Sophie Jan{-}J{\'{e}}gou},
title = {A {BFGS-IP} algorithm for solving strongly convex optimization problems
with feasibility enforced by an exact penalty approach},
journal = {Math. Program.},
volume = {92},
number = {3},
pages = {393--424},
year = {2002},
url = {https://doi.org/10.1007/s101070100283},
doi = {10.1007/S101070100283},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/ArmandGJ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/coap/ArmandG00,
author = {Paul Armand and
Jean Charles Gilbert},
title = {A Piecewise Line-Search Technique for Maintaining the Positive Definitenes
of the Matrices in the {SQP} Method},
journal = {Comput. Optim. Appl.},
volume = {16},
number = {2},
pages = {121--158},
year = {2000},
url = {https://doi.org/10.1023/A:1008701324575},
doi = {10.1023/A:1008701324575},
timestamp = {Tue, 14 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/coap/ArmandG00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamjo/ArmandGJ00,
author = {Paul Armand and
Jean Charles Gilbert and
Sophie Jan{-}J{\'{e}}gou},
title = {A Feasible {BFGS} Interior Point Algorithm for Solving Convex Minimization
Problems},
journal = {{SIAM} J. Optim.},
volume = {11},
number = {1},
pages = {199--222},
year = {2000},
url = {https://doi.org/10.1137/S1052623498344720},
doi = {10.1137/S1052623498344720},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamjo/ArmandGJ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/anor/Armand93,
author = {Paul Armand},
title = {Bounds on the number of vertices of perturbed polyhedra},
journal = {Ann. Oper. Res.},
volume = {46-47},
number = {2},
pages = {249--269},
year = {1993},
url = {https://doi.org/10.1007/BF02023098},
doi = {10.1007/BF02023098},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/anor/Armand93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/Armand93,
author = {Paul Armand},
title = {Finding all maximal efficient faces in multiobjective linear programming},
journal = {Math. Program.},
volume = {61},
pages = {357--375},
year = {1993},
url = {https://doi.org/10.1007/BF01582157},
doi = {10.1007/BF01582157},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/Armand93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2024-04-24 23:02 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:
