|
On Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions
|
| |
|
|
|
چکیده: (26806 مشاهده) |
| Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constraint qualifications. It is proved that nonsmooth complementary approximate Karush-Kuhn-Tucker conditions are stronger than nonsmooth approximate gradient projection conditions. Sufficiency for differentiable generalized convex programming is established. |
|
| |
|
|
متن کامل [PDF 828 kb]
(31746 دریافت)
|
نوع مطالعه: پژوهشی |
موضوع مقاله:
Other
دریافت: 1392/6/3 | پذیرش: 1393/6/28 | انتشار: 1394/6/25
|
|
|
|
|
|
|
| ارسال نظر درباره این مقاله |
|
|
|
