The following pages link to (Q4311908):
Displayed 50 items.
- Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm (Q256102) (← links)
- Vector network equilibrium problems with elastic demands (Q377741) (← links)
- A new decomposition method for variational inequalities with linear constraints (Q415382) (← links)
- An inexact parallel splitting augmented Lagrangian method for monotone variational inequalities with separable structures (Q453611) (← links)
- An inexact alternating direction method for structured variational inequalities (Q481766) (← links)
- A proximal alternating direction method of multipliers for a minimization problem with nonconvex constraints (Q496623) (← links)
- On the \(O(1/t)\) convergence rate of Ye-Yuan's modified alternating direction method of multipliers (Q505760) (← links)
- An improved proximal alternating direction method for monotone variational inequalities with separable structure (Q540633) (← links)
- A class of linearized proximal alternating direction methods (Q658552) (← links)
- An efficient simultaneous method for the constrained multiple-sets split feasibility problem (Q694525) (← links)
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach (Q742299) (← links)
- A multi-mode expansion method for boundary optimal control problems constrained by random Poisson equations (Q779916) (← links)
- Convergence study of indefinite proximal ADMM with a relaxation factor (Q782911) (← links)
- The improvement with relative errors of He et al.'s inexact alternating direction method for monotone variational inequalities (Q815484) (← links)
- Decomposition approaches for constrained spatial auction market problems (Q844131) (← links)
- An improved proximal-based decomposition method for structured monotone variational inequalities (Q940504) (← links)
- New parallel descent-like method for solving a class of variational inequalities (Q987502) (← links)
- A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems (Q1031700) (← links)
- Convergence analysis and applications of the Glowinski-Le Tallec splitting method for finding a zero of the sum of two maximal monotone operators (Q1265027) (← links)
- A variable-penalty alternating directions method for convex optimization (Q1290650) (← links)
- New decomposition methods for solving variational inequality problems. (Q1410985) (← links)
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities (Q1594875) (← links)
- Nonlinear proximal decomposition method for convex programming (Q1594877) (← links)
- Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM (Q1659676) (← links)
- Precompact convergence of the nonconvex primal-dual hybrid gradient algorithm (Q1675933) (← links)
- A simple alternating direction method for the conic trust region subproblem (Q1721084) (← links)
- Proximal alternating direction method with relaxed proximal parameters for the least squares covariance adjustment problem (Q1724494) (← links)
- On Glowinski's open question on the alternating direction method of multipliers (Q1730806) (← links)
- An efficient alternating direction method of multipliers for optimal control problems constrained by random Helmholtz equations (Q1751062) (← links)
- A parallel descent algorithm for convex programming (Q1908925) (← links)
- The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem (Q1919810) (← links)
- The dual step size of the alternating direction method can be larger than 1.618 when one function is strongly convex (Q1983679) (← links)
- An alternating direction method of multipliers with the BFGS update for structured convex quadratic optimization (Q1983931) (← links)
- A survey on some recent developments of alternating direction method of multipliers (Q2136506) (← links)
- Supervised distance preserving projection using alternating direction method of multipliers (Q2190310) (← links)
- Generalized risk parity portfolio optimization: an ADMM approach (Q2200091) (← links)
- Alternating direction method for covariance selection models (Q2276406) (← links)
- A proximal alternating direction method for multi-block coupled convex optimization (Q2313761) (← links)
- An alternating direction method of multipliers for elliptic equation constrained optimization problem (Q2360969) (← links)
- Proximal alternating direction-based contraction methods for separable linearly constrained convex optimization (Q2430823) (← links)
- Relaxed augmented Lagrangian-based proximal point algorithms for convex optimization with linear constraints (Q2438398) (← links)
- A modified alternating projection based prediction-correction method for structured variational inequalities (Q2452996) (← links)
- Proximal alternating directions method for structured variational inequalities (Q2454732) (← links)
- A proximal ADMM with the Broyden family for convex optimization problems (Q2666686) (← links)
- A decomposition method for solving multicommodity network equilibria (Q2670467) (← links)
- A survey on operator splitting and decomposition of convex programs (Q2969955) (← links)
- Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes (Q3179612) (← links)
- On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming (Q3454507) (← links)
- On alternating direction method for solving variational inequality problems with separable structure (Q4631799) (← links)
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization (Q4911905) (← links)