## 摘要

This paper proposes using the neural networks to efficiently solve the second-order cone programs (SOCP). To establish the neural networks, the SOCP is first reformulated as a second-order cone complementarity problem (SOCCP) with the Karush-Kuhn-Tucker conditions of the SOCP. The SOCCP functions, which transform the SOCCP into a set of nonlinear equations, are then utilized to design the neural networks. We propose two kinds of neural networks with the different SOCCP functions. The first neural network uses the Fischer-Burmeister function to achieve an unconstrained minimization with a merit function. We show that the merit function is a Lyapunov function and this neural network is asymptotically stable. The second neural network utilizes the natural residual function with the cone projection function to achieve low computation complexity. It is shown to be Lyapunov stable and converges globally to an optimal solution under some condition. The SOCP simulation results demonstrate the effectiveness of the proposed neural networks.

原文 | 英語 |
---|---|

頁（從 - 到） | 3646-3653 |

頁數 | 8 |

期刊 | Neurocomputing |

卷 | 74 |

發行號 | 17 |

DOIs | |

出版狀態 | 已發佈 - 2011 10月 |

## ASJC Scopus subject areas

- 電腦科學應用
- 認知神經科學
- 人工智慧