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