Paul Armand

25 papers Journal 25
YearRankTypeTitle / Venue / Authors
2025 J jnl
Monitoring bank risk around the world using unsupervised learning.
Eur. J. Oper. Res.
Mathieu Mercadier, Amine Tarazi, Paul Armand, Jean-Pierre Lardy
2024 J jnl
Second-order cone programming for frictional contact mechanics using interior point algorithm.
Optim. Methods Softw.
Vincent Acary, Paul Armand, Hoang Minh Nguyen, Maksym Shpakovych
2022 J jnl
Boundedness of the inverse of a regularized Jacobian matrix in constrained optimization and applications.
Optim. Lett.
Paul Armand, Ngoc Nguyen Tran
2021 J jnl
Local Convergence Analysis of a Primal-Dual Method for Bound-Constrained Optimization Without SOSC.
J. Optim. Theory Appl.
Paul Armand, Ngoc Nguyen Tran
2019 J jnl
An Augmented Lagrangian Method for Equality Constrained Optimization with Rapid Infeasibility Detection Capabilities.
J. Optim. Theory Appl.
Paul Armand, Ngoc Nguyen Tran
2019 J jnl
Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization.
Optim. Methods Softw.
Paul Armand, Ngoc Nguyen Tran
2017 J jnl
A Mixed Logarithmic Barrier-Augmented Lagrangian Method for Nonlinear Optimization.
J. Optim. Theory Appl.
Paul Armand, Riadh Omheni
2017 J jnl
A globally and quadratically convergent primal-dual augmented Lagrangian algorithm for equality constrained optimization.
Optim. Methods Softw.
Paul Armand, Riadh Omheni
2017 J jnl
An inexact proximal regularization method for unconstrained optimization.
Math. Methods Oper. Res.
Paul Armand, Isaï Lankoandé
2014 J jnl
Study of a primal-dual algorithm for equality constrained minimization.
Comput. Optim. Appl.
Paul Armand, Joël Benoist, Riadh Omheni, Vincent Pateloup
2013 J jnl
From global to local convergence of interior methods for nonlinear optimization.
Optim. Methods Softw.
Paul Armand, Joël Benoist, Dominique Orban
2013 J jnl
Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods.
Math. Program.
Paul Armand, Joël Benoist
2012 J jnl
Local path-following property of inexact interior methods in nonlinear programming.
Comput. Optim. Appl.
Paul Armand, Joël Benoist, Jean-Pierre Dussault
2011 J jnl
Pocketing toolpath computation using an optimization method.
Comput. Aided Des.
Michel Bouard, Vincent Pateloup, Paul Armand
2010 J jnl
Chebyshev approximation of the null function by an affine combination of complex exponential functions.
J. Approx. Theory
Paul Armand, Joël Benoist, Elsa Bousquet
2009 J jnl
Optimization of a one dimensional hypertelescope for a direct imaging in astronomy.
Eur. J. Oper. Res.
Paul Armand, Joël Benoist, Elsa Bousquet, Laurent Delage, Serge Olivier, François Reynaud
2008 J jnl
A local convergence property of primal-dual methods for nonlinear programming.
Math. Program.
Paul Armand, Joël Benoist
2008 J jnl
Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming.
Comput. Optim. Appl.
Paul Armand, Joël Benoist, Dominique Orban
2007 J jnl
Limited memory solution of bound constrained convex quadratic problems arising in video games.
RAIRO Oper. Res.
Michael C. Ferris, Andrew J. Wathen, Paul Armand
2003 J jnl
A Quasi-Newton Penalty Barrier Method for Convex Minimization Problems.
Comput. Optim. Appl.
Paul Armand
2002 J jnl
A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach.
Math. Program.
Paul Armand, Jean Charles Gilbert, Sophie Jan-Jégou
2000 J jnl
A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems.
SIAM J. Optim.
Paul Armand, Jean Charles Gilbert, Sophie Jan-Jégou
2000 J jnl
A Piecewise Line-Search Technique for Maintaining the Positive Definitenes of the Matrices in the SQP Method.
Comput. Optim. Appl.
Paul Armand, Jean Charles Gilbert
1993 J jnl
Bounds on the number of vertices of perturbed polyhedra.
Ann. Oper. Res.
Paul Armand
1993 J jnl
Finding all maximal efficient faces in multiobjective linear programming.
Math. Program.
Paul Armand