Options
V Vetrivel
Loading...
Preferred name
V Vetrivel
Official Name
V Vetrivel
Alternative Name
Vetrivel, Vellaichamy
Vetrivel, V.
Main Affiliation
Email
ORCID
Scopus Author ID
Google Scholar ID
27 results
Now showing 1 - 10 of 27
- PublicationOn the Lipschitz continuity of the solution map in semidefinite linear complementarity problems(01-05-2005)
; ;Parthasarathy, T. ;Raman, D. SampangiIn this paper, we investigate the Lipschitz continuity of the solution map in semidefinite linear complementarity problems. For a monotone linear transformation defined on the space of real symmetric n × n matrices, we show that the Lipschitz continuity of the solution map implies the globally uniquely solvable (GUS)-property. For Lyapunov transformations with the Q-property, we prove that the Lipschitz continuity of the solution map is equivalent to the strong monotonicity property. For the double-sided multiplicative transformations, we show that the Lipschitz continuity of the solution map implies the GUS-propeity. © 2005 INFORMS. - PublicationJordan quadratic SSM-property and its relation to copositive linear transformations on Euclidean Jordan algebras(01-08-2010)
;Jeyaraman, I.In this paper, we introduce Jordan quadratic SSM-property and study its relation to copositive linear transformations on Euclidean Jordan algebras. In particular, we study this relationship for normal Z-transformations, Lyapunov-like transformations and cone invariant transformations. © 2010 Elsevier Inc. All rights reserved. - PublicationOn non-existence of bent–negabent rotation symmetric Boolean functions(19-02-2018)
;Mandal, Bimal ;Singh, Bhupendra ;Gangopadhyay, Sugata ;Maitra, SubhamoyIn this communication, we present a characterization of bent–negabent functions, which is related to the autocorrelation spectra. A special case of this characterization is then exploited to prove that there is no rotation symmetric Boolean function in n=2pk variables which is bent–negabent when p is an odd prime and k is any positive integer. - PublicationOn the existence of best proximity points for generalized contractions(01-01-2014)
;Sultana, AsrifaIn this article we establish the existence of a unique best proximity point for some generalized non-self contractions on a metric space in a simpler way using a geometric result. Our results generalize some recent best proximity point theorems and several fixed point theorems proved by various authors. © AGT, UPV, 2014. - PublicationInvestigations on cubic rotation symmetric bent functions(01-12-2016)
;Gangopadhyay, Sugata ;Singh, BhupendraWe identify an infinite class of cubic rotation symmetric bent functions and prove that these functions do not have affine derivatives. Some experimental results concerning rotation symmetric bent functions in 6, 8, 10 and 12 variables are also included. - PublicationA neural network method for monotone variational inclusions(01-01-2019)
;Dey, Soumitra; Xu, Hong KunWe present a neural network method for monotone variational inclusions. The proposed neural network possesses a simple double-layer structure and is suitable for parallel implementation. It is shown that the proposed neural network is globally convergent to the optimal solution of the variational inclusion and is globally asymptotically and exponentially stable at the equilibrium point in the case where f is Lipschitz and strongly monotone. The stability at an equilibrium point in the Lyapunov's sense is also proved in the case where f is inverse strongly monotone. - PublicationSolving strongly monotone linear complementarity problems(01-12-2013)
;Chandrashekaran, A. ;Parthasarathy, T.Given a linear transformation L on a finite dimensional real inner product space V to itself and an element q V we consider the general linear complementarity problem LCP(L, K, q) on a proper cone K E; V. We observe that the iterates generated by any closed algorithmic map will converge to a solution for LCP(L, K, q), whenever L is strongly monotone. Lipschitz constants of L is vital in establishing the above said convergence. Hence we compute the Lipschitz constants for certain classes of Lyapunov, Stein and double-sided multiplicative transformations in the setting of semidefinite linear complementarity problems. We give a numerical illustration of a closed algorithmic map in the setting of a standard linear complementarity problem. On account of the difficulties in numerically implementing such algorithms for general linear complementarity problems, we give an alternative algorithm for computing the solution for a special class of strongly monotone semidefinite linear complementarity problems along with a numerical example. © 2013 World Scientific Publishing Company. - PublicationStein linear programs over symmetric cones(01-12-2013)
;Jeyaraman, I.; In this paper, using Moore-Penrose inverse, we characterize the feasibility of primal and dual Stein linear programs over symmetric cones in a Euclidean Jordan algebra V. We give sufficient conditions for the solvability of the Stein linear programming problem. Further, we give a characterization of the globally uniquely solvable property for the Stein transformation in terms of a least element of a set in V in the context of the linear complementarity problem. © 2013 World Scientific Publishing Company. - PublicationPARAMETERIZED DOUGLAS-RACHFORD DYNAMICAL SYSTEM FOR MONOTONE INCLUSION PROBLEMS(01-04-2023)
;Gautam, Pankaj ;Som, KuntalDouglas-Rachford splitting method with resolvent operator is a renowned algorithm to solve monotone inclusion problem involving sum of two monotone operators. In this paper, we investigate a Douglas-Rachford-based dynamical systems designed to approach the solution sets of inclusion problems involving the sum of two maximally monotone operators. Our main aim is to use parametrized resolvent instead of classical resolvent as the Douglas-Rachford operator in the framework of preconditioning. The convergence of the orbit is demonstrated. We also add a Tikhonov regularized term (both inner and outer regularization) to obtain strong convergence of the induced orbit. - PublicationA Note on Pointwise Well-Posedness of Set-Valued Optimization Problems(01-02-2022)
;Som, KuntalWell-posedness for optimization problems is a well-known notion and has been studied extensively for scalar, vector, and set-valued optimization problems. For the set-valued case, there are many subdivisions: firstly in terms of pointwise notion and global notion and secondly in terms of the solution concepts, like the vector approach, the set-relation approach, etc. Various definitions of pointwise well-posedness for a set-valued optimization problem in the set-relation approach have been proposed in the literature. Here we do a comparative study and suggest modifications in some existing results. We also introduce a new pointwise well-posedness and discuss its properties and connection with others.
- «
- 1 (current)
- 2
- 3
- »