Pages that link to "Item:Q1202587"
From MaRDI portal
The following pages link to Application of the alternating direction method of multipliers to separable convex programming problems (Q1202587):
Displaying 50 items.
- Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm (Q256102) (← links)
- A new parallel splitting augmented Lagrangian-based method for a Stackelberg game (Q267702) (← links)
- Bounding duality gap for separable problems with linear constraints (Q288396) (← links)
- An alternating direction method for Nash equilibrium of two-person games with alternating offers (Q353164) (← links)
- On the \(O(1/t)\) convergence rate of the parallel descent-like method and parallel splitting augmented Lagrangian method for solving a class of variational inequalities (Q371479) (← links)
- A new parallel splitting descent method for structured variational inequalities (Q380579) (← links)
- A parallel splitting method for separable convex programs (Q382899) (← links)
- A new decomposition method for variational inequalities with linear constraints (Q415382) (← links)
- Modified Lagrangian methods for separable optimization problems (Q437562) (← links)
- An asymmetric proximal decomposition method for convex programming with linearly coupling constraints (Q447556) (← links)
- An inexact parallel splitting augmented Lagrangian method for monotone variational inequalities with separable structures (Q453611) (← links)
- An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints (Q461441) (← links)
- An inexact alternating direction method for structured variational inequalities (Q481766) (← links)
- Proximal-based pre-correction decomposition methods for structured convex minimization problems (Q489115) (← links)
- A relaxed projection method for split variational inequalities (Q493247) (← links)
- An alternating direction method with increasing penalty for stable principal component pursuit (Q493688) (← links)
- A new alternating direction method for linearly constrained nonconvex optimization problems (Q496618) (← links)
- On the \(O(1/t)\) convergence rate of Ye-Yuan's modified alternating direction method of multipliers (Q505760) (← links)
- Accelerating a Gibbs sampler for variable selection on genomics data with summarization and variable pre-selection combining an array DBMS and R (Q506436) (← links)
- Decomposition methods for a spatial model for long-term energy pricing problem (Q522102) (← links)
- An improved proximal alternating direction method for monotone variational inequalities with separable structure (Q540633) (← links)
- An LQP-based descent method for structured monotone variational inequalities (Q609244) (← links)
- A class of linearized proximal alternating direction methods (Q658552) (← links)
- A computation study on an integrated alternating direction method of multipliers for large scale optimization (Q683915) (← 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)
- The improvement with relative errors of He et al.'s inexact alternating direction method for monotone variational inequalities (Q815484) (← links)
- Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities (Q842770) (← links)
- Separable augmented Lagrangian algorithm with multidimensional scaling for monotropic programming (Q850824) (← links)
- On the convergence rate of a class of proximal-based decomposition methods for monotone variational inequalities (Q888313) (← links)
- A proximal alternating linearization method for minimizing the sum of two convex functions (Q892779) (← links)
- An augmented Lagrangian-based parallel splitting method for a one-leader-two-follower game (Q898709) (← links)
- Optimal matrix pencil approximation problem in structural dynamic model updating (Q902808) (← links)
- Alternating direction method for structure-persevering finite element model updating problem (Q907569) (← links)
- An improved proximal-based decomposition method for structured monotone variational inequalities (Q940504) (← links)
- An inexact parallel splitting augmented Lagrangian method for large system of linear equations (Q972939) (← links)
- An improved prediction-correction method for monotone variational inequalities with separable operators (Q980130) (← links)
- New parallel descent-like method for solving a class of variational inequalities (Q987502) (← links)
- Proximal-point algorithm using a linear proximal term (Q1028604) (← links)
- A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems (Q1031700) (← links)
- A variable-penalty alternating directions method for convex optimization (Q1290650) (← links)
- A proximal-based deomposition method for compositions method for convex minimization problems (Q1330895) (← 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)
- Alternating direction method for generalized Sylvester matrix equation \(AXB + CYD = E\) (Q1643043) (← links)
- Proximal alternating direction method with relaxed proximal parameters for the least squares covariance adjustment problem (Q1724494) (← links)
- Two-level primal-dual proximal decomposition technique to solve large scale optimization problems (Q1764717) (← links)
- Variable splitting based method for image restoration with impulse plus Gaussian noise (Q1792943) (← links)
- The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem (Q1919810) (← links)
