Analysis of the Primal-Dual Central Path for Nonlinear Semidefinite Optimization Without the Nondegeneracy Condition

References

• [1] Andreani R, Haeser G, Viana DS (2018) Optimality conditions and global convergence for nonlinear semidefinite programming. Math. Programming 180(1):203–235.Google Scholar
• [2] Andreani R, Fukuda E, Haeser G, Santos D, Secchin L (2021) On the use of Jordan algebras for improving global convergence of an augmented Lagrangian method in nonlinear semidefinite programming. Comput. Optim. Appl. 79(3):633–648.Crossref, Google Scholar
• [3] Arahata S, Okuno T, Takeda A (2023) Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems. Comput. Optim. Appl. 86(2):555–598.Crossref, Google Scholar
• [4] Auslender A (2013) An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming. J. Optim. Theory Appl. 156(2):183–212.Crossref, Google Scholar
• [5] Auslender A (2015) An exact penalty method for nonconvex problems covering, in particular, nonlinear programming, semidefinite programming, and second-order cone programming. SIAM J. Optim. 25(3):1732–1759.Crossref, Google Scholar
• [6] Bonnans JF, Ramírez H (2005) Perturbation analysis of second-order cone programming problems. Math. Programming 104(2):205–227.Crossref, Google Scholar
• [7] Bonnans JF, Shapiro A (2013) Perturbation Analysis of Optimization Problems (Springer, New York).Google Scholar
• [8] Correa R, Ramirez CH (2004) A global algorithm for nonlinear semidefinite programming. SIAM J. Optim. 15(1):303–318.Crossref, Google Scholar
• [9] da Cruz Neto JX, Ferreira OP, Monteiro RD (2005) Asymptotic behavior of the central path for a special class of degenerate SDP problems. Math. Programming 103(3):487–514.Crossref, Google Scholar
• [10] Forsgren A (2000) Optimality conditions for nonconvex semidefinite programming. Math. Programming 88(1):105–128.Crossref, Google Scholar
• [11] Freund RW, Jarre F, Vogelbusch CH (2007) Nonlinear semidefinite programming: Sensitivity, convergence, and an application in passive reduced-order modeling. Math. Programming 109(2–3):581–611.Crossref, Google Scholar
• [12] Fukuda EH, Lourenço BF (2018) Exact augmented Lagrangian functions for nonlinear semidefinite programming. Comput. Optim. Appl. 71(2):457–482.Crossref, Google Scholar
• [13] Goldfarb D, Scheinberg K (1998) Interior point trajectories in semidefinite programming. SIAM J. Optim. 8(4):871–886.Crossref, Google Scholar
• [14] Graña Drummond L, Peterzil Y (2002) The central path in smooth convex semidefinite programs. Optimization 51(2):207–233.Crossref, Google Scholar
• [15] Halická M (2002) Analyticity of the central path at the boundary point in semidefinite programming. Eur. J. Oper. Res. 143(2):311–324.Crossref, Google Scholar
• [16] Halická M, de Klerk E, Roos C (2002) On the convergence of the central path in semidefinite optimization. SIAM J. Optim. 12(4):1090–1099.Crossref, Google Scholar
• [17] Halická M, de Klerk E, Roos C (2005) Limiting behavior of the central path in semidefinite optimization. Optim. Methods Software 20(1):99–113.Crossref, Google Scholar
• [18] Hoi C, Scherer CW, Van der Meché E, Bosgra O (2003) A nonlinear SDP approach to fixed-order controller synthesis and comparison with two other methods applied to an active suspension system. Eur. J. Control 9(1):13–28.Crossref, Google Scholar
• [19] Horn RA, Johnson CR (2012) Matrix Analysis (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• [20] Huang X, Teo K, Yang X (2006) Approximate augmented Lagrangian functions and nonlinear semidefinite programs. Acta Math. Sinica 22(5):1283–1296.Crossref, Google Scholar
• [21] Jarre F (2000) An interior method for nonconvex semidefinite programs. Optim. Engrg. 1(4):347–372.Crossref, Google Scholar
• [22] Kakihara S, Ohara A, Tsuchiya T (2013) Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs. J. Optim. Theory Appl. 157(3):749–780.Crossref, Google Scholar
• [23] Kakihara S, Ohara A, Tsuchiya T (2014) Curvature integrals and iteration complexities in SDP and symmetric cone programs. Comput. Optim. Appl. 57(3):623–665.Crossref, Google Scholar
• [24] Kanzow C, Nagel C, Kato H, Fukushima M (2005) Successive linearization methods for nonlinear semidefinite programs. Comput. Optim. Appl. 31(3):251–273.Crossref, Google Scholar
• [25] Kato H, Fukushima M (2007) An SQP-type algorithm for nonlinear second-order cone programs. Optim. Lett. 1(2):129–144.Crossref, Google Scholar
• [26] Kato A, Yabe H, Yamashita H (2015) An interior point method with a primal–Dual quadratic barrier penalty function for nonlinear semidefinite programming. J. Comput. Appl. Math. 275:148–161.Crossref, Google Scholar
• [27] Kočvara M, Stingl M (2004) Solving nonconvex SDP problems of structural optimization with stability control. Optim. Methods Software 19(5):595–609.Crossref, Google Scholar
• [28] Kočvara M, Leibfritz F, Stingl M, Henrion D (2005) A nonlinear SDP algorithm for static output feedback problems in COMPleib. IFAC Proc. Volumes 38(1):1055–1060.Crossref, Google Scholar
• [29] Kojima M, Mizuno S, Noma T (1990) Limiting behavior of trajectories generated by a continuation method for monotone complementarity problems. Math. Oper Res. 15(4):662–675.Link, Google Scholar
• [30] Konno H, Kawadai N, Tuy H (2003) Cutting plane algorithms for nonlinear semi-definite programming problems with applications. J. Global Optim. 25(2):141–155.Crossref, Google Scholar
• [31] Leibfritz F, Maruhn JH (2009) A successive SDP-NSDP approach to a robust optimization problem in finance. Comput. Optim. Appl. 44(3):443–466.Crossref, Google Scholar
• [32] Leibfritz F, Mostafa E (2002) An interior point constrained trust region method for a special class of nonlinear semidefinite programming problems. SIAM J. Optim. 12(4):1048–1074.Crossref, Google Scholar
• [33] Leibfritz F, Volkwein S (2006) Reduced order output feedback control design for PDE systems using proper orthogonal decomposition and nonlinear semidefinite programming. Linear Algebra Appl. 415(2–3):542–575.Crossref, Google Scholar
• [34] Lourenço BF, Fukuda EH, Fukushima M (2018) Optimality conditions for nonlinear semidefinite programming via squared slack variables. Math. Programming 168(1–2):177–200.Crossref, Google Scholar
• [35] Luenberger DG, Ye Y (2008) Linear and Nonlinear Programming, 3rd ed. (Springer, New York).Crossref, Google Scholar
• [36] Luo ZQ, Sturm JF, Zhang S (1998) Superlinear convergence of a symmetric primal-dual path following algorithm for semidefinite programming. SIAM J. Optim. 8(1):59–81.Crossref, Google Scholar
• [37] Mangasarian OL (1994) Nonlinear Programming (Society for Industrial and Applied Mathematics, Philadelphia).Crossref, Google Scholar
• [38] Megiddo N (1989) Pathways to the optimal set in linear programming. Megiddo N, ed. Progress in Mathematical Programming (Springer, New York), 131–158.Crossref, Google Scholar
• [39] Monteiro RD, Tsuchiya T (1996) Limiting behavior of the derivatives of certain trajectories associated with a monotone horizontal linear complementarity problem. Math. Oper. Res. 21(4):793–814.Link, Google Scholar
• [40] Monteiro RD, Zou F (1998) On the existence and convergence of the central path for convex programming and some duality results. Comput. Optim. Appl. 10(1):51–77. Crossref, Google Scholar
• [41] Okuno T (2024) Local convergence of primal-dual interior point methods for nonlinear semi-definite optimization using the family of Monteiro-Tsuchiya directions. Comput. Optim. Appl. 88(2):677–718.Crossref, Google Scholar
• [42] Okuno T, Fukushima M (2020) An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs. J. Comput. Appl. Math. 376:112784.Crossref, Google Scholar
• [43] Okuno T, Fukushima M (2023) Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints. Math. Programming 199(1–2):251–303.Crossref, Google Scholar
• [44] Qi H (2009) Local duality of nonlinear semidefinite programming. Math. Oper. Res. 34(1):124–141.Link, Google Scholar
• [45] Qi H, Sun D (2006) A quadratically convergent Newton method for computing the nearest correlation matrix. SIAM J. Matrix Anal. Appl. 28(2):360–385.Crossref, Google Scholar
• [46] Scherer CW (1995) Multiobjective H2/H∞ control. IEEE Trans. Automatic Control 40(6):1054–1062.Crossref, Google Scholar
• [47] Shapiro A (1997) First and second order analysis of nonlinear semidefinite programs. Math. Programming 77(1):301–320.Crossref, Google Scholar
• [48] Sturm JF, Zhang S (2001) On sensitivity of central solutions in semidefinite programming. Math. Programming 90(2):205–227.Crossref, Google Scholar
• [49] Sun D (2006) The strong second-order sufficient condition and constraint nondegeneracy in nonlinear semidefinite programming and their implications. Math. Oper. Res. 31(4):761–776.Link, Google Scholar
• [50] Sun D, Sun J, Zhang LW (2008) The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming. Math. Programming 114(2):349–391.Crossref, Google Scholar
• [51] Sun J, Zhang LW, Wu Y (2006) Properties of the augmented Lagrangian in nonlinear semidefinite optimization. J. Optim. Theory Appl. 129(3):437–456.Crossref, Google Scholar
• [52] Takezawa A, Nii S, Kitamura M, Kogiso N (2011) Topology optimization for worst load conditions based on the eigenvalue analysis of an aggregated linear system. Comput. Methods Appl. Mechanics Engrg. 200(25–28):2268–2281.Crossref, Google Scholar
• [53] Thore CJ (2022) A worst-case approach to topology optimization for maximum stiffness under uncertain boundary displacement. Comput. Structures 259:106696.Crossref, Google Scholar
• [54] Thore CJ, Holmberg E, Klarbring A (2017) A general framework for robust topology optimization under load-uncertainty including stress constraints. Comput. Methods Appl. Mechanics Engrg. 319:1–18.Crossref, Google Scholar
• [55] Vandaele A, Glineur F, Gillis N (2018) Algorithms for positive semidefinite factorization. Comput. Optim. Appl. 71(1):193–219.Crossref, Google Scholar
• [56] Vandenberghe L, Boyd S (1996) Semidefinite programming. SIAM Rev. 38(1):49–95.Crossref, Google Scholar
• [57] Wolkowicz H, Saigal R, Vandenberghe L (2012) Handbook of Semidefinite Programming: Theory, Algorithms, and Applications (Springer, New York).Google Scholar
• [58] Wright SJ, Orban D (2002) Properties of the log-barrier function on degenerate nonlinear programs. Math. Oper. Res. 27(3):585–613.Link, Google Scholar
• [59] Wu H, Luo H, Ding X, Chen G (2013) Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming. Comput. Optim. Appl. 56(3):531–558.Crossref, Google Scholar
• [60] Yamakawa Y, Okuno T (2022) A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs. Comput. Optim. Appl. 83(3):1027–1064.Crossref, Google Scholar
• [61] Yamakawa Y, Yamashita N (2014) A two-step primal-dual interior point method for nonlinear semidefinite programming problems and its superlinear convergence. J. Oper. Res. Soc. Japan 57(3–4):105–127.Google Scholar
• [62] Yamakawa Y, Yamashita N (2015) A differentiable merit function for the shifted perturbed KKT conditions of the nonlinear semidefinite programming. Pacific J. Optim. 11(3):557–579.Google Scholar
• [63] Yamashita H, Yabe H (2012) Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming. Math. Programming 132(1–2):1–30.Crossref, Google Scholar
• [64] Yamashita H, Yabe H, Harada K (2012) A primal–dual interior point method for nonlinear semidefinite programming. Math. Programming 135(1–2):89–121.Crossref, Google Scholar
• [65] Yamashita H, Yabe H, Harada K (2021) A primal-dual interior point trust-region method for nonlinear semidefinite programming. Optim. Methods Software 36(2–3):569–601.Crossref, Google Scholar
• [66] Yang L, Yu B (2013) A homotopy method for nonlinear semidefinite programming. Comput. Optim. Appl. 56(1):81–96.Crossref, Google Scholar
• [67] Zhao Q, Chen Z (2016) On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming. J. Comput. Appl. Math. 308:1–19.Crossref, Google Scholar
• [68] Zhao Q, Chen Z (2018) An SQP-type method with superlinear convergence for nonlinear semidefinite programming. Asia-Pacific J. Oper. Res. 35(3):1850009.Crossref, Google Scholar