default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul Armand
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j23]Paul Armand
, Ngoc Nguyen Tran:
Boundedness of the inverse of a regularized Jacobian matrix in constrained optimization and applications. Optim. Lett. 16(8): 2359-2371 (2022)- 2021
- [j22]Paul Armand, Ngoc Nguyen Tran:
Local Convergence Analysis of a Primal-Dual Method for Bound-Constrained Optimization Without SOSC. J. Optim. Theory Appl. 189(1): 96-116 (2021)
2010 – 2019
- 2019
- [j21]Paul Armand, Ngoc Nguyen Tran:
An Augmented Lagrangian Method for Equality Constrained Optimization with Rapid Infeasibility Detection Capabilities. J. Optim. Theory Appl. 181(1): 197-215 (2019) - [j20]Paul Armand, Ngoc Nguyen Tran:
Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization. Optim. Methods Softw. 34(5): 991-1013 (2019) - 2017
- [j19]Paul Armand, Riadh Omheni:
A Mixed Logarithmic Barrier-Augmented Lagrangian Method for Nonlinear Optimization. J. Optim. Theory Appl. 173(2): 523-547 (2017) - [j18]Paul Armand, Isaï Lankoandé:
An inexact proximal regularization method for unconstrained optimization. Math. Methods Oper. Res. 85(1): 43-59 (2017) - [j17]Paul Armand, Riadh Omheni:
A globally and quadratically convergent primal-dual augmented Lagrangian algorithm for equality constrained optimization. Optim. Methods Softw. 32(1): 1-21 (2017) - 2014
- [j16]Paul Armand, Joël Benoist, Riadh Omheni, Vincent Pateloup:
Study of a primal-dual algorithm for equality constrained minimization. Comput. Optim. Appl. 59(3): 405-433 (2014) - 2013
- [j15]Paul Armand, Joël Benoist:
Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods. Math. Program. 137(1-2): 587-592 (2013) - [j14]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
- [j13]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) - 2011
- [j12]Michel Bouard, Vincent Pateloup, Paul Armand:
Pocketing toolpath computation using an optimization method. Comput. Aided Des. 43(9): 1099-1109 (2011) - 2010
- [j11]Paul Armand, Joël Benoist, Elsa Bousquet:
Chebyshev approximation of the null function by an affine combination of complex exponential functions. J. Approx. Theory 162(11): 2004-2020 (2010)
2000 – 2009
- 2009
- [j10]Paul Armand, Joël Benoist, Elsa Bousquet, Laurent Delage, Serge Olivier, François Reynaud:
Optimization of a one dimensional hypertelescope for a direct imaging in astronomy. Eur. J. Oper. Res. 195(2): 519-527 (2009) - 2008
- [j9]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) - [j8]Paul Armand, Joël Benoist:
A local convergence property of primal-dual methods for nonlinear programming. Math. Program. 115(2): 199-222 (2008) - 2007
- [j7]Michael C. Ferris, Andrew J. Wathen, Paul Armand:
Limited memory solution of bound constrained convex quadratic problems arising in video games. RAIRO Oper. Res. 41(1): 19-34 (2007) - 2003
- [j6]Paul Armand:
A Quasi-Newton Penalty Barrier Method for Convex Minimization Problems. Comput. Optim. Appl. 26(1): 5-34 (2003) - 2002
- [j5]Paul Armand, Jean Charles Gilbert, Sophie Jan-Jégou:
A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach. Math. Program. 92(3): 393-424 (2002) - 2000
- [j4]Paul Armand, Jean Charles Gilbert:
A Piecewise Line-Search Technique for Maintaining the Positive Definitenes of the Matrices in the SQP Method. Comput. Optim. Appl. 16(2): 121-158 (2000) - [j3]Paul Armand, Jean Charles Gilbert, Sophie Jan-Jégou:
A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems. SIAM J. Optim. 11(1): 199-222 (2000)
1990 – 1999
- 1993
- [j2]Paul Armand:
Bounds on the number of vertices of perturbed polyhedra. Ann. Oper. Res. 46-47(2): 249-269 (1993) - [j1]Paul Armand:
Finding all maximal efficient faces in multiobjective linear programming. Math. Program. 61: 357-375 (1993)
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-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:
