An inexact partial alternating direction method for convex programming problem

MaRDI QIDQ2993171zbMATH OpenFDO

Authors Xiaobiao Chen, X. W. Xue

Publication date 10 August 2016

zbMATH Keywords

alternating direction methodconvex programmingprediction correction methodvariational inequalities

Mathematics Subject Classification ID

Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• A partial inexact proximal point method for separable convex programming
• Application of the alternating direction method of multipliers to separable convex programming problems
• scientific article; zbMATH DE number 6453677
• An alternating direction-based contraction method for linearly constrained separable convex programming problems
• Inexact alternating direction methods of multipliers for separable convex optimization

Cited in

(7)

• A partially inexact proximal alternating direction method of multipliers and its iteration-complexity analysis
• A line-search-based partial proximal alternating directions method for separable convex optimization
• Inexact alternating direction methods of multipliers for separable convex optimization
• An alternating linearization method with inexact data for bilevel nonsmooth convex optimization
• Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization
• A descent SQP alternating direction method for minimizing the sum of three convex functions
• A partial inexact proximal point method for separable convex programming

This page was built for publication: An inexact partial alternating direction method for convex programming problem

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