On Converse Duality for Nonsmooth Optimization Problem
Gue Myung Lee, Do Sang Kim
Abstract
Gue Myung Lee, Do Sang Kim
Abstract
Recently, Reiland [6] defined the nonsmooth invexity of Lipschitz functions and obtained the generalized Kuhn-Tucker sufficient optimality criteria, the weak duality and the strong duality for a nonlienar optimization problem (P) involving nonsmooth invex Lipschitz functions. The purpose of this brief paper, following Jeyakumar’s [4] approach, is to establish the converse duality for (P).
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Recently, Reiland [6] defined the nonsmooth invexity of Lipschitz functions and obtained the generalized Kuhn-Tucker sufficient optimality criteria, the weak duality and the strong duality for a nonlienar optimization problem (P) involving nonsmooth invex Lipschitz functions. The purpose of this brief paper, following Jeyakumar’s [4] approach, is to establish the converse duality for (P).
Key concepts: Converse, Duality (order theory), Lipschitz continuity, Mathematics, Strong duality, Duality gap, Weak duality, Perturbation function