Affiliation:
1. Department of Mathematics, Ferhat Abbas University of Setif-1, Setif 19137, Algeria
Abstract
In this work, we integrate some new approximate functions using the logarithmic penalty method to solve nonlinear optimization problems. Firstly, we determine the direction by Newton’s method. Then, we establish an efficient algorithm to compute the displacement step according to the direction. Finally, we illustrate the superior performance of our new approximate function with respect to the line search one through a numerical experiment on numerous collections of test problems.
Funder
The General Directorate of Scientific Research and Technological Development
Reference25 articles.
1. An algorithm for quadratic programming;Frank;Nav. Res. Logist. Q.,1956
2. A Duality Theorem for Nonlinear Programming;Wolfe;Q. Appl. Math.,1961
3. Bracken, J., and M1cCormiek, G.P. (1968). Selected Applications of Nonlinear Programming, John Wiley & Sons, Inc.
4. Fiacco, A.V., and McCormick, G.P. (1968). Nonlinear Programming: Sequential Unconstrained Minimization Techniques, John Wiley & Sons, Inc.
5. Bonnans, J.-F., Gilbert, J.-C., Lemaréchal, C., and Sagastizàbal, C. (2003). Numerical Optimization: Theoretical and Practical Aspects, Springer. Mathematics and Applications.