Further study on the Levitin-Polyak well-posedness of constrained convex vector optimization problems
From MaRDI portal
Publication:654073
DOI10.1016/j.na.2011.01.012zbMath1254.90208OpenAlexW1998900943MaRDI QIDQ654073
Publication date: 21 December 2011
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.na.2011.01.012
well-posednessEkeland's variational principleconvex vector optimizationcone-constrained optimizationweakly efficient solution set
Related Items (6)
Levitin–Polyak Well-Posedness of Strong Parametric Vector Quasi-equilibrium Problems ⋮ Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems ⋮ Scalarization of Levitin–Polyak well-posed set optimization problems ⋮ Levitin-Polyak well-posedness for constrained quasiconvex vector 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Well-posed optimization problems
- Calmness and exact penalization in vector optimization with cone constraints
- Levitin-Polyak well-posedness of constrained vector optimization problems
- Extended well-posedness of optimization problems
- Characterizations of the nonemptiness and compactness of solution sets in convex vector optimization
- Extended well-posedness properties of vector optimization problems
- Well-posedness and convexity in vector optimization
- Constrained convex optimization problems-well-posedness and stability*
- A generalization of ekellandz’s variational principle
- Coercivity properties and well-posedness in vector optimization
- Generalized Levitin--Polyak Well-Posedness in Constrained Optimization
- On the stability of the functional optimization problem
- Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications
This page was built for publication: Further study on the Levitin-Polyak well-posedness of constrained convex vector optimization problems
