Pages that link to "Item:Q4972547"
From MaRDI portal
The following pages link to SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0) (Q4972547):
Displaying 37 items.
- SDPNAL+ (Q25154) (← links)
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints (Q499161) (← links)
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming (Q1741120) (← links)
- T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming (Q2026772) (← links)
- A proximal DC approach for quadratic assignment problem (Q2028476) (← links)
- \(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex (Q2057228) (← links)
- Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space (Q2079694) (← links)
- B-subdifferential of the projection onto the generalized spectraplex (Q2115259) (← links)
- An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming (Q2148144) (← links)
- Certifying the global optimality of quartic minimization over the sphere (Q2158108) (← links)
- Efficient, certifiably optimal clustering with applications to latent variable graphical models (Q2425167) (← links)
- An exact algorithm for semi-supervised minimum sum-of-squares clustering (Q2676354) (← links)
- SDPLIB 1.2, a library of semidefinite programming test problems (Q4504799) (← links)
- An Efficient Quadratic Programming Relaxation Based Algorithm for Large-Scale MIMO Detection (Q4997173) (← links)
- (Q4998873) (← links)
- Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
- SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning (Q5084594) (← links)
- MathOptInterface: A Data Structure for Mathematical Optimization Problems (Q5085984) (← links)
- An efficient augmented Lagrangian method for support vector machine (Q5135259) (← links)
- An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity (Q5162656) (← links)
- Best Nonnegative Rank-One Approximations of Tensors (Q5203971) (← links)
- Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis (Q6041110) (← links)
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs (Q6044986) (← links)
- A facial reduction approach for the single source localization problem (Q6064050) (← links)
- Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications (Q6071884) (← links)
- An entropy-regularized ADMM for binary quadratic programming (Q6085714) (← links)
- A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem (Q6097765) (← links)
- Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293) (← links)
- Approximation of the Shannon capacity via matrix cone programming (Q6151010) (← links)
- A DCA-Newton method for quartic minimization over the sphere (Q6168057) (← links)
- Near-optimal bounds for generalized orthogonal Procrustes problem via generalized power method (Q6172167) (← links)
- A Corrected Inexact Proximal Augmented Lagrangian Method with a Relative Error Criterion for a Class of Group-Quadratic Regularized Optimal Transport Problems (Q6500198) (← links)
- Semi-definite programming and quantum information (Q6561827) (← links)
- A feasible method for general convex low-rank SDP problems (Q6573007) (← links)
- Lower bounds of functions on finite abelian groups (Q6591628) (← links)
- T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization (Q6606854) (← links)
- Multiscale semidefinite programming approach to positioning problems with pairwise structure (Q6629219) (← links)
