Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Optim Lett

Search In Journal Title:

Abbravation: Optimization Letters

Search In Journal Abbravation:

Publisher

Springer-Verlag

Search In Publisher:

DOI

10.1002/jps.3080030125

Search In DOI:

ISSN

1862-4480

Search In ISSN:
Search In Title Of Papers:

Generalized solutions of quasi variational inequal

Authors: Baasansuren Jadamba Akhtar A Khan Miguel Sama
Publish Date: 2011/07/08
Volume: 6, Issue: 7, Pages: 1221-1231
PDF Link

Abstract

This paper deals with multivalued quasi variational inequalities with pseudomonotone and monotone maps The primary objective of this work is to show that the notion of generalized solutions can be employed to investigate multivalued pseudomonotone quasi variational inequalities It is a wellknown fact that a quasi variational inequality can conveniently be posed as a fixed point problem through the socalled variational selection For pseudomonotone maps the associated variational selection is a nonconvex map and the fixed point theorems can only be applied under restrictive assumptions on the data of quasi variational inequalities On the other hand the generalized solutions are defined by posing a minimization problem which can be solved by a variant of classical Weierstrass theorem It turns out that far less restrictive assumptions on the data are needed in this case To emphasis on the strong difference between a classical solution and a generalized solution we also give a new existence theorem for quasi variational inequalities with monotone maps The main existence result is proved under a milder coercivity condition We also relax a few other conditions from the monotone map Due to its flexibility it seems that the notion of generalized solutions can be employed to study quasi variational inequalities for other classes of maps as well


Keywords:

References


.
Search In Abstract Of Papers:
Other Papers In This Journal:

  1. An interior penalty method for a finite-dimensional linear complementarity problem in financial engineering
  2. The modified proximal point algorithm in CAT(0) spaces
  3. An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
  4. Selection of representative SNP sets for genome-wide association studies: a metaheuristic approach
  5. A semidefinite optimization approach to the Target Visitation Problem
  6. Elementary convex techniques for equilibrium, minimax and variational problems
  7. On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients
  8. Symmetric duality for second-order fractional programs
  9. A composite model in the context of a production-inventory system
  10. Preserving maximal monotonicity with applications in sum and composition rules
  11. Single machine serial-batching scheduling with independent setup time and deteriorating job processing times
  12. Strong convergence of Mann’s type iteration method for an infinite family of generalized asymptotically nonexpansive nonself mappings in Hilbert spaces
  13. Stochastic subgradient descent method for large-scale robust chance-constrained support vector machines
  14. Polynomial-time identification of robust network flows under uncertain arc failures
  15. A multi-space sampling heuristic for the vehicle routing problem with stochastic demands
  16. Maximizing strike aircraft planning efficiency for a given class of ground targets
  17. Dynamic lot-sizing problem with demand time windows and container-based transportation cost
  18. Sufficient conditions for protection routing in IP networks
  19. A note on diameters of point sets
  20. Capacity optimization through sensing threshold adaptation for cognitive radio networks
  21. Convexifying the set of matrices of bounded rank: applications to the quasiconvexification and convexification of the rank function
  22. The perspective of a bank in granting credits: an optimization model
  23. k -Sum decomposition of strongly unimodular matrices
  24. Solving the weighted MAX-SAT problem using the dynamic convexized method
  25. Locating facilities in a competitive environment
  26. A comparison of several nearest neighbor classifier metrics using Tabu Search algorithm for the feature selection problem
  27. Global optimal approximate solutions

Search Result: