نتایج جستجو برای: convex programming

تعداد نتایج: 377543  

Journal: :Oper. Res. Lett. 2012
Vaithilingam Jeyakumar Guoyin Li

An exact semidefinite linear programming (SDP) relaxation of a nonlinear semidefinite programming problem is a highly desirable feature because a semidefinite linear programming problem can efficiently be solved. This paper addresses the basic issue of which nonlinear semidefinite programming problems possess exact SDP relaxations under a constraint qualification. We do this by establishing exa...

This paper presents ‎‎the optimization techniques for solving‎‎ convex programming problems with hybrid constraints‎.‎ According to the saddle point theorem‎, ‎optimization theory‎, ‎convex analysis theory‎, ‎Lyapunov stability theory and LaSalle‎‎invariance principle‎,‎ a neural network model is constructed‎.‎ The equilibrium point of the proposed model is proved to be equivalent to the optima...

Journal: :Journal of Optimization Theory and Applications 1983

Journal: :IEEE Transactions on Automatic Control 2002

Journal: :Journal of Mathematical Analysis and Applications 1996

Journal: :Linear Algebra and its Applications 1990

Journal: :Journal of Mathematical Analysis and Applications 1980

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید