Skip to main content

A Neural Network Algorithm for Second-Order Conic Programming

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3496))

Abstract

A neural network algorithm for second-order conic programming is proposed. By the Smooth technique, a smooth and convex energy function is constructed. We have proved that for any initial point, every trajectory of the neural network converges to an optimal solution of the second-order conic programming. The simulation results show the proposed neural network is feasible and efficient.

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 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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Lobo, M.S., Vandenberghe, L., Boyd, S., Lebret, H.: Application of Second Order Cone Programming. Linear Algebra and its Applications 284, 193–228 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  2. Lebret, H., Boyd, S.: Antenna Array Pattern Synthesis via Convex Optimization. IEEE Transactions on Signal Processing 45, 526–532 (1997)

    Article  Google Scholar 

  3. Lu, W.S., Hinamoto, T.: Optimal Design of IIR Digital Filters with Robust Stability Using Conic-Quadratic-Programming Updates. IEEE Transactions on Signal Processing 51, 1581–1592 (2003)

    Article  MathSciNet  Google Scholar 

  4. Wang, J.: A Deterministic Annealing Neural Network for Conex Programming. Neural networks 7, 629–641 (1994)

    Article  MATH  Google Scholar 

  5. Jiang, D., Wang, J.: A Recurrent Neural Network for Real-time Semidefinite Programming. IEEE Transaction on Neural Networks 10, 81–93 (1999)

    Article  Google Scholar 

  6. Leung, Y., Chen, K., Jiao, Y., Gao, X., Leung, K.S.: A New Gradient-Based Neural Network for Solving Linear and Quadratic Programming Problems. IEEE Transactions on Neural Networks 12, 1074–1083 (2001)

    Article  Google Scholar 

  7. Benson, H.Y., Vanderbei, R.J.: Solving Problems with Semidefinite and Related Constraints Using Interior-Point Methods for Nonlinear Programming. Math. Program 95, 279–302 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  8. Avriel, M.: Nonlinear Programming: Analysis and Methods. Prentice-Hall, Englewood Cliffs (1976)

    MATH  Google Scholar 

  9. Scalle, J.L., Lefschetz, S.: Stability by Lyapunov’s Direct Method with Applications. Academic, New York (1961)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mu, X., Liu, S., Zhang, Y. (2005). A Neural Network Algorithm for Second-Order Conic Programming. In: Wang, J., Liao, X., Yi, Z. (eds) Advances in Neural Networks – ISNN 2005. ISNN 2005. Lecture Notes in Computer Science, vol 3496. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11427391_115

Download citation

  • DOI: https://doi.org/10.1007/11427391_115

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25912-1

  • Online ISBN: 978-3-540-32065-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics