Recognizing underlying sparsity in optimization
type: Item
instance of: scholarly article
title: Recognizing underlying sparsity in optimization
zbMATH Open document ID: 1163.90026
author: Sunyoung Kim
author: Masakazu Kojima
author: Philippe L. Toint
published in: Mathematical Programming. Series A. Series B
publication date: 2009-04-24T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 5547238
Wikidata QID: Q58185774
describes a project that uses: CUTEr
describes a project that uses: SparsePOP
describes a project that uses: minpack
describes a project that uses: GALAHAD
describes a project that uses: SeDuMi
describes a project that uses: LANCELOT
describes a project that uses: GLOBALLib
describes a project that uses: ve08
MaRDI profile type: Publication
full work available at URL: s10107-008-0210-4
OpenAlex ID: W2074448783
cites work: Q4288578
cites work: Q4311906
cites work: Q4023146
cites work: Q3048571
cites work: CUTEr and SifDec
cites work: GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
cites work: Q3677522
cites work: Partitioned variable metric updates for large structured optimization problems
cites work: Local convergence analysis for partitioned quasi-Newton updates
cites work: On the existence of convex decompositions of partially separable functions
cites work: Handbook of test problems in local and global optimization
cites work: Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
cites work: Sparsity in sums of squares of polynomials
cites work: A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones
cites work: Global optimization with polynomials and the problem of moments
cites work: Testing Unconstrained Optimization Software
cites work: Numerical Optimization
cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
cites work: Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
DBLP publication ID: journals/mp/KimKT09
DOI: 10.1007/S10107-008-0210-4
description: scientific article; zbMATH DE number 5547238