On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives (Q2311119): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-018-1292-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2809728774 / rank
 
Normal rank

Revision as of 03:25, 20 March 2024

scientific article
Language Label Description Also known as
English
On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives
scientific article

    Statements

    On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives (English)
    0 references
    0 references
    0 references
    0 references
    10 July 2019
    0 references
    The paper considers nondifferentiable vector optimization problems of the form \(\min f(x) \text{ s.t. } g_i(x) \leqq 0, i=1, \ldots, m\) with respect to a closed, convex and pointed cone \(C\) with nonempty interior. It is assumed that \(f\) is \(C\)-convex and that constraint functions \(g_i\) are convex. Using separation theorems, the authors prove KKT necessary and sufficient optimality conditions for weakly \(C-\epsilon\) efficient solutions. Moreover, they present a Wolfe type dual problem and prove weak and strong duality results.
    0 references
    0 references
    0 references
    0 references
    0 references
    weakly \(C-\epsilon\)-efficient solution
    0 references
    \(C\)-convexity
    0 references
    KKT optimality conditions
    0 references
    Wolfe duality
    0 references
    0 references