Klep, Igor; Magron, Victor; Povh, Janez Sparse noncommutative polynomial optimization. (English) Zbl 1494.90072 Math. Program. 193, No. 2 (B), 789-829 (2022). MSC: 90C23 90C22 47N10 13J10 PDFBibTeX XMLCite \textit{I. Klep} et al., Math. Program. 193, No. 2 (B), 789--829 (2022; Zbl 1494.90072) Full Text: DOI arXiv Link
Polyak, B. T.; Khlebnikov, M. V.; Shcherbakov, P. S. Linear matrix inequalities in control systems with uncertainty. (English. Russian original) Zbl 1460.93056 Autom. Remote Control 82, No. 1, 1-40 (2021); translation from Avtom. Telemekh. 2021, No. 1, 3-54 (2021). MSC: 93C41 93C73 93C05 PDFBibTeX XMLCite \textit{B. T. Polyak} et al., Autom. Remote Control 82, No. 1, 1--40 (2021; Zbl 1460.93056); translation from Avtom. Telemekh. 2021, No. 1, 3--54 (2021) Full Text: DOI
Wang, Jie; Magron, Victor; Lasserre, Jean-Bernard Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension. (English) Zbl 1457.90106 SIAM J. Optim. 31, No. 1, 114-141 (2021). MSC: 90C22 65K05 90C26 05C15 14P10 12D15 PDFBibTeX XMLCite \textit{J. Wang} et al., SIAM J. Optim. 31, No. 1, 114--141 (2021; Zbl 1457.90106) Full Text: DOI arXiv
Kim, Sunyoung; Kojima, Masakazu; Toh, Kim-Chuan Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures. (English) Zbl 1444.90090 J. Glob. Optim. 77, No. 3, 513-541 (2020). MSC: 90C20 90C26 PDFBibTeX XMLCite \textit{S. Kim} et al., J. Glob. Optim. 77, No. 3, 513--541 (2020; Zbl 1444.90090) Full Text: DOI arXiv
Ito, Naoki; Kim, Sunyoung; Kojima, Masakazu; Takeda, Akiko; Toh, Kim-Chuan Algorithm 996: BBCPOP: a sparse doubly nonnegative relaxation of polynomial optimization problems with binary, box, and complementarity constraints. (English) Zbl 1486.65065 ACM Trans. Math. Softw. 45, No. 3, Article No. 34, 26 p. (2019). MSC: 65K10 PDFBibTeX XMLCite \textit{N. Ito} et al., ACM Trans. Math. Softw. 45, No. 3, Article No. 34, 26 p. (2019; Zbl 1486.65065) Full Text: DOI arXiv
Weisser, Tillmann; Lasserre, Jean B.; Toh, Kim-Chuan Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity. (English) Zbl 1402.90136 Math. Program. Comput. 10, No. 1, 1-32 (2018). MSC: 90C26 90C22 PDFBibTeX XMLCite \textit{T. Weisser} et al., Math. Program. Comput. 10, No. 1, 1--32 (2018; Zbl 1402.90136) Full Text: DOI arXiv
Josz, Cédric; Molzahn, Daniel K. Lasserre hierarchy for large scale polynomial optimization in real and complex variables. (English) Zbl 1395.90196 SIAM J. Optim. 28, No. 2, 1017-1048 (2018). MSC: 90C22 90C06 90C26 28A99 14Q99 47N10 PDFBibTeX XMLCite \textit{C. Josz} and \textit{D. K. Molzahn}, SIAM J. Optim. 28, No. 2, 1017--1048 (2018; Zbl 1395.90196) Full Text: DOI arXiv
Mishra, Prabhat K.; Chatterjee, Debasish; Quevedo, Daniel E. Sparse and constrained stochastic predictive control for networked systems. (English) Zbl 1378.93151 Automatica 87, 40-51 (2018). MSC: 93E20 93C10 PDFBibTeX XMLCite \textit{P. K. Mishra} et al., Automatica 87, 40--51 (2018; Zbl 1378.93151) Full Text: DOI arXiv
Bugarin, Florian; Henrion, Didier; Lasserre, Jean Bernard Minimizing the sum of many rational functions. (English) Zbl 1364.90268 Math. Program. Comput. 8, No. 1, 83-111 (2016). MSC: 90C26 90C22 46N10 65K05 PDFBibTeX XMLCite \textit{F. Bugarin} et al., Math. Program. Comput. 8, No. 1, 83--111 (2016; Zbl 1364.90268) Full Text: DOI arXiv
Li, Li Selected applications of convex optimization. (English) Zbl 1321.90005 Springer Optimization and Its Applications 103. Beijing: Tsinghua University Press; Berlin: Springer (ISBN 978-7-302-39029-9/pbk; 978-3-662-46355-0/pbk; 978-3-662-46356-7/ebook). x, 140 p. (2015). Reviewer: Rembert Reemtsen (Cottbus) MSC: 90-02 90C25 90C90 00A69 PDFBibTeX XMLCite \textit{L. Li}, Selected applications of convex optimization. Beijing: Tsinghua University Press; Berlin: Springer (2015; Zbl 1321.90005) Full Text: DOI
Kojima, Masakazu; Yamashita, Makoto Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization. (English) Zbl 1262.90196 Math. Program. 138, No. 1-2 (A), 333-364 (2013). MSC: 90C59 90C22 90C26 90C47 90C35 14P10 PDFBibTeX XMLCite \textit{M. Kojima} and \textit{M. Yamashita}, Math. Program. 138, No. 1--2 (A), 333--364 (2013; Zbl 1262.90196) Full Text: DOI
Kim, Sunyoung; Kojima, Masakazu Exploiting sparsity in SDP relaxation of polynomial optimization problems. (English) Zbl 1334.90107 Anjos, Miguel F. (ed.) et al., Handbook on semidefinite, conic and polynomial optimization. New York, NY: Springer (ISBN 978-1-4614-0768-3/hbk; 978-1-4614-0769-0/ebook). International Series in Operations Research & Management Science 166, 499-531 (2012). MSC: 90C22 90C90 90-02 PDFBibTeX XMLCite \textit{S. Kim} and \textit{M. Kojima}, Int. Ser. Oper. Res. Manag. Sci. 166, 499--531 (2012; Zbl 1334.90107) Full Text: DOI
Chandrasekaran, Venkat; Parrilo, Pablo A.; Willsky, Alan S. Latent variable graphical model selection via convex optimization. (English) Zbl 1257.62061 Ann. Stat. 40, No. 4, 1935-1967 (2012). MSC: 62H12 90C25 05C90 62F12 PDFBibTeX XMLCite \textit{V. Chandrasekaran} et al., Ann. Stat. 40, No. 4, 1935--1967 (2012; Zbl 1257.62061) Full Text: DOI arXiv Euclid
Chen, Xi; Lin, Qihang; Kim, Seyoung; Carbonell, Jaime G.; Xing, Eric P. Smoothing proximal gradient method for general structured sparse regression. (English) Zbl 1243.62100 Ann. Appl. Stat. 6, No. 2, 719-752 (2012). MSC: 62J05 65K10 65C60 PDFBibTeX XMLCite \textit{X. Chen} et al., Ann. Appl. Stat. 6, No. 2, 719--752 (2012; Zbl 1243.62100) Full Text: DOI arXiv Euclid
Murota, Kazuo; Kanno, Yoshihiro; Kojima, Masakazu; Kojima, Sadayoshi A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming. (English) Zbl 1204.65068 Japan J. Ind. Appl. Math. 27, No. 1, 125-160 (2010). MSC: 65K05 65F30 90C22 PDFBibTeX XMLCite \textit{K. Murota} et al., Japan J. Ind. Appl. Math. 27, No. 1, 125--160 (2010; Zbl 1204.65068) Full Text: DOI
Kim, Sunyoung; Kojima, Masakazu Solving polynomial least squares problems via semidefinite programming relaxations. (English) Zbl 1181.90224 J. Glob. Optim. 46, No. 1, 1-23 (2010). MSC: 90C26 90C22 PDFBibTeX XMLCite \textit{S. Kim} and \textit{M. Kojima}, J. Glob. Optim. 46, No. 1, 1--23 (2010; Zbl 1181.90224) Full Text: DOI
de Klerk, Etienne Exploiting special structure in semidefinite programming: a survey of theory and applications. (English) Zbl 1177.90315 Eur. J. Oper. Res. 201, No. 1, 1-10 (2010). MSC: 90C22 PDFBibTeX XMLCite \textit{E. de Klerk}, Eur. J. Oper. Res. 201, No. 1, 1--10 (2010; Zbl 1177.90315) Full Text: DOI
Fujisawa, Katsuki; Fukuda, Mituhiro; Nakata, Kazuhide Preprocessing sparse semidefinite programs via matrix completion. (English) Zbl 1181.90214 Optim. Methods Softw. 21, No. 1, 17-39 (2006). MSC: 90C22 PDFBibTeX XMLCite \textit{K. Fujisawa} et al., Optim. Methods Softw. 21, No. 1, 17--39 (2006; Zbl 1181.90214) Full Text: DOI Link
Kojima, Masakazu; Kim, Sunyoung; Waki, Hayato Sparsity in sums of squares of polynomials. (English) Zbl 1079.90092 Math. Program. 103, No. 1 (A), 45-62 (2005). MSC: 90C22 PDFBibTeX XMLCite \textit{M. Kojima} et al., Math. Program. 103, No. 1 (A), 45--62 (2005; Zbl 1079.90092) Full Text: DOI