Abstract
We discuss unique solvability of the equality-constraint quadratic programming problem, establish a class of preconditioned alternating variable minimization with multiplier (PAVMM) methods for iteratively computing its solution, and demonstrate asymptotic convergence property of these PAVMM methods. We also discuss an algebraic derivation of the PAVMM method by making use of matrix splitting, which reveals that the PAVMM method is actually a modified block Gauss–Seidel iteration method for solving the augmented Lagrangian linear system resulting from the weighted Lagrangian function with respect to the equality-constraint quadratic programming problem.
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.
