2022
DOI: 10.3934/math.20221039
|View full text |Cite
|
Sign up to set email alerts
|

On approximate vector variational inequalities and vector optimization problem using convexificator

Abstract: <abstract><p>In the present article, we study a vector optimization problem involving convexificator-based locally Lipschitz approximately convex functions and give some ideas for approximate efficient solutions. In terms of the convexificator, we approximate Stampacchia-Minty type vector variational inequalities and use them to describe an approximately efficient solution to the nonsmooth vector optimization problem. Moreover, we give a numerical example that attests to the credibility of our resu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2025
2025

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 29 publications
0
1
0
Order By: Relevance
“…Convexificators were recently employed by Golestani and Nobakhtian [8], Li and Zhang [19], Long and Huang [20] and Luu [21] to create the ideal circumstances for nonsmooth optimization problems. We refer to [3,4,12,16,17,18,35], and its sources for further details on convexificators.…”
Section: Introductionmentioning
confidence: 99%
“…Convexificators were recently employed by Golestani and Nobakhtian [8], Li and Zhang [19], Long and Huang [20] and Luu [21] to create the ideal circumstances for nonsmooth optimization problems. We refer to [3,4,12,16,17,18,35], and its sources for further details on convexificators.…”
Section: Introductionmentioning
confidence: 99%
“…Convexificators were recently employed by Golestani and Nobakhtian [6], Long and Huang [15] and Luu [17] to create the ideal circumstances for nonsmooth optimization problems. We refer to [12,13,18], and its sources for further details on convexificators.…”
mentioning
confidence: 99%