εVariational inequalities for vector approximation problems
From MaRDI portal
Publication:2785385
DOI10.1080/02331939608844233zbMath0870.49007OpenAlexW1979245285MaRDI QIDQ2785385
E.-Ch. Henkel, Christiane Tammer
Publication date: 24 August 1997
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939608844233
Ekeland-type variational principle\(\varepsilon\)-variational inequalitiesvectorial approximation problems
Multi-objective and goal programming (90C29) Numerical optimization and variational techniques (65K10) Variational inequalities (49J40) Nonsmooth analysis (49J52)
Related Items (3)
Nash equilibrium and saddle points for multifunctions ⋮ Linear variational principle for convex vector maximization ⋮ A vector problem of optimal control in a Hilbert space
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonconvex separation theorems and some applications in vector optimization
- On Pareto optima, the Fermat-Weber problem, and polyhedral gauges
- \(\epsilon\)-solutions in vector minimization problems
- Geometrical properties of the Fermat-Weber problem
- On two generalizations of Pareto minimality
- Kolmogorov-conditions for vectorial approximation problems
- Approximation of solutions for location problems
- On the variational principle
- Kolmogorov conditions for vectorial optimization problems
- Duality in vectorial control approximation problems with inequality restrictions
- Dualität und algorithmische anwendung beim vektoriellen standortproblem
- Continuity and Differentiability Properties of Convex Operators
- Duality for Multiple Objective Convex Programs
- Directionally Lipschitzian Functions and Subdifferential Calculus
- A generalization of ekellandz’s variational principle
- A nonconvex vector minimization problem
- ∊-Variational inequalities in partially ordered spaces
- A note on Fermat's problem
This page was built for publication: εVariational inequalities for vector approximation problems
