Ram U. Verma

According to our database, Ram U. Verma authored at least 25 papers between 2000 and 2018.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2018

Saddle Point Criteria in Nonsmooth Semi-Infinite Minimax Fractional Programming Problems.

Shashi Kant Mishra, Yadvendra Singh, Ram U. Verma

J. Syst. Sci. Complex., 2018

2013

Weak <i>ϵ</i>-efficiency conditions for multiobjective fractional programming.

Ram U. Verma

Appl. Math. Comput., 2013

2012

General Class of Implicit Variational Inclusions and Graph Convergence on A-Maximal Relaxed Monotonicity.

Ram U. Verma

J. Optim. Theory Appl., 2012

Corrigendum to "The over-relaxed proximal point algorithm based on H-maximal monotonicity design and applications" [Comput. Math. Applications 55 (2008) 2673-2679].

Ram U. Verma

Comput. Math. Appl., 2012

Role of (ρ, η, A)-invexity to ϵ-optimality conditions for multiple objective fractional programming.

Ram U. Verma

Appl. Math. Comput., 2012

2010

New approach to the eta-proximal point algorithm and nonlinear variational inclusion problems.

Ram U. Verma

Appl. Math. Comput., 2010

2009

Generalized over-relaxed proximal algorithm based on A-maximal monotonicity framework and applications to inclusion problems.

Ram U. Verma

Math. Comput. Model., 2009

The generalized relaxed proximal point algorithm involving A-maximal-relaxed accretive mappings with applications to Banach spaces.

Ram U. Verma

Math. Comput. Model., 2009

Relatively Inexact Proximal Point Algorithm and Linear Convergence Analysis.

Ram U. Verma

Int. J. Math. Math. Sci., 2009

A new relaxed proximal point procedure and applications to nonlinear variational inclusions.

Ram U. Verma

Comput. Math. Appl., 2009

A general framework for the over-relaxed A-proximal point algorithm and applications to inclusion problems.

Ram U. Verma

Appl. Math. Lett., 2009

General implicit variational inclusion problems based on A-maximal (m)-relaxed monotonicity (AMRM) frameworks.

Ravi P. Agarwal, Ram U. Verma

Appl. Math. Comput., 2009

2008

Generalized Eckstein-Bertsekas proximal point algorithm based on A-maximal monotonicity design.

Ram U. Verma

Comput. Math. Appl., 2008

The over-relaxed proximal point algorithm based on H-maximal monotonicity design and applications.

Ram U. Verma

Comput. Math. Appl., 2008

Rockafellar's celebrated theorem based on A -maximal monotonicity design.

Ram U. Verma

Appl. Math. Lett., 2008

A hybrid proximal point algorithm based on the (A, eta)-maximal monotonicity framework.

Ram U. Verma

Appl. Math. Lett., 2008

2007

Generalized Eckstein-Bertsekas proximal point algorithm involving (H, η)-monotonicity framework.

Ram U. Verma

Math. Comput. Model., 2007

Proximal point algorithms and generalized nonlinear variational problems.

Ram U. Verma

Appl. Math. Comput., 2007

2006

General approximation solvability of a system of strongly g-r-pseudomonotonic nonlinear variational inequalities and projection methods.

Ali Hajjafar, Ram U. Verma

Math. Comput. Model., 2006

Nonlinear relaxed cocoercive variational inclusions involving (A, eta)-accretive mappings in banach spaces.

Heng-you Lan, Yeol Je Cho, Ram U. Verma

Comput. Math. Appl., 2006

Sensitivity analysis for generalized strongly monotone variational inclusions based on the (<i>A</i>, <i>eta</i>)-resolvent operator technique.

Ram U. Verma

Appl. Math. Lett., 2006

General nonlinear variational inclusion problems involving <i>A</i>-monotone mappings.

Ram U. Verma

Appl. Math. Lett., 2006

2005

General convergence analysis for two-step projection methods and applications to variational problems.

Ram U. Verma

Appl. Math. Lett., 2005

2003

Partial relaxed monotonicity and general auxiliary problem principle with applications.

Ram U. Verma

Appl. Math. Lett., 2003

2000

A class of projection-contraction methods applied to monotone variational inequalities.

Ram U. Verma

Appl. Math. Lett., 2000