SDPNAL+

swMATH13239MaRDI QIDQ25154FDOQ25154

Author name not available (Why is that?)

Described by source

• SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
• SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints

Cited In (73)

• SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning
• A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP
• A new homotopy proximal variable-metric framework for composite convex minimization
• Computing the best approximation over the intersection of a polyhedral set and the doubly nonnegative cone
• On degenerate doubly nonnegative projection problems
• Memory-efficient structured convex optimization via extreme point sampling
• An optimal-storage approach to semidefinite programming using approximate complementarity
• An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming
• 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
• B-subdifferential of the projection onto the generalized spectraplex
• Lower bounds on the global minimum of a polynomial
• A Three-Operator Splitting Perspective of a Three-Block ADMM for Convex Quadratic Semidefinite Programming and Beyond
• Unified convergence analysis of a second-order method of multipliers for nonlinear conic programming
• Composite difference-MAX programs for modern statistical estimation problems
• Covariate regularized community detection in sparse graphs
• On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems
• The linear and asymptotically superlinear convergence rates of the augmented Lagrangian method with a practical relative error criterion
• Spectral operators of matrices
• SDP-based bounds for graph partition via extended ADMM
• 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 note on the sufficient initial condition ensuring the convergence of directly extended 3-block ADMM for special semidefinite programming
• Title not available (Why is that?)
• Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems
• On the nonergodic convergence rate of an inexact augmented Lagrangian framework for composite convex programming
• 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
• 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
• Quadratic growth conditions for convex matrix optimization problems associated with spectral functions
• A novel formulation of the max-cut problem and related algorithm
• Exploiting low-rank structure in semidefinite programming by approximate operator splitting
• Spectral operators of matrices: semismoothness and characterizations of the generalized Jacobian
• DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
• SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
• An efficient augmented Lagrangian method for support vector machine
• Algorithm 996
• MathOptInterface: A Data Structure for Mathematical Optimization Problems
• An ADMM-based interior-point method for large-scale linear programming
• QPPAL: A Two-phase Proximal Augmented Lagrangian Method for High-dimensional Convex Quadratic Programming Problems
• \(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex
• Clustering subgaussian mixtures by semidefinite programming
• An exact algorithm for semi-supervised minimum sum-of-squares clustering
• Proximal gradient method for nonsmooth optimization over the Stiefel manifold
• A Newton-bracketing method for a simple conic optimization problem
• Clustering is semidefinitely not that hard: nonnegative SDP for manifold disentangling
• A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring
• 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
• 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 SemiSmooth Newton Method for Semidefinite Programs and its Applications in Electronic Structure Calculations
• A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
• A robust Lagrangian-DNN method for a class of quadratic optimization problems

This page was built for software: SDPNAL+