Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (3)
  • Open Access

    ARTICLE

    Saddle Point Optimality Criteria of Interval Valued Non-Linear Programming Problem

    Md Sadikur Rahman1, Emad E. Mahmoud2, Ali Akbar Shaikh1,*, Abdel-Haleem Abdel-Aty3,4, Asoke Kumar Bhunia1

    Computer Systems Science and Engineering, Vol.38, No.3, pp. 351-364, 2021, DOI:10.32604/csse.2021.015451 - 19 May 2021

    Abstract The present paper aims to develop the Kuhn-Tucker and Fritz John criteria for saddle point optimality of interval-valued nonlinear programming problem. To achieve the study objective, we have proposed the definition of minimizer and maximizer of an interval-valued non-linear programming problem. Also, we have introduced the interval-valued Fritz-John and Kuhn Tucker saddle point problems. After that, we have established both the necessary and sufficient optimality conditions of an interval-valued non-linear minimization problem. Next, we have shown that both the saddle point conditions (Fritz-John and Kuhn-Tucker) are sufficient without any convexity requirements. Then with the convexity More >

  • Open Access

    ARTICLE

    Non-Linear Localization Algorithm Based on Newton Iterations

    Jianfeng Lu*, Guirong Fei

    Journal on Internet of Things, Vol.2, No.4, pp. 129-134, 2020, DOI:10.32604/jiot.2020.07196 - 22 September 2020

    Abstract In order to improve the performance of time difference of arrival (TDOA) localization, a nonlinear least squares algorithm is proposed in this paper. Firstly, based on the criterion of the minimized sum of square error of time difference of arrival, the location estimation is expressed as an optimal problem of a non-linear programming. Then, an initial point is obtained using the semi-definite programming. And finally, the location is extracted from the local optimal solution acquired by Newton iterations. Simulation results show that when the number of anchor nodes is large, the performance of the proposed More >

  • Open Access

    ARTICLE

    A Combined Approach of the MLPG Method and Nonlinear Programming for Lower-Bound Limit Analysis

    S. S. Chen1, Y. H. Liu1,2, Z. Z. Cen1

    CMES-Computer Modeling in Engineering & Sciences, Vol.28, No.1, pp. 39-56, 2008, DOI:10.3970/cmes.2008.028.039

    Abstract In most engineering applications, solutions derived from the lower-bound theorem of plastic limit analysis are particularly valuable because they provide a safe estimate of the load that will cause plastic collapse. A solution procedure based on the meshless local Petrov-Galerkin (MLPG) method is proposed for lower-bound limit analysis. This is the first work for lower-bound limit analysis by this meshless local weak form method. In the construction of trial functions, the natural neighbour interpolation (NNI) is employed to simplify the treatment of the essential boundary conditions. The discretized limit analysis problem is solved numerically with More >

Displaying 1-10 on page 1 of 3. Per Page