Exact l$_1$ penalty function for nonsmooth multiobjective interval-valued problems

Our objective in this article is to explore the idea of an unconstrained problem using the exact l1 penalty function for the nonsmooth multiobjective interval-valued problem (MIVP) having inequality and equality constraints.First of all, we figure out the KKT-type optimality conditions for the problem (MIVP).Next, we establish the equivalence between the set of weak LU-efficient solutions to the problem (MIVP) and the penalized problem (MIVP) with the exact l1 penalty function.The utility of this transformation lies in the fact that it converts constrained problems to unconstrained ones.To accurately predict the applicability of the results presented in the paper, meticulously crafted examples are provided.

Authors

Publication Details

Journal
Kybernetika
Published
2024-12-19
DOI
https://doi.org/10.14736/kyb-2024-5-0652
Primary Topic
Optimization and Variational Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Exact l$_1$ penalty function for nonsmooth multiobjective interval-valued problems

Ashish Kumar Prasad, Julie Khatri
Kybernetika
Optimization and Variational Analysis
article

Exact l$_1$ penalty function for nonsmooth multiobjective interval-valued problems

Ashish Kumar Prasad, Julie Khatri
article en

Abstract

Our objective in this article is to explore the idea of an unconstrained problem using the exact l1 penalty function for the nonsmooth multiobjective interval-valued problem (MIVP) having inequality and equality constraints.First of all, we figure out the KKT-type optimality conditions for the problem (MIVP).Next, we establish the equivalence between the set of weak LU-efficient solutions to the problem (MIVP) and the penalized problem (MIVP) with the exact l1 penalty function.The utility of this transformation lies in the fact that it converts constrained problems to unconstrained ones.To accurately predict the applicability of the results presented in the paper, meticulously crafted examples are provided.

Kybernetika
Reduced inequalities
Openalex Percentile: Top 72%
Optimization and Variational Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.