An Explicit Exchange Algorithm For Linear Semi-Infinite Programming Problems With Second-Order Cone Constraints

اسناد مشابه

• An Explicit Exchange Algorithm For Linear Semi-Infinite Programming Problems With Second-Order Cone Constraints

  سند علمی۲۰۰۹SIAM Journal on OptimizationShunsuke Hayashi, Soon-Yi Wu

  In this paper, we propose an explicit exchange algorithm for solving semiinfinite programming problem (SIP) with second-order cone (SOC) constraints. We prove, by using the slackness complementarity conditions, that the algorithm terminates in a finite number of iterations and th

• Solving A Fractional Program with Second Order Cone Constraint

  مقاله۲۰۱۹Iranian Journal of Mathematical Sciences and InformaticsA. Sadeghi, M. Saraj, N. Mahdavi Amiri

  We consider a fractional program with both linear and quadratic equation in numerator and denominator having second order cone (SOC) constraints. With a suitable change of variable, we transform the problem into a second order cone programming (SOCP) problem. For the quadratic fr

• Relaxed Cutting Plane Method for Solving Linear Semi-Infinite Programming Problems

  سند علمی۲۰۰۲S. Y. Wu, S. C. FANG, C. J. LIN

  One of the major computational tasks of using the traditional cutting plane approach to solve linear semi-infinite programming problems lies in finding a global optimizer of a nonlinear and nonconvex program. This paper generalizes the Gustafson and Kortanek scheme to relax this

• A neural network based on the generalized FB function for nonlinear convex programs with second-order cone constraints

  سند علمی۲۰۱۶NeurocomputingXinhe Miao, Jein-Shan Chen, Chun-Hsu Ko

  This paper proposes a neural network approach to efficiently solve nonlinear convex programs with the second-order cone constraints. The neural network model is designed by the generalized Fischer–Burmeister function associated with second-order cone. We study the existence and c

• A Regularized Explicit Exchange Method for Semi-Infinite Programs with an Infinite Number of Conic Constraints

  مقاله‌ی دسترسی آزاد۲۰۱۲SIAM Journal on OptimizationTakayukiOkuno, ShunsukeHayashi, MasaoFukushima

• A smoothed NR neural network for solving nonlinear convex programs with second-order cone constraints

  سند علمی۲۰۱۴Inf. Sci.Xinhe Miao, Jein-Shan Chen, Chun-Hsu Ko

  Abstract. This paper proposes a neural network approach for efficiently solving general nonlinear convex programs with second-order cone constraints. The proposed neural network model was developed based on a smoothed natural residual merit function involving an unconstrained min