|
|||||
|
|
A sufficient optimality theoriem for protoconvex programs |
|
| Abstract: | We establish two first order sufficient optimality theorems; one for unconstrained nonlinear minimization problem, and the other for constrained nonlinear minimization problems, both with non-differentiable protoconvex or quasiconvex data functions that are not necessarily locally Lipschitz |
| Keywords: | Nonlinear programming Non-differentiable Protoconvex Quasiconvex Generalized gradient Asymptotic gradient First order optimality conditions Kar-ush - Kuhn -Tucker conditions Epigraph Normal cone |