Time-Varying Semidefinite Programs

References

• [1] Adams RA , Fournier JJF (2003) Sobolev Spaces , 2nd ed. (Elsevier, Oxford, UK).Google Scholar
• [2] Ahmadi AA , Majumdar A (2016) Some applications of polynomial optimization in operations research and real-time decision making. Optim. Lett. 10(4):709–729.Crossref, Google Scholar
• [3] Ahmadi AA , Parrilo P (2013) A complete characterization of the gap between convexity and sos-convexity. SIAM J. Optim. 23(2):811–833.Crossref, Google Scholar
• [4] Anderson EJ , Nash P (1987) Linear Programming in Infinite-Dimensional Spaces: Theory and Applications (John Wiley & Sons, Chichester, UK).Google Scholar
• [5] Anderson EJ , Philpott AB (1989) A continuous-time network simplex algorithm. Networks 19(4):395–425.Crossref, Google Scholar
• [6] Anstreicher KM (1984) Generation of feasible descent directions in continuous time linear programming . Technical Report SOL 83-18, Department of Operations Research, Stanford University, Stanford, CA.Google Scholar
• [7] Aylward EM , Itani SM , Parrilo PA (2007) Explicit SOS decompositions of univariate polynomial matrices and the Kalman-Yakubovich-Popov lemma. Proc. 46th IEEE Conf. Decision Control (IEEE, Piscataway, NJ), 5660–5665.Google Scholar
• [8] Bampou D , Kuhn D (2011) Scenario-free stochastic programming with polynomial decision rules. Proc. IEEE Conf. Decision Control (IEEE, Piscataway, NJ), 7806–7812.Google Scholar
• [9] Bampou D , Kuhn D (2012) Polynomial approximations for continuous linear programs. SIAM J. Optim. 22(2):628–648.Crossref, Google Scholar
• [10] Bellman R (1953) Bottleneck problems and dynamic programming. Proc. Natl. Acad. Sci. USA 39(9):947–951.Crossref, Google Scholar
• [11] Berr R , Wörmann T (2001) Positive polynomials on compact sets. Manuscripta Math. 104(2):135–143.Crossref, Google Scholar
• [12] Bertsimas D , Iancu DA , Parrilo PA (2011) A hierarchy of near-optimal policies for multistage adaptive optimization. IEEE Trans. Automatic Control 56(12):2809–2824.Crossref, Google Scholar
• [13] Buie RN , Abrham J (1973) Numerical solutions to continuous linear programming problems. Zeitschrift Oper. Res. 17(3):107–117.Google Scholar
• [14] Commander CW (2007) Optimization problems in telecommunications with military applications. PhD thesis, University of Florida, Gainesville.Google Scholar
• [15] Commander CW , Pardalos PM , Ryabchenko V , Uryasev S , Zrazhevsky G (2007) The wireless network jamming problem. J. Combin. Optim. 14(4):481–498.Crossref, Google Scholar
• [16] Commander CW , Pardalos PM , Ryabchenko V , Shylo O , Uryasev S , Zrazhevsky G (2008) Jamming communication networks under complete uncertainty. Optim. Lett. 2(1):53–70.Crossref, Google Scholar
• [17] de Klerk E (2002) Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications (Springer, Dordrecht, Netherlands).Crossref, Google Scholar
• [18] Dette H , Studden WJ (2002) Matrix measures, moment spaces and Favard’s theorem for the interval [0,1] and [0, ∞). Linear Algebra Appl. 345(1–3):169–193.Crossref, Google Scholar
• [19] Fleischer L , Sethuraman J (2005) Efficient algorithms for separated continuous linear programs: The multicommodity flow problem with holding costs and extensions. Math. Oper. Res. 30(4):916–938.Link, Google Scholar
• [20] Gorissen BL , den Hertog D (2012) Approximating the Pareto set of multiobjective linear programs via robust optimization. Oper. Res. Lett. 40(5):319–324.Crossref, Google Scholar
• [21] Grinold RC (1969) Continuous programming part one: Linear objectives. J. Math. Anal. Appl. 28(1):32–51.Crossref, Google Scholar
• [22] Hilbert D (1894) Ein Beitrag zur Theorie des Legendre’schen Polynoms. Acta Math. 18(1):155–159.Crossref, Google Scholar
• [23] Kojima M (2003) Sums of squares relaxations of polynomial semidefinite programs . Research Report B-397, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo.Google Scholar
• [24] Lasserre JB (2001) Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3):796–817.Crossref, Google Scholar
• [25] Lasserre JB (2010) A “joint+marginal” approach to parametric polynomial optimization. SIAM J. Optim. 20(4):1995–2022.Crossref, Google Scholar
• [26] Lasserre JB (2010) Moments, Positive Polynomials and Their Applications (World Scientific, Singapore).Google Scholar
• [27] Lehman RS (1954) On the continuous simplex method. Technical Report RM-1386, RAND Corporation, Santa Monica, CA.Google Scholar
• [28] Levinson N (1966) A class of continuous linear programming problems. J. Math. Anal. Appl. 16(1):73–83.Crossref, Google Scholar
• [29] Löfberg J (2004) YALMIP: A toolbox for modeling and optimization in MATLAB. Proc. IEEE Internat. Conf. Robotics Automation (IEEE, Piscatway, NJ), 284–289.Google Scholar
• [30] Löfberg J , Parrilo PA (2004) From coefficients to samples: A new approach to SOS optimization. Proc. IEEE Conf. Decision Control, vol. 3 (IEEE, Piscataway, NJ), 3154–3159.Google Scholar
• [31] Luo X , Bertsimas D (1998) A new algorithm for state-constrained separated continuous linear programs. SIAM J. Control Optim. 37(1):177–210.Crossref, Google Scholar
• [32] Magron V , Henrion D , Lasserre JB (2014) Approximating Pareto curves using semidefinite relaxations. Oper. Res. Lett. 42(6):432–437.Crossref, Google Scholar
• [33] Markowitz H (1952) Portfolio selection. J. Finance 7(1):77–91.Google Scholar
• [34] Mosek ApS (2017) The MOSEK Optimization Toolbox for MATLAB Manual, Version 8.1 (Mosek ApS, Copenhagen).Google Scholar
• [35] Nesterov Y (2000) Squared functional systems and optimization problems. Frenk H , Roos K , Terlaky T , Zhang S , eds. High Performance Optimization (Springer, Boston), 405–440.Crossref, Google Scholar
• [36] Papachristodoulou A , Parrilo PA , Seiler P , Anderson J , Valmorbida G , Prajna S , Seiler P (2013) SOSTOOLS: Sum of squares optimization toolbox for MATLAB. Accessed January 1, 2020, http://sysos.eng.ox.ac.uk/sostools/.Google Scholar
• [37] Papp D (2017) Semi-infinite programming using high-degree polynomial interpolants and semidefinite programming. SIAM J. Optim. 27(3):1858–1879.Crossref, Google Scholar
• [38] Papp D , Alizadeh F (2013) Semidefinite characterization of sum-of-squares cones in algebras. SIAM J. Optim. 23(3):1398–1423.Crossref, Google Scholar
• [39] Papp D , Yildiz S (2019) Sum-of-squares optimization without semidefinite programming. SIAM J. Optim. 29(1):822–851.Crossref, Google Scholar
• [40] Parrilo PA (2003) Semidefinite programming relaxations for semialgebraic problems. Math. Programming 96(2):293–320.Crossref, Google Scholar
• [41] Perold AF (1978) Fundamentals of a continuous time simplex method. Technical Report SOL-78-26, RAND Corporation, Santa Monica, CA.Google Scholar
• [42] Pullan MC (1993) An algorithm for a class of continuous linear programs. SIAM J. Control Optim. 31(6):1558–1577.Crossref, Google Scholar
• [43] Pullan MC (1995) Forms of optimal solutions for separated continuous linear programs. SIAM J. Control Optim. 33(6):1952–1977.Crossref, Google Scholar
• [44] Pullan MC (1996) A duality theory for separated continuous linear programs. SIAM J. Control Optim. 34(3):931–965.Crossref, Google Scholar
• [45] Pullan MC (2000) Convergence of a general class of algorithms for separated continuous linear programs. SIAM J. Optim. 10(3):722–731.Crossref, Google Scholar
• [46] Shapiro A (2001) On duality theory of conic linear problems. Goberna MA , López MA , eds. Semi-Infinite Programming: Recent Advances (Springer, Boston), 135–165.Crossref, Google Scholar
• [47] Timan AF (2014) Theory of Approximation of Functions of a Real Variable (Elsevier, New York).Google Scholar
• [48] Tyndall WF (1965) A duality theorem for a class of continuous linear programming problems. J. Soc. Indust. Appl. Math. 13(3):644–666.Crossref, Google Scholar
• [49] Tyndall WF (1967) An extended duality theorem for continuous linear programming problems. SIAM J. Appl. Math. 15(5):1294–1298.Crossref, Google Scholar
• [50] Walkden C (2018) Ergodic theory. Lecture notes, January 4, University of Manchester, Manchester, UK.Google Scholar
• [51] Wang X , Zhang S , Yao D (2009) Separated continuous conic programming: Strong duality and an approximation algorithm. SIAM J. Control Optim. 48(4):2118–2138.Crossref, Google Scholar
• [52] Weiss G (2008) A simplex based algorithm to solve separated continuous linear programs. Math. Programming 115(1):151–198.Crossref, Google Scholar