Variational inequality - Globe Thesis

Keyword [Variational inequality] Result: 161 - 180 \| Page: 9 of 10
161.	Two-level Defect-correction Methods For Incompressible Fluid With Nonlinear Slipboundary Conditions
162.	Some Research On The Quasi-Variational Inequality And Its Application In Traffic
163.	Stochastic Approximation Approaches To The Stochastic Variational Inequality Problem Based On Projection And Contraction Method
164.	A Class Of Separable Variational Inequalities With Linear Constraints And Application
165.	The Approximate Karush-Kuhn-Tucker Of Vector Optimization Problems
166.	Some Projection Algorithms For Studying The Split Feasibility Problem
167.	Researches On The Direct Algorithm And Application Of Some Game Theory Problems
168.	The Split Variational Inequality, Split Mixed Equilibrium Problems And Their Convergence Algorithms
169.	A Common Element Of The Set Of Solutions For Mixed Equilibrium Problem, Variational Inequality And Operator Semi-groups
170.	Meshfree Barycentric Interpolation Collocation Method And Its Applications In Variational Inequality
171.	The Element-free Galerkin Meshless Method And Its Application
172.	General Iteration Metheds For Variational Inequality Problems And Split Equality Combination Of Equilibrium Problems
173.	Merit Functions And Error Bounds For Constrained Mixed Set-valued Variational Inequalities Via Generalized F-Projection Operators In Hilbert Spaces
174.	Two Types Of Proximal Points Algorithms For Generalized Equilibrium Problem
175.	Some Kinds Of Generalized Viscosity Iterative Approximation Algorithms For Hierarchical Fixed Points In Banach Spaces
176.	Solvability Of Two Classes Of Perturbed Variational Inequalities
177.	Iterative Algorithms For Some Quasi-variational Inequalities
178.	Weak Sharpness For Set-valued Variational Inequalities And Applications To Finite Termination Of Iterative Algorithms
179.	Study On Scalarizations For Approximate Solutions For Multiobjective Optimization Problems
180.	The Projection Algorithms For The Split Feasibility Problem
<<First <Prev Next> Last>> Jump to