Oettli, W. Epsilon-solutions and epsilon-supports. (English) Zbl 0577.90060 Optimization 16, 491-496 (1985). The characterization of \(\epsilon\)-optimal solutions by J. J. Strodiot, V. H. Nguyen and N. Heukemes [see Math. Program. 25, 307-328 (1983; Zbl 0495.90067)] is extended to nondifferentiable convex programming problems by means of \(\epsilon\)-subgradients. The connection with the classical \(\epsilon\)-free optimality conditions is investigated. Reviewer: K.Zimmermann Cited in 1 Document MSC: 90C25 Convex programming 90C55 Methods of successive quadratic programming type 90C30 Nonlinear programming 49K10 Optimality conditions for free problems in two or more independent variables Keywords:separation theorems; \(\epsilon \) -optimal solutions; nondifferentiable convex programming; \(\epsilon \) -subgradients; optimality conditions Citations:Zbl 0495.90067 PDF BibTeX XML Cite \textit{W. Oettli}, Optimization 16, 491--496 (1985; Zbl 0577.90060) Full Text: DOI References: [1] Strodiot J.J., Math. Programming 25 pp 307– (1983) · Zbl 0495.90067 [2] Holmes R.B., Geometric Functional Analysis and its Applications (1975) · Zbl 0336.46001 [3] Oettli W., Modern Applied Mathematics pp 195– (1982) 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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.