zbMATH — the first resource for mathematics

A generalized proximal point algorithm for certain non-convex minimization problems. (English) Zbl 0467.65028

65K05 Numerical mathematical programming methods
90C30 Nonlinear programming
90C25 Convex programming
Full Text: DOI
[1] ARMIJO L., Pacific J. Math. 16 pp 1– (1966) · Zbl 0202.46105
[2] CLARKE F. H., Trans. Am. Math. Soc. 205 pp 247– (1975)
[3] MIFFLIN R., Math. Ops Res. 2 pp 191– (1977) · Zbl 0395.90069
[4] MINE H., J. Optim. Theor. Applic. 33 (1981)
[5] ORTEGA J. M., Iterative Solution of Non– linear Equations in Several Variables (1971)
[6] POLAK E., Computation Methods in Optimization (1971)
[7] POLYAK B. T., Soviet Math. Doldady 8 pp 593– (1967)
[8] PSHENICHNYI B. N., Necessary Conditions for an Extremum (1971) · Zbl 0764.90079
[9] ROCKAFELLAR R. T., Pacific J. Math. 17 pp 497– (1966) · Zbl 0145.15901
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.