Levitin-Polyak well-posedness for constrained quasiconvex vector optimization problems
From MaRDI portal
Publication:2249822
DOI10.1007/s10898-013-0103-9zbMath1298.49041OpenAlexW2041712909MaRDI QIDQ2249822
C. S. Lalitha, Prashanto Chatterjee
Publication date: 3 July 2014
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-013-0103-9
Related Items
Levitin–Polyak Well-Posedness of Strong Parametric Vector Quasi-equilibrium Problems ⋮ Well-posedness and scalarization in set optimization involving ordering cones with possibly empty interior ⋮ Existence and well-posedness for excess demand equilibrium problems ⋮ Scalarization of Levitin–Polyak well-posed set optimization problems ⋮ Characterizations of generalized Levitin-Polyak well-posed set optimization problems ⋮ Scalarization of Levitin-Polyak well-posedness in vector optimization using weak efficiency ⋮ Levitin-Polyak well-posedness for generalized semi-infinite multiobjective programming problems ⋮ Levitin-Polyak well-posedness for equilibrium problems with the lexicographic order ⋮ Levitin-Polyak well-posedness for set optimization problems involving set order relations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On well-posedness and Hausdorff convergence of solution sets of vector optimization problems
- Further study on the Levitin-Polyak well-posedness of constrained convex vector optimization problems
- Well-posed optimization problems
- Convexity and well-posed problems
- Well-posedness and scalarization in vector optimization
- Levitin-Polyak well-posedness of constrained vector optimization problems
- Well posedness in vector optimization problems and vector variational inequalities
- Kuratowksi convergence of the efficient sets in the parametric linear vector semi-infinite optimization
- Generalized semicontinuity and existence theorems for cone saddle points
- Well-posedness and convexity in vector optimization
- On variational principles, level sets, well-posedness, and \(\epsilon\)-solutions in vector optimization
- Constrained convex optimization problems-well-posedness and stability*
- Coercivity properties and well-posedness in vector optimization
- Well-posedness criteria in optimization with application to the calculus of variations
- Well-posedness and stability in vector optimization problems using Henig proper efficiency
- Generalized Levitin--Polyak Well-Posedness in Constrained Optimization
- On the stability of the functional optimization problem
- Almost Every Convex or Quadratic Programming Problem Is Well Posed
- Well-posedness and optimization under perturbations
This page was built for publication: Levitin-Polyak well-posedness for constrained quasiconvex vector optimization problems
