Research ArticleOpen accessIn the keywordsExtension to Sufficient Optimality Conditions in Complex ProgrammingE. A. Youness, M. E. ElbrolosyIn this study we extend the sufficient optimality conditions of complex programming problems to a large class of functions that include the two parts (real and imaginary) of the objective function. The sufficient conditions were established under generalized forms of convexity assumptions. The previous results that considered the real part only can be deduced as special cases. …Journal of Mathematics and Statistics, Vol. 1, Issue 1 · 31 Mar 2005 · 6,242 accessesView PDFCite
Research ArticleOpen accessIn the keywordsStability of Non-Neutral and Neutral Dynamic Switched Systems Subject to Internal DelaysM. De la Sen, J. L. Malaina, A. Gallego, J. C. SotoThis study deals with the quadratic stability and linear state-feedback and output-feedback stabilization of switched delayed linear dynamic systems with, in general, a finite number of non commensurate constant internal point delays. The results are obtained based on Lyapunov’s stability analysis via appropriate Krasovsky-Lyapunov’s functionals and the related stability study is performed to obtain both delay independent and delay dependent … …American Journal of Applied Sciences, Vol. 2, Issue 10 · 31 Oct 2005 · 6,720 accessesView PDFCite
Research ArticleOpen accessIn the abstractEscalating SVM-Efficiency by Sequential QP LP and Slack Variable AnalysisAmit Kumar Kundu, Rezaul Karim, Ali Ahmed AveSupport Vector Machine (SVM) is a highly attractive algorithm among many machine learning models due to its generalization power and classification performance based on sound mathematical formulation being convex that offers global minimum. However, despite being sparse, its high classification cost from kernel execution with Support Vectors (SVs) reduces the user's interest when there are hard computational constraints in the … …Journal of Computer Science, Vol. 19, Issue 10 · 6 Sep 2023 · 5,913 accessesView PDFCite
Research ArticleOpen accessIn the abstractOn Quasi E-Convex Bilevel Programming ProblemE. A. Youness, O. M.A. Al-OlaaBilevel programming problems involve two optimization problems where the data of the first one is implicity determined by the solution of the second. This study introduces the notions of E-convexity and quasi E-convexity in bilevel programming problems to generalize quasi convex bilevel programming problems. …American Journal of Applied Sciences, Vol. 2, Issue 2 · 28 Feb 2005 · 6,569 accessesView PDFCite