Skip to main content
Log in

A line search exact penalty method for nonlinear semidefinite programming

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

In this paper, we present a line search exact penalty method for solving nonlinear semidefinite programming (SDP) problem. Compared with the traditional sequential semidefinite programming (SSDP) method which requires that the subproblem at every iterate point is compatible, this method is more practical. We first use a robust subproblem, which is always feasible, to get a detective step, then compute a search direction either from a traditional SSDP subproblem or a quadratic optimization subproblem with the penalty term. This two-phase strategy with the \(l_1\) exact penalty function is employed to promote the global convergence, which is analyzed without assuming any constraint qualifications. Some 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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Apkarian, P., Noll, D., Tuan, H.D.: Fixed-order \(H_{\infty }\) control design via a partially augmented Lagrangian method. Int. J. Robust Nonlinear Control 13, 1137–1148 (2003)

    Article  MathSciNet  Google Scholar 

  2. Ben-Tal, A., Jarre, F., Kocvara, M., Nemirovski, A., Zowe, J.: Optimization design of trusses under a nonconvex global buckling constraint. Optim. Eng. 1, 189–213 (2000)

    Article  MathSciNet  Google Scholar 

  3. Byrd, R.H., Lopez-Calva, G., Nocedal, J.: A line search exact penalty method using steering rules. Math. Program. 133, 39–73 (2012)

    Article  MathSciNet  Google Scholar 

  4. Charalambous, C.: Nonlinear least p-th optimization and nonlinear programming. Math. Program. 12, 195–225 (1977)

    Article  MathSciNet  Google Scholar 

  5. Chen, Z.W., Miao, S.C.: A penalty-free method with trust region for nonlinear semidefinite programming. Asia Pacific J. Oper. Res. 32(1), 1–24 (2015)

    MathSciNet  MATH  Google Scholar 

  6. Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust-Region Methods, MOS-SIAM Series on Optim. SIAM, Philadelphia (2000)

    Book  Google Scholar 

  7. Correa, R., Ramirez, H.: A global algorithm for nonlinear semidefinite programming. SIAM J. Optim. 15, 303–318 (2004)

    Article  MathSciNet  Google Scholar 

  8. Fares, B., Apkarian, P., Noll, D.: An augmented Lagrangian method for a class of LMI-constrained problems in robust control theory. Int. J. Control 74, 348–360 (2001)

    Article  MathSciNet  Google Scholar 

  9. Fares, B., Noll, D., Apkarian, P.: Robust control via sequential semidefinite programming. SIAM J. Control Optim. 40, 1791–1820 (2002)

    Article  MathSciNet  Google Scholar 

  10. Gómez, W., Ramirez, H.: A filter algorithm for nonlinear semidefinite programming. Comput. Appl. Math. 29, 297–328 (2010)

    MathSciNet  MATH  Google Scholar 

  11. Gould, N.I.M., Loh, Y., Robinson, D.P.: A filter method with unified step computation for nonlinear optimization. SIAM J. Optim. 24, 175–209 (2014)

    Article  MathSciNet  Google Scholar 

  12. Kanno, Y., Takewaki, I.: Sequential semidefinite program for maximum robustness design of structures under load uncertainty. J. Optim. Theory Appl. 130, 265–287 (2006)

    Article  MathSciNet  Google Scholar 

  13. Leibfritz, F.: \(COMPl_eib\): Constrained matrix-optimization problem library - a collection of test examples for nonlinear semidefinite programming, control system design and related problems, Technical report, University of Trier, Trier, Germany (2004)

  14. Mosheyev, L., Zibulevsky, M.: Penalty/barrier multiplier algorithm for semidefinite programming. Optim. Methods Softw. 13, 235–261 (2000)

    Article  MathSciNet  Google Scholar 

  15. Toh, K.C., Tutüncü, R.H., Todd, M.J.: On the implementation and usage of SDPT3-a Matlab software package for semidefinite quadratic linear programming, Version 4.0, 17 July (2006)

  16. Vandenberghe, L., Boyd, S., Wu, S.P.: Determinant maximization with linear matrix inequality constraints. SIAM J. Matrix Anal. Appl. 19, 499–533 (1998)

    Article  MathSciNet  Google Scholar 

  17. Yamashita, H., Yab, H., Harada, K.: A primal-dual interior point method for nonlinear semidefinite programming. Math. Program. 135, 89–121 (2012)

    Article  MathSciNet  Google Scholar 

  18. Zhao, Q., Chen, Z.W.: On the superlinear local convergence of a penalty-free method for nonlinear semidefinite programming. J. Comput. Appl. Math. 308, 1–16 (2016)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhongwen Chen.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

The work was supported by Chinese NSF Grant 11871362.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhao, Q., Chen, Z. A line search exact penalty method for nonlinear semidefinite programming. Comput Optim Appl 75, 467–491 (2020). https://doi.org/10.1007/s10589-019-00158-x

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-019-00158-x

Keywords

Mathematics Subject Classification

Navigation