Marco A. López
YOU?
Author Swipe
View article: Strong duality in infinite convex optimization
Strong duality in infinite convex optimization Open
We develop a methodology for closing duality gap and guaranteeing strong duality in infinite convex optimization. Specifically, we examine two new Lagrangian-type dual formulations involving infinitely many dual variables and infinite sums…
View article: Convex regularization and subdifferential calculus
Convex regularization and subdifferential calculus Open
This paper deals with the regularization of the sum of functions defined on a locally convex space through their closed-convex hulls in the bidual space. Different conditions guaranteeing that the closed-convex hull of the sum is the sum o…
View article: EM Characterization of a Compact RFQ Cold Model Prototype Employing a New Power Injection Scheme
EM Characterization of a Compact RFQ Cold Model Prototype Employing a New Power Injection Scheme Open
The experimental and computational characterization of a cold model prototype designed to test the electromagnetic properties of a new RFQ (Radio-Frequency Quadrupole) cavity is reported. This cavity is intended to be an essential part of …
View article: EM Characterization of a Compact RFQ Cold Model Prototype Employing a New Power Injection Scheme
EM Characterization of a Compact RFQ Cold Model Prototype Employing a New Power Injection Scheme Open
The experimental and computational characterization of a cold model prototype designed to test the electromagnetic properties of a new RFQ (Radio Frequency Quadrupole) cavity is reported. This cavity is intended to be an essential part of …
View article: Measuring the Stability. A Paradigmatic Problem in Optimization
Measuring the Stability. A Paradigmatic Problem in Optimization Open
This article aims to establish the fundamental notions on which stability analysis in optimization is based. It is a topic of singular importance in the analysis of any optimization problem, since the lack of stability can lead to serious …
View article: Convex regularization and subdifferential calculus
Convex regularization and subdifferential calculus Open
This paper deals with the regularization of the sum of functions defined on a locally convex spaces through their closed-convex hulls in the bidual space. Different conditions guaranteeing that the closed-convex hull of the sum is the sum …
View article: Optimality conditions and subdifferential calculus for infinite sums of functions
Optimality conditions and subdifferential calculus for infinite sums of functions Open
The paper extends the widely used in optimisation theory decoupling techniques to infinite collections of functions. Extended concepts of uniform lower semicontinuity and firm uniform lower semicontinuity are discussed. The main theorems g…
View article: Obituary for Georg J. Still (13 November 1951–15 December 2023)
Obituary for Georg J. Still (13 November 1951–15 December 2023) Open
View article: Conjugation-Based Approach to the $\varepsilon $-Subdifferential of Convex Suprema
Conjugation-Based Approach to the $\varepsilon $-Subdifferential of Convex Suprema Open
View article: Optimality Conditions in DC-Constrained Mathematical Programming Problems
Optimality Conditions in DC-Constrained Mathematical Programming Problems Open
View article: Robust and continuous metric subregularity for linear inequality systems
Robust and continuous metric subregularity for linear inequality systems Open
View article: Optimality conditions in DC constrained mathematical programming problems
Optimality conditions in DC constrained mathematical programming problems Open
This paper provides necessary and sufficient optimality conditions for abstract constrained mathematical programming problems in locally convex spaces under new qualification conditions. Our approach exploits the geometrical properties of …
View article: Isolated Calmness and Sharp Minima via Hölder Graphical Derivatives
Isolated Calmness and Sharp Minima via Hölder Graphical Derivatives Open
The paper utilizes Hölder graphical derivatives for characterizing Hölder strong subregularity, isolated calmness and sharp minimum. As applications, we characterize Hölder isolated calmness in linear semi-infinite optimization and Hölder …
View article: Correction to: Lipschitz modulus of linear and convex inequality systems with the Hausdorff metric
Correction to: Lipschitz modulus of linear and convex inequality systems with the Hausdorff metric Open
View article: Optimization, Convex and Variational Analysis – Volume II
Optimization, Convex and Variational Analysis – Volume II Open
View article: New Tour on the Subdifferential of Supremum via Finite Sums and Suprema
New Tour on the Subdifferential of Supremum via Finite Sums and Suprema Open
View article: Preface to “Optimization, Convex and Variational Analysis”
Preface to “Optimization, Convex and Variational Analysis” Open
View article: Relaxed Lagrangian duality in convex infinite optimization: reverse strong duality and optimality
Relaxed Lagrangian duality in convex infinite optimization: reverse strong duality and optimality Open
We associate with each convex optimization problem posed on some locally convex space with an infinite index set T, and a given non-empty family H formed by finite subsets of T, a suitable Lagrangian-Haar dual problem. We provide reverse H…
View article: Relaxed Lagrangian duality in convex infinite optimization: reverse\n strong duality and optimality
Relaxed Lagrangian duality in convex infinite optimization: reverse\n strong duality and optimality Open
We associate with each convex optimization problem posed on some locally\nconvex space with an infinite index set T, and a given non-empty family H\nformed by finite subsets of T, a suitable Lagrangian-Haar dual problem. We\nprovide revers…
View article: Relaxed Lagrangian duality in convex infinite optimization: reducibility and strong duality
Relaxed Lagrangian duality in convex infinite optimization: reducibility and strong duality Open
We associate with each convex optimization problem, posed on some locally convex space, with infinitely many constraints indexed by the set T, and a given non-empty family H of finite subsets of T, a suitable Lagrangian-Haar dual problem. …
View article: Alternative Representations of the Normal Cone to the Domain of Supremum Functions and Subdifferential Calculus
Alternative Representations of the Normal Cone to the Domain of Supremum Functions and Subdifferential Calculus Open
View article: Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming
Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming Open
This paper deals with particular families of DC optimization problems involving suprema of convex functions. We show that the specific structure of this type of function allows us to cover a variety of problems in nonconvex programming. Ne…
View article: Alternative representations of the normal cone to the domain of supremum functions and subdifferential calculus
Alternative representations of the normal cone to the domain of supremum functions and subdifferential calculus Open
The first part of the paper provides new characterizations of the normal cone to the effective domain of the supremum of an arbitrary family of convex functions. These results are applied in the second part to give new formulas for the sub…
View article: Subdifferential of the supremum function: moving back and forth between continuous and non-continuous settings
Subdifferential of the supremum function: moving back and forth between continuous and non-continuous settings Open
View article: Lipschitz modulus of linear and convex inequality systems with the Hausdorff metric
Lipschitz modulus of linear and convex inequality systems with the Hausdorff metric Open
This paper analyzes the Lipschitz behavior of the feasible set mapping associated with linear and convex inequality systems in $${\mathbb {R}}^{n}$$ . To start with, we deal with the parameter space of linear (finite/semi-infinite) sy…
View article: Subdifferential of the Supremum via Compactification of the Index Set
Subdifferential of the Supremum via Compactification of the Index Set Open
View article: Subdifferential of the supremum function: Moving back and forth between\n continuous and non-continuous settings
Subdifferential of the supremum function: Moving back and forth between\n continuous and non-continuous settings Open
In this paper we develop general formulas for the subdifferential of the\npointwise supremum of convex functions, which cover and unify both the compact\ncontinuous and the non-compact non-continuous settings. From the non-continuous\nto t…
View article: Characterizations of Robust and Stable Duality for Linearly Perturbed Uncertain Optimization Problems
Characterizations of Robust and Stable Duality for Linearly Perturbed Uncertain Optimization Problems Open
View article: Subdifferentials and Stability Analysis of Feasible Set and Pareto Front Mappings in Linear Multiobjective Optimization
Subdifferentials and Stability Analysis of Feasible Set and Pareto Front Mappings in Linear Multiobjective Optimization Open
The paper concerns multiobjective linear optimization problems in R^n that are parameterized with respect to the right-hand side perturbations of inequality constraints. Our focus is on measuring the variation of the feasible set and the P…
View article: Lipschitz modulus of linear and convex systems with the Hausdorff metric
Lipschitz modulus of linear and convex systems with the Hausdorff metric Open
This paper analyzes the Lipschitz behavior of the feasible set in two parametric settings, associated with linear and convex systems in R^n. To start with, we deal with the parameter space of linear (finite/semi-infinite) systems identifie…