SPARSE SECOND ORDER CONE PROGRAMMING FORMULATIONS FOR CONVEX OPTIMIZATION PROBLEMS
From MaRDI portal
Publication:5505738
DOI10.15807/jorsj.51.241zbMath1152.90560OpenAlexW2164220355MaRDI QIDQ5505738
Sunyoung Kim, Kazuhiro Kobayashi, Kojima, Masakazu
Publication date: 28 January 2009
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15807/jorsj.51.241
Related Items (3)
Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems ⋮ CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization ⋮ Solving polynomial least squares problems via semidefinite programming relaxations
Uses Software
This page was built for publication: SPARSE SECOND ORDER CONE PROGRAMMING FORMULATIONS FOR CONVEX OPTIMIZATION PROBLEMS
