On the study of sparse linear programming

MaRDI QIDQ5382238zbMATH OpenFDO

Authors Shengjie Chen, Yuhong Dai, Feng-Min Xu

Publication date 21 June 2019

zbMATH Keywords

alternating direction method of multipliersnon-convex optimizationconvergence analysisNP-hardsparse linear programming

Mathematics Subject Classification ID

Linear programming (90C05) Nonconvex programming, global optimization (90C26) Stability and convergence of numerical methods for initial value and initial-boundary value problems involving PDEs (65M12)

Recommendations

• Alternating direction method of multipliers for linear programming
• Short-term sparse portfolio optimization based on alternating direction method of multipliers
• Sparse solutions of linear complementarity problems
• scientific article; zbMATH DE number 3852786
• Sparse approximations with interior point methods

Cited in

(2)

• Lagrangian duality and saddle points for sparse linear programming
• Short-term sparse portfolio optimization based on alternating direction method of multipliers

This page was built for publication: On the study of sparse linear programming

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