Rigorous convergence analysis of alternating variable minimization with multiplier methods for quadratic programming problems with equality constraints
From MaRDI portal
(Redirected from Publication:291885)
Recommendations
- On preconditioned and relaxed AVMM methods for quadratic programming problems with equality constraints
- Convergence of ADMM for Three-Block Separable Quadratic Programming Problems with Linear Constraints
- Augmented Lagrangians with adaptive precision control for quadratic programming with equality constraints
- An alternating directions method of multipliers for convex quadratic second-order cone programming
- Convergence analysis of the generalized alternating direction method of multipliers with logarithmic-quadratic proximal regularization
Cites work
- scientific article; zbMATH DE number 3833218 (Why is no real title available?)
- scientific article; zbMATH DE number 3148887 (Why is no real title available?)
- scientific article; zbMATH DE number 4002053 (Why is no real title available?)
- scientific article; zbMATH DE number 4027357 (Why is no real title available?)
- scientific article; zbMATH DE number 3740690 (Why is no real title available?)
- scientific article; zbMATH DE number 3770993 (Why is no real title available?)
- scientific article; zbMATH DE number 45081 (Why is no real title available?)
- scientific article; zbMATH DE number 2021122 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- scientific article; zbMATH DE number 3366440 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Field-Based Mixed Formulation for the Two-Dimensional Magnetostatic Problem
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A generalized preconditioned HSS method for non-Hermitian positive definite linear systems
- A note on the alternating direction method of multipliers
- A parallel splitting method for separable convex programs
- An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Constraint preconditioners for symmetric indefinite matrices
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Eigenvalue estimates for saddle point matrices of Hermitian and indefinite leading blocks
- Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
- Inexact and Preconditioned Uzawa Algorithms for Saddle Point Problems
- Iterative Solution of Nonlinear Equations in Several Variables
- Local Linear Convergence of the Alternating Direction Method of Multipliers for Quadratic Programs
- Mixed and Hybrid Finite Element Methods
- Monotone Operators and the Proximal Point Algorithm
- Numerical methods for volume preserving image registration
- On generalized successive overrelaxation methods for augmented linear systems
- On nonsingularity of block two-by-two matrices
- 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
- Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control
- 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
- Spectral analysis for HSS preconditioners
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Variational Analysis
Cited in
(11)- ADMM-based methods for nearness skew-symmetric and symmetric solutions of matrix equation \(AXB = C\)
- On SMSNSSOR iteration method for solving complex symmetric linear systems
- Editorial preface: ``Advances in numerical algebra and scientific computing
- On Glowinski's open question on the alternating direction method of multipliers
- 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
- On preconditioned and relaxed AVMM methods for quadratic programming problems with equality constraints
- On ADMM-based methods for solving the nearness symmetric solution of the system of matrix equations \(a_1 Xb_1 = C_1\) and \(a_2 Xb_2 = c_2\)
- Convergence of ADMM for Three-Block Separable Quadratic Programming Problems with Linear Constraints
- Two-step modulus-based matrix splitting iteration methods for retinex problem
- A modified alternating positive semidefinite splitting preconditioner for block three-by-three saddle point problems
This page was built for publication: Rigorous convergence analysis of alternating variable minimization with multiplier 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 Q291885)