Résumé
Pour minimiser une fonction sur Rn en présence de m contraintes d’égalité non linéaires, on propose un algorithme ayant les caractéristiques suivantes: chaque itération comprend deux pas de restauration des contraintes et un pas de minimisation de la fonction, les contraintes sont linéairisées une fois par itération, une matrice d’ordre n-m (approximation du hessien réduit du lagrangien) est mise jour mais pas à chaque itération (un critère de mise à jour est proposé), la méthode est globale avec priorité à la restauration, enfin, la suite de points générée converge Q-superlinéairement.
Abstract
To minimize a function on Rn withm nonlinear equality constraints, we propose an algorithm with the following features: each iteration is formed of two steps of restoration of the constraints and one step of minimization of the function, the constraints are linearized once per iteration, a matrix of order n-m (approximation of the reduced hessian of the lagrangian) is updated but not at each iteration (a criterion is proposed), the method is global with priority to the restoration and generates a Q-superlinearlyconvergingsequence of points.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L. Armilo (1966). Minimization of functions having lipschitz continuous first partial derivatives. PacificJ. Maths 16 /1, 1–3.
J. Blum, J.Ch. Gilbert, B. Thooris (1985). Parametric identification of the plasma current density from the magnetic measurements and the pressure profile, code IDENTC. Centre d’études nucléaires (DRFC), B.P. 6, 92265 Fontenay-aux-Roses (France).
C.G. Brovden, J.E. Dennis, J.J. Maré (1973). On the local and superlinear convergence of quasi-Newton methods. Journal of the Institute of Mathematics and its Applications 12, 223–245.
T.F. Coleman, A.R. Conn (1982,a). Nonlinear programming via an exact penalty function: asymptoticanalysis. Mathematical Programming 24, 123–136.
T.F. Coleman, A.R. Conn (1982,b). Nonlinear programming via an exact penalty function: global analysis. Mathematical Programming 24, 137–161.
T.F. Coleman, A.R. Conn (1984). On the local convergence of a quasi-Newton method for the nonlinear programmingproblem. SIAM J. Numer. Anal. 21 /4, 755–769.
J.E. Dennis, J.J. Moré (1974). A characterization of superlinear convergence and its applications to quasi-Newton methods. Mathematics of Computation 28 /126, 549–560.
J.E. Dennis, J.J. Moré (1977). Quasi-Newton methods, motivation and theory. SIAM Review 19, 46–89.
D. Gabav (1982,a). Minimizing a differentiable function over a differentiable manifold. Journal of Optimization Theory and its Applications 37/2, 171–219.
D. Gabav ( 1982, b). Reduced quasi-Newton methods with feasibility improvement for nonlinearlyconstrainedoptimization. MathematicalProgrammingStudy 16, 18–44.
J.Ch. Gilbert (1985). Une méthode métrique variable réduite en optimisation avec contraintes d’égalité non linéaires. Modélisation Mathématique et Analyse Numérique (a paraître).
J.Ch. Gilbert (1986). Thèse. Université de Paris VI. (a paraître)
J. Goodman (1985). Newton’s method for constrained optimization. Mathematical Programming 33, 162–171.
S.P. Han (1976). Superlinearly convergent variable metric algorithms for general nonlinear programmingproblems. Mathematical Programming 11, 263–282.
D.O. Mayne, E. Polak (1982). A superlinearly convergent algorithm for constrained optimization problems. Mathematical Programming Study 16, 45–61.
J. Nocedal. M.L. Overton (1985). Projectedhessianupdatingalgorithms for nonlinearly constrainedoptimization. SIAM J. Numer. Anal. 22 /5, 821–850.
J.M. Ortega, W.C. Rheinboldt (1970). Iterative solution of nonlinear equations of severalvariables. Academic Press, NewYork.
M.J.D. Powell (1971). On the convergence of the variable metric algorithm. Journal of the Institute of Mathematics and its Applications 7, 21–36.
M.J.D. Powell (1978). The convergence of the variable metric methods for nonlinearly constrained optimization calculations. Nonlinear Programming 3, 27–63. eds: O.L. Mangasarian, R.R Meyer, S.M. Robinson. Academic Press.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer Science+Business Media Dordrecht
About this paper
Cite this paper
Gilbert, J. (1986). Une Methode de Quasi-Newton Reduite en Optimisation Sous Contraintes Avec Priorite a la Restauration. In: Bensoussan, A., Lions, J.L. (eds) Analysis and Optimization of Systems. Lecture Notes in Control and Information Sciences, vol 83. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0007545
Download citation
DOI: https://doi.org/10.1007/BFb0007545
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16729-7
Online ISBN: 978-3-540-39856-1
eBook Packages: Springer Book Archive