Some remarks on the construction of higher order algorithms in convex optimization. (English) Zbl 0527.65042


65K05 Numerical mathematical programming methods
90C25 Convex programming
Full Text: DOI


[1] Ben-Tal A, Zowe J (1982) Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems. Math Programming 24:70-91 · Zbl 0488.90059
[2] Hiriart-Urruty JB (to appear) Limiting behaviour of the approximate first order and second order directional derivatives for a convex function. In: Nonlinear analysis: Theory, methods, and applications · Zbl 0536.26007
[3] Holmes RB (1975) Geometric functional analysis and its applications. Springer-Verlag, New York-Heidelberg-Berlin · Zbl 0336.46001
[4] Laurent P-J (1972) Approximation et optimisation. Hermann, Paris · Zbl 0238.90058
[5] Lemarechal C (1978) Bundle methods in nonsmooth optimisation. In: Lemaréchal C, Mifflin (eds) Nonsmooth optimization. Pergamon Press · Zbl 0398.90088
[6] Moreau JJ (1966-67) Fonctionelles convexes (Séminaires sur les équations aux dérivées partielles II). Collège de France, Paris
[7] Pchenichnyi B (1970) Necessary conditions for an extremum. Marcel Dekker, New York
[8] Rockafellar, RT (1970) Convex analysis. Princeton University Press, Princeton NJ · Zbl 0193.18401
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.