A Smoothing Technique for Objective Penalty Functions in Inequality‐Constrained Optimization: Applications in Wireless Sensor Networks and <scp>5G</scp> Communication

ABSTRACT This manuscript provides a smoothing technique for objective penalty functions in inequality‐constrained optimization problems. A non‐smooth penalty function is defined which is subjected to a new smoothing technique to make it smooth. The error estimates for the original and the smoothed problem are discussed. A procedure is illustrated for the development of the solution of the inequality‐constrained optimization problem and is shown to be convergent under certain specified conditions. The same can be incorporated in various application areas like Wireless Sensor Networks in the form of giving penalties to sensor nodes not fulfilling the network performance criteria and also in some other aspects like 5G communication.

Authors

Institutions

Publication Details

Journal
Internet Technology Letters
Published
2025-09-12
DOI
https://doi.org/10.1002/itl2.70095
Primary Topic
Advanced Multi-Objective Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Smoothing Technique for Objective Penalty Functions in Inequality‐Constrained Optimization: Applications in Wireless Sensor Networks and 5G Communication

Deepak Prashar, Darpan Sood, Malika Anwar Siddiqui, Nishant Jha et al.
Internet Technology Letters
Advanced Multi-Objective Optimization Algorithms
article

A Smoothing Technique for Objective Penalty Functions in Inequality‐Constrained Optimization: Applications in Wireless Sensor Networks and 5G Communication

Deepak Prashar, Darpan Sood, Malika Anwar Siddiqui, Nishant Jha, Suneel Kumar Kaushal, Amanpreet Singh, Rachit Garg, Mohammed I. Habelalmateen
article en

Abstract

ABSTRACT This manuscript provides a smoothing technique for objective penalty functions in inequality‐constrained optimization problems. A non‐smooth penalty function is defined which is subjected to a new smoothing technique to make it smooth. The error estimates for the original and the smoothed problem are discussed. A procedure is illustrated for the development of the solution of the inequality‐constrained optimization problem and is shown to be convergent under certain specified conditions. The same can be incorporated in various application areas like Wireless Sensor Networks in the form of giving penalties to sensor nodes not fulfilling the network performance criteria and also in some other aspects like 5G communication.

Internet Technology LettersVol. 8(6)
Government Medical College (IN), Lovely Professional University (IN), University of Babylon (IQ), Guru Teg Bahadur Hospital (IN), Iraqi University (IQ), University of Ha'il (SA), Kathmandu University (NP)
Openalex Percentile: Top 72%
Advanced Multi-Objective Optimization Algorithms
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.

A Smoothing Technique for Objective Penalty Functions in Inequality‐Constrained Optimization: Applications in Wireless Sensor Networks and <scp>5G</scp> Communication — Deepak Prashar, Darpan Sood, et al. · Internet Technology Letters (2025) | TGRS Research Map | TGRS