کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5773242 | 1631079 | 2017 | 23 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On preconditioned and relaxed AVMM methods for quadratic programming problems with equality constraints
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
اعداد جبر و تئوری
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
To iteratively compute a solution of the equality-constraint quadratic programming problem, by successively introducing relaxation parameters and skillfully adopting a preconditioning matrix, we establish a preconditioned and relaxed alternating variable minimization with multiplier (PRAVMM) method, which is a further generalization of the preconditioned alternating variable minimization with multiplier (PAVMM) method proposed by Bai and Tao (2016) (BIT Numer. Math. 56 (2016), 399-422). Based on rigorous matrix analysis we demonstrate the asymptotic convergence property of the PRAVMM method. Numerical results show that the PRAVMM method is feasible and effective for solving the equality-constraint quadratic programming problems.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Linear Algebra and its Applications - Volume 516, 1 March 2017, Pages 264-285
Journal: Linear Algebra and its Applications - Volume 516, 1 March 2017, Pages 264-285
نویسندگان
Zhong-Zhi Bai, Min Tao,