Skip to main content

A Modified Neural Network for Solving General Singular Convex Optimization with Bounded Variables

  • Conference paper
  • First Online:

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 95))

Abstract

Singular nonlinear optimization problem has been the difficulty for optimization, which is frequently encountered in practical applications. People have been using numerical iteration methods to deal with the singular problem previously, but the numerical instability and large calculation amount have not been able to be resolved. Based on neural network, this paper puts forward a continuity solution with any rank defect, by using the Augmented Lagrangian method and Projection to form a stable model. By using LaSalle’s invariance principle, it is shown that the solution of the proposed network model is convergent. The numerical simulation also further confirmed the effectiveness of the method.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Schnabel, R.B., Chow, T.-T.: Tensor methods for unconstrained optimization using second derivatives. SIAM J. Optim. 1(3), 293–315 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  2. Feng, D., Schnabel, R.B.: Tensor methods for equality constrained optimization. SIAM J. Optim. 6(3), 653–673 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bouaricha, A.: Tensor methods for large sparse unconstrained optimization. SIAM J. Optim. 7(3), 732–756 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  4. Ge, R., Xia, Z.: Solving a type of modified BFGS algorithm with any rank defects and the local Q-superlinear convergence properties. J. Comput. Appl. Math. 22, 1–2 (2006)

    Article  MathSciNet  Google Scholar 

  5. Ge, R., Xia, Z.: A type of modified BFGS algorithm with rank defects and its global convergence in convex minimization. J Pure Appl. Math. Adv. Appl. 3, 17–35 (2010)

    MATH  MathSciNet  Google Scholar 

  6. Xia, Y.S., Wang, J.: On the stability of globally projected dynamical systems. J. Optim. Theory Appl. 106, 129–150 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  7. Xia, Y.S., Leung, H., Wang, J.: A projection neural network and its application to constrained optimization problems. IEEE Trans. Circuits Syst. I 49, 447–458 (2002)

    Article  MathSciNet  Google Scholar 

  8. Sun, C.Y., Feng, C.B.: Neural Networks for Nonconvex Nonlinear Programming Problems: A Switching Control Approach. Lecture Notes in Computer Science, Springer, vol. 3496, pp. 694–699 (2005)

    Article  Google Scholar 

  9. Du, X., Yang, Y., Li, M.: Further studies on the Hestenes-Powell augmented lagrangian function for equality constraints in nonlinear programming problems. OR Trans. 10, 38–46 (2006)

    Google Scholar 

  10. Kinderlehrer, D., Stampacchia, G.: An Introduction to Variational Inequalities and Their Applications. Academic, New York (1980)

    MATH  Google Scholar 

  11. More, J.J., Garbow, B.S., Hillstrom, K.E.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7(1), 19–31 (1981)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rendong Ge .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Ge, R., Liu, L., Wang, J. (2015). A Modified Neural Network for Solving General Singular Convex Optimization with Bounded Variables. In: Gao, D., Ruan, N., Xing, W. (eds) Advances in Global Optimization. Springer Proceedings in Mathematics & Statistics, vol 95. Springer, Cham. https://doi.org/10.1007/978-3-319-08377-3_36

Download citation

Publish with us

Policies and ethics