Abstract
We propose a first-order interior-point method for linearly constrained smooth optimization that unifies and extends first-order affine-scaling method and replicator dynamics method for standard quadratic programming. Global convergence and, in the case of quadratic program, (sub)linear convergence rate and iterate convergence results are derived. Numerical experience on simplex constrained problems with 1000 variables is reported.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Bertsekas D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont (1999)
Bomze I.M.: On standard quadratic optimization problems. J. Global Optim. 13, 369–387 (1998)
Bomze I.M.: Regularity vs. degeneracy in dynamics games and optimization: a unified approach to different aspects. SIAM Rev. 44, 394–414 (2002)
Bomze I.M.: Portfolio selection via replicator dynamics and projection of indefinite estimated covariances. Dyn. Cont. Discrete Impuls. Syst. Ser. B 12, 527–564 (2005)
Bomze, I. M., Schachinger, W.: Multi-standard quadratic optimization problems. Comput. Optim. Appl. doi:10.1007/s10589-009-9243-8 (2009)
Bonnans J.F., Pola C.: A trust region interior point algorithm for linearly constrained optimization. SIAM J. Optim. 7, 717–731 (1997)
Dikin I.I.: Iterative solution of problems of linear and quadratic programming. Soviet Math. Dokl. 8, 674–675 (1967)
Dikin I.I.: Letter to the editor. Math. Program. 41, 393–394 (1988)
Forsgren A., Gill P.E., Wright M.H.: Interior methods for nonlinear optimization. SIAM Rev. 44, 525–597 (2002)
Gill P.E., Murray W., Wright M.H.: Practical Optimization. Academic Press, New York (1981)
Gonzaga, C.C., Carlos, L.A.: A primal affine scaling algorithm for linearly constrained convex programs. Tech. Report ES-238/90, Department of Systems Engineering and Computer Science, COPPE Federal University of Rio de Janeiro, Rio de Janeiro, December 1990
Hofbauer J., Sigmund K.: Evolutionary Games and Population Dynamics. Cambridge University Press, Cambridge (1998)
Hoffman A.J.: On approximate solutions of systems of linear inequalities. J. Res. Natl. Bur. Stand. 49, 263–265 (1952)
Luo Z.-Q., Tseng P.: On the convergence of the affine-scaling algorithm. Math. Program. 56, 301–319 (1992)
Lyubich Y., Maistrowskii G.D., Ol’khovskii Yu.G.: Selection-induced convergence to equilibrium in a single-locus autosomal population. Probl. Inf. Transm. 16, 66–75 (1980)
Mangasarian O.L.: A simple characterization of solution sets of convex programs. Oper. Res. Lett. 7, 21–26 (1988)
Monteiro R.D.C., Tsuchiya T.: Global convergence of the affine scaling algorithm for convex quadratic programming. SIAM J. Optim. 8, 26–58 (1998)
Monteiro R.D.C., Tsuchiya T., Wang Y.: A simplified global convergence proof of the affine scaling algorithm. Ann. Oper. Res. 46/47, 443–482 (1993)
Monteiro R.D.C., Wang Y.: Trust region affine scaling algorithms for linearly constrained convex and concave programs. Math. Program. 80, 283–313 (1998)
Moran P.A.P.: The statistical Processes of Evolutionary Theory. Clarendon Press, Oxford (1962)
Moré J.J., Garbow B.S., Hillstrom K.E.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7, 17–41 (1981)
Murtagh, B.A., Saunders, M.A.: MINOS 5.5 user’s guide. Report SOL 83-20R, Department of Operations Research, Stanford University, Stanford (Revised July 1998)
Pelillo M.: Replicator equations, maximal cliques, and graph isomorphism. Neural Comput. 11, 1933–1955 (1999)
Pelillo M.: Matching free trees, maximal cliques, and monotone game dynamics. IEEE Trans. Pattern Anal. Machine Intell. 24, 1535–1541 (2002)
Pelillo M., Siddiqi K., Zucker S.W.: Matching hierarchical structures using association graphs. IEEE Trans. Pattern Anal. Mach. Intell. 21, 1105–1120 (1999)
Saigal R.: The primal power affine scaling method. Ann. Oper. Res. 62, 375–417 (1996)
Sun J.: A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions. Math. Program. 60, 69–79 (1993)
Sun J.: A convergence analysis for a convex version of Dikin’s algorithm. Ann. Oper. Res. 62, 357–374 (1996)
Tseng P.: Convergence properties of Dikin’s affine scaling algorithm for nonconvex quadratic minimization. J. Global Optim. 30, 285–300 (2004)
Tsuchiya T.: Global convergence of the affine scaling methods for degenerate linear programming problems. Math. Program. 52, 377–404 (1991)
Tsuchiya T.: Global convergence of the affine scaling algorithm for primal degenerate strictly convex quadratic programming problems. Ann. Oper. Res. 46/47, 509–539 (1993)
Tsuchiya T., Muramatsu M.: Global convergence of a long-step affine scaling algorithm for degenerate linear programming problems. SIAM J. Optim. 5, 525–551 (1995)
Ye Y.: On affine scaling algorithms for nonconvex quadratic programming. Math. Program. 56, 285–300 (1992)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Tseng, P., Bomze, I.M. & Schachinger, W. A first-order interior-point method for linearly constrained smooth optimization. Math. Program. 127, 399–424 (2011). https://doi.org/10.1007/s10107-009-0292-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-009-0292-7
Keywords
- Linearly constrained optimization
- Affine scaling
- Replicator dynamics
- Interior-point method
- Global convergence
- Sublinear convergence rate