Bounds on the number of vertices of perturbed polyhedra. - Paul Armand (Ann. Oper. Res., 1993)

Finding all maximal efficient faces in multiobjective linear programming. - Paul Armand (Math. Program., 1993)

A Piecewise Line-Search Technique for Maintaining the Positive Definitenes of the Matrices in the SQP Method. - Paul Armand; Jean Charles Gilbert (Comput. Optim. Appl., 2000)

A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems. - Paul Armand; Jean Charles Gilbert; Sophie Jan-Jégou (SIAM J. Optim., 2000)

A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach. - Paul Armand; Jean Charles Gilbert; Sophie Jan-Jégou (Math. Program., 2002)

A Quasi-Newton Penalty Barrier Method for Convex Minimization Problems. - Paul Armand (Comput. Optim. Appl., 2003)

Limited memory solution of bound constrained convex quadratic problems arising in video games. - Michael C. Ferris; Andrew J. Wathen; Paul Armand (RAIRO Oper. Res., 2007)

Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming. - Paul Armand; Joël Benoist; Dominique Orban (Comput. Optim. Appl., 2008)

A local convergence property of primal-dual methods for nonlinear programming. - Paul Armand; Joël Benoist (Math. Program., 2008)

Optimization of a one dimensional hypertelescope for a direct imaging in astronomy. - Paul Armand; Joël Benoist; Elsa Bousquet; Laurent Delage; Serge Olivier; François Reynaud (Eur. J. Oper. Res., 2009)

Chebyshev approximation of the null function by an affine combination of complex exponential functions. - Paul Armand; Joël Benoist; Elsa Bousquet (J. Approx. Theory, 2010)

Pocketing toolpath computation using an optimization method. - Michel Bouard; Vincent Pateloup; Paul Armand (Comput. Aided Des., 2011)

Local path-following property of inexact interior methods in nonlinear programming. - Paul Armand; Joël Benoist; Jean-Pierre Dussault (Comput. Optim. Appl., 2012)

Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods. - Paul Armand; Joël Benoist (Math. Program., 2013)

From global to local convergence of interior methods for nonlinear optimization. - Paul Armand; Joël Benoist; Dominique Orban (Optim. Methods Softw., 2013)

Study of a primal-dual algorithm for equality constrained minimization. - Paul Armand; Joël Benoist; Riadh Omheni; Vincent Pateloup (Comput. Optim. Appl., 2014)

A Mixed Logarithmic Barrier-Augmented Lagrangian Method for Nonlinear Optimization. - Paul Armand; Riadh Omheni (J. Optim. Theory Appl., 2017)

An inexact proximal regularization method for unconstrained optimization. - Paul Armand; Isaï Lankoandé (Math. Methods Oper. Res., 2017)

A globally and quadratically convergent primal-dual augmented Lagrangian algorithm for equality constrained optimization. - Paul Armand; Riadh Omheni (Optim. Methods Softw., 2017)

An Augmented Lagrangian Method for Equality Constrained Optimization with Rapid Infeasibility Detection Capabilities. - Paul Armand; Ngoc Nguyen Tran (J. Optim. Theory Appl., 2019)

Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization. - Paul Armand; Ngoc Nguyen Tran (Optim. Methods Softw., 2019)

Local Convergence Analysis of a Primal-Dual Method for Bound-Constrained Optimization Without SOSC. - Paul Armand; Ngoc Nguyen Tran (J. Optim. Theory Appl., 2021)

Boundedness of the inverse of a regularized Jacobian matrix in constrained optimization and applications. - Paul Armand; Ngoc Nguyen Tran (Optim. Lett., 2022)

Second-order cone programming for frictional contact mechanics using interior point algorithm. - Vincent Acary; Paul Armand; Hoang Minh Nguyen; Maksym Shpakovych (Optim. Methods Softw., 2024)

Monitoring bank risk around the world using unsupervised learning. - Mathieu Mercadier; Amine Tarazi; Paul Armand; Jean-Pierre Lardy (Eur. J. Oper. Res., 2025)