no. 4
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 
@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},
     year = {1993},
     publisher = {EDP Sciences},
     volume = {27},
     number = {4},
     mrnumber = {1250362},
     zbl = {0789.90071},
     language = {fr},
     url = {https://www.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  - https://www.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 https://www.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. https://www.numdam.org/item/RO_1993__27_4_353_0/

1. C. G. Broyden et N. F. Attia, Penalty Functions, Newton's Method, and Quadratic Progamming, Journal of Optimization Theory and Applications, 1988, Quadratic ,58, n°3, p. 377-381. | Zbl | MR

2. R. Courant, Variationnal Methods for the Solution of Problems of Equilibrium and Vibrations, Bull. Amer. Math, Soc. 1943, 49, p. 1-23. | Zbl | MR

3. J.-P. Dussault, Numerical Stability and Efficiency of Penalty Algorithms, S.I.A.M, Num. Anal. 1990, to appear. | Zbl | MR

4. A. V. Fiacco et G. P. Mccormick, Nonlinear Programming: Sequential Unconstrained Minimization Techniques, Wiley, NewYork, 1968. | Zbl | MR

5. K. R. Frish, The Logarithmic Potential Method of Convex Programming, Memorandum of May 13, University Institute of Economics, Oslo, 1955.

6. G. P. Mccormick, The Projective SUMT Method for Convex Programming, M.O.R. 1989, 14, p. 203-223. | Zbl | MR

7. W. Murray, Constrained Optimization, Ph. D. thesis, University of London, 1969.