most citedSublinear Scalarizations for Proper and Approximate Proper Efficient Points in Nonconvex Vector Optimization

6 citations · 14 across the 5 of their papers we have counts for

collaborators

5 papers

math.OC20241 cited

A Set-Valued Lagrange Theorem based on a Process for Convex Vector Programming

Fernando García-Castaño, M. A. Melguizo Padial

In this paper, we present a new set-valued Lagrange multiplier theorem for constrained convex set-valued optimization problems. We introduce the novel concept of Lagrange process.…

math.FA20243 cited

On dentability and cones with a large dual

Fernando García-Castaño, M. A. Melguizo Padial

In this paper, we provide some equivalences on dentability in normed spaces. Among others we prove: the origin is a denting point of a pointed cone if and only if it is a point…

math.FA20244 cited

Denting Points of Convex Sets and Weak Property () of Cones in Locally Convex Spaces

Fernando García-Castaño, M. A. Melguizo Padial, G. Parzanese

In this paper we first extend from normed spaces to locally convex spaces some characterizations of denting points in convex sets. On the other hand, we also prove that in an infra…

math.OC2024

Lagrange Multipliers, Duality, and Sensitivity in Set-Valued Convex Programming via Pointed Closed Convex Processes

Fernando García-Castaño, M. A. Melguizo Padial

We present a new kind of Lagrangian duality theory for set-valued convex optimization problems whose objective and constraint maps are defined between preordered normed spaces. The…

math.OC20246 cited

Sublinear Scalarizations for Proper and Approximate Proper Efficient Points in Nonconvex Vector Optimization

Fernando García-Castaño, Miguel Ángel Melguizo-Padial, G. Parzanese

We show that under a separation property, a -minimal point in a normed space is the minimum of a given sublinear function. This fact provides sufficient conditions, vi…