scientific article; zbMATH DE number 6453677

MaRDI QIDQ5260299zbMATH OpenFDO

Authors Yun Yang, Zheng Peng

Publication date 29 June 2015

zbMATH Keywords

convex optimizationvariational inequalityparallel splitting methodseparable structure

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• A parallel splitting method for separable convex programs
• A proximal partially parallel splitting method for separable convex programs
• An inexact hybrid splitting method for separable convex optimization
• A partially parallel prediction-correction splitting method for convex optimization problems with separable structure
• Some parallel splitting methods for separable convex programming with the \(O(\frac{1}{t})\) convergence rate
• A splitting method for separable convex programming
• An application of splitting methods to convex partially separable optimization problems
• A parallel splitting ALM-based algorithm for separable convex programming
• scientific article; zbMATH DE number 1064843
• A parallel Gauss-Seidel method for convex problems with separable structure

Cited in

(18)

• An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints
• A parallel splitting method for separable convex programs
• Sequential threshold control in descent splitting methods for decomposable optimization problems
• A partially parallel prediction-correction splitting method for convex optimization problems with separable structure
• Study on the Splitting Methods for Separable Convex Optimization in a Unified Algorithmic Framework
• Fast inexact decomposition algorithms for large-scale separable convex optimization
• A parallel splitting ALM-based algorithm for separable convex programming
• A splitting method for separable convex programming
• An inexact parallel splitting augmented Lagrangian method for monotone variational inequalities with separable structures
• An augmented-Lagrangian-based parallel splitting method for solving network resource allocation problems
• A partial inexact proximal point method for separable convex programming
• An application of splitting methods to convex partially separable optimization problems
• A splitting algorithm for constrained optimization problems with parabolic equations
• Adaptive descent splitting method for decomposable optimization problems
• An inexact partial alternating direction method for convex programming problem
• An inexact hybrid splitting method for separable convex optimization
• A proximal partially parallel splitting method for separable convex programs
• A parallel Gauss-Seidel method for convex problems with separable structure

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5260299)