Pages that link to "Item:Q1330895"

The following pages link to A proximal-based deomposition method for compositions method for convex minimization problems (Q1330895):

Displaying 50 items.

• Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm (Q256102) (← links)
• Convergence analysis of L-ADMM for multi-block linear-constrained separable convex minimization problem (Q259135) (← links)
• A new parallel splitting augmented Lagrangian-based method for a Stackelberg game (Q267702) (← links)
• New descent LQP alternating direction methods for solving a class of structured variational inequalities (Q288023) (← links)
• Bounding duality gap for separable problems with linear constraints (Q288396) (← links)
• A descent LQP alternating direction method for solving variational inequality problems with separable structure (Q295243) (← links)
• A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints (Q301677) (← links)
• Convergence rates with inexact non-expansive operators (Q312687) (← links)
• An algorithm twisted from generalized ADMM for multi-block separable convex minimization models (Q313627) (← links)
• On the global and linear convergence of direct extension of ADMM for 3-block separable convex minimization models (Q314977) (← links)
• An inexact LQP alternating direction method for solving a class of structured variational inequalities (Q316538) (← links)
• An alternating direction method for second-order conic programming (Q336362) (← links)
• Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems (Q354625) (← links)
• Linearized alternating direction method with adaptive penalty and warm starts for fast solving transform invariant low-rank textures (Q361272) (← links)
• A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms (Q368722) (← links)
• A parallel splitting method for separable convex programs (Q382899) (← links)
• A new decomposition method for variational inequalities with linear constraints (Q415382) (← links)
• Coupling the gradient method with a general exterior penalization scheme for convex minimization (Q415412) (← links)
• Modified Lagrangian methods for separable optimization problems (Q437562) (← links)
• An asymmetric proximal decomposition method for convex programming with linearly coupling constraints (Q447556) (← links)
• Lagrangian-penalization algorithm for constrained optimization and variational inequalities (Q452269) (← 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)
• Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization (Q467471) (← 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 augmented Lagrangian method for distributed optimization (Q494348) (← links)
• Saddle point mirror descent algorithm for the robust PageRank problem (Q505294) (← links)
• On the \(O(1/t)\) convergence rate of Ye-Yuan's modified alternating direction method of multipliers (Q505760) (← links)
• The hybrid proximal decomposition method applied to the computation of a Nash equilibrium for hydrothermal electricity markets (Q535723) (← links)
• An improved proximal alternating direction method for monotone variational inequalities with separable structure (Q540633) (← links)
• Hybrid approximate proximal method with auxiliary variational inequality for vector optimization (Q604261) (← links)
• A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs (Q613430) (← links)
• Alternating direction augmented Lagrangian methods for semidefinite programming (Q621749) (← links)
• Fast minimization methods for solving constrained total-variation superresolution image reconstruction (Q632177) (← links)
• A unified primal-dual algorithm framework based on Bregman iteration (Q639393) (← links)
• Alternating direction method for bi-quadratic programming (Q652699) (← links)
• A class of linearized proximal alternating direction methods (Q658552) (← links)
• Alternating direction method of multipliers with difference of convex functions (Q723734) (← links)
• Lagrangian penalization scheme with parallel forward-backward splitting (Q725876) (← links)
• New augmented Lagrangian-based proximal point algorithm for convex optimization with equality constraints (Q727234) (← links)
• The improvement with relative errors of He et al.'s inexact alternating direction method for monotone variational inequalities (Q815484) (← links)
• Continuous dynamics related to monotone inclusions and non-smooth optimization problems (Q829490) (← links)
• Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities (Q842770) (← links)
• Interior-point Lagrangian decomposition method for separable convex optimization (Q846931) (← links)
• Inexact proximal point method for general variational inequalities (Q852837) (← links)
• The prediction-correction approach to nonlinear complementarity problems (Q853010) (← 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)