Pages that link to "Item:Q1235959"
From MaRDI portal
The following pages link to A dual algorithm for the solution of nonlinear variational problems via finite element approximation (Q1235959):
Displaying 50 items.
- On the \(O(1/t)\) convergence rate of Ye-Yuan's modified alternating direction method of multipliers (Q505760) (← links)
- An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming (Q507319) (← links)
- A note on the convergence of ADMM for linearly constrained convex optimization problems (Q513720) (← links)
- Comparison of several fast algorithms for projection onto an ellipsoid (Q515784) (← links)
- On the linear convergence of the alternating direction method of multipliers (Q517301) (← links)
- Stability and performance verification of optimization-based controllers (Q518285) (← links)
- An inexact alternating direction method of multipliers with relative error criteria (Q519776) (← links)
- Mean field type control with congestion. II: An augmented Lagrangian method (Q520350) (← links)
- A note on the convergence of alternating proximal gradient method (Q529911) (← links)
- A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming (Q530249) (← links)
- An improved proximal alternating direction method for monotone variational inequalities with separable structure (Q540633) (← links)
- A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs (Q613430) (← links)
- Fast minimization methods for solving constrained total-variation superresolution image reconstruction (Q632177) (← links)
- A new alternating direction method for solving variational inequalities (Q651537) (← links)
- Alternating direction method for bi-quadratic programming (Q652699) (← links)
- A class of linearized proximal alternating direction methods (Q658552) (← links)
- Analysis of convergence for the alternating direction method applied to joint sparse recovery (Q668704) (← links)
- A three-operator splitting scheme and its optimization applications (Q683303) (← links)
- Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications (Q683737) (← links)
- Remarks on the generalized Newton method (Q687040) (← links)
- An alternating direction algorithm for matrix completion with nonnegative factors (Q693195) (← links)
- An efficient simultaneous method for the constrained multiple-sets split feasibility problem (Q694525) (← links)
- A class of ADMM-based algorithms for three-block separable convex programming (Q721954) (← links)
- Alternating direction method of multipliers with difference of convex functions (Q723734) (← links)
- Convergence analysis of the direct extension of ADMM for multiple-block separable convex minimization (Q723737) (← links)
- A \(\mathcal O(1/k^{3/2})\) hybrid proximal extragradient primal-dual interior point method for nonlinear monotone mixed complementarity problems (Q725814) (← links)
- Lagrangian penalization scheme with parallel forward-backward splitting (Q725876) (← links)
- Pointwise and ergodic convergence rates of a variable metric proximal alternating direction method of multipliers (Q725878) (← links)
- An efficient finite element solution using a large pre-solved regular element (Q726289) (← links)
- On preconditioned and relaxed AVMM methods for quadratic programming problems with equality constraints (Q730628) (← links)
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach (Q742299) (← links)
- On the convergence rate of Douglas-Rachford operator splitting method (Q747781) (← links)
- Auxiliary problem principle and decomposition of optimization problems (Q755159) (← links)
- Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization (Q779740) (← links)
- Generalized ADMM with optimal indefinite proximal term for linearly constrained convex optimization (Q781096) (← links)
- Rank minimization with applications to image noise removal (Q781854) (← links)
- Convergence study of indefinite proximal ADMM with a relaxation factor (Q782911) (← links)
- Managing randomization in the multi-block alternating direction method of multipliers for quadratic optimization (Q823888) (← links)
- Convergence analysis on a modified generalized alternating direction method of multipliers (Q824590) (← links)
- Modified hybrid decomposition of the augmented Lagrangian method with larger step size for three-block separable convex programming (Q824816) (← links)
- Alternating direction method of multipliers with variable metric indefinite proximal terms for convex optimization (Q827573) (← links)
- A parallel Gauss-Seidel method for convex problems with separable structure (Q827578) (← links)
- Accelerated proximal algorithms with a correction term for monotone inclusions (Q832632) (← links)
- Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities (Q842770) (← links)
- Decomposition approaches for constrained spatial auction market problems (Q844131) (← links)
- A reliability-based stochastic traffic assignment model for network with multiple user classes under uncertainty in demand (Q862476) (← links)
- An extended alternating direction method for variational inequality problems with linear equality and inequality constraints (Q879552) (← links)
- Augmented Lagrangian methods for transport optimization, mean field games and degenerate elliptic equations (Q887112) (← links)
- A fast splitting method tailored for Dantzig selector (Q887167) (← links)
- On the sublinear convergence rate of multi-block ADMM (Q888303) (← links)
