کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4640762 | 1341286 | 2010 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A superlinear space decomposition algorithm for constrained nonsmooth convex program
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
A class of constrained nonsmooth convex optimization problems, that is, piecewise C2C2 convex objectives with smooth convex inequality constraints are transformed into unconstrained nonsmooth convex programs with the help of exact penalty function. The objective functions of these unconstrained programs are particular cases of functions with primal–dual gradient structure which has connection with VUVU space decomposition. Then a VUVU space decomposition method for solving this unconstrained program is presented. This method is proved to converge with local superlinear rate under certain assumptions. An illustrative example is given to show how this method works.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Computational and Applied Mathematics - Volume 234, Issue 1, 1 May 2010, Pages 224–232
Journal: Journal of Computational and Applied Mathematics - Volume 234, Issue 1, 1 May 2010, Pages 224–232
نویسندگان
Yuan Lu, Li-Ping Pang, Fang-Fang Guo, Zun-Quan Xia,