Abstract
A sequential generalized quadratic programming algorithm for nonlinear programming problems with equality and inequality constraints that uses an l 1 penalty function is described. The algorithm incorporates an automatic adjustment rule for the selection of two penalty parameters and uses an Armijo-type line search procedure and second order corrections. Global convergence and local superlinear convergence results are proved. Numerical results are given to illustrate the performance of the algorithm.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
