\(\alpha\)-well-posedness for mixed quasi variational-like inequality problems
From MaRDI portal
Publication:554932
DOI10.1155/2011/683140zbMath1217.49014WikidataQ58654399 ScholiaQ58654399MaRDI QIDQ554932
Publication date: 22 July 2011
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2011/683140
49J40: Variational inequalities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Well-posed optimization problems
- On general minimax theorems
- Convexity and well-posed problems
- Levitin-Polyak well-posedness of variational inequality problems with functional constraints
- Levitin-Polyak well-posedness in generalized vector variational inequality problem with functional constraints
- Well-posedness of mixed variational inequalities, inclusion problems and fixed point problems
- Well-posedness for mixed quasivariational-like inequalities
- Well-posedness of generalized mixed variational inequalities, inclusion problems and fixed-point problems
- Levitin-Polyak well-posedness of generalized quasivariational inequalities with functional constraints
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- Extended well-posedness of optimization problems
- Levitin-Polyak well-posedness in generalized variational inequality problems with functional constraints
- Parametric well-posedness for variational inequalities defined by bifunctions
- Well-posedness and \(L\)-well-posedness for quasivariational inequalities
- About well-posed optimization problems for functionals in metric spaces
- Convergence of convex sets and of solutions of variational inequalities
- A characterization of tyhonov well-posedness for minimum problems, with applications to variational inequalities(∗)
- Constrained convex optimization problems-well-posedness and stability*
- Variational Analysis
- Generalized Levitin--Polyak Well-Posedness in Constrained Optimization
- On the stability of the functional optimization problem