Abstract
In this paper, our interest is to solve canonical nonlinear semidefinite programming (NLSDP). First, we give a reformulation of the (KKT) system associated to the NLSDP as a nonsmooth equation by using the Fischer-Burmeister (FB) function. The nonsmooth equation is then solved by the nonsmooth Newton’s method using formulas of the generalized Jacobian of the FB function given by L. Zhang et al. in [14]. Under mild conditions, we prove that the convergence is locally quadratic.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bi, S., Pan, S., Chen, J.-S.: Nonsingularity Conditions for the Fischer-Burmeister System of Nonlinear SDPs. SIAM J. Optim. 21(4), 1392–1417 (2011)
Clarke, F.H.: Optimization and nonsmooth optimization. Wiley, New York (1983)
Fares, B., Apkarian, P., Noll, D.: An augmented Lagrangian method for a class of LMI-constrained problems in robust control theory. Internat. J. Control. 74, 348–360 (2001)
Fares, B., Noll, D., Apkarian, P.: Robust control via sequential semidefinite programming. SIAM J. Control Optim. 40, 1791–1820 (2002)
Freund, R.W., Fleurian, J., Christoph, V.: A sequential semidefinite programming method and an application in passive reduced-order modeling (2005)
Han, L., Bi, S., Pan, S.: Nonsingularity of F-B system and Constraint Nondegeneracy in Semidefinite Programming. Numer. Algor. 62, 79–113 (2013)
Li, C., Sun, W.: A nonsmooth Newton-type method for nonlinear semidefinite programming. Journal of Nanjing Normal University. Natural Science Edition 31(2) (January 2008)
Li, C., Sun, W., de Sampaio, R.J.B.: An equivalency condition of nonsingularity in nonlinear semidefinite programming. Jrl. Syst. Sci. & Complexity 22, 1–8 (2009)
Qi, L., Sun, D.: A survey of Some Nonsmooth Equations and Smoothing Newton Methods. School of Mathematics. The University of New South Wales Sydney 2052, Australia (1998)
Sun, D.F., Sun, J.: Strong Semismoothness of the Fischer-Burmeister SDC and SOC Complementarity Functions. Math. Program. 103, 575–581 (2005)
Tuan, H.D., Apkarian, P., Nakashina, Y.: A new Lagrangian dual global optimization algorithm for solving bilinear matrix inequalities. Internat. J. Robust Nonlinear Control 10, 561–578 (2000)
Vanderbei, R.J.: LOQO usre’s manual version 3. 10. Report SOR 97-08. Princeton University, Princeton (1997)
Vanderbei, R.J., Benson, H.Y., Shanno, D.F.: Interior point method for nonconvexe nonlinear programming: filter method and merit functions. Compt. Optim. Appl. 23, 257–272 (2002)
Zhang, L., Zhang, N., Pang, L.: Differential Properties of the Symmetric Matrix-Valued Fischer-Burmeister Function. J. Optim Theory Appl. 153, 436–460 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Benahmed, B., Alloun, A. (2015). Semismooth Reformulation and Nonsmooth Newton’s Method for Solving Nonlinear Semidefinite Programming. In: Le Thi, H., Pham Dinh, T., Nguyen, N. (eds) Modelling, Computation and Optimization in Information Systems and Management Sciences. Advances in Intelligent Systems and Computing, vol 359. Springer, Cham. https://doi.org/10.1007/978-3-319-18161-5_35
Download citation
DOI: https://doi.org/10.1007/978-3-319-18161-5_35
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18160-8
Online ISBN: 978-3-319-18161-5
eBook Packages: EngineeringEngineering (R0)