An algorithm of successive minimization in convex programming
- Volume: 12, Issue: 4, page 377-400
- ISSN: 0764-583X
Access Full Article
top
How to cite
topLaurent, P. J., and Carasso, C.. "An algorithm of successive minimization in convex programming." ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique 12.4 (1978): 377-400. <http://eudml.org/doc/193330>.
@article{Laurent1978,
author = {Laurent, P. J., Carasso, C.},
journal = {ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique},
keywords = {Successive Minimization; Convex Programming; General Exchange Algorithm; Epfilon-Solution},
language = {eng},
number = {4},
pages = {377-400},
publisher = {Dunod},
title = {An algorithm of successive minimization in convex programming},
url = {http://eudml.org/doc/193330},
volume = {12},
year = {1978},
}
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 - Modélisation Mathématique et Analyse Numérique
PY - 1978
PB - Dunod
VL - 12
IS - 4
SP - 377
EP - 400
LA - eng
KW - Successive Minimization; Convex Programming; General Exchange Algorithm; Epfilon-Solution
UR - http://eudml.org/doc/193330
ER -
References
top- 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. Zbl0347.90049
- 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 Zbl0383.90086MR525720
- 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 Zbl0352.65010MR616090
- 6 E W CHENEY and A GOLDSTEIN, Newton's Method for Convex Programming and Tchebyscheff Approximation, Num Math , vol 1, 1959, pp 253-268 Zbl0113.10703MR109430
- 7 A A GOLDSTEIN, Constiuctive Real Analysis, Haiper's Series in Modem Mathematics, Harper and Row, 1967 Zbl0189.49703MR217616
- 8 P J LAURENT, Approximation et Optimisation, Hermann Pans, 1972 Zbl0238.90058MR467080
- 9 P J LAURENT, Exchange Algonthm in Convex Analysis Conference on pproximation theory, The Umv of Texas, Austm, 1973, Acad Press Zbl0326.90051MR331181
- 10 R T ROCKAFELLAR, Convex Analysis, Pnnc Umv Press 1970 Zbl0193.18401MR274683
- 11 E L STIEFEL, Uber diskrete und lineare Tschebyscheff-ApproximatwnenNum Math , vol 1, 1959, pp 1-28 Zbl0083.11501
- 12 E L STIEFELNumencal Methods of Tschebycheff Approximation In On numencal Approximation, R LANGER, Ed , Umv of Wisconsm, 1959, pp 217-232 Zbl0083.35502MR107961
- 13 E L STIEFEL, Note on Jordan Elimination, Linear Programming and Tchebycheff Approximation, Num Math , vol 2, 1960, pp 1-17 Zbl0097.32306MR111124
- 14 H J TOPFER, Tschebyscheff-Approximation bei nicht erfullter Haarscher Bedingung, Zerts fur angew Math und Mech , vol 45, 1965, T 81-T 82 Zbl0148.04101MR203323
- 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 Zbl0155.48005MR230019
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.