Rigorous convergence analysis of alternating variable minimization with multiplier methods for quadratic programming problems with equality constraints
From MaRDI portal
Publication:291885
DOI10.1007/S10543-015-0563-ZzbMATH Open1357.65071OpenAlexW1478834372MaRDI QIDQ291885FDOQ291885
Authors: Min Tao, Zhong-Zhi Bai 
Publication date: 10 June 2016
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10543-015-0563-z
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
preconditioningiteration methodsolvabilityasymptotic convergenceequality-constraint quadratic programming problem
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Preconditioners for iterative methods (65F08)
Cites Work
- 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
- Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control
- 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
- Title not available (Why is that?)
- Practical methods for optimal control using nonlinear programming
- Title not available (Why is that?)
- A parallel splitting method for separable convex programs
- Mixed and Hybrid Finite Element Methods
- 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?)
- Title not available (Why is that?)
- Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
- Iterative Solution of Nonlinear Equations in Several Variables
- An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
- Title not available (Why is that?)
- Constraint preconditioners for symmetric indefinite matrices
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Eigenvalue estimates for saddle point matrices of Hermitian and indefinite leading blocks
- Numerical methods for volume preserving image registration
- On the \(O(1/t)\) convergence rate of alternating direction method with logarithmic-quadratic proximal regularization
- Spectral analysis for HSS preconditioners
- A generalized preconditioned HSS method for non-Hermitian positive definite linear systems
- A note on the alternating direction method of multipliers
- On nonsingularity of block two-by-two matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Field-Based Mixed Formulation for the Two-Dimensional Magnetostatic Problem
- 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
- Optimal alternating direction implicit preconditioners for conjugate gradient methods
Cited In (11)
- Backward and forward modified SOR iteration methods for solving standard saddle-point problems
- A modified alternating positive semidefinite splitting preconditioner for block three-by-three saddle point problems
- On SMSNSSOR iteration method for solving complex symmetric linear systems
- Editorial preface: ``Advances in numerical algebra and scientific computing
- 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\)
- 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
- ADMM-based methods for nearness skew-symmetric and symmetric solutions of matrix equation \(AXB = C\)
- Two-step modulus-based matrix splitting iteration methods for retinex problem
- On Glowinski's open question on the alternating direction method of multipliers
- A relaxed Newton-Picard like method for Huber variant of total variation based image restoration
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)
