---
title: Gerstewitz Vectorization in Optimization
url: https://www.emergentmind.com/topics/gerstewitz-vectorization
type: topic
---

# Gerstewitz Vectorization in Optimization

Gerstewitz vectorization refers to a suite of techniques in vector and set-valued optimization that enable scalarization or reduction of complex multiobjective and set-valued problems to tractable scalar or finite-dimensional vector optimization problems. The approach builds on Gerstewitz functionals, which provide a parametric way to represent efficient points, generalized orderings, and Pareto frontiers in ordered topological vector spaces. Two principal streams are established: the scalar Gerstewitz functional method in vector optimization, and the Gerstewitz vectorizing function for set-valued optimization, including nonconvex cases. The framework unifies and extends classical scalarization approaches, notably encompassing Pascoletti–Serafini scalarization as a special parameter choice.

## 1. Gerstewitz Functional: Definition and Properties

Let \( Y \) be a real topological vector space. Given a closed reference set \( A \subset Y \) and a nonzero direction \( k \in -0^+A \) (where \( 0^+A := \{u\in Y\mid A+\mathbb{R}_+u\subset A\} \) is the recession cone), the Gerstewitz functional is defined by
\[
\varphi_{A,k}(y) := \inf\{t \in \mathbb{R} \mid y \in A + t k\}, \qquad y \in Y.
\]
Key properties include:
- Lower semicontinuity on \( \operatorname{Dom}\varphi_{A,k} = A + \mathbb{R}k \).
- Sublevel sets: For any \( t \in \mathbb{R} \), the set \( \{y \mid \varphi_{A,k}(y) \le t\} = A + t k \).
- Properness and finiteness on the effective domain if \( A \) is convex and \( k \in -\mathrm{core}\,0^+A \), and finiteness everywhere if \( k \in -\mathrm{core}\,0^+A \) [1704.08632].

The geometric interpretation is that, for fixed \( k \), \( A \) is shifted along the line \( \{a + tk \mid t\in\mathbb{R}\} \) until it first “covers” \( y \).

## 2. Scalarization in Vector and Set-Valued Optimization

In multicriteria optimization, the identification of efficient solutions (minima with respect to a cone \( D \subset Y \)) is achieved by minimizing the Gerstewitz functional over the feasible image set:
\[
\min_{y \in F} \varphi_{a-H,k}(y),
\]
where \( F \subset Y \), \( a \) is a reference point, and \( H \) is a closed domination set (typically a cone). This scalarization is equivalent to the classical Pascoletti–Serafini scalar problem when \( H=D \) and \( a \) corresponds to the reference point [1704.08632]. All (weakly) efficient solutions of the original vector problem can be recovered via suitable parameterization.

For set-valued optimization (where the objective is a set-valued map \( F:X \rightarrow \mathcal{P}(Y) \)), the Gerstewitz vectorizing function enables reduction to a vector optimization problem in \( \mathbb{R}^2 \). Given two sets \( A, B \subset Y \) and a direction \( e \in -\operatorname{int} C \) for a closed convex pointed cone \( C \),
\[
w_e(A,B) := \left(-G_e(A,B),\, G_u(B,A)\right) \in \mathbb{R}^2,
\]
where
\[
G_e(A,B) = \sup_{b \in B} D_{e,A}(b),\qquad D_{e,A}(y) = \inf\{t \in \mathbb{R} \mid y \in t e + A + C\},
\]
and \( G_u(B,A) := -G_e(-B,-A) \) [1706.02579].

## 3. Existence, Compactness, and Stability of Minimizers

The nonemptiness and compactness of the set of minimizers \( M_{F,a,H,k} := \operatorname{argmin}_{y \in F} \varphi_{a-H,k}(y) \) depend on the interplay of the feasible set \( F \), the reference and ordering sets, and the direction:
- Necessity: \( F \cap (a-H+\mathbb{R}k) \neq \emptyset \) and \( \exists t \) with \( F \cap (a-H+tk) = \emptyset \).
- Sufficiency: If \( \exists t_1 \) such that \( B := F \cap (a-H+t_1k) \) is nonempty and compact, then boundedness below of \( \varphi \) on \( F \) is equivalent to finiteness on \( F \cap \operatorname{Dom}\varphi \); in this case, the minimizer set is nonempty and compact [1704.08632].
- Compactness persists under various geometric conditions on \( F \) and \( H \). If \( F \) is compact and \( k \in \mathrm{core}\, 0^+H \), compactness is guaranteed.

Parameter sensitivity:
- Scaling invariance: Replacing \( k \) by a positive multiple or shifting \( a \) along \( k \) leaves the minimizer set unchanged.
- Feasibility region convexity: If \( H \) is convex with non-trivial recession cone and \( F + 0^+H \) is convex, the feasible parameters \( (a,k) \) form a convex set [1704.08632].

Stability:
- If \( M \) is compact for one parameter pair \( (a,k) \), compactness persists under perturbations \( k' \in \operatorname{int} 0^+H \).
- If minimizers are empty or unbounded for some \( (a,k) \), this persists for all nearby \( (b,k') \) outside \( -0^+H \).

## 4. Gerstewitz Vectorization for Nonconvex Set-Valued Problems

The Gerstewitz vectorizing function serves as a robust reduction for set-valued optimization, mapping a set-valued minimization problem to a two-dimensional vector optimization:
\[
\min_s F(x) \iff \max_{\mathbb{R}^2} w_e(F(x_0),F(x)),\quad x\in X,
\]
where minimization is with respect to the set-less order
\[
A \preceq_s B \iff B \subset A+C,~A \subset B-C,
\]
for a closed convex cone \( C \) [1706.02579].

Properties:
- Well-defined whenever \( F(x) \) are \( C \)- and \( -C \)-bounded for all \( x \in X \).
- The mapping \( w_e \) is invariant under the equivalence relation associated with \( \preceq_s \), and strictly monotone under strict set-less ordering.
- The vectorizing function completely characterizes \( \preceq_s \): \( w_e(A,B) \geq_{\mathbb{R}^2} (0,0) \iff A \preceq_s B \).
- The approach is agnostic to convexity—solutions are preserved for nonconvex images, in contrast to scalarizations limited to convex settings [1706.02579].

Optimality: Existence and characterization of \( s \)-maximal (or minimal, weak) points are equivalent to Pareto maximality (resp., minimality) of \( w_e \) in \( \mathbb{R}^2 \).

## 5. Connections to Pascoletti–Serafini Scalarization and Generalizations

Pascoletti–Serafini scalarization parses efficient points of \( f(x): S \to Y \) by minimizing
\[
\min t \quad \text{s.t. } f(x)-a \in D + t k,
\]
with ordering cone \( D \), reference \( a \), and direction \( k \). Setting \( H=D \) and \( a=z^0 \) in the Gerstewitz framework recovers this form precisely [1704.08632].

The equivalence is explicit:
- Every Pascoletti–Serafini subproblem is a Gerstewitz minimization for suitable parameters.
- Conversely, any Gerstewitz scalarization \( (P_{F,a,H,k}) \) can be written in Pascoletti–Serafini form by matching \( H \) and \( D \), and setting the reference accordingly.
- The Gerstewitz approach allows parametrization with arbitrary closed \( H \), not limited to cones.

## 6. Implementation Guidelines and Limitations

Implementation of Gerstewitz vectorization and scalarization relies on careful parameter selection and geometry:
- The direction \( k \) should be in \( \mathrm{core}~0^+H \) for well-posedness and bounded, compact minimizer sets.
- Only one direction per “ray” is necessary; normalization by unit norm or sum-to-one convention is standard.
- Reference point \( a \) may be fixed on a hyperplane complementary to \( \operatorname{span}\{k\} \).
- For compact feasible sets \( F \), a grid over the boundary contour of \( F \) with fixed \( k \) suffices to recover the efficient frontier.
- If the minimizer set is empty or unbounded for some parameters, nearby choices will not resolve this unless \( k \) remains in \( \operatorname{int} 0^+H \).

Computational aspects in the set-valued, nonconvex setting (as with the Gerstewitz vectorizing function) reduce to searching for Pareto optima in \( \mathbb{R}^2 \), which is algorithmically accessible, though explicit duality or specialized algorithms remain largely undeveloped [1706.02579].

## 7. Illustrative Examples and Further Directions

Explicit examples illustrate the practical reduction:
- For \( Y = \mathbb{R}^2 \), \( F = \{(y_1, y_2)| 0 \leq y_2 \leq y_1 \leq 1\} \), \( H = \mathbb{R}^2_+ \), \( a = (-1, 0) \), and \( k = (1, 1) \), the unique minimizer is \( (0,0) \), at \( t^{opt}=1 \).
- In the nonconvex set-valued case, set-valued images consisting of ball unions or nonconvex compact sets are analyzed using the vectorizing function, yielding correct sets of minimal solutions, even when classical convexification fails [1706.02579].

Limitations and open problems include the necessity for both \( C \)- and \( -C \)-boundedness, dependence on the selection of \( e \), restriction to two-dimensional surrogates, unresolved issues in differentiability and subdifferential calculus for \( w_e \), and the lack of algorithmic development for more general settings, especially regarding higher-dimensional vectorizations or removal of comparability requirements [1706.02579].

**References**: For detailed proofs, additional technical conditions, and extensive examples, see “Minimizers of Gerstewitz functionals” [1704.08632] and “A Vectorization for Nonconvex Set-valued Optimization” [1706.02579].

Source: https://www.emergentmind.com/topics/gerstewitz-vectorization