Abstract
We study a primal-dual path following method for mathematical programming problems, based on an exponential penalty function suitably adapted to handle equality as well as inequality constraints. The primal-dual approach avoids the ill-conditioning associated with the primal exponential penalty method. Moreover, under strong second order sufficient conditions we prove that the method has a quadratic rate of convergence, improving the known results for primal methods based on the exponential penalty
Sign-in/Register to access full text options 
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.
