This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Balinski, M.L. and P. Wolfe, eds., Nondifferentiable Optimization, Mathematical Programming, Study 3, North Holland-Publishing Co., Amsterdam, 1975.
Rockafellar, R.T. Convex Analysis, Princeton University Press, Princeton, N.J., 1970.
Bertsecas, D.P. and S.K. Mitter, A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals, SIAM Journal Control, Vol. 11, 4 (1973).
Lemarechal, C., Nondifferentiable Optimization; Subgradient and ɛ-subgradient Methods, Lecture Notes: Numerical Methods in Optimization and Operation Research, Springer Verlag, August 1975, 191–199.
Rockafellar, R.T., The Multiplier Method of Hesten and Powell Applied to Convex Programming, JOTA, Vol. 12, 6 (1974).
Nurminski, E.A., The Quasigradient Method for Solving of Nonlinear Programming Problems, Cybernetics, Vol. 9, 1, (Jan–Feb 1973), 145–150, Plenum Publishing Corporation, N.Y., London.
Zangwill, W.I., Convergence Conditions for Nonlinear Programming Algorithms, Management Science, Vol. 16, 1 (1969), 1–13.
Wolf, P., Convergence Theory in Nonlinear Programming, North-Holland Publishing Co., 1970, 1–36.
Meyer, G.G.L., A Systematic Approach to the Synthesis of Algorithms, Numerical Mathematics, Vol. 24, 4 (1975), 277–290.
Rheinboldt, W.C., A Unified Convergence Theory for a Class of Iterative Processes, SIAM Journal Numerical Analysis, Vol. 5, 1 (1968).
Nurminski, E.A. and A.A. Zhelikhovski, Investigation of One Regulating Step, Cybernetics, Vol. 10, 6 (Nov–Dec. 1974), 1027–1031, Plenum Publishing Corporation, N.Y., London.
Nurminski, E.A., Convergence Conditions for Nonlinear Programming Algorithms, Kybernetika, 6 (1972), 79–81 (in Russian).
Nurminski, E.A. and A.A. Zhelikhovski, ɛ-Quasigradient Method for Solving Nonsmooth External Problems, Cybernetics, Vol. 13, 1 (1977), 109–114, Plenum Publishing Corporation, N.Y., London.
Nurminski, E.A. and P.I. Verchenko, Convergence of Algorithms for Finding Saddle Points, Cybernetics, Vol. 13, 3, 430–434, Plenum Publishing Corporation, N.Y., London.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag
About this paper
Cite this paper
Nurminski, E.A. (1979). On ɛ-subgradient methods of non-differentiable optimization. In: Bensoussan, A., Lions, J.L. (eds) International Symposium on Systems Optimization and Analysis. Lecture Notes in Control and Information Sciences, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0002654
Download citation
DOI: https://doi.org/10.1007/BFb0002654
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09447-0
Online ISBN: 978-3-540-35232-7
eBook Packages: Springer Book Archive