SDPNAL+
From MaRDI portal
Cited in
(only showing first 100 items - show all)- MADAM
- QAPLIB
- SOS-SDP
- ProxSDP
- SE-Sync
- SDPLIB
- SDPHA
- SeDuMi
- SDPT3
- DSDP5
- Mosek
- QSDP
- SDPLR
- A primal majorized semismooth Newton-CG augmented Lagrangian method for large-scale linearly constrained convex programming
- COL
- PENSDP
- SNLSDP
- A multilevel analysis of the Lasserre hierarchy
- ADMM for the SDP relaxation of the QAP
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems
- NCSOStools
- On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems
- T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming
- A proximal DC approach for quadratic assignment problem
- Tensor theta norms and low rank recovery
- Manopt
- \(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex
- Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space
- Unified convergence analysis of a second-order method of multipliers for nonlinear conic programming
- A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems
- Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
- B-subdifferential of the projection onto the generalized spectraplex
- SDP-based bounds for graph partition via extended ADMM
- A globally convergent method for solving a quartic generalized Markowitz portfolio problem
- Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints
- An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming
- A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring
- On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming
- SDPNAL
- Biq Mac
- A novel formulation of the max-cut problem and related algorithm
- When do birds of a feather flock together? \(k\)-means, proximity, and conic programming
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
- Accuracy of approximate projection to the semidefinite cone
- Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms
- On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
- Spectral operators of matrices
- Efficient, certifiably optimal clustering with applications to latent variable graphical models
- Semidefinite relaxations for semi-infinite polynomial programming
- BiqMac
- DISCO
- An exact algorithm for semi-supervised minimum sum-of-squares clustering
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
- An efficient inexact ABCD method for least squares semidefinite programming
- SCS
- CDCS
- QSDPNAL
- EMPIAR
- CTFFIND
- RTRMC
- IMRO
- SPOT
- Rudy
- BiqCrunch
- SPOTless
- FMS
- ADMM_QAP
- BBCPOP
- Sparse-BSOS
- Sieve-SDP
- 2EBD-HPE
- Composite difference-MAX programs for modern statistical estimation problems
- A SemiSmooth Newton Method for Semidefinite Programs and its Applications in Electronic Structure Calculations
- Quadratic growth conditions for convex matrix optimization problems associated with spectral functions
- Clustering subgaussian mixtures by semidefinite programming
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- Clustering is semidefinitely not that hard: nonnegative SDP for manifold disentangling
- Lower bounds on the global minimum of a polynomial
- A note on the sufficient initial condition ensuring the convergence of directly extended 3-block ADMM for special semidefinite programming
- frlib
- Algorithm 996
- An efficient quadratic programming relaxation based algorithm for large-scale MIMO detection
- scientific article; zbMATH DE number 7370526 (Why is no real title available?)
- Covariate regularized community detection in sparse graphs
- A Newton-bracketing method for a simple conic optimization problem
- An ADMM-based interior-point method for large-scale linear programming
- Scalable semidefinite programming
- Exploiting low-rank structure in semidefinite programming by approximate operator splitting
- Mathematical programming models and exact algorithms
- A new homotopy proximal variable-metric framework for composite convex minimization
- SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning
- MathOptInterface: A Data Structure for Mathematical Optimization Problems
- A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP
- SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
- An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming
- An efficient augmented Lagrangian method for support vector machine
- The linear and asymptotically superlinear convergence rates of the augmented Lagrangian method with a practical relative error criterion
- A Three-Operator Splitting Perspective of a Three-Block ADMM for Convex Quadratic Semidefinite Programming and Beyond
- Memory-efficient structured convex optimization via extreme point sampling
This page was built for software: SDPNAL+
