On preconditioned and relaxed AVMM methods for quadratic programming problems with equality constraints
DOI10.1016/J.LAA.2016.11.038zbMATH Open1352.65096OpenAlexW2559500155WikidataQ114851453 ScholiaQ114851453MaRDI QIDQ730628FDOQ730628
Authors: 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
Recommendations
- Rigorous convergence analysis of alternating variable minimization with multiplier methods for quadratic programming problems with equality constraints
- Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy
- scientific article; zbMATH DE number 590053
- Semi-monotonic inexact augmented Lagrangians for quadratic programing with equality constraints
- Augmented Lagrangians with adaptive precision control for quadratic programming with equality constraints
preconditioningiteration methodasymptotic convergenceequality-constraint quadratic programming problemsuccessive relaxation
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Convex programming (90C25) Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10)
Cites Work
- Biomedical Image Registration
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Variational Analysis
- Title not available (Why is that?)
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Methods of conjugate gradients for solving linear systems
- A generalization of the inexact parameterized Uzawa methods for saddle point problems
- Practical methods for optimal control using nonlinear programming
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- On generalized successive overrelaxation methods for augmented linear systems
- Title not available (Why is that?)
- Conjugate Gradient Methods for Toeplitz Systems
- Title not available (Why is that?)
- Inexact and Preconditioned Uzawa Algorithms for Saddle Point Problems
- Title not available (Why is that?)
- On the Location of Zeros of Certain Classes of Polynomials with Applications to Numerical Analysis
- On parameterized inexact Uzawa methods for generalized saddle point problems
- The Uzawa-HSS method for saddle-point problems
- Title not available (Why is that?)
- Numerical methods for volume preserving image registration
- On the \(O(1/t)\) convergence rate of alternating direction method with logarithmic-quadratic proximal regularization
- A generalization of parameterized inexact Uzawa method for generalized saddle point problems
- Rigorous convergence analysis of alternating variable minimization with multiplier methods for quadratic programming problems with equality constraints
- 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
- A reduced Newton method for constrained linear least-squares problems
- Optimal alternating direction implicit preconditioners for conjugate gradient methods
- On generalized parameterized inexact Uzawa method for a block two-by-two linear system
- New choices of preconditioning matrices for generalized inexact parameterized iterative methods
- Image Denoising via Residual Kurtosis Minimization
- Application of denoising methods to regularizationof ill-posed problems
- Fractional regularization matrices for linear discrete ill-posed problems
Cited In (4)
- On equivalence of three-parameter iterative methods for singular symmetric saddle-point problem
- Backward and Forward Modified SOR Iteration Methods for Solving Standard Saddle-Point Problems
- 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
This page was built for publication: On preconditioned and relaxed AVMM methods for quadratic programming problems with equality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q730628)
