SDPLR
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A feasible method for optimization with orthogonality constraints
- CSDP
- L0BnB
- ProxSDP
- SE-Sync
- SDPLIB
- First- and second-order methods for semidefinite programming
- LFTB
- SDPA
- Interior-point algorithms for semidefinite programming based on a nonlinear formulation
- SeDuMi
- SDPT3
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- SDPpack
- PENNON
- DSDP5
- Benchmarks for Optimization Software
- QSDP
- SMCP
- Using negative curvature in solving nonlinear programs
- CirCut
- COL
- SDLS
- DSPCA
- Max-AO
- ConicBundle
- PENSDP
- SNLSDP
- A multilevel analysis of the Lasserre hierarchy
- On semidefinite relaxations for the block model
- Visualizing network communities with a semi-definite programming method
- Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems
- lambda
- From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
- Algorithms for positive semidefinite factorization
- Efficient semidefinite branch-and-cut for MAP-MRF inference
- COMPleib
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
- Solving \(k\)-cluster problems to optimality with semidefinite programming
- Unconstrained formulation of standard quadratic optimization problems
- Two proposals for robust PCA using semidefinite programming
- SDPARA
- SDP_S
- SBmethod
- Simple algorithms for optimization on Riemannian manifolds with constraints
- Scalable incremental nonconvex optimization approach for phase retrieval
- A survey on conic relaxations of optimal power flow problem
- Low-rank factorization for rank minimization with nonconvex regularizers
- On the Burer-Monteiro method for general semidefinite programs
- Manopt
- NOA
- Outward rotations
- Non-convex exact community recovery in stochastic block model
- Convergence rate of block-coordinate maximization Burer-Monteiro method for solving large SDPs
- AtMostNValue
- ptsplib
- AllDifferent
- Proof methods for robust low-rank matrix recovery
- Sums of squares and quadratic persistence on real projective varieties
- A block coordinate descent method for sensor network localization
- Low tubal rank tensor recovery using the Bürer-Monteiro factorisation approach. Application to optical coherence tomography
- On the tightness of SDP relaxations of QCQPs
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
- Lurupa
- Lower bounds for finding stationary points I
- A brief introduction to manifold optimization
- A look at robustness and stability of \(\ell_1\)-versus \(\ell_0\)-regularization: discussion of papers by Bertsimas et al. and Hastie et al.
- \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM
- Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation
- SDPNAL
- A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion
- Biq Mac
- Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
- Using a factored dual in augmented Lagrangian methods for semidefinite programming
- Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers
- SLRA
- Improved row-by-row method for binary quadratic optimization problems
- A fast algorithm for the semi-definite relaxation of the state estimation problem in power grids
- Kernel based support vector machine via semidefinite programming: application to medical diagnosis
- Implementation of a primal-dual method for SDP on a shared memory parallel architecture
- Relaxation and decomposition methods for mixed integer nonlinear programming.
- Optimality conditions for nonlinear semidefinite programming via squared slack variables
- SDP-based branch-and-bound for non-convex quadratic integer optimization
- Jellyfish
- Eigentaste
- Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem
- Optspace
- BiqMac
- SymNMF
- A semidefinite programming-based heuristic for graph coloring
- Local minima and convergence in low-rank semidefinite programming
- Lagrangian smoothing heuristics for Max-cut
- Semidefinite programming relaxations and algebraic optimization in control
- SDPNAL+
- dsyevx
- MADAM
- A continuation algorithm for max-cut problem
- A strengthened Barvinok-Pataki bound on SDP rank
- A global exact penalty for rank-constrained optimization problem and applications
This page was built for software: SDPLR
