Pages that link to "Item:Q4190443"

The following pages link to Modified Lagrangians in convex programming and their generalizations (Q4190443):

Displaying 38 items.

• An inexact generalized PRSM with LQP regularization for structured variational inequalities and its applications to traffic equilibrium problems (Q295005) (← links)
• Another weak convergence theorems for accretive mappings in Banach spaces (Q362446) (← links)
• Extended extragradient methods for generalized variational inequalities (Q410894) (← links)
• A symmetric version of the generalized alternating direction method of multipliers for two-block separable convex programming (Q530249) (← links)
• Strong convergence of an iterative algorithm for variational inequalities in Banach spaces (Q646088) (← links)
• The generalized proximal point algorithm with step size 2 is not necessarily convergent (Q721955) (← links)
• Lagrangian penalization scheme with parallel forward-backward splitting (Q725876) (← links)
• Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach (Q742299) (← links)
• New inertial factors of the Krasnosel'skiĭ-Mann iteration (Q829879) (← links)
• Weak convergence of an iterative sequence for accretive operators in Banach spaces (Q884246) (← links)
• On convergence criteria of generalized proximal point algorithms (Q929905) (← links)
• An algorithmic framework of generalized primal-dual hybrid gradient methods for saddle point problems (Q1702597) (← links)
• On Glowinski's open question on the alternating direction method of multipliers (Q1730806) (← links)
• On the optimal linear convergence rate of a generalized proximal point algorithm (Q1742669) (← links)
• A parameterized proximal point algorithm for separable convex optimization (Q1800446) (← links)
• Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis (Q2010228) (← links)
• Convergence rates for an inexact ADMM applied to separable convex optimization (Q2023686) (← links)
• Accelerated proximal point method for maximally monotone operators (Q2235140) (← links)
• Convex relaxation of a class of vertex penalizing functionals (Q2251199) (← links)
• Convergence analysis of the generalized alternating direction method of multipliers with logarithmic-quadratic proximal regularization (Q2260661) (← links)
• Convergence analysis of the relaxed proximal point algorithm (Q2319250) (← links)
• Semidefinite inverse eigenvalue problems with prescribed entries and partial eigendata (Q2346642) (← links)
• Inexact alternating direction methods of multipliers for separable convex optimization (Q2419545) (← links)
• On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective (Q2419572) (← links)
• A proximal point algorithm revisit on the alternating direction method of multipliers (Q2441139) (← links)
• Weak convergence of a projection algorithm for variational inequalities in a Banach space (Q2465177) (← links)
• Generalized alternating direction method of multipliers: new theoretical insights and applications (Q2516351) (← links)
• A customized proximal point algorithm for convex minimization with linear constraints (Q2636606) (← links)
• An iterative method based on ADMM for solving generalized Sylvester matrix equations (Q2676138) (← links)
• Weak and strong convergence of generalized proximal point algorithms with relaxed parameters (Q2694524) (← links)
• The augmented Lagrangian method with full Jacobian decomposition and logarithmic-quadratic proximal regularization for multiple-block separable convex programming (Q4967363) (← links)
• (Q5081914) (← links)
• Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming (Q5275290) (← links)
• A rank-two relaxed parallel splitting version of the augmented Lagrangian method with step size in (0,2) for separable convex programming (Q5886869) (← links)
• The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent (Q5962713) (← links)
• A variable projection method for large-scale inverse problems with \(\ell^1\) regularization (Q6086881) (← links)
• A two-stage numerical approach for the sparse initial source identification of a diffusion–advection equation ^* (Q6171606) (← links)
• The geometry of monotone operator splitting methods (Q6598417) (← links)