An approximate alternating linearization decomposition method

MaRDI QIDQ2868962zbMATH OpenFDO

Authors Li-Ping Pang, Zun-Quan Xia, Dan Li

Publication date 30 December 2013

Published in Journal of Applied Mathematics \& Informatics (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Recommendations

• Proximal Decomposition Via Alternating Linearization
• An accelerated linearized alternating direction method of multipliers
• An approximate decomposition algorithm for convex minimization
• scientific article; zbMATH DE number 4101816
• scientific article; zbMATH DE number 4099182
• Alternating direction method of multipliers for linear programming
• Linearized alternating direction method for constrained linear least-squares problem.
• scientific article; zbMATH DE number 2127843
• An alternating projections algorithm for solving linear programs

Cited in

(8)

• An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information
• Fast alternating linearization methods for minimizing the sum of two convex functions
• Proximal Decomposition Via Alternating Linearization
• An Analysis of Approximate Nonlinear Elimination
• Proximal decomposition of convex optimization via an alternating linearization algorithm with inexact oracles
• Inexact proximal penalty alternating linearization decomposition scheme of nonsmooth convex constrained optimization problems
• An alternative algorithm for a sliding window ULV decomposition
• A proximal alternating linearization method for minimizing the sum of two convex functions

This page was built for publication: An approximate alternating linearization decomposition method

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