کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10348275 | 699363 | 2012 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
The hill detouring method for minimizing hinging hyperplanes functions
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: The hill detouring method for minimizing hinging hyperplanes functions The hill detouring method for minimizing hinging hyperplanes functions](/preview/png/10348275.png)
چکیده انگلیسی
This paper studies the problem of minimizing hinging hyperplanes (HH) which is a widely applied nonlinear model. To deal with HH minimization, we transform it into a d.c. (difference of convex functions) programming and a concave minimization on a polyhedron, then some mature techniques are applicable. More importantly, HH is a continuous piecewise linear function and for concave HH, the super-level sets are polyhedra. Inspired by this property, we establish a method which searches on the counter map in order to escape a local optimum. Intuitively, this method bypasses the super-level set and is hence called hill detouring method, following the name of hill climbing. In numerical experiments, the proposed algorithm is compared with CPLEX and a heuristic algorithm showing its effectiveness.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 39, Issue 7, July 2012, Pages 1763-1770
Journal: Computers & Operations Research - Volume 39, Issue 7, July 2012, Pages 1763-1770
نویسندگان
Xiaolin Huang, Jun Xu, Xiaomu Mu, Shuning Wang,