Abstract
The mixed-integer extension of the well-known Augmented Lagrangian Alternating Direction Inexact Newton (ALADIN) method has been shown to have favourable results for a number of different problems from battery scheduling to reactive power dispatch. Despite the demonstrated convergence for these problems, a general convergence proof has thus far been an open question. To this effect, the present paper proves limited convergence properties for the mixed-integer ALADIN algorithm and provides a new algorithm for detecting a class of problems for which convergence is not possible.
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.
