Paul Armand

529 total citations
34 papers, 379 citations indexed

About

Paul Armand is a scholar working on Numerical Analysis, Computational Theory and Mathematics and Atomic and Molecular Physics, and Optics. According to data from OpenAlex, Paul Armand has authored 34 papers receiving a total of 379 indexed citations (citations by other indexed papers that have themselves been cited), including 20 papers in Numerical Analysis, 20 papers in Computational Theory and Mathematics and 7 papers in Atomic and Molecular Physics, and Optics. Recurrent topics in Paul Armand's work include Advanced Optimization Algorithms Research (20 papers), Optimization and Variational Analysis (13 papers) and Matrix Theory and Algorithms (9 papers). Paul Armand is often cited by papers focused on Advanced Optimization Algorithms Research (20 papers), Optimization and Variational Analysis (13 papers) and Matrix Theory and Algorithms (9 papers). Paul Armand collaborates with scholars based in France, Canada and Vietnam. Paul Armand's co-authors include Joël Benoist, Dominique Orban, Moctar Mouhamadou, Vincent Pateloup, Agnès Desfarges‐Berthelemot, Vincent Kermène, Alain Barthélémy, Jean-Pièrre Dussault, Andrew J. Wathen and Michael C. Ferris and has published in prestigious journals such as SHILAP Revista de lepidopterología, European Journal of Operational Research and Optics Express.

In The Last Decade

Paul Armand

31 papers receiving 339 citations

Peers

Paul Armand
Paul Armand
Citations per year, relative to Paul Armand Paul Armand (= 1×) peers Chenliang Li

Countries citing papers authored by Paul Armand

Since Specialization
Citations

This map shows the geographic impact of Paul Armand's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Paul Armand with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Paul Armand more than expected).

Fields of papers citing papers by Paul Armand

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Paul Armand. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Paul Armand. The network helps show where Paul Armand may publish in the future.

Co-authorship network of co-authors of Paul Armand

This figure shows the co-authorship network connecting the top 25 collaborators of Paul Armand. A scholar is included among the top collaborators of Paul Armand based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Paul Armand. Paul Armand is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Tarazi, Amine, et al.. (2025). Monitoring bank risk around the world using unsupervised learning. European Journal of Operational Research. 324(2). 590–615.
2.
Armand, Paul, et al.. (2022). On-Demand Phase Control of a 7-Fiber Amplifiers Array with Neural Network and Quasi-Reinforcement Learning. Photonics. 9(4). 243–243. 8 indexed citations
3.
Armand, Paul, et al.. (2019). Random Scattering and Alternating Projection Optimization for Active Phase Control of a Laser Beam Array. IEEE photonics journal. 11(4). 1–9. 4 indexed citations
4.
Armand, Paul, et al.. (2018). An Augmented Lagrangian Method for Equality Constrained Optimization with Rapid Infeasibility Detection Capabilities. Journal of Optimization Theory and Applications. 181(1). 197–215. 2 indexed citations
5.
Armand, Paul, et al.. (2016). An inexact proximal regularization method for unconstrained optimization. Mathematical Methods of Operations Research. 85(1). 43–59. 2 indexed citations
6.
Armand, Paul & Dominique Orban. (2012). The Squared Slacks Transformation in Nonlinear Programming. SHILAP Revista de lepidopterología. 16. 22–22. 6 indexed citations
7.
Armand, Paul, Joël Benoist, & Dominique Orban. (2012). From global to local convergence of interior methods for nonlinear optimization. Optimization methods & software. 28(5). 1051–1080. 14 indexed citations
8.
Mansuryan, Tigran, Géraud Bouwmans, Vincent Kermène, et al.. (2012). Spatially dispersive scheme for transmission and synthesis of femtosecond pulses through a multicore fiber. Optics Express. 20(22). 24769–24769. 6 indexed citations
9.
Armand, Paul & Joël Benoist. (2011). Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods. Mathematical Programming. 137(1-2). 587–592. 13 indexed citations
10.
Pateloup, Vincent, et al.. (2011). Pocketing toolpath computation using an optimization method. Computer-Aided Design. 43(9). 1099–1109. 24 indexed citations
11.
Armand, Paul, et al.. (2010). Chebyshev approximation of the null function by an affine combination of complex exponential functions. Journal of Approximation Theory. 162(11). 2004–2020. 1 indexed citations
12.
Armand, Paul, et al.. (2008). Optimization of a one dimensional hypertelescope for a direct imaging in astronomy. European Journal of Operational Research. 195(2). 519–527. 6 indexed citations
13.
Ferris, Michael C., Andrew J. Wathen, & Paul Armand. (2007). Limited memory solution of bound constrained convex quadratic problems arising in video games. RAIRO - Operations Research. 41(1). 19–34. 6 indexed citations
14.
Armand, Paul, Joël Benoist, & Dominique Orban. (2007). Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming. Computational Optimization and Applications. 41(1). 1–25. 19 indexed citations
15.
Armand, Paul & Joël Benoist. (2007). A local convergence property of primal-dual methods for nonlinear programming. Mathematical Programming. 115(2). 199–222. 9 indexed citations
16.
Armand, Paul. (2006). Modification of the Wolfe Line Search Rules to Satisfy the Descent Condition in the Polak-Ribière-Polyak Conjugate Gradient Method. Journal of Optimization Theory and Applications. 132(2). 287–305. 2 indexed citations
17.
Armand, Paul, Joël Benoist, & Dominique Orban. (2005). Interpretation of interior point methods as damped Newton methods. 1 indexed citations
18.
Armand, Paul. (2003). A Quasi-Newton Penalty Barrier Method for Convex Minimization Problems. Computational Optimization and Applications. 26(1). 5–34. 2 indexed citations
19.
Armand, Paul. (1993). Finding all maximal efficient faces in multiobjective linear programming. Mathematical Programming. 61(1-3). 357–375. 40 indexed citations
20.
Armand, Paul. (1993). Bounds on the number of vertices of perturbed polyhedra. Annals of Operations Research. 46-47(2). 249–269. 5 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026