A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion
From MaRDI portal
Publication:2236545
DOI10.1007/s10915-021-01654-1zbMath1479.90152arXiv1909.06099OpenAlexW3205470900MaRDI QIDQ2236545
Jacek Gondzio, Margherita Porcelli, Stefania Bellavia
Publication date: 25 October 2021
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.06099
Computational methods for sparse matrices (65F50) Semidefinite programming (90C22) Interior-point methods (90C51) Iterative numerical methods for linear systems (65F10)
Related Items
Bregman primal-dual first-order method and application to sparse semidefinite programming, An interior point-proximal method of multipliers for linear positive semi-definite programming, A semidefinite programming approach for the projection onto the cone of negative semidefinite symmetric tensors with applications to solid mechanics
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Fixed point and Bregman iterative methods for matrix rank minimization
- Handbook on semidefinite, conic and polynomial optimization
- Convergence behavior of interior-point algorithms
- An alternating direction algorithm for matrix completion with nonnegative factors
- On the solution of large-scale SDP problems by the modified barrier method using iterative solvers
- Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- On the worst-case evaluation complexity of non-monotone line search algorithms
- Low-rank matrix completion using nuclear norm minimization and facial reduction
- An inexact dual logarithmic barrier method for solving sparse semidefinite programs
- On the steplength selection in gradient methods for unconstrained optimization
- Local minima and convergence in low-rank semidefinite programming
- Exact matrix completion via convex optimization
- A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization
- Solving Some Large Scale Semidefinite Programs via the Conjugate Residual Method
- A Singular Value Thresholding Algorithm for Matrix Completion
- Matrix completion via an alternating direction method
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- The Gauss-Newton direction in semidefinite programming
- Semidefinite optimization
- Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Two-Point Step Size Gradient Methods
- Pseudoinversus and conjugate gradients
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Semidefinite Programming
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Deterministic Guarantees for Burer‐Monteiro Factorizations of Smooth Semidefinite Programs
- ADMiRA: Atomic Decomposition for Minimum Rank Approximation
- Matrix Completion From a Few Entries
