Paul Armand

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
Second-order cone programming for frictional contact mechanics using interior point algorithm	2024-11-20	Paper
Boundedness of the inverse of a regularized Jacobian matrix in constrained optimization and applications	2022-10-11	Paper
Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC	2021-06-15	Paper
Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization	2019-10-02	Paper
An augmented Lagrangian method for equality constrained optimization with rapid infeasibility detection capabilities	2019-06-07	Paper
Limited memory solution of bound constrained convex quadratic problems arising in video games	2018-01-12	Paper
A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization	2017-07-20	Paper
A globally and quadratically convergent primal–dual augmented Lagrangian algorithm for equality constrained optimization	2017-06-21	Paper
An inexact proximal regularization method for unconstrained optimization	2017-04-13	Paper
Study of a primal-dual algorithm for equality constrained minimization	2014-12-12	Paper
From global to local convergence of interior methods for nonlinear optimization	2013-12-19	Paper
Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods	2013-03-18	Paper
Local path-following property of inexact interior methods in nonlinear programming	2012-12-13	Paper
Chebyshev approximation of the null function by an affine combination of complex exponential functions	2011-01-21	Paper
Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming	2009-10-09	Paper
Optimization of a one-dimensional hypertelescope for a direct imaging in astronomy	2009-01-08	Paper
A local convergence property of primal-dual methods for nonlinear programming	2008-10-16	Paper
Modification of the Wolfe line search rules to satisfy the descent condition in the Polak-Ribière-Polyak conjugate gradient method	2008-07-25	Paper
A quasi-Newton penalty barrier method for convex minimization problems	2003-10-14	Paper
A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach	2002-12-01	Paper
A feasible BFGS interior point algorithm for solving convex minimization problems	2001-03-19	Paper
A piecewise line-search technique for maintaining the positive definiteness of the matrices in the SQP method	2001-01-21	Paper
Finding all maximal efficient faces in multiobjective linear programming	1994-09-14	Paper
Bounds on the number of vertices of perturbed polyhedra	1994-05-05	Paper
Determination of the efficient set in multiobjective linear programming	1994-04-27	Paper
https://portal.mardi4nfdi.de/entity/Q4014835	1992-10-21	Paper

Research outcomes over time

This page was built for person: Paul Armand