Zobrazeno 1 - 10
of 139
pro vyhledávání: '"Ram U. Verma"'
Autor:
Ram U. Verma
Publikováno v:
Electronic Journal of Differential Equations, Vol 2011, Iss 50,, Pp 1-6 (2011)
First, general frameworks for the first-order evolution inclusions are developed based on the A-maximal relaxed monotonicity, and then using the Yosida approximation the solvability of a general class of first-order nonlinear evolution inclusions is
Externí odkaz:
https://doaj.org/article/324296e68b6d4f03b0d974aff22f671e
Autor:
Ram U. Verma
Publikováno v:
Electronic Journal of Differential Equations, Vol 2009, Iss 85,, Pp 1-16 (2009)
First a general framework for the Yosida approximation is introduced based on the relative H-maximal monotonicity model, and then it is applied to the solvability of a general class of first-order nonlinear evolution equations. The obtained results g
Externí odkaz:
https://doaj.org/article/581ea463f75e4f9186d9b91bb84091de
Autor:
Ravi P. Agarwal, Ram U. Verma
Publikováno v:
Fixed Point Theory and Applications, Vol 2009 (2009)
We glance at recent advances to the general theory of maximal (set-valued) monotone mappings and their role demonstrated to examine the convex programming and closely related field of nonlinear variational inequalities. We focus mostly on application
Externí odkaz:
https://doaj.org/article/cbc7a6d00f244e0d9cf5c473f34b38a6
Autor:
Ram U. Verma
Publikováno v:
International Journal of Mathematics and Mathematical Sciences, Vol 2009 (2009)
Based on a notion of relatively maximal (m)-relaxed monotonicity, the approximation solvability of a general class of inclusion problems is discussed, while generalizing Rockafellar's theorem (1976) on linear convergence using the proximal point algo
Externí odkaz:
https://doaj.org/article/a7c64c085f50408885e7b17808308927
Autor:
Ram U Verma
Publikováno v:
Cubo, Vol 13, Iss 3, Pp 185-196 (2011)
General framework for the generalized proximal point algorithm, based on the notion of (H,r)- monotonicity, is developed. The linear convergence analysis for the generalized proximal point algorithm to the context of solving a class of nonlinear vari
Externí odkaz:
https://doaj.org/article/779560b7b329435ca4304febd6f4fdde
Autor:
G. J. Zalmai, Ram U. Verma
Publikováno v:
OPSEARCH. 55:381-410
A class of second order parameter-free duality models are constructed for semiinfinite (with infinitely many inequality and equality constraints) discrete minmax fractional programming problems, and then using various generalized second-order ( $$\ph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bf35ac27583473443baa833f89b3a873
https://doi.org/10.1007/s12597-017-0323-8
https://doi.org/10.1007/s12597-017-0323-8
Publikováno v:
Journal of Systems Science and Complexity. 31:446-462
This paper considers a nonsmooth semi-infinite minimax fractional programming problem (SIMFP) involving locally Lipschitz invex functions. The authors establish necessary optimality conditions for SIMFP. The authors establish the relationship between
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8addbdbd54567a1351c936dc1d47bec2
https://doi.org/10.1007/s11424-017-6085-9
https://doi.org/10.1007/s11424-017-6085-9
Autor:
Ram U. Verma
This monograph is aimed at presenting “Next Generation Newton-Type Methods,” which outperform most of the iterative methods and offer great research potential for new advanced research on iterative computational methods. This monograph provides r
Autor:
Ram U. Verma
This monograph presents smooth, unified, and generalized fractional programming problems, particularly advanced duality models for discrete min-max fractional programming. In the current, interdisciplinary, computer-oriented research environment, the
Autor:
G. J. Zalmai, Ram U. Verma
Publikováno v:
Mathematical Sciences. 10:185-199
In this paper, we construct six generalized second-order parameter-free duality models, and prove several weak, strong, and strict converse duality theorems for a discrete minmax fractional programming problem using two partitioning schemes and vario
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5347a137a9500d936604bd3d71cd1224
https://doi.org/10.1007/s40096-016-0193-x
https://doi.org/10.1007/s40096-016-0193-x