SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
type: Item
instance of: scholarly article
title: SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
zbMATH Open document ID: 1321.90085
author: Liuqin Yang
author: Defeng Sun
author: Kim-Chuan Toh
published in: Mathematical Programming Computation
publication date: 2015-09-30T00:00:00Z
full work available at URL: https://arxiv.org/abs/1406.0942
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 65F10
zbMATH DE Number: 6487280
zbMATH Keywords: semidefinite programming
zbMATH Keywords: degeneracy
zbMATH Keywords: augmented Lagrangian
zbMATH Keywords: semismooth Newton-CG method
describes a project that uses: QAPLIB
describes a project that uses: DIMACS
describes a project that uses: 2EBD-HPE
MaRDI profile type: Publication
OpenAlex ID: W1861508522
arXiv ID: 1406.0942
cites work: ON MATRICES DEPENDING ON PARAMETERS
cites work: Q4503250
cites work: Convex analysis and nonlinear optimization. Theory and examples.
cites work: On the copositive representation of binary and continuous nonconvex quadratic programs
cites work: A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs
cites work: The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
cites work: Frequency planning and ramifications of coloring
cites work: Alternating direction augmented Lagrangian methods for semidefinite programming
cites work: Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
cites work: A first-order block-decomposition method for solving two-easy-block structured semidefinite programs
cites work: Q3845569
cites work: Regularization methods for SDP relaxations in large-scale polynomial optimization
cites work: Semidefinite Relaxations for Best Rank-1 Tensor Approximations
cites work: Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems
cites work: Approximating K‐means‐type Clustering via Semidefinite Programming
cites work: Copositive and semidefinite relaxations of the quadratic assignment problem
cites work: Q4050397
cites work: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: Semismooth Matrix-Valued Functions
cites work: A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
cites work: Solving Large Scale Semidefinite Programs via an Iterative Solver on the Augmented Systems
cites work: A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
DOI: 10.1007/S12532-015-0082-6
description: scientific article