Abstract
In this paper, we consider the convex minimization problem
where f: IRn → IR is a convex function and D ⊂ IRn is a convex, closed and bounded subset. We suppose that \( M: = Arg{\min_{{x \in D}}}f(x) \ne \phi \), i.e. f attains its minimum on D.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cegielski, A., On a relaxation algorithm in convex optimization problems, Technical Report, Institute of Mathematics, Higher College of Engineering, Zielona Góra, Poland, 1992.
Cegielski, A., Relaxation Methods in Convex Optimization Problems, Higher College of Engineering, Series Monographies, No. 67, Zielona Góra, Poland 1993 (Polish).
Cegielski, A., Projection onto an acute cone and convex feasibility problems, in Lecture Notes in Control and Information Science 197, J. Henry and J.-P. Yvon, eds., Springer-Verlag, London, 1994, pp. 187–194.
Kim, S., Ahn, H., Cho, S.-C., Variable target value subgradient method, Mathematical Programming 49 (1991) 359–369.
Kiwiel, K. C., Block-iterative surrogate projection methods for convex feasibility problems, Linear Algebra and Applications, (1994) (to appear).
Kiwiel, K. C., The efficiency of subgradient projection methods for convex optimization, part I: General level methods, Technical Report, System Research Institute, Warsaw 1994.
Kiwiel, K. C., The efficiency of subgradient projection methods for convex optimization, part II: Implementations and extensions, Technical Report, System Research Institute, Warsaw 1994.
C. Lemaréchal, A. S. Nemirovskii and YU. E. Nesterov, New variants of bundle methods, Research Report 1508, INRIA, Roquencourt, 1991.
Polyak, B. T., Minimization of unsmooth functionals, Zh. Vychisl. Mat. i Mat. Fiz. 9 (1969) 509–521 (Russian). English translation in U.S.S.R. Comput. Math. and Math. Phys. 9 (1969) 14–29.
Shchepakin, M. B., On a modification of a class of algorithms for mathematical programming, Zh. Vychisl. Mat. i Mat. Fiz. 19 (1979) 1387–1395 (Russian).
Todd, M. J., Some remarks on the relaxation method for linear inequalities, Technical Report 419, Cornell University, Cornell, Ithaca, 1979.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cegielski, A. (1996). Variable Target Subgradient Method of Projection onto an Acute Cone in Convex Minimization. In: Kleinschmidt, P., Bachem, A., Derigs, U., Fischer, D., Leopold-Wildburger, U., Möhring, R. (eds) Operations Research Proceedings 1995. Operations Research Proceedings, vol 1995. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-80117-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-80117-4_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60806-6
Online ISBN: 978-3-642-80117-4
eBook Packages: Springer Book Archive