Abstract
When a Sequential Quadratic Programming (SQP) method is used to solve the nonlinear programming problems, one of the main difficulties is that the Quadratic Programming (QP) subproblem may be incompatible. In this paper, an SQP algorithm is given by modifying the traditional QP subproblem and applying a class of penalty function whose penalty parameters can be adjusted automatically. The new QP subproblem is compatible. Under the extended Mangasarian-Fromovitz constraint qualification condition and the boundedness of the iterates, the algorithm is showed to be globally convergent to a KKT point of the non-linear programming problem.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
