Coercivity properties and well-posedness in vector optimization
From MaRDI portal
Publication:4467897
DOI10.1051/ro:2003021zbMath1070.90095OpenAlexW2017799496MaRDI QIDQ4467897
Publication date: 10 June 2004
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=RO_2003__37_3_195_0
vector optimizationwell-posednesserror boundsweakly efficient solutionrelative interiorlevel-coercivity
Related Items (max. 100)
Levitin-Polyak well-posedness of variational inequality problems with functional constraints ⋮ First- and second-order asymptotic analysis with applications in quasiconvex optimization ⋮ Unnamed Item ⋮ Boundedness and nonemptiness of the efficient solution sets in multiobjective optimization ⋮ The generalized Tykhonov well-posedness for system of vector quasi-equilibrium problems ⋮ Primal or dual strong-duality in nonconvex optimization and a class of quasiconvex problems having zero duality gap ⋮ On well-posedness and Hausdorff convergence of solution sets of vector optimization problems ⋮ Levitin-Polyak well-posedness in vector quasivariational inequality problems with functional constraints ⋮ Further study on the Levitin-Polyak well-posedness of constrained convex vector optimization problems ⋮ A quasiconvex asymptotic function with applications in optimization ⋮ Optimality conditions for vector equilibrium problems with applications ⋮ Existence of efficient and properly efficient solutions to problems of constrained vector optimization ⋮ Levitin-Polyak well-posedness for constrained quasiconvex vector optimization problems ⋮ Levitin–Polyak Well-Posedness of Vector Variational Inequality Problems with Functional Constraints ⋮ An optimal alternative theorem and applications to mathematical programming ⋮ Levitin-Polyak well-posedness of constrained vector optimization problems ⋮ Levitin-Polyak well-posedness of a system of generalized vector variational inequality problems ⋮ Levitin-Polyak well-posedness of generalized quasivariational inequalities with functional constraints ⋮ Weak efficiency in multiobjective quasiconvex optimization on the real-line without derivatives
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Well-posed optimization problems
- Theory of multiobjective optimization
- Partially finite convex programming. I: Quasi relative interiors and duality theory
- On extensions of the Frank-Wolfe theorems
- How to deal with the unbounded in optimization: Theory and algorithms
- Characterizations of the nonemptiness and compactness of solution sets in convex vector optimization
- Existence of optimal solutions and duality results under weak conditions
- On variational principles, level sets, well-posedness, and \(\epsilon\)-solutions in vector optimization
- A Variational Principle for Problems with Functional Constraints
- An Existence Theorem in Vector Optimization
- Convex Functions with Unbounded Level Sets and Applications to Duality Theory
- Variational Analysis
- On Approximate Solutions in Convex Vector Optimization
- Convex Analysis
- Pointwise well-posedness of perturbed vector optimization problems in a vector-valued variational principle
- Well-posedness and optimization under perturbations
- Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications
This page was built for publication: Coercivity properties and well-posedness in vector optimization