Advertisement

Journal of Optimization Theory and Applications

, Volume 107, Issue 2, pp 223–243 | Cite as

On Complexity of the Translational-Cut Algorithm for Convex Minimax Problems

  • K. A. Ariyawansa
  • P. L. Jiang
Article

Abstract

Burke, Goldstein, Tseng, and Ye (Ref. 1) have presented an interesting interior-point algorithm for a class of smooth convex minimax problems. They have also presented a complexity analysis leading to a worst-case bound on the total work necessary to obtain a solution within a prescribed tolerance. In this paper, we present refinements to the analysis of Burke et al. which show that the resulting complexity bound can be worse than those for other algorithms available at the time Ref. 1 was published.

complexity minimax optimization global Newton method interior-point methods analytic centers 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Burke, J. V., Goldstein, A. A., Tseng, P., and Ye, Y., Translational Cuts for Convex Minimization, Complexity in Numerical Optimization, Edited by P. M. Pardalos, World Scientific Publishing Company, River Edge, New Jersey,pp. 57–73, 1993.Google Scholar
  2. 2.
    Goldstein, A. A., A Global Newton Method, Applied Geometry and Discrete Mathematics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Providence, Rhode Island, Vol. 4, pp. 301–307, 1991.Google Scholar
  3. 3.
    Hertog, D. D., Roos, C., and Terlaky, T., A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems, SIAM Journal on Optimization, Vol. 2, pp. 55–70, 1992.Google Scholar
  4. 4.
    Jarre, F., On the Method of Analytic Centers for Smooth Convex Programs, Optimization—5th French-German Conference, Castel Novel 1988, Lecture Notes in Mathematics, Springer Verlag, Heidelberg, Germany, Vol. 1405, pp. 69–85, 1989.Google Scholar
  5. 5.
    Mehrotra, S., and Sun, J., An Interior-Point Algorithm for Solving Smooth Convex Programs Based on Newton's Method, Mathematical Developments Arising from Linear Programming, Contemporary Mathematics, Edited by J. C. Lagarias and M. J. Todd, American Mathematical Society, Providence, Rhode Island, Vol. 114, pp. 265–284, 1990.Google Scholar
  6. 6.
    Mifflin, R. B., Rates of Convergence for a Method of Centers Algorithm, Journal of Optimization Theory and Applications, Vol. 18, pp. 199–228, 1976.Google Scholar
  7. 7.
    Mifflin, R. B., Subproblem and Overall Convergence for a Method of Centers Algorithm, Operations Research, Vol. 23, pp. 796–809, 1975.Google Scholar
  8. 8.
    Ortega, J. M., and Rheinboldt, W. C., Iterative Solution of Nonlinear Equations in Several Variables, Academic Press, New York, NY, 1970.Google Scholar
  9. 9.
    Goldstein, A. A., A Global Newton Method, II: Analytic Centers, Mathematical Programming, Vol. 62, pp. 223–237, 1993.Google Scholar
  10. 10.
    Jiang, P. L., Polynomial Cutting Plane Algorithms for Stochastic Programming and Related Problems, PhD Thesis, Washington State University, 1997.Google Scholar
  11. 11.
    Atkinson, D. S., and Vaidya, P. M., A Cutting Plane Algorithm for Convex Programming that Uses Analytic Centers, Mathematical Programming, Vol. 69, pp. 1–43, 1995.Google Scholar
  12. 12.
    Bland, R. G., Goldfarb, D., and Todd, M. J., The Ellipsoid Method: A Survey, Operations Research, Vol. 29, pp. 1039–1091, 1981.Google Scholar
  13. 13.
    Vaidya, P.M., A New Algorithm for Minimizing Convex Functions over Convex Sets, Mathematical Programming, Vol. 73, pp. 291–341, 1996.Google Scholar
  14. 14.
    Anstreicher, K. M., On Vaidya's Volumetric Cutting Plane Method for Convex Programming, Technical Report, Department of Management Sciences, University of Iowa, 1994; see also Mathematics of Operations Research, Vol. 22, pp. 63’89, 1997.Google Scholar

Copyright information

© Plenum Publishing Corporation 2000

Authors and Affiliations

  • K. A. Ariyawansa
    • 1
  • P. L. Jiang
    • 2
  1. 1.Department of Pure and Applied MathematicsWashington State UniversityPullman
  2. 2.Professional ServicesDelta Dental Plan of MinnesotaEagan

Personalised recommendations