The following pages link to Paul Armand (Q480920):
Displaying 26 items.
- Study of a primal-dual algorithm for equality constrained minimization (Q480924) (← links)
- An inexact proximal regularization method for unconstrained optimization (Q522090) (← links)
- Chebyshev approximation of the null function by an affine combination of complex exponential functions (Q619050) (← links)
- Local path-following property of inexact interior methods in nonlinear programming (Q694602) (← links)
- Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming (Q732237) (← links)
- (Q933808) (redirect page) (← links)
- Modification of the Wolfe line search rules to satisfy the descent condition in the Polak-Ribière-Polyak conjugate gradient method (Q933809) (← links)
- A local convergence property of primal-dual methods for nonlinear programming (Q948957) (← links)
- Bounds on the number of vertices of perturbed polyhedra (Q1312764) (← links)
- Finding all maximal efficient faces in multiobjective linear programming (Q1315425) (← links)
- Determination of the efficient set in multiobjective linear programming (Q1321077) (← links)
- A quasi-Newton penalty barrier method for convex minimization problems (Q1410237) (← links)
- A piecewise line-search technique for maintaining the positive definiteness of the matrices in the SQP method (Q1583583) (← links)
- A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach (Q1849498) (← links)
- Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods (Q1942268) (← links)
- Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC (Q2032022) (← links)
- Boundedness of the inverse of a regularized Jacobian matrix in constrained optimization and applications (Q2080828) (← links)
- A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization (Q2363570) (← links)
- Optimization of a one-dimensional hypertelescope for a direct imaging in astronomy (Q2378356) (← links)
- An augmented Lagrangian method for equality constrained optimization with rapid infeasibility detection capabilities (Q2420776) (← links)
- A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems (Q2706324) (← links)
- From global to local convergence of interior methods for nonlinear optimization (Q2867424) (← links)
- (Q4014835) (← links)
- Limited memory solution of bound constrained convex quadratic problems arising in video games (Q4600610) (← links)
- Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization (Q5198049) (← links)
- A globally and quadratically convergent primal–dual augmented Lagrangian algorithm for equality constrained optimization (Q5268888) (← links)
