@article{RO_1993__27_4_353_0, author = {Benchakroun, A. and Dussault, J.-P. and Mansouri, A.}, title = {P\'enalit\'es mixtes : un algorithme superlin\'eaire en deux \'etapes}, journal = {RAIRO - Operations Research - Recherche Op\'erationnelle}, pages = {353--374}, publisher = {EDP-Sciences}, volume = {27}, number = {4}, year = {1993}, mrnumber = {1250362}, zbl = {0789.90071}, language = {fr}, url = {http://archive.numdam.org/item/RO_1993__27_4_353_0/} }
TY - JOUR AU - Benchakroun, A. AU - Dussault, J.-P. AU - Mansouri, A. TI - Pénalités mixtes : un algorithme superlinéaire en deux étapes JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 1993 SP - 353 EP - 374 VL - 27 IS - 4 PB - EDP-Sciences UR - http://archive.numdam.org/item/RO_1993__27_4_353_0/ LA - fr ID - RO_1993__27_4_353_0 ER -
%0 Journal Article %A Benchakroun, A. %A Dussault, J.-P. %A Mansouri, A. %T Pénalités mixtes : un algorithme superlinéaire en deux étapes %J RAIRO - Operations Research - Recherche Opérationnelle %D 1993 %P 353-374 %V 27 %N 4 %I EDP-Sciences %U http://archive.numdam.org/item/RO_1993__27_4_353_0/ %G fr %F RO_1993__27_4_353_0
Benchakroun, A.; Dussault, J.-P.; Mansouri, A. Pénalités mixtes : un algorithme superlinéaire en deux étapes. RAIRO - Operations Research - Recherche Opérationnelle, Tome 27 (1993) no. 4, pp. 353-374. http://archive.numdam.org/item/RO_1993__27_4_353_0/
1. Penalty Functions, Newton's Method, and Quadratic Progamming, Journal of Optimization Theory and Applications, 1988, Quadratic ,58, n°3, p. 377-381. | MR | Zbl
et ,2. Variationnal Methods for the Solution of Problems of Equilibrium and Vibrations, Bull. Amer. Math, Soc. 1943, 49, p. 1-23. | MR | Zbl
,3. Numerical Stability and Efficiency of Penalty Algorithms, S.I.A.M, Num. Anal. 1990, to appear. | MR | Zbl
,4. Nonlinear Programming: Sequential Unconstrained Minimization Techniques, Wiley, NewYork, 1968. | MR | Zbl
et ,5. The Logarithmic Potential Method of Convex Programming, Memorandum of May 13, University Institute of Economics, Oslo, 1955.
,6. The Projective SUMT Method for Convex Programming, M.O.R. 1989, 14, p. 203-223. | MR | Zbl
,7. Constrained Optimization, Ph. D. thesis, University of London, 1969.
,