http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
REFINEMENTS OF HERMITE-HADAMARD TYPE INEQUALITIES FOR CONVEX FUNCTIONS VIA FRACTIONAL INTEGRALS
Xiang, Ruiyin The Korean Society for Computational and Applied M 2015 Journal of applied mathematics & informatics Vol.33 No.1
In this note, two new mappings associated with convexity are propoesd, by which we obtain some new Hermite-Hadamard type inequalities for convex functions via Riemann-Liouville fractional integrals. We conclude that the results obtained in this work are the refinements of the earlier results.
Refinements of Hermite-Hadamard type inequalities for convex functions via fractional integrals
Ruiyin Xiang 한국전산응용수학회 2015 Journal of applied mathematics & informatics Vol.33 No.1
In this note, two new mappings associated with convexity arepropoesd, by which we obtain some new Hermite-Hadamard typeinequalities for convex functions via Riemann-Liouville fractionalintegrals. We conclude that the results obtained in this work arethe refinements of the earlier results.
Feixiang Chen,Ruiyin Xiang 한국전산응용수학회 2011 Journal of applied mathematics & informatics Vol.29 No.5
We establishes the polynomial convergence of a new class of path-following methods for semidefinite linear complementarity problems (SDLCP) whose search directions belong to the class of directions introduced by Monteiro [9]. Namely, we show that the polynomial iteration-complexity bound of the well known algorithms for linear programming,namely the predictor-corrector algorithm of Mizuno and Ye, carry over to the context of SDLCP.
Chen, Feixiang,Xiang, Ruiyin The Korean Society for Computational and Applied M 2011 Journal of applied mathematics & informatics Vol.29 No.5
We establishes the polynomial convergence of a new class of path-following methods for semidefinite linear complementarity problems (SDLCP) whose search directions belong to the class of directions introduced by Monteiro [9]. Namely, we show that the polynomial iteration-complexity bound of the well known algorithms for linear programming, namely the predictor-corrector algorithm of Mizuno and Ye, carry over to the context of SDLCP.