Paul Armand - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 23 from 23

2022

Boundedness of the inverse of a regularized Jacobian matrix in constrained optimization and applicationsPaul Armand, Ngoc Nguyen Tran. ol, 16(8):2359-2371, 2022. [doi]

2021

Local Convergence Analysis of a Primal-Dual Method for Bound-Constrained Optimization Without SOSCPaul Armand, Ngoc Nguyen Tran. jota, 189(1):96-116, 2021. [doi]

2019

An Augmented Lagrangian Method for Equality Constrained Optimization with Rapid Infeasibility Detection CapabilitiesPaul Armand, Ngoc Nguyen Tran. jota, 181(1):197-215, 2019. [doi]

Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimizationPaul Armand, Ngoc Nguyen Tran. oms, 34(5):991-1013, 2019. [doi]

2017

A globally and quadratically convergent primal-dual augmented Lagrangian algorithm for equality constrained optimizationPaul Armand, Riadh Omheni. oms, 32(1):1-21, 2017. [doi]

An inexact proximal regularization method for unconstrained optimizationPaul Armand, Isaï Lankoandé. mmor, 85(1):43-59, 2017. [doi]

A Mixed Logarithmic Barrier-Augmented Lagrangian Method for Nonlinear OptimizationPaul Armand, Riadh Omheni. jota, 173(2):523-547, 2017. [doi]

2014

Study of a primal-dual algorithm for equality constrained minimizationPaul Armand, Joël Benoist, Riadh Omheni, Vincent Pateloup. coap, 59(3):405-433, 2014. [doi]

2013

Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methodsPaul Armand, Joël Benoist. mp, 137(1-2):587-592, 2013. [doi]

From global to local convergence of interior methods for nonlinear optimizationPaul Armand, Joël Benoist, Dominique Orban. oms, 28(5):1051-1080, 2013. [doi]

2012

Local path-following property of inexact interior methods in nonlinear programmingPaul Armand, Joël Benoist, Jean-Pierre Dussault. coap, 52(1):209-238, 2012. [doi]

2011

Pocketing toolpath computation using an optimization methodMichel Bouard, Vincent Pateloup, Paul Armand. cad, 43(9):1099-1109, 2011. [doi]

2010

Chebyshev approximation of the null function by an affine combination of complex exponential functionsPaul Armand, Joël Benoist, Elsa Bousquet. jat, 162(11):2004-2020, 2010. [doi]

2009

Optimization of a one dimensional hypertelescope for a direct imaging in astronomyPaul Armand, Joël Benoist, Elsa Bousquet, Laurent Delage, Serge Olivier, François Reynaud. eor, 195(2):519-527, 2009. [doi]

2008

A local convergence property of primal-dual methods for nonlinear programmingPaul Armand, Joël Benoist. mp, 115(2):199-222, 2008. [doi]

Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programmingPaul Armand, Joël Benoist, Dominique Orban. coap, 41(1):1-25, 2008. [doi]

2007

Limited memory solution of bound constrained convex quadratic problems arising in video gamesMichael C. Ferris, Andrew J. Wathen, Paul Armand. rairo, 41(1):19-34, 2007. [doi]

2003

A Quasi-Newton Penalty Barrier Method for Convex Minimization ProblemsPaul Armand. coap, 26(1):5-34, 2003. [doi]

2002

A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approachPaul Armand, Jean Charles Gilbert, Sophie Jan-Jégou. mp, 92(3):393-424, 2002. [doi]

2000

A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization ProblemsPaul Armand, Jean Charles Gilbert, Sophie Jan-Jégou. siamjo, 11(1):199-222, 2000. [doi]

A Piecewise Line-Search Technique for Maintaining the Positive Definitenes of the Matrices in the SQP MethodPaul Armand, Jean Charles Gilbert. coap, 16(2):121-158, 2000. [doi]

1993

Finding all maximal efficient faces in multiobjective linear programmingPaul Armand. mp, 61:357-375, 1993.

Bounds on the number of vertices of perturbed polyhedraPaul Armand. anor, 46-47(2):249-269, 1993. [doi]

Sign in or sign up to see more results.

runs on WebDSL