An Inexact SQP Newton Method for Convex SC1 Minimization Problems



In this paper, we present a globally and superlinearly convergent inexact SQP Newton method for solving large scale convex SC 1 minimization problems under mild conditions. In particular, the BD-regularity assumption made by Pang and Qi in Journal of Optimization Theory and Applications, 85 (1995), pp. 633–648 is replaced by a much more realistic assumption. Our numerical experiments conducted on least squares semidefinite programming with lower and upper bounds demonstrate that our inexact SQP Newton method is much more efficient than its exact version and is competitive with existing methods when the number of simple constraints is very large.


Convex SC1 minimization Inexact SQP method Semismoothness Superlinear convergence 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Pang, J.S., Qi, L.: A globally convergent Newton method for convex SC 1 minimization problems. J. Optim. Theory Appl. 85, 633–648 (1995) MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Bhatia, R.: Matrix Analysis. Springer, New York (1997) Google Scholar
  3. 3.
    Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (1985) MATHGoogle Scholar
  4. 4.
    Borwein, J., Lewis, A.S.: Partially finite convex programming, part II: Explicit lattice models. Math. Program. 57, 49–83 (1992) MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970) MATHGoogle Scholar
  6. 6.
    Rockafellar, R.T.: Conjugate Duality and Optimization. SIAM, Philadelphia (1974) MATHGoogle Scholar
  7. 7.
    Zarantonello, E.H.: Projections on convex sets in Hilbert space and spectral theory I and II. In: Zarantonello, E.H. (ed.) Contributions to Nonlinear Functional Analysis, pp. 237–424. Academic Press, New York (1971) Google Scholar
  8. 8.
    Schwertman, N.C., Allen, D.M.: Smoothing an indefinite variance-covariance matrix. J. Stat. Comput. Simul. 9, 183–194 (1979) CrossRefGoogle Scholar
  9. 9.
    Sun, D.F., Sun, J.: Semismooth matrix valued functions. Math. Oper. Res. 27, 150–169 (2002) MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Chen, X., Qi, H.-D., Tseng, P.: Analysis of nonsmooth symmetric-matrix-valued functions with applications to semidefinite complementarity problems. SIAM J. Optim. 13, 960–985 (2003) MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Qi, H.-D., Sun, D.F.: A quadratically convergent Newton method for computing the nearest correlation matrix. SIAM J. Matrix Anal. Appl. 28, 360–385 (2006) MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Boyd, S., Xiao, L.: Least-squares covariance matrix adjustment. SIAM J. Matrix Anal. Appl. 27, 532–546 (2005) MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Chen, X.J.: Convergence of the BFGS method for LC1 convex constrained optimization. SIAM J. Control Optim. 34, 2051–2063 (1996) CrossRefMathSciNetGoogle Scholar
  14. 14.
    Malick, J.: A dual approach to semidefinite least-squares problems. SIAM J. Matrix Anal. Appl. 26, 272–284 (2004) MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Bai, Z.-J., Chu, D.L., Sun, D.F.: A dual optimization approach to inverse quadratic eigenvalue problems with partial eigenstructure. SIAM J. Sci. Comput. 29, 2531–2561 (2007) MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Zhao, X.Y., Sun, D.F., Toh, K.-C.: A Newton-CG augmented Lagrangian method for semidefinite programming. SIAM J. Optim. 20, 1737–1765 (2010) CrossRefGoogle Scholar
  17. 17.
    Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (1999) MATHCrossRefGoogle Scholar
  18. 18.
    Ravindran, G., Gowda, M.S.: Regularization of P 0-functions in box variational inequality problems. SIAM J. Optim. 11, 748–760 (2000) MATHCrossRefMathSciNetGoogle Scholar
  19. 19.
    Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, Berlin (1998) MATHCrossRefGoogle Scholar
  20. 20.
    Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley, New York (1983) MATHGoogle Scholar
  21. 21.
    Qi, L.: Convergence analysis of some algorithms for solving nonsmooth equations. Math. Oper. Res. 18, 227–244 (1993) MATHCrossRefMathSciNetGoogle Scholar
  22. 22.
    Mifflin, R.: Semismoothness and semiconvex functions in constrained optimization. SIAM J. Control Optim. 15, 959–972 (1977) MATHCrossRefMathSciNetGoogle Scholar
  23. 23.
    Qi, L., Sun, J.: A nonsmooth version of Newton’s method. Math. Program. 58, 353–367 (1993) CrossRefMathSciNetGoogle Scholar
  24. 24.
    Eaves, B.C.: On the basic theorem of complemenarity. Math. Program. 1, 68–75 (1971) MATHCrossRefMathSciNetGoogle Scholar
  25. 25.
    Sun, D.F., Sun, J.: Löwner’s operator and spectral functions in Euclidean Jordan algebras. Math. Oper. Res. 33, 421–445 (2008) CrossRefMathSciNetGoogle Scholar
  26. 26.
    Fischer, A.: Solution of monotone complementarity problems with locally Lipschitzian functions. Math. Program. 76, 513–532 (1997) Google Scholar
  27. 27.
    Gao, Y., Sun, D.F.: Calibrating least squares semidefinite programming with equality and inequality constraints. SIAM J. Matrix Anal. Appl. 31, 1432–1457 (2010) CrossRefMathSciNetGoogle Scholar
  28. 28.
    Qi, H.-D.: Positive semidefinite matrix completions on chordal graphs and the constraint nondegeneracy in semidefinite programming. Linear Algebra Appl. 430, 1151–1164 (2009) MATHCrossRefMathSciNetGoogle Scholar
  29. 29.
    Facchinei, F., Pang, J.S.: Finite-Dimensional Variational Inequalities and Complementarity Problems, vols. I & II. Springer, New York (2003) Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.Royal Bank of Scotland, 38/F, Cheung Kong CenterHong KongHong Kong
  2. 2.Department of MathematicsNational University of SingaporeSingaporeRepublic of Singapore
  3. 3.School of ScienceShenyang Institute of Aeronautical EngineeringShenyangP.R. China

Personalised recommendations