Primal–Dual Interior-Point Methods for Domain-Driven Formulations

References

• [1] Alkire B, Vandenberghe L (2002) Convex optimization problems involving finite autocorrelation sequences. Math. Programming 93(3):331–359.Crossref, Google Scholar
• [2] Ames BPW, Vavasis SA (2011) Nuclear norm minimization for the planted clique and biclique problems. Math. Programming 129(1):69–89.Crossref, Google Scholar
• [3] Ben-Tal A, Nemirovski A (2001) Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications, vol. 2 (SIAM, Philadelphia).Crossref, Google Scholar
• [4] Ben-Tal A, Nemirovski A (2002) Robust optimization–Methodology and applications. Math. Programming 92(3):453–480.Crossref, Google Scholar
• [5] Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust Optimization (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• [6] Boyd S, Vandenberghe L (2004) Convex Optimization (Cambridge University Press, Cambridge, UK).Crossref, Google Scholar
• [7] Boyd S, El Ghaoui L, Feron E, Balakrishnan V (1994) Linear Matrix Inequalities in System and Control Theory (SIAM, Philadelphia).Crossref, Google Scholar
• [8] Boyd S, Kim S-J, Vandenberghe L, Hassibi A (2007) A tutorial on geometric programming. Optim. Engrg. 8(1):67–127.Crossref, Google Scholar
• [9] Candes E, Recht B (2012) Exact matrix completion via convex optimization. Comm. ACM. 55(6):111–119.Crossref, Google Scholar
• [10] Chandrasekaran V, Shah P (2016) Relative entropy relaxations for signomial optimization. SIAM J. Optim. 26(2):1147–1173.Crossref, Google Scholar
• [11] Chandrasekaran V, Shah P (2017) Relative entropy optimization and its applications. Math. Programming 161(1–2):1–32.Crossref, Google Scholar
• [12] Davis C (1957) All convex invariant functions of hermitian matrices. Arch. Math. (Basel) 8(4):276–278.Crossref, Google Scholar
• [13] Donoho DL (2006) Compressed sensing. IEEE Trans. Inform. Theory 52(4):1289–1306.Crossref, Google Scholar
• [14] Fang S-C, Rajasekera JR, Tsao H-SJ (1997) Entropy Optimization and Mathematical Programming, vol. 8 (Springer Science & Business Media, New York).Crossref, Google Scholar
• [15] Fawzi H, Fawzi O (2018) Efficient optimization of the quantum relative entropy. J. Phys. A: Math. Theoret. 51(15):154003.Google Scholar
• [16] Fawzi H, Saunderson J, Parrilo PA (2019) Semidefinite approximations of the matrix logarithm. Foundations Comput. Math. 19(2):259–296.Google Scholar
• [17] Faybusovich L (2018) Primal-dual potential reduction algorithm for symmetric programming problems with nonlinear objective functions. Linear Algebra Appl. 536:228–249.Crossref, Google Scholar
• [18] Faybusovich L, Tsuchiya T (2017) Matrix monotonicity and self-concordance: how to handle quantum entropy in optimization problems. Optim. Lett. 11(8):1513–1526.Crossref, Google Scholar
• [19] Güler O (1997) Hyperbolic polynomials and interior point methods for convex programming. Math. Oper. Res. 22(2):350–377.Link, Google Scholar
• [20] Haeser G, Hinder O, Ye Y (2017) On the behavior of lagrange multipliers in convex and non-convex infeasible interior point methods. Working paper, University of São Paulo, São Paulo, Brazil.Google Scholar
• [21] Hastie T, Tibshirani R, Wainwright M (2015) Statistical Learning with Sparsity: The Lasso and Generalizations (CRC Press, New York).Crossref, Google Scholar
• [22] Hinder O, Ye Y (2018) A one-phase interior point method for nonconvex optimization. Working paper, Stanford University, Stanford, CA.Google Scholar
• [23] Hiriart-Urruty J-B, Lemaréchal C (2001) Fundamentals of Convex Analysis (Springer-Verlag, Berlin, Heidelberg).Crossref, Google Scholar
• [24] Karimi M (2017) Convex optimization via domain-driven barriers and primal-dual interior-point methods. Unpublished doctoral dissertation, University of Waterloo, Ontario, Canada.Google Scholar
• [25] Karimi M, Tunçel L (2019) Status determination by interior-point methods for convex optimization problems in domain-driven form. Working paper, University of Waterloo, Waterloo, Ontario, Canada.Google Scholar
• [26] Karmarkar N (1984) A new polynomial-time algorithm for linear programming. Combinatorica 4(4):373–395.Crossref, Google Scholar
• [27] Kojima M, Megiddo N, Mizuno S (1993) A primal-dual infeasible-interior-point algorithm for linear programming. Math. Programming 61(1–3):263–280.Crossref, Google Scholar
• [28] Lewis AS (2003) The mathematics of eigenvalue optimization. Math. Programming 97(1–2):155–176.Crossref, Google Scholar
• [29] Lustig IJ (1990) Feasibility issues in a primal-dual interior-point method for linear programming. Math. Programming 49(1–3):145–162.Crossref, Google Scholar
• [30] Lustig IJ, Marsten RE, Shanno DF (1991) Computational experience with a primal-dual interior point method for linear programming. Linear Algebra Appl. 152:191–222.Crossref, Google Scholar
• [31] Mizuno S (1994) Polynomiality of infeasible-interior-point algorithms for linear programming. Math. Programming 67(1–3):109–119.Crossref, Google Scholar
• [32] Mizuno S, Todd MJ, Ye Y (1993) On adaptive-step primal-dual interior-point algorithms for linear programming. Math. Oper. Res. 18(4):964–981.Link, Google Scholar
• [33] Myklebust T, Tunçel L (2014) Interior-point algorithms for convex optimization based on primal-dual metrics. Working paper, University of Waterloo, Waterloo, Ontario, Canada.Google Scholar
• [34] Nemirovski A (2004) Interior point polynomial time methods in convex programming. Unpublished lecture notes.Google Scholar
• [35] Nemirovski A, Tunçel L (2005) Cone-free primal-dual path-following and potential reduction polynomial time interior-point methods. Math. Programming 102(2):261–294.Crossref, Google Scholar
• [36] Nesterov Y (1995) Infeasible-start interior-point primal-dual methods in nonlinear programming. Technical report, Université Catholique de Louvain, Ottignies-Louvain-la-Neuve, Belgium.Google Scholar
• [37] Nesterov Y (2006) Constructing self-concordant barriers for convex cones. Technical report, Université Catholique de Louvain, Ottignies-Louvain-la-Neuve, Belgium.Google Scholar
• [38] Nesterov Y (2012) Toward non-symmetric conic optimization. Optim. Methods Software 27(4–5):893–917.Crossref, Google Scholar
• [39] Nesterov Y (2018) Lectures on Convex Optimization (Springer, Cham, Switzerland).Crossref, Google Scholar
• [40] Nesterov Y, Nemirovski A (1992) Conic duality and its applications in convex programming. Optim. Methods Software 1:95–115.Crossref, Google Scholar
• [41] Nesterov Y, Nemirovski A (1994) Interior-Point Polynomial Algorithms in Convex Programming, SIAM Series in Applied Mathematics (SIAM, Philadelphia).Google Scholar
• [42] Nesterov Y, Nemirovski A (1998) Multi-parameter surfaces of analytic centers and long-step surface-following interior-point methods. Math. Oper. Res. 23(1):1–38.Link, Google Scholar
• [43] Nesterov Y, Todd MJ (1997) Self-scaled barriers and interior-point methods for convex programming. Math. Oper. Res. 22(1):1–42.Link, Google Scholar
• [44] Nesterov Y, Todd MJ (1998) Primal-dual interior-point methods for self-scaled cones. SIAM J. Optim. 8(2):324–364.Crossref, Google Scholar
• [45] Nesterov Y, Tunçel L (2016) Local superlinear convergence of polynomial-time interior-point methods for hyperbolicity cone optimization problems. SIAM J. Optim. 26(1):139–170.Crossref, Google Scholar
• [46] Nesterov Y, Todd MJ, Ye Y (1999) Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems. Math. Programming 84(2):227–267.Crossref, Google Scholar
• [47] Recht B, Fazel M, Parrilo PA (2010) Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52(3):471–501.Crossref, Google Scholar
• [48] Skajaa A, Ye Y (2015) A homogeneous interior-point algorithm for nonsymmetric convex conic optimization. Math. Programming 150(2):391–422.Crossref, Google Scholar
• [49] Tunçel L (2001) Generalization of primal-dual interior-point methods to convex optimization problems in conic form. Foundations Comput. Math. 1(3):229–254.Crossref, Google Scholar
• [50] Tunçel L (2010) Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization (American Mathematical Society, Providence, RI).Google Scholar
• [51] Ye Y, Todd MJ, Mizuno S (1994) An O(nL)-iteration homogeneous and self-dual linear programming algorithm. Math. Oper. Res. 19(1):53–67.Link, Google Scholar
• [52] Zhang Y (1994) On the convergence of a class of infeasible interior-point methods for the horizontal linear complementarity problem. SIAM J. Optim. 4(1):208–227.Crossref, Google Scholar
• [53] Zhang Y (1998) On extending some primal–dual interior-point algorithms from linear programming to semidefinite programming. SIAM J. Optim. 8(2):365–386.Crossref, Google Scholar
• [54] Zhang Y (1999) User’s guide to LIPSOL linear-programming interior point solvers V0.4. Optim. Methods Software 11(1–4):385–396.Crossref, Google Scholar