On preconditioned and relaxed AVMM methods for quadratic programming problems with equality constraints
From MaRDI portal
(Redirected from Publication:730628)
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
Cites work
- scientific article; zbMATH DE number 3148887 (Why is no real title available?)
- scientific article; zbMATH DE number 4027357 (Why is no real title available?)
- scientific article; zbMATH DE number 3770993 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A generalization of parameterized inexact Uzawa method for generalized saddle point problems
- A generalization of the inexact parameterized Uzawa methods for saddle point problems
- A reduced Newton method for constrained linear least-squares problems
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Application of denoising methods to regularizationof ill-posed problems
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Biomedical Image Registration
- Conjugate Gradient Methods for Toeplitz Systems
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Fractional regularization matrices for linear discrete ill-posed problems
- Image denoising via residual kurtosis minimization
- Inexact and Preconditioned Uzawa Algorithms for Saddle Point Problems
- Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
- Methods of conjugate gradients for solving linear systems
- Monotone Operators and the Proximal Point Algorithm
- New choices of preconditioning matrices for generalized inexact parameterized iterative methods
- Numerical methods for volume preserving image registration
- On generalized parameterized inexact Uzawa method for a block two-by-two linear system
- On generalized successive overrelaxation methods for augmented linear systems
- 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
- On the Location of Zeros of Certain Classes of Polynomials with Applications to Numerical Analysis
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- On the \(O(1/t)\) convergence rate of alternating direction method with logarithmic-quadratic proximal regularization
- Optimal alternating direction implicit preconditioners for conjugate gradient methods
- Practical methods for optimal control using nonlinear programming
- Rate of Convergence Analysis of Decomposition Methods Based on the Proximal Method of Multipliers for Convex Minimization
- Rigorous convergence analysis of alternating variable minimization with multiplier methods for quadratic programming problems with equality constraints
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- The Uzawa-HSS method for saddle-point problems
- Variational Analysis
Cited in
(5)- Rigorous convergence analysis of alternating variable minimization with multiplier methods for quadratic programming problems with equality constraints
- 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
- A relaxed Newton-Picard like method for Huber variant of total variation based image restoration
- Two-step modulus-based matrix splitting iteration methods for retinex problem
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)
