Levitin–Polyak Well-Posedness of Vector Variational Inequality Problems with Functional Constraints
DOI10.1080/01630563.2010.485296zbMath1196.49021OpenAlexW2167172612MaRDI QIDQ3590026
Publication date: 17 September 2010
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2010.485296
approximating solution sequencegeneralized Levitin-Polyak well-posednesscone-coercivitycone-monotonicityvector variational inequality with functional constraints
Sensitivity, stability, well-posedness (49K40) Nonlinear programming (90C30) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Variational inequalities (49J40) Sensitivity, stability, parametric optimization (90C31)
Related Items (7)
Cites Work
- Unnamed Item
- Unnamed Item
- Well-posed optimization problems
- Approximations and well-posedness in multicriteria games
- Levitin-Polyak well-posedness of variational inequality problems with functional constraints
- Levitin-Polyak well-posedness of constrained vector optimization problems
- Metrically well-set minimization problems
- Extended well-posedness of optimization problems
- Extended and strongly extended well-posedness of set-valued optimization problems
- Extended well-posedness properties of vector optimization problems
- \(\alpha\)-well-posedness for Nash equilibria and for optimization problems with Nash equilibrium constraints
- Vector optimization. Set-valued and variational analysis.
- Well-posedness and \(L\)-well-posedness for quasivariational inequalities
- About well-posed optimization problems for functionals in metric spaces
- Well-posed vector optimization problems and vector variational inequalities
- The EPI-Distance Topology: Continuity and Stability Results with Applications to Convex Optimization Problems
- Vector variational inequality and its duality
- Constrained convex optimization problems-well-posedness and stability*
- Hadamard and Strong Well-Posedness for Convex Programs
- Coercivity properties and well-posedness in vector optimization
- Well-posedness criteria in optimization with application to the calculus of variations
- Generalized Levitin--Polyak Well-Posedness in Constrained Optimization
- On the stability of the functional optimization problem
- Well-posedness and optimization under perturbations
This page was built for publication: Levitin–Polyak Well-Posedness of Vector Variational Inequality Problems with Functional Constraints