Proper efficiency results in vector optimisation in real linear-topological spaces based on vectorial penalisation

Christiane Tammer; Christian G\"unther; Elisabeth K\"obis; Paul Schm\"olling

arxiv: 2605.30286 · v1 · pith:5UNUXTV2new · submitted 2026-05-28 · 🧮 math.OC

Proper efficiency results in vector optimisation in real linear-topological spaces based on vectorial penalisation

Paul Schm\"olling , Christian G\"unther , Christiane Tammer , Elisabeth K\"obis This is my paper

Pith reviewed 2026-06-29 05:44 UTC · model grok-4.3

classification 🧮 math.OC

keywords proper efficiencyvector optimizationvectorial penalizationcone convexitylinear-topological spacesconstrained problemsunconstrained problems

0 comments

The pith

Vectorial penalization relates properly efficient solution sets of constrained and unconstrained vector optimization problems under cone convexity.

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

This paper studies constrained vector optimization problems with objectives mapping between real linear-topological spaces. It establishes relationships between the sets of properly efficient solutions for the constrained and corresponding unconstrained versions by applying a vectorial penalization method, provided the objective satisfies cone convexity. A sympathetic reader would care because the relation permits converting constrained problems into unconstrained ones while preserving the proper efficiency property, which can simplify theoretical analysis and solution procedures in vector-valued settings.

Core claim

Under certain cone convexity assumptions on the objective function, the sets of properly efficient solutions to constrained and unconstrained vector optimisation problems are related via a vectorial penalisation approach in real linear-topological spaces.

What carries the argument

Vectorial penalisation approach, which augments the objective with a penalty term derived from the constraints to produce an equivalent unconstrained problem.

If this is right

Properly efficient solutions of the original constrained problem correspond directly to properly efficient solutions of the penalized unconstrained problem.
The penalization preserves membership in the properly efficient set precisely when cone convexity holds.
Constraints can be incorporated implicitly without changing the proper efficiency characterization.
The result applies in general real linear-topological spaces rather than only finite-dimensional or normed settings.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

Algorithms developed for unconstrained vector problems could be reused on constrained instances after penalization.
Similar relations might hold for other efficiency notions such as weak efficiency if analogous convexity conditions are imposed.
In applications with multiple conflicting objectives, this offers a route to treat constraints without explicit feasible-set projections.

Load-bearing premise

The objective function satisfies certain cone convexity assumptions.

What would settle it

A concrete vector optimization example in linear-topological spaces where the objective meets the cone convexity conditions yet the properly efficient solution sets of the constrained and unconstrained problems fail to relate as claimed.

read the original abstract

In this paper, we are dealing with constrained vector optimisation problems where the objective function acts between real linear-topological spaces. Our aim is to study the relationships between the sets of properly efficient solutions to constrained and unconstrained vector optimisation problems under certain cone convexity assumptions on the objective function using a vectorial penalisation approach.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

Cone-convexity lets vectorial penalization equate the properly efficient solution sets of constrained and unconstrained vector problems in linear-topological spaces.

read the letter

The paper establishes that, when the objective satisfies cone-convexity, a vector penalty function makes the sets of properly efficient points coincide for the original constrained problem and the corresponding unconstrained penalized problem. The setting is real linear-topological spaces, which is a modest step beyond the usual normed-space results.

The work is competent on its own terms. It states the assumptions clearly, recalls the relevant definitions of proper efficiency, and derives the equivalence using standard arguments about the ordering cone and separation. The vectorial penalization approach itself is not brand new, but carrying it through in this generality and tying it specifically to proper efficiency is a small, clean extension.

The main limitation is the cone-convexity hypothesis. It is strong enough that many vector problems fall outside the result, and the paper does not appear to weaken it or give practical checks for when it holds. The topological assumptions are handled at the level one expects, with no visible gaps, but the proofs remain at the level of existence and set equality rather than constructive or algorithmic content.

This is a narrow technical note aimed at people already working on efficiency notions and penalization in vector optimization. A reader who needs the precise equivalence under these hypotheses will find it useful; most others will not. The citation pattern looks standard for the subfield and does not raise flags.

It is worth sending to referees. The claim is modest, the assumptions are explicit, and the argument appears internally consistent.

Referee Report

0 major / 3 minor

Summary. The manuscript claims that, under cone-convexity assumptions on the objective function, the sets of properly efficient solutions of a constrained vector optimization problem and its unconstrained counterpart coincide when the latter is obtained via a vectorial penalization in real linear-topological spaces.

Significance. If the central equivalence holds, the result supplies a penalization technique that reduces constrained proper-efficiency questions to unconstrained ones in a broad class of topological vector spaces; this is a standard direction in vector optimization and the topological setting is a natural extension of normed-space results.

minor comments (3)

The abstract and introduction should explicitly state the precise form of the vectorial penalty term (e.g., the scalarizing functional or the cone-valued multiplier) before the main theorems are announced.
Notation for the ordering cones and the proper-efficiency notions (e.g., Borwein, Benson, or Henig proper efficiency) must be fixed at the beginning of Section 2 and used consistently thereafter.
Any counter-example showing that cone-convexity cannot be dropped should be placed immediately after the main theorem to clarify the sharpness of the hypothesis.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment of our manuscript and the recommendation for minor revision. The referee's summary correctly captures the paper's focus on relating properly efficient solution sets for constrained and unconstrained vector optimization problems via vectorial penalization under cone-convexity assumptions in real linear-topological spaces.

Circularity Check

0 steps flagged

No significant circularity; derivation self-contained under stated assumptions

full rationale

The paper establishes relationships between properly efficient solution sets for constrained and unconstrained vector problems in linear-topological spaces via vectorial penalisation, relying on explicit cone-convexity assumptions on the objective. The abstract states the setting, aim, and assumptions directly without self-referential definitions, fitted parameters renamed as predictions, or load-bearing self-citations. No equations or steps are provided that reduce by construction to inputs, and the central claim remains independent of any internal fitting or renaming. This is the expected outcome for a theoretical existence/relationship result grounded in stated topological and convexity hypotheses.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Only the abstract is available; no specific free parameters, axioms, or invented entities can be identified from the provided information.

pith-pipeline@v0.9.1-grok · 5608 in / 979 out tokens · 53847 ms · 2026-06-29T05:44:39.710600+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

29 extracted references · 22 canonical work pages · 1 internal anchor

[1]

A new penalization tool in scalar and vector optimizations

Marius Apetrii, Marius Durea, and Radu Strugariu. “A new penalization tool in scalar and vector optimizations”. In:Nonlinear Analysis: Theory, Methods & Ap- plications vol. 107107 (Sept. 2014).doi:10.1016/j.na.2014.04.022

work page doi:10.1016/j.na.2014.04.022 2014
[2]

5. Admissible Points of Convex Sets

K. J. Arrow, E. W. Barankin, and D. Blackwell. “5. Admissible Points of Convex Sets”. In:Contributions to the Theory of Games (AM-28), Volume II. Ed. by Harold William Kuhn and Albert William Tucker. Princeton: Princeton University Press, Dec. 1953, pp. 87–92.isbn: 978-1-4008-8197-0.doi:10.1515/9781400881970-006. url:https://www.degruyter.com/document/doi...

work page doi:10.1515/9781400881970-006 1953
[3]

On Some Methods to Derive Necessary and Sufficient Optimality Conditions in Vector Optimization

Marius Durea, Radu Strugariu, and Christiane Tammer. “On Some Methods to Derive Necessary and Sufficient Optimality Conditions in Vector Optimization”. In:Journal of Optimization Theory and Applications175.3 (Dec. 2017), pp. 738– 763.issn: 0022-3239, 1573-2878.doi:10.1007/s10957-016-1059-y.url:http: //link.springer.com/10.1007/s10957-016-1059-y(visited on...

work page doi:10.1007/s10957-016-1059-y.url:http: 2017
[4]

Ryszard Engelking.General topology. Rev. and completed ed. Sigma series in pure mathematics 6. Berlin: Heldermann, 1989.isbn: 978-3-88538-006-1

1989
[5]

Proper efficiency and the theory of vector maximization

Arthur M Geoffrion. “Proper efficiency and the theory of vector maximization”. In:Journal of Mathematical Analysis and Applications22.3 (June 1968), pp. 618– 630.issn: 0022-247X.doi:10 . 1016 / 0022 - 247X(68 ) 90201 - 1.url:https : / / www.sciencedirect.com/science/article/pii/0022247X68902011(visited on 09/18/2025)

work page arXiv 1968
[6]

A new ABB theorem in normed vector spaces

A. G¨ opfert, Chr. Tammer, and C. Z˘ alinescu. “A new ABB theorem in normed vector spaces”. In:Optimization53.4 (Aug. 2004), pp. 369–376.issn: 0233-1934, 1029- 4945.doi:10 . 1080 / 02331930412331282427.url:http : / / www . tandfonline . com/doi/abs/10.1080/02331930412331282427(visited on 09/11/2023)

work page doi:10.1080/02331930412331282427(visited 2004
[7]

CMS/CAIMS books in mathematics

Alfred G¨ opfert et al.Variational Methods in Partially Ordered Spaces. CMS/CAIMS books in mathematics. Cham: Springer Nature Switzerland AG, second Edition, 2023.isbn: 978-3-031-36533-1.url:https : / / doi . org / 10 . 1007 / 978 - 3 - 031 - 36534-8. 18

2023
[8]

On the notion of proper efficiency in vector optimization

A. Guerraggio, E. Molho, and A. Zaffaroni. “On the notion of proper efficiency in vector optimization”. In:Journal of Optimization Theory and Applications82.1 (July 1994), pp. 1–21.issn: 0022-3239, 1573-2878.doi:10.1007/BF02191776.url: http://link.springer.com/10.1007/BF02191776(visited on 06/26/2024)

work page doi:10.1007/bf02191776.url: 1994
[9]

Vector Optimiza- tion w.r.t. Relatively Solid Convex Cones in Real Linear Spaces

Christian G¨ unther, Bahareh Khazayel, and Christiane Tammer. “Vector Optimiza- tion w.r.t. Relatively Solid Convex Cones in Real Linear Spaces”. In:Journal of Optimization Theory and Applications193.1-3 (June 2022), pp. 408–442.issn: 0022- 3239, 1573-2878.doi:10 . 1007 / s10957 - 021 - 01976 - y.url:https : / / link . springer.com/10.1007/s10957-021-0197...

work page doi:10.1007/s10957-021-01976-y(visited 2022
[10]

A new concept of semistrict quasiconvexity for vector functions

Christian G¨ unther, Alexandru Orzan, and Nicolae Popovici. “A new concept of semistrict quasiconvexity for vector functions”. In:Optimization74.14 (2025), pp. 3573– 3601.doi:10.1080/02331934.2024.2384919

work page doi:10.1080/02331934.2024.2384919 2025
[11]

On generalized-convex constrained multi-objective optimization

Christian G¨ unther and Christiane Tammer. “On generalized-convex constrained multi-objective optimization”. In:Pure and Applied Functional Analysis3.3 (2018), pp. 429–461

2018
[12]

Relationships between constrained and unconstrained multi-objective optimization and application in location theory

Christian G¨ unther and Christiane Tammer. “Relationships between constrained and unconstrained multi-objective optimization and application in location theory”. In:Mathematical Methods of Operations Research84 (Oct. 2016), pp. 359–387.doi: 10.1007/s00186-016-0547-z

work page doi:10.1007/s00186-016-0547-z 2016
[13]

Necessary optimality conditions in generalized convex multi-objective optimization involving nonconvex constraints

Christian G¨ unther, Christiane Tammer, and Jen-Chih Yao. “Necessary optimality conditions in generalized convex multi-objective optimization involving nonconvex constraints”. In:Applied Analysis and Optimization2.3 (Dec. 2018), pp. 403–421

2018
[14]

Christian G¨ unther et al.Bishop-Phelps Type Scalarization for Vector Optimization in Real Topological-Linear Spaces. Nov. 2024.doi:10.48550/arXiv.2410.10026. arXiv:2410.10026 [math].url:http://arxiv.org/abs/2410.10026(visited on 12/15/2024)

work page internal anchor Pith review doi:10.48550/arxiv.2410.10026 2024
[15]

Vectorial penalisation in vector optimisation in real linear- topological spaces

Christian G¨ unther et al. “Vectorial penalisation in vector optimisation in real linear- topological spaces”. In:Journal of Nonlinear and Variational Analysis7.5 (Oct. 2023), pp. 651–686.doi:10 . 23952 / jnva . 7 . 2023 . 5 . 02.url:http : / / jnva . biemdas.com/archives/2093(visited on 10/02/2023)

2023
[16]

Bishop–Phelps cones given by an equa- tion in Banach spaces

Truong Xuan Duc Ha and Johannes Jahn. “Bishop–Phelps cones given by an equa- tion in Banach spaces”. In:Optimization72.5 (2023), pp. 1309–1346.doi:10.1080/ 02331934.2021.2011870

work page arXiv 2023
[17]

On Cone-Efficiency, Cone-Convexity and Cone-Compactness

Roger Hartley. “On Cone-Efficiency, Cone-Convexity and Cone-Compactness”. In: SIAM Journal on Applied Mathematics34.2 (1978), pp. 211–222.issn: 0036-1399. doi:10.1137/0134018. JSTOR:2100887. (Visited on 03/11/2026)

work page doi:10.1137/0134018 1978
[18]

Proper efficiency with respect to cones

M. I. Henig. “Proper efficiency with respect to cones”. In:Journal of Optimization Theory and Applications36.3 (Mar. 1982), pp. 387–407.issn: 0022-3239, 1573- 2878.doi:10.1007/BF00934353.url:http://link.springer.com/10.1007/ BF00934353(visited on 09/11/2023)

work page doi:10.1007/bf00934353.url:http://link.springer.com/10.1007/ 1982
[19]

Johannes Jahn.Vector Optimization: Theory, Applications, and Extensions. 2nd ed. Berlin, Heidelberg: Springer-Verlag Berlin Heidelberg, 2011.isbn: 978-3-642-17004- 1 978-3-642-17005-8.doi:10.1007/978- 3- 642- 17005- 8.url:https://link. springer.com/10.1007/978-3-642-17005-8. 19

work page doi:10.1007/978- 2011
[20]

Khan, Christiane Tammer, and Constantin Zalinescu.Set-valued Op- timization - An Introduction with Applications

Akhtar A. Khan, Christiane Tammer, and Constantin Zalinescu.Set-valued Op- timization - An Introduction with Applications. Vector Optimization. Heidelberg: Springer, 2015.isbn: 978-3-642-54264-0.doi:10.1007/978-3-642-54265-7

work page doi:10.1007/978-3-642-54265-7 2015
[21]

Regularized nonlinear scalarization for vector opti- mization problems with PDE-constraints

G. Leugering and R. Schiel. “Regularized nonlinear scalarization for vector opti- mization problems with PDE-constraints”. In:GAMM-Mitteilungen35.2 (2012), pp. 209–225.issn: 1522-2608.doi:10 . 1002 / gamm . 201210014.url:https : / / onlinelibrary . wiley . com / doi / abs / 10 . 1002 / gamm . 201210014(visited on 01/30/2026)

2012
[22]

Springer Undergraduate Mathematics Series

Rafael L´ opez.Point-Set Topology: A Working Textbook. Springer Undergraduate Mathematics Series. Cham: Springer International Publishing, 2024.isbn: 978-3- 031-58512-8 978-3-031-58513-5.doi:10.1007/978-3-031-58513-5.url:https: //link.springer.com/10.1007/978-3-031-58513-5(visited on 03/04/2026)

work page doi:10.1007/978-3-031-58513-5.url:https: 2024
[23]

Dinh The Luc.Theory of Vector Optimization. Ed. by M. Beckmann and W. Krelle. Vol. 319. Lecture Notes in Economics and Mathematical Systems. Berlin, Heidel- berg: Springer, 1989.isbn: 978-3-540-50541-9 978-3-642-50280-4.doi:10 . 1007 / 978-3-642-50280-4.url:http://link.springer.com/10.1007/978-3-642- 50280-4(visited on 06/13/2023)

work page doi:10.1007/978-3-642- 1989
[24]

On the Density of Henig Efficient Points in Locally Convex Topological Vector Spaces

Joseph Newhall and Robert K. Goodrich. “On the Density of Henig Efficient Points in Locally Convex Topological Vector Spaces”. In:Journal of Optimization Theory and Applications165.3 (June 2015), pp. 753–762.issn: 0022-3239, 1573-2878.doi: 10 . 1007 / s10957 - 014 - 0644 - 1.url:http : / / link . springer . com / 10 . 1007 / s10957-014-0644-1(visited on 0...

2015
[25]

Rough Convergence in Infinite Dimensional Normed Spaces

Hoang Xuan Phu. “Rough Convergence in Infinite Dimensional Normed Spaces”. In:Numerical Functional Analysis and Optimization24.3-4 (Jan. 2003), pp. 285– 301.issn: 0163-0563.doi:10.1081/NFA-120022923. (Visited on 01/30/2026)

work page doi:10.1081/nfa-120022923 2003
[26]

Rough Convergence in Normed Linear Spaces

Hoang Xuan Phu. “Rough Convergence in Normed Linear Spaces”. In:Numerical Functional Analysis and Optimization22.1-2 (Mar. 2001), pp. 199–222.issn: 0163- 0563.doi:10.1081/NFA-100103794.url:https://www.tandfonline.com/doi/ abs/10.1081/NFA-100103794(visited on 01/30/2026)

work page doi:10.1081/nfa-100103794.url:https://www.tandfonline.com/doi/ 2001
[27]

H. H. Schaefer and M. P. Wolff.Topological Vector Spaces. Vol. 3. Graduate Texts in Mathematics. New York, NY: Springer, 1999.isbn: 978-1-4612-7155-0 978-1-4612- 1468-7.doi:10.1007/978-1-4612-1468-7.url:http://link.springer.com/ 10.1007/978-1-4612-1468-7(visited on 09/25/2024)

work page doi:10.1007/978-1-4612-1468-7.url:http://link.springer.com/ 1999
[28]

The exact penalty principle

Jane J. Ye. “The exact penalty principle”. In:Nonlinear Analysis: Theory, Methods & Applications75.3 (2012), pp. 1642–1654.issn: 0362-546X.doi:10.1016/j.na. 2011.03.025.url:https://www.sciencedirect.com/science/article/pii/ S0362546X11001556

work page doi:10.1016/j.na 2012
[29]

London: World Scientific, 2002.isbn: 978-981-238-067-8.doi:10.1142/5021.url:https://www

Constantin Zalinescu.Convex Analysis in General Vector Spaces. London: World Scientific, 2002.isbn: 978-981-238-067-8.doi:10.1142/5021.url:https://www. worldscientific.com/doi/abs/10.1142/5021. 20

work page doi:10.1142/5021.url:https://www 2002

[1] [1]

A new penalization tool in scalar and vector optimizations

Marius Apetrii, Marius Durea, and Radu Strugariu. “A new penalization tool in scalar and vector optimizations”. In:Nonlinear Analysis: Theory, Methods & Ap- plications vol. 107107 (Sept. 2014).doi:10.1016/j.na.2014.04.022

work page doi:10.1016/j.na.2014.04.022 2014

[2] [2]

5. Admissible Points of Convex Sets

K. J. Arrow, E. W. Barankin, and D. Blackwell. “5. Admissible Points of Convex Sets”. In:Contributions to the Theory of Games (AM-28), Volume II. Ed. by Harold William Kuhn and Albert William Tucker. Princeton: Princeton University Press, Dec. 1953, pp. 87–92.isbn: 978-1-4008-8197-0.doi:10.1515/9781400881970-006. url:https://www.degruyter.com/document/doi...

work page doi:10.1515/9781400881970-006 1953

[3] [3]

On Some Methods to Derive Necessary and Sufficient Optimality Conditions in Vector Optimization

Marius Durea, Radu Strugariu, and Christiane Tammer. “On Some Methods to Derive Necessary and Sufficient Optimality Conditions in Vector Optimization”. In:Journal of Optimization Theory and Applications175.3 (Dec. 2017), pp. 738– 763.issn: 0022-3239, 1573-2878.doi:10.1007/s10957-016-1059-y.url:http: //link.springer.com/10.1007/s10957-016-1059-y(visited on...

work page doi:10.1007/s10957-016-1059-y.url:http: 2017

[4] [4]

Ryszard Engelking.General topology. Rev. and completed ed. Sigma series in pure mathematics 6. Berlin: Heldermann, 1989.isbn: 978-3-88538-006-1

1989

[5] [5]

Proper efficiency and the theory of vector maximization

Arthur M Geoffrion. “Proper efficiency and the theory of vector maximization”. In:Journal of Mathematical Analysis and Applications22.3 (June 1968), pp. 618– 630.issn: 0022-247X.doi:10 . 1016 / 0022 - 247X(68 ) 90201 - 1.url:https : / / www.sciencedirect.com/science/article/pii/0022247X68902011(visited on 09/18/2025)

work page arXiv 1968

[6] [6]

A new ABB theorem in normed vector spaces

A. G¨ opfert, Chr. Tammer, and C. Z˘ alinescu. “A new ABB theorem in normed vector spaces”. In:Optimization53.4 (Aug. 2004), pp. 369–376.issn: 0233-1934, 1029- 4945.doi:10 . 1080 / 02331930412331282427.url:http : / / www . tandfonline . com/doi/abs/10.1080/02331930412331282427(visited on 09/11/2023)

work page doi:10.1080/02331930412331282427(visited 2004

[7] [7]

CMS/CAIMS books in mathematics

Alfred G¨ opfert et al.Variational Methods in Partially Ordered Spaces. CMS/CAIMS books in mathematics. Cham: Springer Nature Switzerland AG, second Edition, 2023.isbn: 978-3-031-36533-1.url:https : / / doi . org / 10 . 1007 / 978 - 3 - 031 - 36534-8. 18

2023

[8] [8]

On the notion of proper efficiency in vector optimization

A. Guerraggio, E. Molho, and A. Zaffaroni. “On the notion of proper efficiency in vector optimization”. In:Journal of Optimization Theory and Applications82.1 (July 1994), pp. 1–21.issn: 0022-3239, 1573-2878.doi:10.1007/BF02191776.url: http://link.springer.com/10.1007/BF02191776(visited on 06/26/2024)

work page doi:10.1007/bf02191776.url: 1994

[9] [9]

Vector Optimiza- tion w.r.t. Relatively Solid Convex Cones in Real Linear Spaces

Christian G¨ unther, Bahareh Khazayel, and Christiane Tammer. “Vector Optimiza- tion w.r.t. Relatively Solid Convex Cones in Real Linear Spaces”. In:Journal of Optimization Theory and Applications193.1-3 (June 2022), pp. 408–442.issn: 0022- 3239, 1573-2878.doi:10 . 1007 / s10957 - 021 - 01976 - y.url:https : / / link . springer.com/10.1007/s10957-021-0197...

work page doi:10.1007/s10957-021-01976-y(visited 2022

[10] [10]

A new concept of semistrict quasiconvexity for vector functions

Christian G¨ unther, Alexandru Orzan, and Nicolae Popovici. “A new concept of semistrict quasiconvexity for vector functions”. In:Optimization74.14 (2025), pp. 3573– 3601.doi:10.1080/02331934.2024.2384919

work page doi:10.1080/02331934.2024.2384919 2025

[11] [11]

On generalized-convex constrained multi-objective optimization

Christian G¨ unther and Christiane Tammer. “On generalized-convex constrained multi-objective optimization”. In:Pure and Applied Functional Analysis3.3 (2018), pp. 429–461

2018

[12] [12]

Relationships between constrained and unconstrained multi-objective optimization and application in location theory

Christian G¨ unther and Christiane Tammer. “Relationships between constrained and unconstrained multi-objective optimization and application in location theory”. In:Mathematical Methods of Operations Research84 (Oct. 2016), pp. 359–387.doi: 10.1007/s00186-016-0547-z

work page doi:10.1007/s00186-016-0547-z 2016

[13] [13]

Necessary optimality conditions in generalized convex multi-objective optimization involving nonconvex constraints

Christian G¨ unther, Christiane Tammer, and Jen-Chih Yao. “Necessary optimality conditions in generalized convex multi-objective optimization involving nonconvex constraints”. In:Applied Analysis and Optimization2.3 (Dec. 2018), pp. 403–421

2018

[14] [14]

Christian G¨ unther et al.Bishop-Phelps Type Scalarization for Vector Optimization in Real Topological-Linear Spaces. Nov. 2024.doi:10.48550/arXiv.2410.10026. arXiv:2410.10026 [math].url:http://arxiv.org/abs/2410.10026(visited on 12/15/2024)

work page internal anchor Pith review doi:10.48550/arxiv.2410.10026 2024

[15] [15]

Vectorial penalisation in vector optimisation in real linear- topological spaces

Christian G¨ unther et al. “Vectorial penalisation in vector optimisation in real linear- topological spaces”. In:Journal of Nonlinear and Variational Analysis7.5 (Oct. 2023), pp. 651–686.doi:10 . 23952 / jnva . 7 . 2023 . 5 . 02.url:http : / / jnva . biemdas.com/archives/2093(visited on 10/02/2023)

2023

[16] [16]

Bishop–Phelps cones given by an equa- tion in Banach spaces

Truong Xuan Duc Ha and Johannes Jahn. “Bishop–Phelps cones given by an equa- tion in Banach spaces”. In:Optimization72.5 (2023), pp. 1309–1346.doi:10.1080/ 02331934.2021.2011870

work page arXiv 2023

[17] [17]

On Cone-Efficiency, Cone-Convexity and Cone-Compactness

Roger Hartley. “On Cone-Efficiency, Cone-Convexity and Cone-Compactness”. In: SIAM Journal on Applied Mathematics34.2 (1978), pp. 211–222.issn: 0036-1399. doi:10.1137/0134018. JSTOR:2100887. (Visited on 03/11/2026)

work page doi:10.1137/0134018 1978

[18] [18]

Proper efficiency with respect to cones

M. I. Henig. “Proper efficiency with respect to cones”. In:Journal of Optimization Theory and Applications36.3 (Mar. 1982), pp. 387–407.issn: 0022-3239, 1573- 2878.doi:10.1007/BF00934353.url:http://link.springer.com/10.1007/ BF00934353(visited on 09/11/2023)

work page doi:10.1007/bf00934353.url:http://link.springer.com/10.1007/ 1982

[19] [19]

Johannes Jahn.Vector Optimization: Theory, Applications, and Extensions. 2nd ed. Berlin, Heidelberg: Springer-Verlag Berlin Heidelberg, 2011.isbn: 978-3-642-17004- 1 978-3-642-17005-8.doi:10.1007/978- 3- 642- 17005- 8.url:https://link. springer.com/10.1007/978-3-642-17005-8. 19

work page doi:10.1007/978- 2011

[20] [20]

Khan, Christiane Tammer, and Constantin Zalinescu.Set-valued Op- timization - An Introduction with Applications

Akhtar A. Khan, Christiane Tammer, and Constantin Zalinescu.Set-valued Op- timization - An Introduction with Applications. Vector Optimization. Heidelberg: Springer, 2015.isbn: 978-3-642-54264-0.doi:10.1007/978-3-642-54265-7

work page doi:10.1007/978-3-642-54265-7 2015

[21] [21]

Regularized nonlinear scalarization for vector opti- mization problems with PDE-constraints

G. Leugering and R. Schiel. “Regularized nonlinear scalarization for vector opti- mization problems with PDE-constraints”. In:GAMM-Mitteilungen35.2 (2012), pp. 209–225.issn: 1522-2608.doi:10 . 1002 / gamm . 201210014.url:https : / / onlinelibrary . wiley . com / doi / abs / 10 . 1002 / gamm . 201210014(visited on 01/30/2026)

2012

[22] [22]

Springer Undergraduate Mathematics Series

Rafael L´ opez.Point-Set Topology: A Working Textbook. Springer Undergraduate Mathematics Series. Cham: Springer International Publishing, 2024.isbn: 978-3- 031-58512-8 978-3-031-58513-5.doi:10.1007/978-3-031-58513-5.url:https: //link.springer.com/10.1007/978-3-031-58513-5(visited on 03/04/2026)

work page doi:10.1007/978-3-031-58513-5.url:https: 2024

[23] [23]

Dinh The Luc.Theory of Vector Optimization. Ed. by M. Beckmann and W. Krelle. Vol. 319. Lecture Notes in Economics and Mathematical Systems. Berlin, Heidel- berg: Springer, 1989.isbn: 978-3-540-50541-9 978-3-642-50280-4.doi:10 . 1007 / 978-3-642-50280-4.url:http://link.springer.com/10.1007/978-3-642- 50280-4(visited on 06/13/2023)

work page doi:10.1007/978-3-642- 1989

[24] [24]

On the Density of Henig Efficient Points in Locally Convex Topological Vector Spaces

Joseph Newhall and Robert K. Goodrich. “On the Density of Henig Efficient Points in Locally Convex Topological Vector Spaces”. In:Journal of Optimization Theory and Applications165.3 (June 2015), pp. 753–762.issn: 0022-3239, 1573-2878.doi: 10 . 1007 / s10957 - 014 - 0644 - 1.url:http : / / link . springer . com / 10 . 1007 / s10957-014-0644-1(visited on 0...

2015

[25] [25]

Rough Convergence in Infinite Dimensional Normed Spaces

Hoang Xuan Phu. “Rough Convergence in Infinite Dimensional Normed Spaces”. In:Numerical Functional Analysis and Optimization24.3-4 (Jan. 2003), pp. 285– 301.issn: 0163-0563.doi:10.1081/NFA-120022923. (Visited on 01/30/2026)

work page doi:10.1081/nfa-120022923 2003

[26] [26]

Rough Convergence in Normed Linear Spaces

Hoang Xuan Phu. “Rough Convergence in Normed Linear Spaces”. In:Numerical Functional Analysis and Optimization22.1-2 (Mar. 2001), pp. 199–222.issn: 0163- 0563.doi:10.1081/NFA-100103794.url:https://www.tandfonline.com/doi/ abs/10.1081/NFA-100103794(visited on 01/30/2026)

work page doi:10.1081/nfa-100103794.url:https://www.tandfonline.com/doi/ 2001

[27] [27]

H. H. Schaefer and M. P. Wolff.Topological Vector Spaces. Vol. 3. Graduate Texts in Mathematics. New York, NY: Springer, 1999.isbn: 978-1-4612-7155-0 978-1-4612- 1468-7.doi:10.1007/978-1-4612-1468-7.url:http://link.springer.com/ 10.1007/978-1-4612-1468-7(visited on 09/25/2024)

work page doi:10.1007/978-1-4612-1468-7.url:http://link.springer.com/ 1999

[28] [28]

The exact penalty principle

Jane J. Ye. “The exact penalty principle”. In:Nonlinear Analysis: Theory, Methods & Applications75.3 (2012), pp. 1642–1654.issn: 0362-546X.doi:10.1016/j.na. 2011.03.025.url:https://www.sciencedirect.com/science/article/pii/ S0362546X11001556

work page doi:10.1016/j.na 2012

[29] [29]

London: World Scientific, 2002.isbn: 978-981-238-067-8.doi:10.1142/5021.url:https://www

Constantin Zalinescu.Convex Analysis in General Vector Spaces. London: World Scientific, 2002.isbn: 978-981-238-067-8.doi:10.1142/5021.url:https://www. worldscientific.com/doi/abs/10.1142/5021. 20

work page doi:10.1142/5021.url:https://www 2002