Advertisement
Published in:
2006 | OriginalPaper | Chapter
Optimal Solutions for Quasi-convex Maximization
Published in: Duality for Nonconvex Approximation and Optimization
Publisher: Springer New York
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Let
X
be a locally convex space, ƒ :
X
ƒ;
$$ \bar R $$
a function,
G
⊆
Z
, and g
o
∈
G
. Clearly, if ƒ(
g
0
) = +∞ then
g
0
is an optimal solution of the primal supremization problem(
P
s
](of(3.1)),i.e.,ƒ(
g
0
) = max ƒ(
G
),andifƒ(
g
o) = -∞, ƒ|
G
# -∞, then go is not a maximum point of → on
G