✨
Yapay Zeka Hızlı Bakış & Çıkarımlar
AI Insight⚡ TL;DR(1 Cümlede Hızlı Çıkarım)
Then, last problem is solved by coordinate descent method
📌 3 Maddede Bu Makale
🎯
Amaç & Hipotez:In the article, a numerical method for convex programming problem (with linear inequality) in Hilbert spaces is given.
📊
Temel Bulgular & Veri:Firstly, by Khun-Tuckerconditions problem is reduced to minimize a convex funtional under nonnegative variables.
💡
Sonuç & Katkı:Then, last problem is solved by coordinate descent method
🔬Tür:Araştırma Makalesi
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Convex function · Khun-Tucker conditions · minimization method
Abstract
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
🔖
Bu Makaleye Atıf Yap
AHMETOĞLU, F. (2013). CALCULATION METHOD FOR QUADRATIC PROGRAMMING PROBLEM IN HILBERT SPACES, PARTIALLY ORDERED BY CONE WITH EMPTY INTERIOR. Communications Faculty of Sciences University of Ankara Series A1 Mathematics and Statistics, Cilt: 62 - Sayı: 2, 11–15. https://ajindex.com/articles/747392