Skip to main content
Log in

Globally and Quadratically Convergent Algorithm for Minimizing the Sum of Euclidean Norms

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

For the problem of minimizing the sum of Euclidean norms (MSN), most existing quadratically convergent algorithms require a strict complementarity assumption. However, this assumption is not satisfied for a number of MSN problems. In this paper, we present a globally and quadratically convergent algorithm for the MSN problem. In particular, the quadratic convergence result is obtained without assuming strict complementarity. Examples without strictly complementary solutions are given to show that our algorithm can indeed achieve quadratic convergence. Preliminary numerical results are reported.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Calamai, P. H., and Conn, A.R., A Projected Newton Method for l p Norm Location Problems, Mathematical Programming, Vol. 38, pp. 75-109, 1987.

    Google Scholar 

  2. Overton, M. L., A Quadratically Convergent Method for Minimizing a Sum of Euclidean Norms, Mathematical Programming, Vol. 27, pp. 34-63, 1983.

    Google Scholar 

  3. Xue, G., and Ye, Y., An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications, SIAM Journal on Optimization, Vol. 7, pp. 1017-1036, 1997.

    Google Scholar 

  4. Qi, L., and Zhou, G., A Smoothing Newton Method for Minimizing a Sum of Euclidean Norms, SIAM Journal on Optimization, Vol. 11, pp. 389-410, 2000.

    Google Scholar 

  5. Hiriart-Urruty, J. B., and Lemarechal, C., Convex Analysis and Minimization Algorithms, Springer Verlag, Berlin, Germany, 1993.

    Google Scholar 

  6. Robinson, S.M., Normal Maps Induced by Linear Transformations, Mathematics of Operations Research, Vol. 17, pp. 691-714, 1992.

    Google Scholar 

  7. Qi, L., and Sun, J., A Nonsmooth Version of Newton's Method, Mathematical Programming, Vol. 58, pp. 353-367, 1993.

    Google Scholar 

  8. Fischer, A., Solution of Monotone Complementarity Problems with Locally Lipschitzian Functions, Mathematical Programming, Vol. 76, pp. 513-532, 1997.

    Google Scholar 

  9. Chen, C., and Mangasarian, O. L., A Class of Smoothing Functions for Nonlinear and Mixed Complementarity Problems, Computational Optimization and Applications, Vol. 5, pp. 97-138, 1996.

    Google Scholar 

  10. Qi, H.D., A Regularized Smoothing Newton Method for Box-Constrained Variational Inequality Problems with P 0 -Functions, SIAM Journal on Optimization, Vol. 10, pp. 251-264, 2000.

    Google Scholar 

  11. Qi, L., Sun, D., and Zhou, G., A New Look at Smoothing Newton Methods for Nonlinear Complementarity Problems and Box-Constrained Variational Inequalities, Mathematical Programming, Vol. 87, pp. 1-35, 2000.

    Google Scholar 

  12. Sun, D., A Regularization Newton Method for Solving Nonlinear Complementarity Problems, Applied Mathematics and Optimization, Vol. 40, pp. 315-339, 1999.

    Google Scholar 

  13. Chen, B., and Harker, P. T., A Noninterior-Point Continuation Method for Linear Complementarity Problems, SIAM Journal on Matrix Analysis and Applications, Vol. 14, pp. 1168-1190, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhou, G., Toh, K. & Sun, D. Globally and Quadratically Convergent Algorithm for Minimizing the Sum of Euclidean Norms. Journal of Optimization Theory and Applications 119, 357–377 (2003). https://doi.org/10.1023/B:JOTA.0000005450.58251.6d

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:JOTA.0000005450.58251.6d

Navigation