CALCULATION METHOD FOR QUADRATIC PROGRAMMING PROBLEM IN HILBERT SPACES, PARTIALLY ORDERED BY CONE WITH EMPTY INTERIOR

Yıl 2013, Cilt: 62 Sayı: 2, 11 - 15, 01.08.2013

Feyzullah Ahmetoğlu

https://doi.org/10.1501/Commua1_0000000694

Öz

In the article, a numerical method for convex programming problem (with linear inequality) in Hilbert spaces is given. Firstly, by Khun-Tuckerconditions problem is reduced to minimize a convex funtional under nonnegative variables. Then, last problem is solved by coordinate descent method

Anahtar Kelimeler

Convex function, Khun-Tucker conditions, minimization method

Kaynakça

• [1] F.Ahmetoglu, Kuhn-Tucker conditions for a convex programming problem in Banach spaces partially ordered by cone with empty interior. Numerical Functional Analysis and Optimization, v. 33, 4, pp. 363-373, 2011.
• [2] S.Y.Chen, S.Y.Wu, Algorithms for in…nite quadratic programming in Lp spaces. Journal of Computational and Applied Mathematics, v. 213, 2, pp. 408-422, 2008.
• [3] S.Y. Wu, A cutting plane approach for solving quadratic in…nite programming on measure spaces. Journal of Global Optimization, v. 21, 1, pp. 67-87, 2001.
• [4] J. Semple, In…nite positive-defnite quadratic programming in a Hilbert space. Journal of Optimization Theory and Applications, v. 88, 3, pp. 743-749, 1996
• [5] S.C. Fang, C.J. Lin, S. Y. Wu, Solving quadratic semiin…nite programming problemsby using relaxed cutting-plane scheme. Journal of Computational and Applied Mathematics, v. 129, pp. 89-104, 2001. Current address : Faculty of Education, Giresun University, Giresun, TURKEY E-mail address : [e-mail] URL: http://communications.science.ankara.edu.tr/index.php?series=A1