Analysis of some interior point continuous trajectories for convex programming

References

• Monteiro RDC. A globally convergent primal-dual interior point algorithm for convex programming. Math Program. 1994;64(1–3):123–147.
   Web of Science ®Google Scholar
• Dikin II. On the convergence of an iterative process. Upravlyaemye Sistemy. 1974;12:54–60. Russian.
   Google Scholar
• Saigal R. A simple proof of a primal affine scaling method. Ann Oper Res. 1996;62:303–324.
   Web of Science ®Google Scholar
• Tseng P, Luo Z-Q. On the convergence of the affine-scaling algorithm. Math Program. 1992;56:301–319.
   Web of Science ®Google Scholar
• Tsuchiya T. Global convergence of the affine scaling methods for degenerate linear programming problems. Math Program. 1991;52:377–404.
   Web of Science ®Google Scholar
• Tsuchiya T. Global convergence property of the affine scaling methods for primal degenerate linear programming problems. Math Oper Res. 1992;17:527–557.
   Web of Science ®Google Scholar
• Gonzaga CC, Carlos LA. A primal affine-scaling algorithm for linearly constrained convex programs; 2002. Available from: http://www.optimization-online.org/DB_HTML/2002/09/531.html.
   Google Scholar
• Sun J. A convergence analysis for a convex version of Dikin’s algorithm. Ann Oper Res. 1996;62:357–374.
   Web of Science ®Google Scholar
• Tseng P, Bomze IM, Schachinger W. A first-order interior point method for linearly constrained smooth optimization. Math Program. 2011;127:399–424.
   Web of Science ®Google Scholar
• Kojima M, Mizuno S, Yoshise A. A primal-dual interior point algorithm for linear programming. Prog Math Program. 1989;61(1–3):29–47.
   Google Scholar
• Monteiro RDC, Adler I. Interior path-following primal-dual algorithm. Part I: linear programming. Math Program. 1989;44(1–3):27–41.
   Web of Science ®Google Scholar
• Monteiro RDC, Adler I. Interior path following primal-dual algorithms. part II: convex quadratic programming. Math Program. 1989;44(1–3):43–66.
   Web of Science ®Google Scholar
• Renegar J. A polynomial-time algorithm based on Newton’s method for linear programming. Math Program. 1988;40:59–93.
   Web of Science ®Google Scholar
• Roos C. New trajectory following polynomial-time algorithm for the linear programming problem. J Optim Theory Appl. 1989;63(3):433–458.
   Web of Science ®Google Scholar
• Todd MJ, Ye Y. A centered projective algorithm for linear programming. Math Oper Res. 1990;15(3):508–529.
   Web of Science ®Google Scholar
• Gonzaga CC. Path-following methods for linear programming. SIAM Rev. 1992;34(2):167–224.
   Web of Science ®Google Scholar
• Zhu J. A path following algorithm for a class of convex programming problems. ZOR-Methods Models Oper Res. 1992;36(4):359–377.
   Google Scholar
• Monteiro RDC, Adler I, Resende MGC. A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension. Math Oper Res. 1990;15(2):191–214.
   Web of Science ®Google Scholar
• Hertog DD, Roos C. A survey of search directions in interior point methods for linear programming. Math Program. 1991;52(1–3):481–509.
   Web of Science ®Google Scholar
• Adler I, Monteiro RDC. Limiting behavior of the affine scaling continuous trajectories for linear programming problems. Math Program. 1991;50:29–51.
   Web of Science ®Google Scholar
• Bayer DA, Lagarias JC. The nonlinear geometry of linear programming. II Legendre transform coordinates and central trajectories. Trans Am Math Soc. 1989;314:527–581.
   Web of Science ®Google Scholar
• Liao L-Z. A study of the dual affine scaling continuous trajectories for linear programming. J Optim Theory Appl. 2014;163:548–568.
   Web of Science ®Google Scholar
• Megiddo N, Shub M. Boundary behavior of interior point algorihms for linear programming. Math Oper Res. 1989;14:97–146.
   Web of Science ®Google Scholar
• Monteiro RDC. Convergence and bounary behavior of the projective scaling trajectories for linear programmin. Math Oper Res. 1991;16:842–858.
   Web of Science ®Google Scholar
• Monteiro RDC. On the continuous trajectories for a potential reduction algorithm for linear programming. Math Oper Res. 1992;17(1):225–253.
   Web of Science ®Google Scholar
• Mclinden L. An analogue of Moreau’s proximation theorem, with application to the nonlinear complementarity problem. Pac J Math. 1980;88(1):101–161.
   Web of Science ®Google Scholar
• Megiddo N. Pathways to the optimal set in linear programming. Prog Math Program. 1989:131–158.
   Google Scholar
• Kojima M, Mizuno S, Noma T. Limiting behavior of trajectories by a continuation method for monotone complementarity problems. Math Oper Res. 1990;15:662–675.
   Web of Science ®Google Scholar
• Monteiro RDC, Tsuchiya T. Limiting behavior of the derivatives of certain trajectories associated with a monotone horizontal linear complementarity problem. Math Oper Res. 1996;21:793–814.
   Web of Science ®Google Scholar
• Vavasis SA, Ye Y. A primal-dual interior point method whose running time depends only on the constraint matrix. Math Program. 1996;74:79–120.
   Web of Science ®Google Scholar
• Witzgall C, Boggs PT, Domich PD. On the convergence behavior of trajectories for linear programming. Contemp Math. 1990;114:161–188.
   Google Scholar
• Monteiro RDC, Zhou FJ. On the existence and convergence of the central path for convex programming and some duality results. Comput Optim Appl. 1998;10:51–77.
   Web of Science ®Google Scholar
• Drummond LMG, Svaiter BF. On well definedness of the central path. J Optim Theory Appl. 1999;102:223–237.
   Web of Science ®Google Scholar
• Gilbert JC, Gonzaga CC, Karas E. Examples of ill-behaved central paths in convex optimization. Math Program. 2005;103:63–94.
   Web of Science ®Google Scholar
• Wang SG, Wu MX, Jia ZZ. Matrix inequalities. 2nd ed. Beijing: Science Press; 2006. Chinese.
   Google Scholar
• Anosov DV, Aranson SKh, Arnold VI, et al. Ordinary differential equations and smooth dynamical systems. Berlin: Springer; 1988.
   Google Scholar
• Coddington EA, Levinson N. Theory of ordinary diffenential equations. New York (NY): McGraw-Hill Book Co; 1955.
   Google Scholar
• Boyd S, Vandenberghe L. Convex optimization. Cambridge: Cambridge University Press; 2004.
   Google Scholar
• Parks HR, Krantz SG. A primer of real analytic functions. Boston (MA): Birkhäuser Verlag; 1992.
   Google Scholar
• Rockafellar RT. Convex analysis. Princeton (NJ): Princeton University Press; 1970. (Princeton mathematical series; 28).
   Google Scholar
• Fiacco AV, McCormick GP. Nonlinear programming: sequential unconstrained minimization techniques. Philadelphia (PA): SIAM; 1990.
   Google Scholar