Computational enhancements in low-rank semidefinite programming
From MaRDI portal
Publication:5475287
DOI10.1080/10556780500286582zbMath1136.90429OpenAlexW2019713176MaRDI QIDQ5475287
Publication date: 16 June 2006
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780500286582
semidefinite programmingnumerical experimentsnon-linear programminglow-rank matricesvector programming
Related Items
Structure methods for solving the nearest correlation matrix problem, A second-order cone cutting surface method: Complexity and application, Matrix completion via max-norm constrained optimization, Implementation of a primal-dual method for SDP on a shared memory parallel architecture, A semidefinite programming approach to the hypergraph minimum bisection problem, First-order semidefinite programming for the two-electron treatment of many-electron atoms and molecules
Uses Software
Cites Work
- Problems of distance geometry and convex properties of quadratic maps
- A spectral bundle method with bounds
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs
- An independent benchmarking of SDP and SOCP solvers
- Solving a class of semidefinite programs via nonlinear programming
- Local minima and convergence in low-rank semidefinite programming
- Handbook series linear algebra. Linear least squares solutions by Householder transformations
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions
- On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
- Solving Some Large Scale Semidefinite Programs via the Conjugate Residual Method
- SYMMETRIC GAUGE FUNCTIONS AND UNITARILY INVARIANT NORMS
- LAPACK Users' Guide
- Inexact Newton Methods
- Numerical Optimization
- ARPACK Users' Guide
- A BLAS-3 Version of the QR Factorization with Column Pivoting
- Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices
- PENNON: A code for convex nonlinear and semidefinite programming
- CSDP, A C library for semidefinite programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- SDPLIB 1.2, a library of semidefinite programming test problems
- A Spectral Bundle Method for Semidefinite Programming
- Automatic Preconditioning by Limited Memory Quasi-Newton Updating
- Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Benchmarking optimization software with performance profiles.
