Skip to main content
Springer Nature Link
Log in

An efficient neural network for solving convex optimization problems with a nonlinear complementarity problem function

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

In this paper, we present a one-layer recurrent neural network (NN) for solving convex optimization problems by using the Mangasarian and Solodov (MS) implicit Lagrangian function. In this paper by using Krush–Kuhn–Tucker conditions and MS function the NN model was derived from an unconstrained minimization problem. The proposed NN model is one layer and compared to the available NNs for solving convex optimization problems, which has a better performance in convergence time. The proposed NN model is stable in the sense of Lyapunov and globally convergent to optimal solution of the original problem. Finally, simulation results on several numerical examples are presented and the validity of the proposed NN model is demonstrated.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Bazaraa MS, Shetty CM (1979) Nonlinear programming. Theory and algorithms. Wiley, New York

    MATH  Google Scholar 

  • Bazaraa MS, Jarvis JJ, Sherali HD (1990) Linear programming and network flows, 2nd edn. Wiley, Hoboken

    MATH  Google Scholar 

  • Bouzerdoum A, Pattison TR (1993) Neural network for quadratic optimization with bound constraints. IEEE Trans Neural Netw 4(2):293–304

    Article  Google Scholar 

  • Chen JS (2007) On some NCP-functions based on the generalized Fischer–Burmeister function. Asia-Pac J Oper Res 24:401–420

    Article  MathSciNet  Google Scholar 

  • Chen JS, Pan S (2008) A family of NCP functions and a descent method for the nonlinear complementarity problem. Comput Optim Appl 40:389–404

    Article  MathSciNet  Google Scholar 

  • Chen JS, Ko CH, Pan S (2010) A neural network based on the generalized Fischer–Burmeister function for nonlinear complementarity problems. Inf Sci 180:697–711

    Article  MathSciNet  Google Scholar 

  • Cottle RW, Pang JS, Stone RE (1992) The linear complementarity problem. Academic Press, New York

    MATH  Google Scholar 

  • Effati S, Baymani M (2005) A new nonlinear neural network for solving convex nonlinear programming problems. Appl Math Comput 168:1370–1379

    MathSciNet  MATH  Google Scholar 

  • Effati S, Nazemi AR (2006) Neural network and its application for solving linear and quadratic programming problems. Appl Math Comput 172:305–331

    MathSciNet  MATH  Google Scholar 

  • Effati S, Ranjbar M (2011) A novel recurrent nonlinear neural network for solving quadratic programming problems. Appl Math Model 35:1688–1695

    Article  MathSciNet  Google Scholar 

  • Effati S, Ghomashi A, Abbasi M (2011) A novel recurrent neural network for solving MLCPs and its application to linear and quadratic programming problems. Asia-Pac J Oper Res 28:523–541

    Article  MathSciNet  Google Scholar 

  • Effati S, Mansoori A, Eshaghnezhad M (2015) An efficient projection neural network for solving bilinear programming problems. Neurocomputing 168:1188–1197

    Article  Google Scholar 

  • Facchinei F (1998) Structural and stability properties of \(P_0\) nonlinear complementarity problems. Math Oper Res 23(3):735–745

    Article  MathSciNet  Google Scholar 

  • Ferris MC, Kanzow C (2002) Complementarity and related problems: a survey. In: Handbook of applied optimization. Oxford University Press, New York, pp 514–530

  • Ferris MC, Mangasarian OL, Pang JS (eds) (2001) Complementarity: applications, algorithms and extensions. Kluwer Academic Publishers, Dordrecht

    Google Scholar 

  • Fischer A (1992) A special Newton-type optimization method. Optimization 24:269–284

    Article  MathSciNet  Google Scholar 

  • Fischer A (1997) Solution of the monotone complementarity problem with locally Lipschitzian functions. Math Program 76:513–532

    MathSciNet  MATH  Google Scholar 

  • He S, Zhang L, Zhang J (2015) The rate of convergence of a NLM based on F-B NCP for constrained optimization problems without strict complementarity. Asia-Pac J Oper Res 32(3):1550012

    Article  MathSciNet  Google Scholar 

  • Hu SL, Huang ZH, Chen JS (2009) Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems. J Comput Appl Math 230:69–82

    Article  MathSciNet  Google Scholar 

  • Huang X, Cui B (2016) A novel neural network for solving convex quadratic programming problems subject to equality and inequality constraints. Neurocomputing 214:23–31

    Article  Google Scholar 

  • Kanzow C, Yamashita N, Fukushima M (1997) New NCP-functions and their properties. J Optim Theory Appl 94:115–135

    Article  MathSciNet  Google Scholar 

  • Kennedy MP, Chua LO (1988) Neural networks for nonlinear programming. IEEE Trans Circuits Syst 35:554–562

    Article  MathSciNet  Google Scholar 

  • Liao LZ, Qi H, Qi L (2001) Solving nonlinear complementarity problems with neural networks: a reformulation method approach. J Comput Appl Math 131:342–359

    Article  MathSciNet  Google Scholar 

  • Mangasarian OL, Soldov MV (1993) Nonlinear complementarity as unconstrained and constrained minimization. Math Program 62:277–297

    Article  MathSciNet  Google Scholar 

  • Miller RK, Michel AN (1982) Ordinary differential equations. Academic Press, New York

    MATH  Google Scholar 

  • Miri SM, Effati S (2015) On generalized convexity of nonlinear complementarity functions. J Optim Theory Appl 164(2):723–730

    Article  MathSciNet  Google Scholar 

  • Nazemi AR (2012) A dynamic system model for solving convex nonlinear optimization problems. Commun Nonlinear Sci Numer Simul 17:1696–1705

    Article  MathSciNet  Google Scholar 

  • Nazemi AR (2013) Solving general convex nonlinear optimization problems by an efficient neurodynamic model. Eng Appl Artif Intell 26(2):685–696

    Article  Google Scholar 

  • Nazemi AR (2014) A neural network model for solving convex quadratic programming problems with some applications. Eng Appl Artif Intell 32:54–62

    Article  Google Scholar 

  • Ranjbar M, Effati S, Miri SM (2017) An artificial neural network for solving quadratic zero-one programming problems. Neurocomputing 235:192–198

    Article  Google Scholar 

  • Rodriguez VA, Domingues-Castro R, Rueda A, Huertas JL, Sanchez SE (1990) Nonlinear switched-capacitor neural networks for optimization problems. IEEE Trans Circuits Syst 37(3):384–397

    Article  MathSciNet  Google Scholar 

  • Slotin JJE, Li W (1991) Applied nonlinear control. Prentice Hall, Upper Saddle River

    Google Scholar 

  • Tank DW, Hopfield JJ (1986) Simple neural optimization networks: an A/D converter, signal decision network and a linear programming circuit. IEEE Trans Circuits Syst 33:533–541

    Article  Google Scholar 

  • Wang J (1994) A deterministic annealing neural network for convex programming. Neural Netw 7(4):629–641

    Article  Google Scholar 

  • Xia Y (1996) A new neural network for solving linear programming problems and its application. IEEE Trans Neural Netw 7:525–529

    Article  Google Scholar 

  • Xia Y, Wang J (2000) A recurrent neural network for solving linear projection equations. Neural Netw 13:337–350

    Article  Google Scholar 

  • Xia Y, Wang J (2004) A recurrent neural network for nonlinear convex optimization subject to nonlinear inequality constraints. IEEE Trans Circuits Syst 51(7):1385–1394

    Article  MathSciNet  Google Scholar 

  • Xia Y, Wang J (2005) A recurrent neural network for solving nonlinear convex programs subject to linear constraints. IEEE Trans Neural Netw 16(2):1045–1053

    Article  Google Scholar 

  • Zhang XS (1996) Mathematical analysis of some neural networks for solving linear and quadratic programming. Acta Mathematicae Applicatae Sinica 12(1):1–10

    Article  MathSciNet  Google Scholar 

  • Zhang Z, Constantinides AG (1992) Lagrange programming neural networks. IEEE Trans Circuits Syst 39(7):441–452

    Article  Google Scholar 

  • Zhang XS, Zhuo XJ, Jing ZJ (2002) An adaptive neural network model for nonlinear programming problems. Acta Mathematicae Applicatae Sinica 18(3):377–388

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Ferdowsi University of Mashhad, Mashhad, Iran

    M. Ranjbar, S. Effati & S. M. Miri

Authors
  1. M. Ranjbar
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. S. Effati
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. S. M. Miri
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to M. Ranjbar.

Ethics declarations

Conflict of interest

All authors have no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

Additional information

Communicated by V. Loia.

Publisher's Note

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

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ranjbar, M., Effati, S. & Miri, S.M. An efficient neural network for solving convex optimization problems with a nonlinear complementarity problem function. Soft Comput 24, 4233–4242 (2020). https://doi.org/10.1007/s00500-019-04189-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-019-04189-8

Keywords