A differential inclusion-based approach for solving nonsmooth convex optimization problems

Optimization

Volumn 62, Issue 9, 2013, Pages 1203-1226

  Hosseini, Alireza ^a   Hosseini, S Mohammad ^a   Soleimani damaneh, M ^b  

^a TARBIAT MODARES UNIVERSITY   (Iran)

^b UNIVERSITY OF TEHRAN   (Iran)

Author keywords

differential inclusion; globally asymptotically stability; neural network; nonsmooth convex optimization; steepest descent method

Indexed keywords

EID: 84881620402     PISSN: 02331934     EISSN: 10294945     Source Type: Journal    
DOI: 10.1080/02331934.2011.613993     Document Type: Article

References (20)

1. Aubin, JP and Cellina, A. 1984. Differential Inclusion: Set-valued Maps and Viability Theory, Berlin, Germany: Springer-Verlag.
2. Bazaraa, MS, Sherali, HD and Shetty, CM. 1993. Nonlinear Programming: Theory and Algorithms, 2, New York: Wiley.
3. Beliakov, G and Bagirov, A. 2006. Non-smooth optimization methods for computation of the conditional value-at-risk and portfolio optimization. Optimization, 55: 459 - 479.
4. Bian, W and Xue, X. 2009. Subgradient-based neural networks for nonsmooth optimization problems. IEEE Trans. Neural Netw., 20: 1024 - 1038.
5. Cheng, LG, Shiji, S and Cheng, WU. 2010. Generalized gradient projection neural networks for nonsmooth optimization problems. Sci. China Ser. F-Inf. Sci., 53: 990 - 1004.
6. Clarke, FH, Ledyaev, YS, Stern, RJ and Wolenski, PR. 1998. Nonsmooth Analysis and Control Theory, New York: Springer-Verlag.
7. Filippove, AF. 1988. " Differential Equations with Discontinuous Right-hand Side ". In Mathematics and its Applications (Soviet Series), Boston, MA: Kluwer.
8. Forti, M, Nistri, P and Quincampoix, M. 2004. Generalized neural network for nonsmooth non-linear programming problems. IEEE Trans. Circuits Syst. I, Reg. Papers, 51: 1741 - 1754.
9. Gerard, M, Schutter, BD and Verhaegen, M. 2009. A hybrid descent method for convex optimization. Automatica, 49: 525 - 531.
10. Hopfield, JJ and Tank, DW. 1985. Neural computation decision in optimization problems. Biol. Cybern., 52: 141 - 152.
11. Kennedy, MP and Chua, LO. 1988. Neural networks for non-linear programming. IEEE Trans. Circuits Syst. CAS-35,: 554 - 562.
12. Li, G, Song, S and Guan, X. 2006. Subgradient-based feedback neural networks for non-differentiable convex optimization problems. Sci. China Ser. F-Inf. Sci., 20: 421 - 435.
13. Li, G, Song, S, Wu, C and Du, Z. 2006. A Neural Network Model for Nonsmooth Optimization Over a Compact Convex Subset, Lecture Notes in Computer Science, Vol. 3971, 344 - 349. Berlin: Spring-Verlag.
14. Liang, X and Wang, J. 1999. A recurrent neural network for non-linear optimization with a continuously differentiable objective function and bound constraints. IEEE Trans. Neural Netw., 11: 1251 - 1262.
15. Mordukhovich, B. 2006. " Variations Analysis and Generalized Differentiation, I: Basic Theory ". In (Fundamental Principles of Mathematical Sciences), Vol. 330, Grundlehren Series, Springer, Berlin.
16. Mordukhovich, B. 2006. " Variations Analysis and Generalized Differentiation, II: Applications ". In (Fundamental Principles of Mathematical Sciences), Vol. 331, Grundlehren Series, Springer, Berlin.
17. W. Rudin, Principles of Mathematical Analysis, International Series in Pure and Applied Mathematics, McGraw-Hill Book Co., New York-Auckland-Dseldrof, 1976
18. Soleimani-damaneh, M. 2010. Nonsmooth optimization using Mordukhovich's subdifferential. SIAM J. Control Optim., 48: 3403 - 3432.
19. Xia, Y, Leung, H and Wang, J. 2002. A projection neural network and its application to constrained optimization problems. IEEE Trans. Circuits Syst. I: Fundamental Theory Appl., 49: 442 - 457.
20. Xia, Y and Wang, J. 2005. A recurrent neural network for non-linear convex programs subject to linear constraint. IEEE Trans. Neural Netw., 16: 379 - 386.