Comparative Analysis Of Smooth Penalty Function Algorithms In Nonlinear Inequality Constrained Optimization

Abstract :- In this paper the comparative analysis of the four algorithms elucidates distinct convergence behaviours and performance attributes is provided. Algorithms I and II demonstrates an accelerated convergence rate, rendering them advantageous in scenarios prioritizing expeditious optimization. Algorithm III, while exhibiting prompt stabilization, may not attain the minimal objective function value. Algorithm IV, offering a compromise between convergence speed and the final objective function value, is a viable option when a balanced approach is deemed acceptable. Keywords :- Smooth Penalty Function, Second Order Smooth Penalty Function, Algorithms, Objective Function, Optimality Conditions