On preconditioned and relaxed AVMM methods for quadratic programming problems with equality constraints

DOI10.1016/j.laa.2016.11.038zbMath1352.65096OpenAlexW2559500155WikidataQ114851453 ScholiaQ114851453MaRDI QIDQ730628

Min Tao, Zhong Zhi Bai

Publication date: 28 December 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2016.11.038

zbMATH Keywords

preconditioningiteration methodasymptotic convergenceequality-constraint quadratic programming problemsuccessive relaxation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Quadratic programming (90C20) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)

Related Items (4)

Backward and Forward Modified SOR Iteration Methods for Solving Standard Saddle-Point Problems ⋮ On equivalence of three-parameter iterative methods for singular symmetric saddle-point problem ⋮ Two-step modulus-based matrix splitting iteration methods for retinex problem ⋮ A relaxed Newton-Picard like method for Huber variant of total variation based image restoration

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Rigorous convergence analysis of alternating variable minimization with multiplier methods for quadratic programming problems with equality constraints
• Application of denoising methods to regularizationof ill-posed problems
• Fractional regularization matrices for linear discrete ill-posed problems
• New choices of preconditioning matrices for generalized inexact parameterized iterative methods
• A generalization of parameterized inexact Uzawa method for generalized saddle point problems
• A reduced Newton method for constrained linear least-squares problems
• Optimal alternating direction implicit preconditioners for conjugate gradient methods
• On parameterized inexact Uzawa methods for generalized saddle point problems
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• On generalized parameterized inexact Uzawa method for a block two-by-two linear system
• The Uzawa-HSS method for saddle-point problems
• A generalization of the inexact parameterized Uzawa methods for saddle point problems
• On generalized successive overrelaxation methods for augmented linear systems
• On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
• Image Denoising via Residual Kurtosis Minimization
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Inexact and Preconditioned Uzawa Algorithms for Saddle Point Problems
• Variational Analysis
• Numerical methods for volume preserving image registration
• Conjugate Gradient Methods for Toeplitz Systems
• On the $O(1/t)$ Convergence Rate of Alternating Direction Method with Logarithmic-Quadratic Proximal Regularization
• Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
• Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
• Biomedical Image Registration
• On the Location of Zeros of Certain Classes of Polynomials with Applications to Numerical Analysis
• Methods of conjugate gradients for solving linear systems

This page was built for publication: On preconditioned and relaxed AVMM methods for quadratic programming problems with equality constraints