Robust linear optimization under matrix completion

DOI10.1007/s11425-013-4697-7zbMath1308.65099OpenAlexW2253789357MaRDI QIDQ2254817

Shouwen Wen, Chen Lin, ZaiWen Wen, Fang Fang Xu

Publication date: 6 February 2015

Published in: Science China. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-013-4697-7

zbMATH Keywords

linear programmingnumerical examplesmatrix completionrobust optimizationinput-output analysis

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Input-output approaches in control theory (93D25) Matrix completion problems (15A83)

Related Items

Hierarchical clustering and matrix completion for the reconstruction of world input-output tables, Optimizing electricity mix for CO2 emissions reduction: a robust input-output linear programming model, Coupling input-output analysis with multiobjective linear programming models for the study of economy-energy-environment-social (E3S) trade-offs: a review

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fixed point and Bregman iterative methods for matrix rank minimization
• Robust linear optimization under general norms.
• Robust solutions of uncertain linear programs
• Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
• Robust optimization-methodology and applications
• Exact matrix completion via convex optimization
• Robust Convex Optimization
• Robust principal component analysis?
• Theory and Applications of Robust Optimization
• A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality
• Input-Output Analysis
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Robust Solutions to Uncertain Semidefinite Programs
• Robust Solutions to Least-Squares Problems with Uncertain Data
• The Power of Convex Relaxation: Near-Optimal Matrix Completion