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
- Deepak Prashar (ORCID: https://orcid.org/0000-0002-8786-1115)
- Darpan Sood
- Malika Anwar Siddiqui
- Nishant Jha (ORCID: https://orcid.org/0000-0003-2758-1215)
- Suneel Kumar Kaushal (ORCID: https://orcid.org/0000-0002-6434-4385)
- Amanpreet Singh (ORCID: https://orcid.org/0000-0002-7903-6764)
- Rachit Garg (ORCID: https://orcid.org/0000-0002-2996-5530)
- Mohammed I. Habelalmateen
Institutions
- 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)
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