Parametric Semidefinite Programming: Geometry of the Trajectory of Solutions

References

• [1] Ahmadi AA, El Khadir B (2021) Time-varying semidefinite programs. Math. Oper. Res. 46(3):1054–1080.Link, Google Scholar
• [2] Al-Salih R, Bohner M (2018) Linear programming problems on time scales. Appl. Anal. Discrete Math. 12(1):192–204.Crossref, Google Scholar
• [3] Alizadeh F, Haeberly JPA, Overton ML (1997) Complementarity and nondegeneracy in semidefinite programming. Math. Programming 77(1):111–128.Crossref, Google Scholar
• [4] Alizadeh F, Haeberly JPA, Overton ML (1998) Primal-dual interior-point methods for semidefinite programming: Convergence rates, stability and numerical results. SIAM J. Optim. 8(3):746–768.Crossref, Google Scholar
• [5] Anjos MF, Lasserre JB (2011) Handbook on Semidefinite, Conic and Polynomial Optimization (Springer, Berlin).Google Scholar
• [6] El Khadir B (2020) Semidefinite representations in semialgebraic optimization and dynamics-oriented learning. PhD thesis, Princeton University, Princeton, NJ.Google Scholar
• [7] Franklin JN (2012) Matrix Theory (Courier Corporation, North Chelmsford, MA).Google Scholar
• [8] Goldfarb D, Scheinberg K (1998) Interior point trajectories in semidefinite programming. SIAM J. Optim. 8(4):871–886.Crossref, Google Scholar
• [9] Goldfarb D, Scheinberg K (1999) On parametric semidefinite programming. Appl. Numer. Math. 29(3):361–377.Crossref, Google Scholar
• [10] Guddat J, Vazquez FG, Jongen HT (1990) Parametric Optimization: Singularities, Pathfollowing and Jumps (Springer, Berlin).Crossref, Google Scholar
• [11] Haeberly JP (1998) Remarks on nondegeneracy in mixed semidefinite-quadratic programming. Technical report, Department of Mathematics, Fordham University, New York.Google Scholar
• [12] Hauenstein JD, Liddell AC Jr, McPherson S, Zhang Y (2021) Numerical algebraic geometry and semidefinite programming. Results Appl. Math. 11:100166.Crossref, Google Scholar
• [13] Hauenstein JD, Mohammad-Nezhad A, Tang T, Terlaky T (2022) On computing the nonlinearity interval in parametric semidefinite optimization. Math. Oper. Res. 47(4):2989–3009.Link, Google Scholar
• [14] Henrion D, Korda M, Lasserre JB (2020) The Moment-SOS Hierarchy (World Scientific, Singapore).Crossref, Google Scholar
• [15] Hogan WW (1973) Point-to-set maps in mathematical programming. SIAM Rev. 15(3):591–603.Crossref, Google Scholar
• [16] Krantz SG, Parks HR (2002) The Implicit Function Theorem: History, Theory, and Applications (Springer Science & Business Media, Berlin).Google Scholar
• [17] Lasserre JB (2001) Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3):796–817.Crossref, Google Scholar
• [18] Lavaei J, Low SH (2011) Zero duality gap in optimal power flow problem. IEEE Trans. Power Systems 27(1):92–107.Crossref, Google Scholar
• [19] Liu J, Marecek J, Simonetto A, Takač M (2018) A coordinate-descent algorithm for tracking solutions in time-varying optimal power flows. IEEE Power Systems Comput. Conf. (IEEE, Piscataway, NJ), 1–7.Google Scholar
• [20] Mohammad-Nezhad A (2019) Conic optimization: Optimal partition, parametric, and stability analysis. PhD thesis, Lehigh University, Bethlehem, PA.Google Scholar
• [21] Mohammad-Nezhad A, Terlaky T (2020) Parametric analysis of semidefinite optimization. Optimization 69(1):187–216.Crossref, Google Scholar
• [22] Nie J, Ranestad K, Sturmfels B (2010) The algebraic degree of semidefinite programming. Math. Programming 122(2):379–405.Crossref, Google Scholar
• [23] Pataki G (2012) The geometry of semidefinite programming. Wolkowicz H, Saigal R, Vandenberghe L, eds. Handbook of Semidefinite Programming: Theory, Algorithms, and Applications (Springer, Boston), 29–65.Google Scholar
• [24] Rockafellar RT, Wets RJB (2009) Variational Analysis (Springer, Berlin).Google Scholar
• [25] Sekiguchi Y, Waki H (2021) Perturbation analysis of singular semidefinite programs and its applications to control problems. J. Optim. Theory Appl. 188(1):52–72.Crossref, Google Scholar
• [26] Wang X, Zhang S, Yao DD (2009) Separated continuous conic programming: Strong duality and an approximation algorithm. SIAM J. Control Optim. 48(4):2118–2138.Crossref, Google Scholar
• [27] Yildirim EA (2004) Unifying optimal partition approach to sensitivity analysis in conic optimization. J. Optim. Theory Appl. 122(2):405–423.Crossref, Google Scholar