Robust linear optimization under matrix completion
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3833218 (Why is no real title available?)
- scientific article; zbMATH DE number 45081 (Why is no real title available?)
- scientific article; zbMATH DE number 3200250 (Why is no real title available?)
- A monotone+skew splitting model for composite monotone inclusions in duality
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- Exact matrix completion via convex optimization
- Fixed point and Bregman iterative methods for matrix rank minimization
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- Input-Output Analysis
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Robust Solutions to Uncertain Semidefinite Programs
- Robust convex optimization
- Robust linear optimization under general norms.
- Robust optimization
- Robust optimization-methodology and applications
- Robust principal component analysis?
- Robust solutions of uncertain linear programs
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Theory and applications of robust optimization
Cited in
(5)- Γ-robust linear complementarity problems
- Optimizing electricity mix for CO2 emissions reduction: a robust input-output linear programming model
- Max-norm optimization for robust matrix recovery
- Hierarchical clustering and matrix completion for the reconstruction of world input-output tables
- Coupling input-output analysis with multiobjective linear programming models for the study of economy-energy-environment-social (E3S) trade-offs: a review
This page was built for publication: Robust linear optimization under matrix completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2254817)