Generic Convergence of Descent Methods in Banach Spaces
Published Online:1 May 2000https://doi.org/10.1287/moor.25.2.231.12226
References
- Minimization of nonsmooth convex functionals in Banach spaces. J. Convex Anal. (1997) 4 235 255 Google Scholar
- Penalty/barrier multiplier methods for convex programming problems. SIAM J. Optim. (1997) 7 347 366 Crossref, Google Scholar
- Sur la convergence des approximations successives pour les contractions non lineaires dans un espace de Banach. C.R. Acad. Sci. Paris (1976) 283 185 187 Google Scholar
- Generic Sows generated by continuous vector fields in Banach spaces. Adv. Math. (1983) 50 266 280 Crossref, Google Scholar
- Convergence of some algorithms for convex minimization. Math. Programming (1993) 62 261 275 Crossref, Google Scholar
- A comparison of constraint qualifications in infinite dimensional convex programming. SIAM J. Control Optim. (1990) 28 925 935 Crossref, Google Scholar
- Convex Analysis and Minimization Algorithms (1993) (Springer, Berlin, Germany) Crossref, Google Scholar
- Entropy-like proximal methods in convex programming. Math. Oper. Res. (1994) 19 790 814 Link, Google Scholar
- General Topology (1955) (D. Van Nostrand, New York) Google Scholar
- Convergence of generic infinite products of nonexpansive and uniformly continuous operators. Nonlinear Anal.: Theory, Methods, Appl. (1999) 36 1049 1065 Crossref, Google Scholar
- On the minimization of convex functionals. Calculus of Variations and Differential Equations (1999) (CRC Press, Boca Raton, FL) 200 209 . Forthcoming Google Scholar
- Optimal programs on infinite horizon, 1 and 2. SIAM J. Control Optim. (1995) 33 1643 1686 Crossref, Google Scholar
- Dynamic properties of optimal solutions of variational problems. Nonlinear Anal.: Theory, Methods, Appl. (1996) 27 895 932 Crossref, Google Scholar
