SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
From MaRDI portal
Publication:4972547
DOI10.1080/10556788.2019.1576176zbMath1432.90104arXiv1710.10604OpenAlexW2963774730WikidataQ128336091 ScholiaQ128336091MaRDI QIDQ4972547
Xinyuan Zhao, Defeng Sun, Kim-Chuan Toh, Yancheng Yuan
Publication date: 25 November 2019
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.10604
Related Items
Mathematical Programming Models and Exact Algorithms, An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming, Certifying the global optimality of quartic minimization over the sphere, 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, Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis, An exact algorithm for semi-supervised minimum sum-of-squares clustering, Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs, A facial reduction approach for the single source localization problem, Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications, An entropy-regularized ADMM for binary quadratic programming, A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem, Partitioning through projections: strong SDP bounds for large graph partition problems, Unnamed Item, Efficient, certifiably optimal clustering with applications to latent variable graphical models, Approximation of the Shannon capacity via matrix cone programming, A DCA-Newton method for quartic minimization over the sphere, Near-optimal bounds for generalized orthogonal Procrustes problem via generalized power method, An efficient augmented Lagrangian method for support vector machine, An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity, T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming, A proximal DC approach for quadratic assignment problem, Best Nonnegative Rank-One Approximations of Tensors, \(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex, SDPNAL+, Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space, An Efficient Quadratic Programming Relaxation Based Algorithm for Large-Scale MIMO Detection, B-subdifferential of the projection onto the generalized spectraplex
Uses Software
Cites Work
- Solving semidefinite-quadratic-linear programs using SDPT3
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Copositive and semidefinite relaxations of the quadratic assignment problem
- A first-order block-decomposition method for solving two-easy-block structured semidefinite programs
- A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs
- Semidefinite Relaxations for Best Rank-1 Tensor Approximations
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- An SDP-Based Divide-and-Conquer Algorithm for Large-Scale Noisy Anchor-Free Graph Realization
- On the Shannon capacity of a graph
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- 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)
- Frequency planning and ramifications of coloring
- A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
- Approximating K‐means‐type Clustering via Semidefinite Programming
- A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
