Paul Armand

Publication Activity (10 Years)

Years Active: 1993-2022
Publications (10 Years): 7

Top Topics

Jacobian Matrix

Penalty Function

Constrained Optimization

Augmented Lagrangian

Top Venues

J. Optim. Theory Appl.

Optim. Methods Softw.

Math. Methods Oper. Res.

Publications

Paul Armand, Ngoc Nguyen Tran
Boundedness of the inverse of a regularized Jacobian matrix in constrained optimization and applications. Optim. Lett. 16 (8) (2022)
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) (2021)
Paul Armand, Ngoc Nguyen Tran
Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization. Optim. Methods Softw. 34 (5) (2019)
Paul Armand, Ngoc Nguyen Tran
An Augmented Lagrangian Method for Equality Constrained Optimization with Rapid Infeasibility Detection Capabilities. J. Optim. Theory Appl. 181 (1) (2019)
Paul Armand, Riadh Omheni
A Mixed Logarithmic Barrier-Augmented Lagrangian Method for Nonlinear Optimization. J. Optim. Theory Appl. 173 (2) (2017)
Paul Armand, Isaï Lankoandé
An inexact proximal regularization method for unconstrained optimization. Math. Methods Oper. Res. 85 (1) (2017)
Paul Armand, Riadh Omheni
A globally and quadratically convergent primal-dual augmented Lagrangian algorithm for equality constrained optimization. Optim. Methods Softw. 32 (1) (2017)
Paul Armand, Joël Benoist, Riadh Omheni, Vincent Pateloup
Study of a primal-dual algorithm for equality constrained minimization. Comput. Optim. Appl. 59 (3) (2014)
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) (2013)
Paul Armand, Joël Benoist, Dominique Orban
From global to local convergence of interior methods for nonlinear optimization. Optim. Methods Softw. 28 (5) (2013)
Paul Armand, Joël Benoist, Jean-Pierre Dussault
Local path-following property of inexact interior methods in nonlinear programming. Comput. Optim. Appl. 52 (1) (2012)
Michel Bouard, Vincent Pateloup, Paul Armand
Pocketing toolpath computation using an optimization method. Comput. Aided Des. 43 (9) (2011)
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) (2010)
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) (2009)
Paul Armand, Joël Benoist
A local convergence property of primal-dual methods for nonlinear programming. Math. Program. 115 (2) (2008)
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) (2008)
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) (2007)
Paul Armand
A Quasi-Newton Penalty Barrier Method for Convex Minimization Problems. Comput. Optim. Appl. 26 (1) (2003)
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) (2002)
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) (2000)
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) (2000)
Paul Armand
Bounds on the number of vertices of perturbed polyhedra. Ann. Oper. Res. (2) (1993)
Paul Armand
Finding all maximal efficient faces in multiobjective linear programming. Math. Program. 61 (1993)