• Journal of the Chungcheong Mathematical Society
• /
• v.22 no.1
• /
• pp.11-16
• /
• 2009

In this paper, using the diagonally $\mathcal{C}$-concave condition, we will prove a functional inequality in a topological space, and as an application, we can obtain a new variational inequality.

• Journal of applied mathematics & informatics
• /
• v.27 no.1_2
• /
• pp.123-137
• /
• 2009

A multiobjective variational problem involving higher order derivatives is considered and Fritz-John and Karush-Kuhn-Tucker type optimality conditions for this problem are derived. As an application of Karush-Kuhn-Tucker optimality conditions, Wolfe type dual to this variational problem is constructed and various duality results are validated under generalized invexity. Some special cases are mentioned and it is also pointed out that our results can be considered as a dynamic generalization of the already existing results in nonlinear programming.

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.3
• /
• pp.475-496
• /
• 2021

The main aim is to define a new class of generalized h-variational inequality problems and its generalized h-variational inequality problems. We define the class of h-𝜂-invex set, h-𝜂-invex function and H-pseudospace. Existence of the solution of the problems are established in H-pseudospace with the help of H-KKM mapping theorem and HC_*-condition of 𝜂 associated with the function h.

• Journal of Information Processing Systems
• /
• v.13 no.2
• /
• pp.417-427
• /
• 2017

Power allocation is an important factor for cognitive radio networks to achieve higher communication capacity and faster equilibrium. This paper considers power allocation problem to each cognitive user to maximize capacity of the cognitive systems subject to the constraints on the total power of each cognitive user and the interference levels of the primary user. Since this power control problem can be formulated as a mixed-integer nonlinear programming (NP) equivalent to variational inequality (VI) problem in convex polyhedron which can be transformed into complementary problem (CP), we utilize modified projection method to solve this CP problem instead of finding NP solution and give a power control allocation algorithm with a subcarrier allocation scheme. Simulation results show that the proposed algorithm performs well and effectively reduces the system power consumption with almost maximum capacity while achieve Nash equilibrium.

• Nonlinear Functional Analysis and Applications
• /
• v.27 no.1
• /
• pp.121-140
• /
• 2022

In this paper, we study the strong convergence of new methods for solving classical variational inequalities problems involving semistrictly quasimonotone and Lipschitz-continuous operators in a real Hilbert space. Three proposed methods are based on Tseng's extragradient method and use a simple self-adaptive step size rule that is independent of the Lipschitz constant. The step size rule is built around two techniques: the monotone and the non-monotone step size rule. We establish strong convergence theorems for the proposed methods that do not require any additional projections or knowledge of an involved operator's Lipschitz constant. Finally, we present some numerical experiments that demonstrate the efficiency and advantages of the proposed methods.

• Nonlinear Functional Analysis and Applications
• /
• v.27 no.1
• /
• pp.1-22
• /
• 2022

The purpose of this research is to formulate a new proximal-type algorithm to solve the equilibrium problem in a real Hilbert space. A new algorithm is analogous to the famous two-step extragradient algorithm that was used to solve variational inequalities in the Hilbert spaces previously. The proposed iterative scheme uses a new step size rule based on local bifunction details instead of Lipschitz constants or any line search scheme. The strong convergence theorem for the proposed algorithm is well-proven by letting mild assumptions about the bifunction. Applications of these results are presented to solve the fixed point problems and the variational inequality problems. Finally, we discuss two test problems and computational performance is explicating to show the efficiency and effectiveness of the proposed algorithm.

• Nonlinear Functional Analysis and Applications
• /
• v.27 no.2
• /
• pp.381-403
• /
• 2022

The main goal of this research is to solve variational inequalities involving quasimonotone operators in infinite-dimensional real Hilbert spaces numerically. The main advantage of these iterative schemes is the ease with which step size rules can be designed based on an operator explanation rather than the Lipschitz constant or another line search method. The proposed iterative schemes use a monotone and non-monotone step size strategy based on mapping (operator) knowledge as a replacement for the Lipschitz constant or another line search method. The strong convergences have been demonstrated to correspond well to the proposed methods and to settle certain control specification conditions. Finally, we propose some numerical experiments to assess the effectiveness and influence of iterative methods.

• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.61-74
• /
• 2011

In this paper, we introduce a new iteration method based on the hybrid method in mathematical programming and the descent-like method for finding a common element of the solution set for a variational inequality and the set of common fixed points of a nonexpansive semigroup in Hilbert spaces. We obtain a strong convergence for the sequence generated by our method in Hilbert spaces. The result in this paper modifies and improves some well-known results in the literature for a more general problem.

• Journal of Korean Society of Transportation
• /
• v.20 no.3
• /
• pp.129-147
• /
• 2002

This paper presents a variational equality formulation by Providing new dynamic route choice condition for a link-based dynamic traffic assignment model. The concepts of used paths, used links, used departure times are employed to derive a new link-based dynamic route choice condition. The route choice condition is formulated as a time-dependent variational equality problem and necessity and sufficiency conditions are provided to prove equivalence of the variational equality model. A solution algorithm is proposed based on physical network approach and diagonalization technique. An asymmetric network computational study shows that ideal dynamic-user optimal route condition is satisfied when the length of each time interval is shortened. The I-394 corridor study shows that more than 93% of computational speed improved compared to conventional variational inequality approach, and furthermore as the larger network size, the more computational performance can be expected. This paper concludes that the variational equality could be a promising approach for real-time application of a dynamic traffic assignment model based on fast computational performance.

• Bulletin of the Korean Mathematical Society
• /
• v.49 no.6
• /
• pp.1131-1145
• /
• 2012

The purpose of this paper is to use an appropriate variational framework to discuss the boundary value problem with p-Laplacian type operators $$\{({\alpha}(t,x^{\Delta}(t)))^{\Delta}-a(t){\phi}_p(x^{\sigma}(t))+f({\sigma}(t),x^{\sigma}(t))=0,\;{\Delta}-a.e.\;t{\in}I\\x^{\sigma}(0)=0,\\{\beta}_1x^{\sigma}(1)+{\beta}_2x^{\Delta}({\sigma}(1))=0,$$ where ${\beta}_1$, ${\beta}_2$ > 0, $I=[0,1]^{k^2}$, ${\alpha}({\cdot},x({\cdot}))$ is an operator of $p$-Laplacian type, $\mathbb{T}$ is a time scale. Some sufficient conditions for the existence of constant-sign solutions are obtained.