Abstract
Presents an efficient descent algorithm for a class of unconstrained optimization problems of nonlinear large mesh-interconnected systems. This algorithm combines an approximate scaled gradient method with a textured decomposition-based block Gauss-Seidel method. The authors prove that their algorithm is globally convergent and that it is numerically stable. The authors also demonstrate the computational efficiency of the method compared with the Newton-like method associated with the sparse matrix technique through several numerical experiments.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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.
