Vector critical points and cone efficiency in nonsmooth vector optimization (Q2233604)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Vector critical points and cone efficiency in nonsmooth vector optimization
scientific article

    Statements

    Vector critical points and cone efficiency in nonsmooth vector optimization (English)
    0 references
    0 references
    0 references
    0 references
    11 October 2021
    0 references
    Vector critical points in the senses of Fritz John and Karush-Kuhn-Tucker as well as weakly \(K\)-efficient and \(K\)-efficient solutions to nonsmooth vector optimization problems with cone and equality constraints are studied in the situation when each component of the involved functions is locally Lipschitz continuous under cone-\(FJ\)-pseudo-invexity and cone-\(KT\)-pseudo-invexity hypotheses and via the Clarke generalized gradient for vector-valued functions, respectively.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    nonsmooth mutiobjective programming
    0 references
    vector critical point
    0 references
    (weakly) efficiency
    0 references
    nonsmooth cone-\(FJ\)-pseudo-invexity
    0 references
    nonsmooth cone-\(KT\)-pseudo-invexity
    0 references
    optimality conditions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references