Robust solutions of uncertain complex-valued quadratically constrained programs
From MaRDI portal
Publication:2519336
DOI10.1007/s10114-008-5656-zzbMath1186.90087OpenAlexW2108515966MaRDI QIDQ2519336
Publication date: 26 January 2009
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-008-5656-z
Cites Work
- A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
- Approximation bounds for quadratic maximization and max-cut problems with semidefinite programming relaxation
- Approximating the 2-catalog segmentation problem using semidefinite programming relaxations
This page was built for publication: Robust solutions of uncertain complex-valued quadratically constrained programs