Geodesic
An algorithm of successive minimization in convex programming
ESAIM: Mathematical Modelling and Numerical Analysis , Tome 12 (1978) no. 4, pp. 377-400.

Voir la notice de l'article provenant de la source Numdam

@article{M2AN_1978__12_4_377_0,
     author = {Laurent, P. J. and Carasso, C.},
     title = {An algorithm of successive minimization in convex programming},
     journal = {ESAIM: Mathematical Modelling and Numerical Analysis },
     pages = {377--400},
     publisher = {Centrale des revues, Dunod-Gauthier-Villars},
     address = {Montreuil},
     volume = {12},
     number = {4},
     year = {1978},
     mrnumber = {519019},
     zbl = {0402.90075},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/M2AN_1978__12_4_377_0/}
}
TY  - JOUR
AU  - Laurent, P. J.
AU  - Carasso, C.
TI  - An algorithm of successive minimization in convex programming
JO  - ESAIM: Mathematical Modelling and Numerical Analysis 
PY  - 1978
SP  - 377
EP  - 400
VL  - 12
IS  - 4
PB  - Centrale des revues, Dunod-Gauthier-Villars
PP  - Montreuil
UR  - http://geodesic.mathdoc.fr/item/M2AN_1978__12_4_377_0/
LA  - en
ID  - M2AN_1978__12_4_377_0
ER  - 
%0 Journal Article
%A Laurent, P. J.
%A Carasso, C.
%T An algorithm of successive minimization in convex programming
%J ESAIM: Mathematical Modelling and Numerical Analysis 
%D 1978
%P 377-400
%V 12
%N 4
%I Centrale des revues, Dunod-Gauthier-Villars
%C Montreuil
%U http://geodesic.mathdoc.fr/item/M2AN_1978__12_4_377_0/
%G en
%F M2AN_1978__12_4_377_0
Laurent, P. J.; Carasso, C. An algorithm of successive minimization in convex programming. ESAIM: Mathematical Modelling and Numerical Analysis , Tome 12 (1978) no. 4, pp. 377-400. http://geodesic.mathdoc.fr/item/M2AN_1978__12_4_377_0/

1. C. Carasso, L'algorithme d'échange en optimisation convexe, Thèse, Grenoble, 1973.

2. C. Carasso, Un algorithme de minimisation de fonctions convexes avec ou sans contraintes : l'algorithme d'échange. 7th I.F.I.P. Conference on Optimizatîon Techniques, Springer-Verlag, 1975, 2, pp. 268-282. | Zbl

3 C Carasso and P J Laurent, Un algorithme pour la minimisation d'une fonctionnelle convexe sur une variété affine Séminaire d'Analyse numérique, Grenoble, 18 octobre 1973

4 C Carasso and P J Laurent, Un algorithme de minimisation en chaîne en optimisation convexe Séminaire d'Analyse numérique, Grenoble, 29 janvier 1976 S I A M J Control and Optimization, vol 16, No 2, 1978 pp 209-235 | Zbl | MR

5 C Carasso and P J Laurent, Un algorithme general pour l'approximation au sens de Tchebycheff de fonctions bornées sur un ensemble quelconque Approximations-Kolloqmum, Bonn, June 8-12, 1976, Lecture Notes m Math , No 556, Springer-Verlag, Berlin, 1976 | Zbl | MR

6 E W Cheney and A Goldstein, Newton's Method for Convex Programming and Tchebyscheff Approximation, Num Math , vol 1, 1959, pp 253-268 | Zbl | MR

7 A A Goldstein, Constiuctive Real Analysis, Haiper's Series in Modem Mathematics, Harper and Row, 1967 | Zbl | MR

8 P J Laurent, Approximation et Optimisation, Hermann Pans, 1972 | Zbl | MR

9 P J Laurent, Exchange Algonthm in Convex Analysis Conference on pproximation theory, The Umv of Texas, Austm, 1973, Acad Press | Zbl | MR

10 R T Rockafellar, Convex Analysis, Pnnc Umv Press 1970 | Zbl | MR

11 E L Stiefel, Uber diskrete und lineare Tschebyscheff-ApproximatwnenNum Math , vol 1, 1959, pp 1-28 | Zbl

12 E L Stiefel Numencal Methods of Tschebycheff Approximation In On numencal Approximation, R LANGER, Ed , Umv of Wisconsm, 1959, pp 217-232 | Zbl | MR

13 E L Stiefel, Note on Jordan Elimination, Linear Programming and Tchebycheff Approximation, Num Math , vol 2, 1960, pp 1-17 | Zbl | MR

14 H J Topfer, Tschebyscheff-Approximation bei nicht erfullter Haarscher Bedingung, Zerts fur angew Math und Mech , vol 45, 1965, T 81-T 82 | Zbl | MR

15 H J Topfer, Tschebyscheff-Approximation und Austauschverfaren bei nicht erfullter Haarscher Bedingung Tagung, Oberwolfach, 1965 I S N M 7, Birkhauser Verlag 1967, pp 71-89 | Zbl | MR