Infinite-dimensional Convex Cones: Internal Geometric Structure and Analytical Representation

Valentin V. Gorokhovik

REVIEW 2 major objections 6 minor 36 references

Infinite-dimensional Convex Cones: Internal Geometric Structure and Analytical Representation

T0 review · 2 major / 6 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Every asymmetric convex cone in a real vector space is exactly the common positive set of its step-linear functionals, giving a topology-free analytical representation.

desk verdict A solid structural theory of convex cones via open components, but the main analytical representation rests on an unproved imported separation theorem. read the letter →

arxiv 2411.16209 v1 pith:ZNYQYQUF submitted 2024-11-25 math.OC

Valentin V. Gorokhovik This is my paper · ORCID

classification math.OC MSC 52A0506F20

keywords convexconeopencomponentconicalhalfspacestep-linearfunctioninternalgeometricstructurerelativealgebraicinterioruppersemilatticeanalyticalrepresentation

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper develops a topology-free description of convex cones in infinite-dimensional real vector spaces, built from open components rather than faces. It proves that every convex cone is a disjoint union of its open components, that this family is partially ordered as an upper semilattice, and that this order structure is the cone's internal geometric structure. For conical halfspaces the components are linearly ordered, and each asymmetric conical halfspace is represented by a step-linear function whose positive set is the halfspace. The main result (Theorem 49) states that any asymmetric convex cone $K$ is exactly the set of points at which every step-linear function in a certain family $\mathcal{U}_K$ is positive, with the associated subspace $L_K$ captured by vanishing. This gives an analytic dual description of cones in spaces carrying no norm and no topology.

What carries the argument

The load-bearing notion is the dominance preorder on a convex cone $K$: a point $x$ dominates $y$, written $y \unlhd_K x$, when $x - \lambda y \in K$ for some $\lambda > 0$. Its equivalence classes are the open components of $K$; each is a relatively algebraically open convex cone, and the partially ordered family $\mathcal{O}(K)$ is an upper semilattice with join $E_x \vee E_y = E_{x+y}$. For conical halfspaces the dominance relation is total, so the open components are linearly ordered, and the linear functionals attached to them form a linearly independent cortege. That cortege generates a step-linear function, a real-valued function that selects the least nonzero linear functional in the order at each point, and Theorem 42 shows the asymmetric conical halfspace is exactly the positive set of this function.

What would settle it

Find an asymmetric convex cone $K$ and a vector $y \notin K$ such that every step-linear function positive on $K$ and zero on $L_K$ is also positive at $y$; Theorem 49 predicts that such a $y$ cannot exist. Equivalently, exhibit disjoint convex cones $K_1$ and $K_2$ with $K_1$ asymmetric that are not separated by any asymmetric conical halfspace, which would disprove the imported Theorem 47.

Watch

Extended reading notes

Core claim

Theorem 49: for any asymmetric convex cone $K$ in a real vector space $X$, the family $\mathcal{U}_K$ of step-linear functions $u : X \to \mathbb{R}$ satisfying $u(x) > 0$ on $K$ and $u(x) = 0$ on $L_K$ is nonempty, and $K = \{x \mid u(x) > 0 \text{ for all } u \in \mathcal{U}_K\}$ while $L_K = \{x \mid u(x) = 0 \text{ for all } u \in \mathcal{U}_K\}$. The proof proceeds by regularly extending $K$ to an asymmetric conical halfspace $H$, representing $H$ by a step-linear function, and then showing that for every point outside $K$ some step-linear functional in $\mathcal{U}_K$ is nonpositive. The representation is exact: membership in the cone and membership in its associated vector subspace are both certified by the whole family of positive step-linear functionals.

Load-bearing premise

The main representation theorem imports, without proof, a separation theorem stating that two disjoint convex cones, one asymmetric, can be separated by an asymmetric conical halfspace; Theorems 48 and 49 collapse if that theorem is false or needs hypotheses not present here.

Editorial extensions

If this is right

Every asymmetric convex cone in a real vector space, with no topology, has a nonempty family of positive step-linear functionals, so points outside the cone always admit an analytic certificate of nonmembership.
Asymmetric conical halfspaces and step-linear functions are dual objects: the halfspace is the positive set of the function and the subspace $L_H$ is its zero set.
The open-component semilattice gives a way to study the internal geometry of cones independently of faces, which matters because in infinite-dimensional spaces faces can have empty intrinsic cores while open components always exist.
The family $\mathcal{U}_K$ can serve as a step-linear counterpart of the positive dual cone, extending the classical duality between algebraically open halfspaces and linear functions.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

If Theorem 49 is correct, the upper semilattice of open components becomes an order-theoretic invariant that could be used to distinguish convex cones that are not linearly isomorphic in infinite-dimensional spaces.
The paper leaves open whether the two elementary properties proved in Proposition 41 (homogeneity and the implications $u(y)=0 \Rightarrow u(x+y)=u(x)$, $u(x),u(y)>0 \Rightarrow u(x+y)>0$) actually characterise step-linear functions; a positive answer would yield an axiomatic definition usable in optimization.
The regular-extension argument suggests that the collection of all conical halfspaces extending a given asymmetric cone, together with their step-linear representations, may encode boundary data that a topological dual space cannot see.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Read this for the open components. The idea of defining an equivalence relation on a convex cone from the dominance relation and showing the quotient is an upper semilattice (Theorem 13) is genuinely new and does real work. Example 24, where the internal structure differs from the facial structure in infinite dimensions, is concrete and correct. Sections 2–3 check out; the proofs are detailed enough that I could follow them without filling in much. The step-linear representation of conical halfspaces (Theorem 42) also holds up: it follows from the structure theorem plus Aliprantis–Border separation, and the characterization via corteges is clean.

The soft spot is exactly where the reader says it is: Theorem 47. It is stated without proof, imported from [11], and it carries the whole final representation. Theorem 49 uses it twice—once to regularly extend K to a halfspace, once to separate each outside point from L_K. If that theorem has hidden hypotheses, or is not true at the level of generality stated, then (27) and (28) fail. The paper does flag it as unproved, which is honest, but a referee will want either a proof or a precise statement of the version in [11] with its hypotheses spelled out. This is a conditional result, not a demonstrated one.

One more thing to ask the author: clarify the novelty boundary. Step-linear functions and their role in halfspace representation were introduced in [10,11]. What exactly is new in Theorem 49 beyond assembling those pieces? The open-component structure is clearly new, but the representation theorem's newness relative to prior work is understated. Minor: some algebraic steps in Proposition 3 and Theorem 13 are compressed, but recoverable.

Bottom line: This paper deserves a serious referee. The open-component semilattice and the halfspace representation are real contributions. The final representation is promising but conditional on an unproved separation theorem. I would send it to review and ask the author to include the missing proof or a precise citation, and to sharpen the novelty discussion. I would not cite the main representation theorem in my own work until that is resolved, but I would cite the open-component structure.

Referee Report

2 major / 6 minor

Summary. The paper studies convex cones in real vector spaces with no topology. It introduces the dominance relation and defines 'open components' of a convex cone as its equivalence classes; it proves that the family of open components is an upper semilattice (Theorem 13) and that each open component is the intrinsic core of a minimal face (Theorem 18). It compares this 'internal geometric structure' with the facial structure and exhibits an infinite-dimensional example where the two differ (Example 24). For conical halfspaces, the paper shows that their open components are linearly ordered and each is itself a conical halfspace in its linear hull (Theorem 30), and that each asymmetric conical halfspace is represented exactly by a step-linear function (Theorem 42). The final theorem (Theorem 49) claims that every asymmetric convex cone K is characterized by the family U_K of step-linear functions that are positive on K and zero on L_K, via the equivalence x∈K iff u(x)>0 for all u∈U_K, and x∈L_K iff u(x)=0 for all u∈U_K. The proofs through Theorem 42 are detailed and the examples check out. The central result Theorem 49, however, relies on a separation theorem (Theorem 47) that is stated without proof and imported from a previous paper.

Significance. If the results hold, the paper makes a substantial contribution to convex analysis in general vector spaces: it provides a new structural decomposition of convex cones (open components and their upper semilattice), clarifies the relation to faces, and gives an exact analytical representation of arbitrary asymmetric convex cones by step-linear functions, extending the classical linear-functional representation of algebraically open halfspaces. Theorems 13, 18, 30 and 42 are proved in detail and are internally consistent; the examples (4, 11, 24, 45) are instructive and check out. The main weakness is that the final representation theorem depends on the unproved external separation theorem, so the significance is conditional unless that theorem is supplied or precisely referenced. The paper also contains a number of new technical tools (the cortege structure of linear functionals and step-linear functions) that are likely to be useful in further work.

major comments (2)

[Section 6, Theorem 47] Theorem 47 is stated without proof and is load-bearing for the paper's main theorem. It is used in Theorem 48 to separate K from L_K, and in the proof of Theorem 49 it is used twice: to separate conv(K ∪ l_y) from L_K for y outside K, and to construct the step-linear function with u(y) < 0. Since the theorem asserts a very strong separation property in arbitrary real vector spaces with no topology, I ask that the author either provide a complete proof (e.g., in an appendix) or give the exact statement as proved in [11], with all hypotheses explicitly listed and with a precise reference to the theorem number in [11]. Without this, Theorems 48 and 49 remain conditional on an unverified input.
[Section 6, proof of Theorem 49] In the proof of (27), the assertion 'It is easy to verify that conv(K ∪ l_y) is an asymmetric convex cone' is not demonstrated. This property is necessary to apply Theorem 47 with K1 = conv(K ∪ l_y). It is not immediate for arbitrary asymmetric K and arbitrary y in X \ ((-K) ∪ L_K ∪ K), so the proof should justify it. Please add a short argument or a reference.

minor comments (6)

[Abstract and Section 2.2] The phrase 'the partial ordered family' appears in the abstract and again later; it should read 'the partially ordered family'.
[Section 2.2, definition of the partial order ⊴*_K] The sentence 'E1 ⊴*_K E2 holds for E1,E2 ∈ O(K) if and only if x1 ⊴_K x2 for all (some) x1 ∈ E1 and all (some) x2 ∈ E2' is ambiguous. Since the relation is well-defined on equivalence classes, it should say 'for all x1 ∈ E1 and all x2 ∈ E2 (equivalently, for some x1 ∈ E1 and some x2 ∈ E2)'.
[Theorem 38, first sentence] The theorem states 'Let H ⊂ X be an asymmetric convex halfspace in X'; this should be 'asymmetric conical halfspace'.
[Example 24, definition of E_m] In the display defining E_m, the condition 'lm(x) > 0' is used, but the quantifier on m is not shown in the displayed set; it should be made explicit that m ∈ Z.
[Proof of Theorem 43, part (i) ⇒ (iii)] The phrase 'H is algebraic open halfspace' should be 'H is an algebraically open halfspace' (the adverbial form is missing).
[Proposition 34] The proof invokes Corollary 5.62 of [1] to separate E and L_E. Since the paper works in the purely algebraic setting, it would be helpful to state explicitly that this is an algebraic separation result or to give a direct proof using the algebraic Hahn-Banach extension theorem.

Circularity Check

1 steps flagged · score 4.0 of 10

Theorem 49's main representation rests on Theorem 47, an unproved separation theorem imported from the author's own [11]; the rest of the derivation is internally consistent.

self citation load bearing [Section 6, Theorem 47 and proof of Theorem 49]
"To prove the existence of regular extensions for each asymmetric convex cone we need the following theorem on separation of convex cones by conical halfspaces [11] which is presented here without proof. ... by Theorem 47 there exists a step-linear function ¯u : X → R such that ¯u(x) > 0 for all x ∈ conv(K ⋃ ly) and ¯u(x) ≤ 0 for all x ∈ LK."

Theorem 49, the paper's main analytical-representation claim, is not self-contained: its proof invokes Theorem 47 twice—once through Theorem 48 to regularly extend K to a conical halfspace, and once to separate conv(K∪l_y) from LK for every y outside K∪(−K)∪LK. The separating step-linear functions supplied by Theorem 47 are exactly what makes U_K nonempty and what forces the left-to-right implications in (27) and (28). Theorem 47 is stated without proof and attributed only to the author's prior paper [11]; the current paper contributes no derivation of it. Thus the central characterization reduces at its decisive separation step to a self-citation rather than to the paper's own open-component/cortege machinery.

full rationale

No other load-bearing circularity found. The open-component semilattice (Theorem 13) is derived from the dominance relation; Theorem 18 and Corollary 23 follow internally; the conical-halfspace decomposition (Theorem 30) is proved from Lemma 29 and earlier propositions; Theorem 42's representation of conical halfspaces by step-linear functions is built from Proposition 34 (using the standard Aliprantis-Border separation theorem) and the cortege property, not from its conclusion. The sole circularity burden is Theorem 47, which is imported without proof from the author's own [11] and is essential to Theorems 48 and 49. Because the rest of the argument is independent and the imported theorem is an explicit, published separation result (albeit self-cited), the circularity is partial: score 4 reflects a load-bearing self-citation, not a full reduction of the conclusion to its assumptions.

Assumptions & free parameters 0 free parameters · 4 assumptions · 0 invented entities

No fitted parameters. The proofs rest on standard separation theorems and on the author's previously published separation theorem (Theorem 47), imported without proof. No non-mathematical invented entities appear.

assumptions (4)

standard math The proper separation theorem for an algebraically open convex set and a disjoint convex set in a real vector space provides a nonzero linear functional separating them (Aliprantis-Border, Cor 5.62).
Used in Proposition 34 to construct lE for each open component E.
domain assumption Separation of an asymmetric convex cone and a disjoint convex cone by an asymmetric conical halfspace, equivalently by a step-linear function, stated as Theorem 47 and cited from Gorokhovik [11] without proof.
Load-bearing for regular extension (Theorem 48) and for completeness of U_K in Theorem 49.
domain assumption The union of a linearly ordered family of faces of a convex set is a face (Proposition 2.8 of Diaz Millan and Roshchina [6]).
Used in Theorem 22 and Corollary 23 to identify faces built from open components.
standard math Hamel bases exist for every vector space; coordinate functionals for a Hamel basis are linear and well-defined on finite combinations.
Used in Examples 4, 11, 24 to construct infinite-dimensional cones with controlled open component structure.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Infinite-dimensional Convex Cones: Internal Geometric Structure and Analytical Representation." pith.science (2026). https://pith.science/paper/ZNYQYQUF

@misc{pith2026241116209,
  author       = {Pith},
  title        = {Pith review of: Infinite-dimensional Convex Cones: Internal Geometric Structure and Analytical Representation},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/ZNYQYQUF}},
  note         = {Machine review of arXiv:2411.16209}
}

read the original abstract

In the paper we consider convex cones in infinite-dimensional real vector spaces which are endowed with no topology. The main purpose is to study an internal geometric structure of convex cones and to obtain an analytical description of those. To this end, we first introduce the notion of an open component of a convex cone and then prove that an arbitrary convex cone is the disjoint union of the partial ordered family of its open components and, moreover, as an ordered set this family is an upper semilattice. We identify the structure of this upper semilattice with the internal geometric structure of a convex cone. We demonstrate that the internal geometric structure of a convex cone is related to its facial structure but in the infinite-dimensional setting these two structures may differ each other. Further, we study the internal geometric structure of conical halfspaces (convex cones whose complements are also convex cones). We show that every conical halfspace is the disjoint union of the linear ordered family of its open components each of which is a conical halfspace in its linear hull. Using the internal geometric structure of conical halfspaces, each asymmetric conical halfspace is associated with a linearly ordered family of linear functions, which generates in turn a real-valued function, called a step-linear one, analytically describing this conical halfspace. At last, we establish that an arbitrary asymmetric convex cone admits an analytical representation by the family of step-linear functions.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

36 extracted references · 30 canonical work pages

[11]

Proceed ings of the Steklov Institute of Mathematics

Gorokhovik, V.V.: Step-Aﬃne Functions, Halfspaces, and Sepa ration of Con- vex Sets with Applications to Convex Optimization Problems. Proceed ings of the Steklov Institute of Mathematics. 313(Suppl. 1), S83–S99 (2021) https://doi.org/10.1134/S008154382103010X

doi:10.1134/s008154382103010x 2021
[1]

A hitch hiker’s guide

Aliprantis, C.D., Border, K.C.: Inﬁnite-dimensional analysis. A hitch hiker’s guide. 3ed. Springer-Verlag, Berlin (2006) https://doi.org/10.1007/3-5 40-29587-9

doi:10.1007/3-5 2006
[2]

Aliprantis, C.D., Tourky R.: Cones and duality. Amer. Math. Soc., Pr ovidence (RI) (2007)

work page 2007
[3]

Line ar Algebra and Its Applications, 7(1), 71–82 (1973)

Barker, G.P.: The lattice of faces of a ﬁnite dimensional cone. Line ar Algebra and Its Applications, 7(1), 71–82 (1973)

work page 1973
[4]

Birkhoﬀ, G.: Lattice theory (3rd ed.). Amer. Math. Soc., Provide nce (RI) (1967)

work page 1967
[5]

New York, Springer-Verlag (2000)

Bonnans, J.F., Shapiro, A.: Perturbation Analysis of Optimization P roblems. New York, Springer-Verlag (2000)

work page 2000
[6]

Set-Valued and Variational Analys is

Diaz Millan, R, Roshchina, V.: The Intrinsic Core and Minimal Faces of Convex Sets in General Vector Spaces. Set-Valued and Variational Analys is. 31(Article 14), (2023). https://doi.org/10.1007/s11228-023-00671-6

doi:10.1007/s11228-023-00671-6 2023
[7]

Garcia-Pacheco, F.J.: A solution to the faceless problem. J. Geom . Anal., 30(4), 3859–3871 (2020)

work page 2020

Show all 36 references

[8]

Gorokhovik, V.V.: Convex and nonsmooth vector optimization pro blems [in Russian], Nawuka i Tekhnika, Minsk (1990). 24

1990
[9]

Gorokhovik, V.V., Semenkova, E.A.: Classiﬁcation of halfspaces by types in inﬁnite-dimensional vector spaces [in Rusian]. Mat. Zametki. 64(2), 191–198 (1998). https://doi.org/10.4213/mzm1385 Engish translation: Gorokhovik, V.V., Semenkova, E.A.: Classiﬁcation of halfspaces by ...

1998 doi
[10]

In: Przeworska–Rolewich, D

Gorokhovik, V.V., Shinkevich, E.A.: Geometric structure and clas siﬁcation of inﬁnite-dimensional halfspaces. In: Przeworska–Rolewich, D. (ed ): Algebraic Analysis and Related Topics. Banach Center Publications, vol. 53, pp . 121–138. Institute of Mathematics PAN, Warsaw (2000)

2000
[12]

Duke Math

Hammer, P.C.: Maximal convex sets. Duke Math. J. 22(1), 103– 106 (1955) https://doi.org/10.1215/S0012-7094-55-02209-2

1955 doi
[13]

Hille, E., Phillips, R.: Functional Analysis and Semi-Groups. Amer. Ma th. Soc., Providence (RI)(1957)

1957
[14]

Sp ringer–Verlag, New York–Heidelberg–Berlin 1975)

Holmes, R.: Geometric functional analysis and its applications. Sp ringer–Verlag, New York–Heidelberg–Berlin 1975)

1975
[15]

Springer, Berlin (1970)

Jameson, G.: Ordered linear spaces. Springer, Berlin (1970)

1970
[16]

Springer, Berlin (2011)

Jahn, J.: Vector Optimization — Theory, Applications, and Exten sions. Springer, Berlin (2011)

2011
[17]

Eidelheit ¨ uber konvexe Mengen

Kakutani, S.: Ein Beweis des Satzen von M. Eidelheit ¨ uber konvexe Mengen. Proc. Imp. Acad. Tokio. 14, 93–94 (1938) https://doi.org/10.3792/pia/ 1195579980

1938 doi
[18]

An In troduction with Applications

Khan, A.A., Tammer, Ch., Z˘ alinescu, C.: Set Valued Analysis. An In troduction with Applications. Springer, Heidelberg (2014). https://doi.org/10 .1007/978-3- 642-54265-7

2014
[19]

Khazayel, B., Farajzadeh, A.P., G¨ unther, C., Tammer, Ch.: On t he intrinsic core of convex cones in real vector spaces. SIAM J. on Optimization. 31 (2), 1276–1298 (2021) https://doi.org/10.1137/19M1283148

2021 doi
[20]

Klee, V.: The structure of semispaces. Math. Scand. 4, 54–64 (1956). https://doi.org/10.7146/math.scand.a-10455 25

1956 doi
[21]

Duke Mathematical Journ al

Klee, V.: Convex sets in linear spaces. Duke Mathematical Journ al. 18(2), 443–466 (1951) https://doi.org/10.1215/S0012-7094-51-01835-2

1951 doi
[22]

Lassak, M.: Convex half-spaces. Fund. Math. 120(1), 7–13 ( 1984). https://doi.org/10.4064/fm-120-1-7-13

1984 doi
[23]

Lassak, M.A., Proszynski, A.: Translate-inclusive sets, orderin gs and convex halfspaces. Bull. Polish Acad. Sci. Math. 34(3–4), 195–201 (1986)

1986
[24]

Linear Algebra and Its Applications

Martinez-Legaz, J.-E., Singer, I.: The structure of hemispace s in Rn. Linear Algebra and Its Applications. 110, 117–179 (1988). https://doi.or g/10.1016/0024- 3795(83)90315-0

1988 doi
[25]

Mordukhovich, B.S.: Variational Analysis and Generalized Diﬀeren tiation. Vol
[26]

Springer–Verlag, Berlin (2005)

Basic Theory. Springer–Verlag, Berlin (2005)

2005
[27]

Novo, V., Z˘ alinescu, C.: On Relatively Solid Convex Cones in Real Lin ear Spaces. J. Optimiz. Theory Appl. 188(1), 277–290 (2021) https://doi.org/ 10.1007/s10957- 020-01773-z

2021 doi
[28]

Harper an d Row, New York (1967)

Peressini, A.L.: Ordered topological vector spaces. Harper an d Row, New York (1967)

1967
[29]

Raikov, D.A.: Vector Spaces. P. Noordhoﬀ, Groningen, Nether lands (1965)

1965
[30]

Rockafellar, R.T.: Convex Analysis, Princeton University Press, Princeton, New Jersey (NJ)
[31]

Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis, Springer Ve rlag, Berlin (1998)

1998
[32]

Rosenstein, J.G.: Linear orderings, Academic Press, New York ( 1982)

1982
[33]

Doklady Akad

Rubinstein, G.S.: On a method of invastigation of convex sets [in Ru ssian]. Doklady Akad. Nauk SSSR. 102, 451–454 (1955)

1955
[34]

Russian Mathematical Surveys

Rubinshtein, G.S.: Duality in mathematical programming and some p rob- lems of convex analysis. Russian Mathematical Surveys. 25(5), 17 1–200 (1970). https://doi.org/10.1070/RM1970v025n05ABEH003800

1970 doi
[35]

W.: Some notes on the separation of convex sets

Tukey, J. W.: Some notes on the separation of convex sets. Po rtugaliae Math. 3(2), 95–102 (1942) https://eudml.org/doc/114600

1942
[36]

World Scientiﬁc, New Jersey-London-Singapore-Hong Kong (2002) (2002) 26

Z˘ alinescu, C.: Convex Analysis in General Vector Spaces. World Scientiﬁc, New Jersey-London-Singapore-Hong Kong (2002) (2002) 26

2002

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.

[1] [11]

Proceed ings of the Steklov Institute of Mathematics

Gorokhovik, V.V.: Step-Aﬃne Functions, Halfspaces, and Sepa ration of Con- vex Sets with Applications to Convex Optimization Problems. Proceed ings of the Steklov Institute of Mathematics. 313(Suppl. 1), S83–S99 (2021) https://doi.org/10.1134/S008154382103010X

doi:10.1134/s008154382103010x 2021

[2] [1]

A hitch hiker’s guide

Aliprantis, C.D., Border, K.C.: Inﬁnite-dimensional analysis. A hitch hiker’s guide. 3ed. Springer-Verlag, Berlin (2006) https://doi.org/10.1007/3-5 40-29587-9

doi:10.1007/3-5 2006

[3] [2]

Aliprantis, C.D., Tourky R.: Cones and duality. Amer. Math. Soc., Pr ovidence (RI) (2007)

work page 2007

[4] [3]

Line ar Algebra and Its Applications, 7(1), 71–82 (1973)

Barker, G.P.: The lattice of faces of a ﬁnite dimensional cone. Line ar Algebra and Its Applications, 7(1), 71–82 (1973)

work page 1973

[5] [4]

Birkhoﬀ, G.: Lattice theory (3rd ed.). Amer. Math. Soc., Provide nce (RI) (1967)

work page 1967

[6] [5]

New York, Springer-Verlag (2000)

Bonnans, J.F., Shapiro, A.: Perturbation Analysis of Optimization P roblems. New York, Springer-Verlag (2000)

work page 2000

[7] [6]

Set-Valued and Variational Analys is

Diaz Millan, R, Roshchina, V.: The Intrinsic Core and Minimal Faces of Convex Sets in General Vector Spaces. Set-Valued and Variational Analys is. 31(Article 14), (2023). https://doi.org/10.1007/s11228-023-00671-6

doi:10.1007/s11228-023-00671-6 2023

[8] [7]

Garcia-Pacheco, F.J.: A solution to the faceless problem. J. Geom . Anal., 30(4), 3859–3871 (2020)

work page 2020