Titre		Coauteurs		Destination
25		On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery [doi]				Journal of Optimization Theory and Applications, 172:1 (2017) 70-101.
24		How the augmented Lagrangian algorithm can deal with an infeasible convex quadratic optimization problem		A. Chiche		Journal of Convex Analysis, 23:2 (2016) 425-459
23		Application of the moment-SOS approach to global optimization of the OPF problem		C. Josz, J. Maeght, P. Panciatici		IEEE Transactions on Power Systems, 30-1 (2015) 463-470
22		An algorithmic characterization of P-matricity		I. Ben Gharbia		SIAM Journal on Matrix Analysis and Applications, 34 (2013) 904-916
21		Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a P-matrix		I. Ben Gharbia		Mathematical Programming, 134 (2012) 349-364
20		LIBOPT - An environment for testing solvers on heterogeneous collections of problems		X. Jonsson		ACM Transactions on Mathematical Software (soumis)
19		Optimisation Différentiable [doi]				Techniques de l'Ingénieur, document AF-1-252 (2008)
18		Higher order time stepping for second order hyperbolic problems and optimal CFL conditions		P. Joly		Partial Differential Equations, Springer, Computational Methods in Applied Sciences 16, 67-93, 2008
17		Constrained optimization in seismic reflection tomography: a Gauss-Newton augmented Lagrangian approach [doi]		F. Delbos, R. Glowinski, D. Sinoquet		Geophysical Journal International, 164 (2006) 670-684
16		Global linear convergence of an augmented Lagrangian algorithm for solving convex quadratic optimization problems		F. Delbos		Journal of Convex Analysis, 12 (2005) 45-69
15		Examples of ill-behaved central paths in convex optimization		C.C. Gonzaga, E. Karas		Mathematical Programming, 103 (2005) 63-94
14		A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach		P. Armand, S. Jan-Jégou		Mathematical Programming, 92 (2002) 393-424
13		A feasible BFGS interior point algorithm for solving strongly convex minimization problems		P. Armand, S. Jan-Jégou		SIAM Journal on Optimization, 11 (2000) 199-222
12		A trust region method based on interior point techniques for nonlinear programming		R.H. Byrd, J. Nocedal		Mathematical Programming, 89 (2000) 149-185
11		A piecewise line-search technique for maintaining the positive definiteness of the matrices in the SQP method [doi]		P. Armand		Computational Optimization and Applications, 16 (2000) 121-158
10		On the realization of the Wolfe conditions in reduced quasi-Newton methods for equality constrained optimization				SIAM Journal on Optimization, 7 (1997) 780-813
9		A family of variable metric proximal methods		F. Bonnans, C. Lemaréchal, C. Sagastizábal		Mathematical Programming, 68 (1995) 15-47
8		Automatic differentiation and the step computation in the limited memory BFGS method		J. Nocedal		Applied Mathematics Letters, 6 (1993) 47-50
7		Automatic differentiation and iterative processes				Optimization Methods and Software, 1 (1992) 13-21
6		Global convergence properties of conjugate gradient methods for optimization		J. Nocedal		SIAM Journal on Optimization, 2 (1992) 21-42
5		Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization				Mathematical Programming, 50 (1991) 1-28
4		Morcad, an object-oriented molecular modelling package running on IBM RS/6000 and SGI 4Dxxx workstations [doi]		M. Le Bret, J. Gabarro-Arpa, C. Lemaréchal		Journal de Chimie Physique, 88 (1991) 2489-2496
3		Some numerical experiments with variable-storage quasi-Newton algorithms		C. Lemaréchal		Mathematical Programming, 45 (1989) 407-435
2		On the local and global convergence of a reduced quasi-Newton method				Optimization, 20 (1989) 421-450
1		Mise à jour de la métrique dans les méthodes de quasi-Newton réduites en optimisation avec contraintes d'égalité				Modélisation Mathématique et Analyse Numérique, 22 (1988) 251-288