default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRam U. Verma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j25]Shashi Kant Mishra
, Yadvendra Singh, Ram U. Verma:
Saddle Point Criteria in Nonsmooth Semi-Infinite Minimax Fractional Programming Problems. J. Syst. Sci. Complex. 31(2): 446-462 (2018)- 2013
- [j24]Ram U. Verma:
Weak ϵ-efficiency conditions for multiobjective fractional programming. Appl. Math. Comput. 219(12): 6819-6827 (2013) - 2012
- [j23]Ram U. Verma:
Role of (ρ, η, A)-invexity to ϵ-optimality conditions for multiple objective fractional programming. Appl. Math. Comput. 218(17): 8444-8452 (2012) - [j22]Ram U. Verma:
Corrigendum to "The over-relaxed proximal point algorithm based on H-maximal monotonicity design and applications" [Comput. Math. Applications 55 (2008) 2673-2679]. Comput. Math. Appl. 64(9): 2961-2963 (2012) - [j21]Ram U. Verma:
General Class of Implicit Variational Inclusions and Graph Convergence on A-Maximal Relaxed Monotonicity. J. Optim. Theory Appl. 155(1): 196-214 (2012) - 2010
- [j20]Ram U. Verma:
New approach to the eta-proximal point algorithm and nonlinear variational inclusion problems. Appl. Math. Comput. 217(7): 3155-3165 (2010)
2000 – 2009
- 2009
- [j19]Ravi P. Agarwal, Ram U. Verma:
General implicit variational inclusion problems based on A-maximal (m)-relaxed monotonicity (AMRM) frameworks. Appl. Math. Comput. 215(1): 367-379 (2009) - [j18]Ram U. Verma:
A general framework for the over-relaxed A-proximal point algorithm and applications to inclusion problems. Appl. Math. Lett. 22(5): 698-703 (2009) - [j17]Ram U. Verma:
A new relaxed proximal point procedure and applications to nonlinear variational inclusions. Comput. Math. Appl. 58(8): 1631-1635 (2009) - [j16]Ram U. Verma:
Relatively Inexact Proximal Point Algorithm and Linear Convergence Analysis. Int. J. Math. Math. Sci. 2009: 691952:1-691952:11 (2009) - [j15]Ram U. Verma:
Generalized over-relaxed proximal algorithm based on A-maximal monotonicity framework and applications to inclusion problems. Math. Comput. Model. 49(7-8): 1587-1594 (2009) - [j14]Ram U. Verma:
The generalized relaxed proximal point algorithm involving A-maximal-relaxed accretive mappings with applications to Banach spaces. Math. Comput. Model. 50(7-8): 1026-1032 (2009) - 2008
- [j13]Ram U. Verma:
A hybrid proximal point algorithm based on the (A, eta)-maximal monotonicity framework. Appl. Math. Lett. 21(2): 142-147 (2008) - [j12]Ram U. Verma:
Rockafellar's celebrated theorem based on A -maximal monotonicity design. Appl. Math. Lett. 21(4): 355-360 (2008) - [j11]Ram U. Verma:
The over-relaxed proximal point algorithm based on H-maximal monotonicity design and applications. Comput. Math. Appl. 55(11): 2673-2679 (2008) - [j10]Ram U. Verma:
Generalized Eckstein-Bertsekas proximal point algorithm based on A-maximal monotonicity design. Comput. Math. Appl. 56(7): 1861-1875 (2008) - 2007
- [j9]Ram U. Verma:
Proximal point algorithms and generalized nonlinear variational problems. Appl. Math. Comput. 187(1): 535-543 (2007) - [j8]Ram U. Verma:
Generalized Eckstein-Bertsekas proximal point algorithm involving (H, η)-monotonicity framework. Math. Comput. Model. 45(9-10): 1214-1230 (2007) - 2006
- [j7]Ram U. Verma:
General nonlinear variational inclusion problems involving A-monotone mappings. Appl. Math. Lett. 19(9): 960-963 (2006) - [j6]Ram U. Verma:
Sensitivity analysis for generalized strongly monotone variational inclusions based on the (A, eta)-resolvent operator technique. Appl. Math. Lett. 19(12): 1409-1413 (2006) - [j5]Heng-you Lan, Yeol Je Cho, Ram U. Verma:
Nonlinear relaxed cocoercive variational inclusions involving (A, eta)-accretive mappings in banach spaces. Comput. Math. Appl. 51(9-10): 1529-1538 (2006) - [j4]Ali Hajjafar, Ram U. Verma:
General approximation solvability of a system of strongly g-r-pseudomonotonic nonlinear variational inequalities and projection methods. Math. Comput. Model. 43(1-2): 150-157 (2006) - 2005
- [j3]Ram U. Verma:
General convergence analysis for two-step projection methods and applications to variational problems. Appl. Math. Lett. 18(11): 1286-1292 (2005) - 2003
- [j2]Ram U. Verma:
Partial relaxed monotonicity and general auxiliary problem principle with applications. Appl. Math. Lett. 16(5): 791-796 (2003) - 2000
- [j1]Ram U. Verma:
A class of projection-contraction methods applied to monotone variational inequalities. Appl. Math. Lett. 13(8): 55-62 (2000)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
