Abstract
This paper proposes a semismooth Newton method for a class of bilinear programming problems (BLPs) based on the augmented Lagrangian, in which the BLPs are reformulated as a system of nonlinear equations with original variables and Lagrange multipliers. Without strict complementarity, the convergence of the method is studied by means of theories of semismooth analysis under the linear independence constraint qualification and strong second order sufficient condition. At last, numerical results are reported to show the performance of the proposed method.
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 callMore From: Applied Mathematics-A Journal of Chinese Universities
Disclaimer: 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.
