Abstract
<abstract><p>Many problems in different fields may lead to solutions of absolute value equations, such as linear programming problems, linear complementarity problems, quadratic programming, mixed integer programming, the bimatrix game and so on. In this paper, by introducing a nonnegative real parameter to the modified Newton-based iteration scheme, we present a new relaxed modified Newton-based (RMN) iteration method for solving generalized absolute value equations. The famous Picard iteration method and the modified Newton-type iteration method are the exceptional cases of the RMN iteration method. The convergence property of the new method is discussed. Finally, the validity and feasibility of the RMN iteration method are verified by experimental examples.</p></abstract>
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.
