Miguel Angel Goberna
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Miguel Angel Goberna has a total of 94 co-authors. Here are the top co-authors by number of shared publications:
- Marco Antonio López
Department of Mathematics, University of Alicante, San Vicente del Raspeig, Spain
34 shared publications - Michel Volle
Avignon University, Avignon, France
16 shared publications - Nguyen Dinh
International University, Vietnam National University - HCMC, Ho Chi Minh City, Vietnam
11 shared publications - Vaithilingam Jeyakumar
Department of Applied Mathematics, University of New South Wales, Sydney, Australia
10 shared publications - Guoyin Li
Department of Applied Mathematics, University of New South Wales, Sydney, Australia
8 shared publications M.I. Todorov
8 shared publications
Latest Publications
- 26 September 2026
- Published by Springer Nature in TOP
- p. 1-22
Robust generalized S-procedure revisited with applications to robust optimization problems
- 26 September 2026
- Published by Springer Nature in TOP
- p. 1-22
Robust generalized S-procedure revisited with applications to robust optimization problems
- Open Access
Robust generalized S-Procedure
We introduce in this paper the so-called robust generalized S-procedure associated with a given robust optimization problem. We provide a primal characterization for the validity of this procedure as well as a dual characterization under the assumption that the decision space is locally convex. We also analyze an extension of the mentioned robust S-procedure that incorporates a right-hand side function.
Open AccessRobust generalized S-Procedure
We introduce in this paper the so-called robust generalized S-procedure associated with a given robust optimization problem. We provide a primal characterization for the validity of this procedure as well as a dual characterization under the assumption that the decision space is locally convex. We also analyze an extension of the mentioned robust S-procedure that incorporates a right-hand side function.
- Open Access
- 22 August 2025
- Published by Springer Nature in Set-Valued and Variational Analysis
- Vol. 33 (3) , 1-24
Primal and Dual Characterizations for Farkas Type Lemmas in Terms of Closedness Criteria
This paper deals with the characterization, in terms of closedness of certain sets regarding other sets, of Farkas lemmas determining when the upperlevel set of a convex function $f$ contains a set of the form $C\cap \mathbb{A}^{-1}\left ( D\right ) $ , where $C$ and $D$ are convex sets (not necessarily cones) in locally convex spaces $X$ (with topological dual $X^{\prime }$ ) and $Y$ , respectively, while $\mathbb{A}$ is a continuous linear operator from $X$ to $Y$ . More in detail, each of the mentioned characterizations of Farkas type lemmas consists in the closedness of certain subset of either one of the “primal” spaces $X\times Y\times \mathbb{R}$ and $Y\times \mathbb{R}$ , or of the “dual” space $X^{\prime }\times \mathbb{R}$ , regarding some singleton set of the corresponding space. Moreover, the paper also provides an existence theorem for the feasible set $C\cap \mathbb{A}^{-1}\left ( D\right ) $ in terms of the closedness of certain subset of the dual space $X^{\prime }\times \mathbb{R}$ regarding the singleton set formed by the null element. These results are illustrated with significant applications to constrained convex minimization problems and to functional approximation by polynomials.- 22 August 2025
- Published by Springer Nature in Set-Valued and Variational Analysis
- Vol. 33 (3) , 1-24
Open AccessPrimal and Dual Characterizations for Farkas Type Lemmas in Terms of Closedness Criteria
This paper deals with the characterization, in terms of closedness of certain sets regarding other sets, of Farkas lemmas determining when the upperlevel set of a convex function $f$ contains a set of the form $C\cap \mathbb{A}^{-1}\left ( D\right ) $ , where $C$ and $D$ are convex sets (not necessarily cones) in locally convex spaces $X$ (with topological dual $X^{\prime }$ ) and $Y$ , respectively, while $\mathbb{A}$ is a continuous linear operator from $X$ to $Y$ . More in detail, each of the mentioned characterizations of Farkas type lemmas consists in the closedness of certain subset of either one of the “primal” spaces $X\times Y\times \mathbb{R}$ and $Y\times \mathbb{R}$ , or of the “dual” space $X^{\prime }\times \mathbb{R}$ , regarding some singleton set of the corresponding space. Moreover, the paper also provides an existence theorem for the feasible set $C\cap \mathbb{A}^{-1}\left ( D\right ) $ in terms of the closedness of certain subset of the dual space $X^{\prime }\times \mathbb{R}$ regarding the singleton set formed by the null element. These results are illustrated with significant applications to constrained convex minimization problems and to functional approximation by polynomials. - Open Access
Primal and Dual Characterizations for Farkas type Lemmas in Terms of Closedness Criteria
This paper deals with the characterization, in terms of closedness of certain sets regarding other sets, of Farkas lemmas determining when the upperlevel set of a given convex function contains the intersection, say F, of a convex set of a locally convex space X with the inverse image by a continuous linear operator from X to another locally convex space Y of certain convex subset of Y. More in detail, each of the mentioned characterizations of Farkas type lemmas consists in the closedness of certain subset of either one of the "primal" spaces XxYxR and YxR, or of the "dual" space X'xR, regarding some singleton set of the corresponding space. Moreover, the paper also provides an existence theorem for the feasible set F in terms of the closedness of certain subset of the dual space X'xR regarding the singleton set formed by the null element. These results are illustrated with significant applications.
Open AccessPrimal and Dual Characterizations for Farkas type Lemmas in Terms of Closedness Criteria
This paper deals with the characterization, in terms of closedness of certain sets regarding other sets, of Farkas lemmas determining when the upperlevel set of a given convex function contains the intersection, say F, of a convex set of a locally convex space X with the inverse image by a continuous linear operator from X to another locally convex space Y of certain convex subset of Y. More in detail, each of the mentioned characterizations of Farkas type lemmas consists in the closedness of certain subset of either one of the "primal" spaces XxYxR and YxR, or of the "dual" space X'xR, regarding some singleton set of the corresponding space. Moreover, the paper also provides an existence theorem for the feasible set F in terms of the closedness of certain subset of the dual space X'xR regarding the singleton set formed by the null element. These results are illustrated with significant applications.
- Open Access
- 21 July 2024
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 203 (2) , 1509-1530
The Stability of Robustness for Conic Linear Programs with Uncertain Data
The robust counterpart of a given conic linear program with uncertain data in the constraints is defined as the robust conic linear program that arises from replacing the nominal feasible set by the robust feasible set of points that remain feasible for any possible perturbation of the data within an uncertainty set. Any minor changes in the size of the uncertainty set can result in significant changes, for instance, in the robust feasible set, robust optimal value and the robust optimal set. The concept of quantifying the extent of these deviations is referred to as the stability of robustness. This paper establishes conditions for the stability of robustness under which minor changes in the size of the uncertainty sets lead to only minor changes in the robust feasible set of a given linear program with cone constraints and ball uncertainty sets.
- 21 July 2024
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 203 (2) , 1509-1530
Open AccessThe Stability of Robustness for Conic Linear Programs with Uncertain Data
The robust counterpart of a given conic linear program with uncertain data in the constraints is defined as the robust conic linear program that arises from replacing the nominal feasible set by the robust feasible set of points that remain feasible for any possible perturbation of the data within an uncertainty set. Any minor changes in the size of the uncertainty set can result in significant changes, for instance, in the robust feasible set, robust optimal value and the robust optimal set. The concept of quantifying the extent of these deviations is referred to as the stability of robustness. This paper establishes conditions for the stability of robustness under which minor changes in the size of the uncertainty sets lead to only minor changes in the robust feasible set of a given linear program with cone constraints and ball uncertainty sets.
- 6 April 2024
- Published by Springer Nature
- p. 111-133
Vector Optimization (or How to Make Insurmountable Decisions)
- 6 April 2024
- Published by Springer Nature
- p. 111-133
Vector Optimization (or How to Make Insurmountable Decisions)
- 6 April 2024
- Published by Springer Nature
- p. 43-70
Feasibility (or How to Meet Requirements)
- 6 April 2024
- Published by Springer Nature
- p. 71-110
Scalar Optimization (or How to Make the Best Decision)
- 6 April 2024
- Published by Springer Nature
- p. 71-110
Scalar Optimization (or How to Make the Best Decision)
- 6 April 2024
- Published by Springer Nature
- p. 1-42
Mathematical Tools for Political Decision-Making
- 6 April 2024
- Published by Springer Nature
- p. 169-195
The Impact of Political Decisions on Mathematics