Generalized Lagrange multipliers for nonconvex directionally differentiable programs.
https://doi.org/10.1007/0-387-26771-9_10Publisher, magazine: ,
Publication year: 2005
Lưu Trích dẫn Chia sẻAbstract
A class of nonconvex optimization problems in which all the functions involved are directionally differentiable is considered. Necessary optimality conditions of Kuhn-Tucker type based on the directional derivatives are proved. Here the Lagrange multipliers generally depend on the directions. It is shown that for various concrete classes of problems (including classes convex problems, locally Lipschitz problems, composite nonsmooth problems), generalized Lagrange multipliers collapse to the standard ones (i.e., Lagrange multipliers are constants as usual). Optimality conditions for quasidifferentiable problems are derived from the main results. Optimality conditions for a class of problems in which all the functions possess upper DSL-approximates are also derived from the framework.
Tags: Directional Kuhn-Tucker condition, quasidifferentiable functions, regularity conditions, upper approximates, invexity, composite problems, optimality conditions.
Các bài viết liên quan đến tác giả Nguyễn Định
Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
Farkas-type results and duality for DC programs with convex constraints
Liberating the subgradient optimality conditions from constraint qualifications
From linear to convex systems: consistency, Farkas’ lemma and applications
Directional Kuhn-Tucker condition and duality for quasidifferentiable programs