SDPNAL+
From MaRDI portal
Software:25154
swMATH13239MaRDI QIDQ25154FDOQ25154
Author name not available (Why is that?)
Cited In (73)
- Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions
- An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming
- On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming
- Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
- Convex Relaxation Approaches for Strictly Correlated Density Functional Theory
- 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
- Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian
- A multilevel analysis of the Lasserre hierarchy
- DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
- 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
- On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems
- 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 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?)
- Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems
- Title not available (Why is that?)
- 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
- Scalable Semidefinite Programming
- Best Nonnegative Rank-One Approximations of Tensors
- 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
- Exploiting low-rank structure in semidefinite programming by approximate operator splitting
- SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
- An Efficient Quadratic Programming Relaxation Based Algorithm for Large-Scale MIMO Detection
- 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
- A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems
- An exact algorithm for semi-supervised minimum sum-of-squares clustering
- Mathematical Programming Models and Exact Algorithms
- Composite Difference-Max Programs for Modern Statistical Estimation Problems
- 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
- 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
- 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
- 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
- A Convex Matrix Optimization for the Additive Constant Problem in Multidimensional Scaling with Application to Locally Linear Embedding
- 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
- 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
- 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
This page was built for software: SDPNAL+