✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
Finally, we apply our algorithm to test problems to demonstrate the effectiveness of the algorithm
📌 3 Key Takeaways
🎯
Objective & Hypothesis:In this study, we consider nonlinear inequality constrained optimization problems.
📊
Key Findings & Data:We introduce l1 exact penalty function approach with a new smoothing function based on Bezier curve.
💡
Conclusion & Impact:Finally, we apply our algorithm to test problems to demonstrate the effectiveness of the algorithm
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:l1 penalty function · Smoothing · Non-smooth optimization
Abstract
In this study, we consider nonlinear inequality constrained optimization problems. We introduce l1 exact penalty function approach with a new smoothing function based on Bezier curve. Then, we propose a new algorithm by using the differentiation based methods to solve for solving l1 exact penalty functions. Finally, we apply our algorithm to test problems to demonstrate the effectiveness of the algorithm
🔖
Cite This Article
SAHİNER, A., YILMAZ, N., KAPUSUZ, G., ÖZKARDAŞ, G. (2021). Bezier Curve Based Smoothing Penalty Function for Constrained Optimization. Journal of Multidisciplinary Modeling and Optimization, Cilt: 3 - Sayı: 2, 70–79. https://ajindex.com/articles/836264