Pages that link to "Item:Q2424935"

The following pages link to A generalization of linearized alternating direction method of multipliers for solving two-block separable convex programming (Q2424935):

Displaying 13 items.

• Linearized symmetric multi-block ADMM with indefinite proximal regularization and optimal proximal parameter (Q831269) (← links)
• A projected extrapolated gradient method with larger step size for monotone variational inequalities (Q2046702) (← links)
• The partially shared values and small functions for meromorphic functions in a \(k\)-punctured complex plane (Q2068079) (← links)
• The existence and forms of solutions for some Fermat-type differential-difference equations (Q2132817) (← links)
• An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems (Q2226322) (← links)
• The properties of solutions for several types of Painlevé equations concerning fixed-points, zeros and poles (Q2278428) (← links)
• Growth and approximation of Laplace-Stieltjes transform with \((p, q)\)-proximate order converges on the whole plane (Q2305198) (← links)
• Inertial proximal strictly contractive peaceman-Rachford splitting method with an indefinite term for convex optimization (Q2306407) (← links)
• Inertial generalized proximal Peaceman-Rachford splitting method for separable convex programming (Q2664392) (← links)
• An inertial subgradient extragradient algorithm with adaptive stepsizes for variational inequality problems (Q5058384) (← links)
• Modified Tseng's extragradient methods for variational inequality on Hadamard manifolds (Q5156462) (← links)
• Multi-step inertial strictly contractive PRSM algorithms for convex programming problems with applications (Q6049292) (← links)
• Linearized generalized ADMM-based algorithm for multi-block linearly constrained separable convex programming in real-world applications (Q6126060) (← links)