Skip to main content
Erschienen in: Journal of Applied Mathematics and Computing 1-2/2013

01.03.2013 | Applied mathematics

A smoothing and regularization Broyden-like method for nonlinear inequalities

verfasst von: Haitao Che, Meixia Li

Erschienen in: Journal of Applied Mathematics and Computing | Ausgabe 1-2/2013

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this paper, we consider the smoothing and regularization Broyden-like algorithm for the system of nonlinear inequalities. By constructing a new smoothing function \(\phi(\mu,a)=\frac{1}{2}(a+\mu(\ln2+\ln(1+\cosh\frac{a}{\mu})))\), the problem is approximated via a family of parameterized smooth equations H(μ,ε,x)=0. A smoothing and regularization Broyden-like algorithm with a non-monotone linear search is proposed for solving the system of nonlinear inequalities based on the new smoothing function. The global convergence of the algorithm is established under suitable assumptions. In addition, the smoothing parameter μ and the regularization parameter ε in our algorithm are viewed as two different independent variables. Preliminary numerical results show the efficiency of the algorithm and reveal that the regularization parameter ε in our algorithm plays an important role in numerical improvement, hence, our algorithm seems to be simpler and more easily implemented compared to many previous methods.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Zakian, V., Nail, U.A.: Design of dynamical and control systems by the method of inequalities. Proc. Inst. Electr. Electron. Eng. 120, 1421–1472 (1973) CrossRef Zakian, V., Nail, U.A.: Design of dynamical and control systems by the method of inequalities. Proc. Inst. Electr. Electron. Eng. 120, 1421–1472 (1973) CrossRef
2.
Zurück zum Zitat Dennis, J.E., Schnabel, R.B.: Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice-Hall, Englewood Cliffs (1983) MATH Dennis, J.E., Schnabel, R.B.: Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Prentice-Hall, Englewood Cliffs (1983) MATH
3.
Zurück zum Zitat Neumaier, A.: Interval Methods for System of Equations. Cambridge University Press, Cambridge (1990) Neumaier, A.: Interval Methods for System of Equations. Cambridge University Press, Cambridge (1990)
4.
Zurück zum Zitat Kanzow, C.: Some noninterior continuation methods for linear complementarity problems. SIAM J. Matrix Anal. Appl. 17, 851–868 (1996) MathSciNetMATHCrossRef Kanzow, C.: Some noninterior continuation methods for linear complementarity problems. SIAM J. Matrix Anal. Appl. 17, 851–868 (1996) MathSciNetMATHCrossRef
5.
Zurück zum Zitat Engelke, S., Kanzow, C.: Predictor-corrector smoothing methods for the solution of linear programming. Preprint, Department of Mathematics, University of Hamburg, Hamburg, Germany (2000) Engelke, S., Kanzow, C.: Predictor-corrector smoothing methods for the solution of linear programming. Preprint, Department of Mathematics, University of Hamburg, Hamburg, Germany (2000)
6.
Zurück zum Zitat Chen, B., Harker, P.T.: A noninterior-point continuation method for linear complementarity problems. SIAM J. Matrix Anal. Appl. 14, 1168–1190 (1993) MathSciNetMATHCrossRef Chen, B., Harker, P.T.: A noninterior-point continuation method for linear complementarity problems. SIAM J. Matrix Anal. Appl. 14, 1168–1190 (1993) MathSciNetMATHCrossRef
7.
Zurück zum Zitat Smale, S.: Algorithms for solving equations. In: Gleason, A.M. (ed.) Proceedings of the International Congress of Mathematicians, pp. 172–195. Am. Math. Soc., Providence (1987) Smale, S.: Algorithms for solving equations. In: Gleason, A.M. (ed.) Proceedings of the International Congress of Mathematicians, pp. 172–195. Am. Math. Soc., Providence (1987)
8.
Zurück zum Zitat Chen, X., Qi, L.: A parametrized Newton method and a Broyden-like method for solving nonsmooth equations. Comput. Optim. Appl. 3, 157–179 (1994) MathSciNetMATHCrossRef Chen, X., Qi, L.: A parametrized Newton method and a Broyden-like method for solving nonsmooth equations. Comput. Optim. Appl. 3, 157–179 (1994) MathSciNetMATHCrossRef
9.
Zurück zum Zitat Chen, C., Mangasarian, O.L.: A class of smoothing functions for nonlinear and mixed complementarity problems. Comput. Optim. Appl. 5, 97–138 (1996) MathSciNetMATHCrossRef Chen, C., Mangasarian, O.L.: A class of smoothing functions for nonlinear and mixed complementarity problems. Comput. Optim. Appl. 5, 97–138 (1996) MathSciNetMATHCrossRef
10.
Zurück zum Zitat Tseng, P.: Analysis of a noninterior continuation method based on Chen-Mangasarian smoothing functions for complementarity problems. In: Fukushima, M., Qi, L. (eds.) Reformulation: Nonsmooth, Piecewise-Smooth, Semismooth, and Smoothing Methods, pp. 381–404. Kluwer Academic, Boston (1998) Tseng, P.: Analysis of a noninterior continuation method based on Chen-Mangasarian smoothing functions for complementarity problems. In: Fukushima, M., Qi, L. (eds.) Reformulation: Nonsmooth, Piecewise-Smooth, Semismooth, and Smoothing Methods, pp. 381–404. Kluwer Academic, Boston (1998)
11.
Zurück zum Zitat Gabriel, S.A., More, J.J.: Smoothing of mixed complementarity problems. In: Ferris, M.C., Pang, J.S. (eds.) Complementarity and Variational Problems: State of the Art, pp. 105–116. SIAM, Philadelphia (1997) Gabriel, S.A., More, J.J.: Smoothing of mixed complementarity problems. In: Ferris, M.C., Pang, J.S. (eds.) Complementarity and Variational Problems: State of the Art, pp. 105–116. SIAM, Philadelphia (1997)
12.
Zurück zum Zitat Huang, Z.H., Han, J.Y., Chen, Z.W.: Predictor-corrector smoothing Newton method based on a new smoothing function, for solving the nonlinear complementarity problem with a P 0 function. J. Optim. Theory Appl. 117, 39–68 (2003) MathSciNetMATHCrossRef Huang, Z.H., Han, J.Y., Chen, Z.W.: Predictor-corrector smoothing Newton method based on a new smoothing function, for solving the nonlinear complementarity problem with a P 0 function. J. Optim. Theory Appl. 117, 39–68 (2003) MathSciNetMATHCrossRef
14.
Zurück zum Zitat Mayne, D.Q., Polak, E., Heunis, A.J.: Solving nonlinear inequalities in a finite number of iterations. J. Optim. Theory Appl. 33, 207–221 (1981) MathSciNetMATHCrossRef Mayne, D.Q., Polak, E., Heunis, A.J.: Solving nonlinear inequalities in a finite number of iterations. J. Optim. Theory Appl. 33, 207–221 (1981) MathSciNetMATHCrossRef
15.
16.
Zurück zum Zitat Yin, H.X., Huang, Z.H., Qi, L.Q.: The convergence of a Levenberg-Marquardt method for nonlinear inequalities. Numer. Funct. Anal. Optim. 29, 687–716 (2008) MathSciNetMATHCrossRef Yin, H.X., Huang, Z.H., Qi, L.Q.: The convergence of a Levenberg-Marquardt method for nonlinear inequalities. Numer. Funct. Anal. Optim. 29, 687–716 (2008) MathSciNetMATHCrossRef
17.
Zurück zum Zitat Huang, Z.H., Zhang, Y., Wu, W.: A smoothing-type algorithm for solving system of inequalities. J. Comput. Appl. Math. 220, 355–363 (2008) MathSciNetMATHCrossRef Huang, Z.H., Zhang, Y., Wu, W.: A smoothing-type algorithm for solving system of inequalities. J. Comput. Appl. Math. 220, 355–363 (2008) MathSciNetMATHCrossRef
18.
Zurück zum Zitat Zhu, J.G., Liu, H.W., Li, X.L.: A regularized smoothing-type algorithm for solving a system of inequalities with a P 0-function. J. Comput. Appl. Math. 233, 2611–2619 (2010) MathSciNetMATHCrossRef Zhu, J.G., Liu, H.W., Li, X.L.: A regularized smoothing-type algorithm for solving a system of inequalities with a P 0-function. J. Comput. Appl. Math. 233, 2611–2619 (2010) MathSciNetMATHCrossRef
19.
Zurück zum Zitat He, C., Ma, C.F.: A smoothing self-adaptive Levenberg-Marquardt algorithm for solving system of nonlinear inequalities. Appl. Math. Comput. 216, 3056–3063 (2010) MathSciNetMATHCrossRef He, C., Ma, C.F.: A smoothing self-adaptive Levenberg-Marquardt algorithm for solving system of nonlinear inequalities. Appl. Math. Comput. 216, 3056–3063 (2010) MathSciNetMATHCrossRef
20.
Zurück zum Zitat Huang, Z.H., Qi, L., Sun, D.: Sub-quadratic convergence of a smoothing Newton algorithm for the P 0 and monotone LCP. Math. Program. 99, 423–441 (2004) MathSciNetMATHCrossRef Huang, Z.H., Qi, L., Sun, D.: Sub-quadratic convergence of a smoothing Newton algorithm for the P 0 and monotone LCP. Math. Program. 99, 423–441 (2004) MathSciNetMATHCrossRef
21.
Zurück zum Zitat Li, D.H., Fukushima, M.: Smoothing Newton and quasi-Newton methods for mixed complementarity problems. Comput. Optim. Appl. 17, 203–230 (2000) MathSciNetMATHCrossRef Li, D.H., Fukushima, M.: Smoothing Newton and quasi-Newton methods for mixed complementarity problems. Comput. Optim. Appl. 17, 203–230 (2000) MathSciNetMATHCrossRef
22.
Zurück zum Zitat Li, D.H., Fukushima, M.: Globally convergent Broyden-like methods for semismooth equations and applications to VIP, NCP and MCP. Ann. Oper. Res. 103, 71–79 (2001) MathSciNetMATHCrossRef Li, D.H., Fukushima, M.: Globally convergent Broyden-like methods for semismooth equations and applications to VIP, NCP and MCP. Ann. Oper. Res. 103, 71–79 (2001) MathSciNetMATHCrossRef
23.
Zurück zum Zitat Li, D.H., Fukushima, M.: A derivative-free line search and global convergence of Broyden-like method for nonlinear equations. Optim. Methods Softw. 13, 181–201 (2000) MathSciNetMATHCrossRef Li, D.H., Fukushima, M.: A derivative-free line search and global convergence of Broyden-like method for nonlinear equations. Optim. Methods Softw. 13, 181–201 (2000) MathSciNetMATHCrossRef
24.
Zurück zum Zitat Qi, L.Q., Sun, D.F., Zhou, G.L.: A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities. Math. Program. 87, 1–35 (2000) MathSciNetMATH Qi, L.Q., Sun, D.F., Zhou, G.L.: A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities. Math. Program. 87, 1–35 (2000) MathSciNetMATH
25.
Zurück zum Zitat Herty, M., Klar, A., Singh, A.K., Spellucci, P.: Smoothed penalty algorithms for optimization of nonlinear models. Comput. Optim. Appl. 37, 157–176 (2007) MathSciNetMATHCrossRef Herty, M., Klar, A., Singh, A.K., Spellucci, P.: Smoothed penalty algorithms for optimization of nonlinear models. Comput. Optim. Appl. 37, 157–176 (2007) MathSciNetMATHCrossRef
26.
Zurück zum Zitat Sun, W.Y., Han, J.Y., Sun, J.: Global convergence of non-monotone descent methods for unconstrained optimization problems. J. Comput. Appl. Math. 146, 89–98 (2002) MathSciNetMATHCrossRef Sun, W.Y., Han, J.Y., Sun, J.: Global convergence of non-monotone descent methods for unconstrained optimization problems. J. Comput. Appl. Math. 146, 89–98 (2002) MathSciNetMATHCrossRef
27.
Zurück zum Zitat Yu, Z.S., Pu, D.G.: A new nonmonotone line search technique for unconstrained optimization. J. Comput. Appl. Math. 219, 134–144 (2008) MathSciNetMATHCrossRef Yu, Z.S., Pu, D.G.: A new nonmonotone line search technique for unconstrained optimization. J. Comput. Appl. Math. 219, 134–144 (2008) MathSciNetMATHCrossRef
28.
Zurück zum Zitat Luca, T.D., Facchinei, F., Kanzow, C.: A semismooth equation approach to the solution of nonlinear complementarity problems. Math. Program. 75, 407–439 (1996) MATHCrossRef Luca, T.D., Facchinei, F., Kanzow, C.: A semismooth equation approach to the solution of nonlinear complementarity problems. Math. Program. 75, 407–439 (1996) MATHCrossRef
29.
Zurück zum Zitat Lee, Y.J., Mangasarin, O.L.: SSVM: a smooth support vector machine for classification. Comput. Optim. Appl. 20, 5–22 (2001) MathSciNetMATHCrossRef Lee, Y.J., Mangasarin, O.L.: SSVM: a smooth support vector machine for classification. Comput. Optim. Appl. 20, 5–22 (2001) MathSciNetMATHCrossRef
30.
Zurück zum Zitat Spellucci, P.: Solving QP problems by penalization and smoothing. Preprint 2242, TUD Dept. of Math. (2002) Spellucci, P.: Solving QP problems by penalization and smoothing. Preprint 2242, TUD Dept. of Math. (2002)
31.
Zurück zum Zitat Chen, B., Harker, P.T.: A non-interior-point continuation method for linear complementarity problems. SIAM J. Matrix Anal. Appl. 14, 1168–1190 (1993) MathSciNetMATHCrossRef Chen, B., Harker, P.T.: A non-interior-point continuation method for linear complementarity problems. SIAM J. Matrix Anal. Appl. 14, 1168–1190 (1993) MathSciNetMATHCrossRef
32.
Zurück zum Zitat Zhang, Y., Huang, Z.H.: A nonmonotone smoothing-type algorithm for solving a system of equalities and inequalities. J. Comput. Appl. Math. 233, 2312–2321 (2010) MathSciNetMATHCrossRef Zhang, Y., Huang, Z.H.: A nonmonotone smoothing-type algorithm for solving a system of equalities and inequalities. J. Comput. Appl. Math. 233, 2312–2321 (2010) MathSciNetMATHCrossRef
Metadaten
Titel
A smoothing and regularization Broyden-like method for nonlinear inequalities
verfasst von
Haitao Che
Meixia Li
Publikationsdatum
01.03.2013
Verlag
Springer-Verlag
Erschienen in
Journal of Applied Mathematics and Computing / Ausgabe 1-2/2013
Print ISSN: 1598-5865
Elektronische ISSN: 1865-2085
DOI
https://doi.org/10.1007/s12190-012-0588-2

Weitere Artikel der Ausgabe 1-2/2013

Journal of Applied Mathematics and Computing 1-2/2013 Zur Ausgabe

Premium Partner