M. J. Cánovas
YOU?
Author Swipe
View article: Lipschitz Stability in Convex Optimization
Lipschitz Stability in Convex Optimization Open
This work is concerned with the quantitative stability of the feasible and optimal solutions of convex semi-infinite optimization problems in different parametric settings. Regarding the constraint system, we deal with convex inequalities …
View article: Lipschitz upper semicontinuity of linear inequality systems under full perturbations
Lipschitz upper semicontinuity of linear inequality systems under full perturbations Open
The present paper is focused on the computation of the Lipschitz upper semicontinuity modulus of the feasible set mapping in the context of fully perturbed linear inequality systems; i.e., where all coefficients are allowed to be perturbed…
View article: Feasibility problems via paramonotone operators in a convex setting
Feasibility problems via paramonotone operators in a convex setting Open
This paper is focussed on some properties of paramonotone operators on Banach spaces and their application to certain feasibility problems for convex sets in a Hilbert space and convex systems in the Euclidean space. In particular, it show…
View article: Hoffman constant of the argmin mapping in linear optimization
Hoffman constant of the argmin mapping in linear optimization Open
The main contribution of this paper consists of providing an explicit formula to compute the Hoffman constant of the argmin mapping in linear optimization. The work is developed in the context of right-hand side perturbations of the constr…
View article: Feasibility problems via paramonotone operators in a convex setting
Feasibility problems via paramonotone operators in a convex setting Open
This paper is focused on some properties of paramonotone operators on Banach spaces and their application to certain feasibility problems for convex sets in a Hilbert space and convex systems in the Euclidean space. In particular, it shows…
View article: Robust and continuous metric subregularity for linear inequality systems
Robust and continuous metric subregularity for linear inequality systems Open
View article: From Calmness to Hoffman Constants for Linear Semi-infinite Inequality Systems
From Calmness to Hoffman Constants for Linear Semi-infinite Inequality Systems Open
In this paper we focus on different---global, semilocal, and local---versions of Hoffman-type inequalities expressed in a variational form. In a first stage our analysis is developed for generic multifunctions between metric spaces, and we…
View article: Stability and Sensitivity of Uncertain Linear Programs
Stability and Sensitivity of Uncertain Linear Programs Open
The present paper deals with uncertain linear optimization problems where the objective function coefficient vector belongs to a compact convex uncertainty set and the feasible set is described by a linear semi-infinite inequality system (…
View article: Lipschitz upper semicontinuity in linear optimization via local directional convexity
Lipschitz upper semicontinuity in linear optimization via local directional convexity Open
This work is focussed on computing the Lipschitz upper semicontinuity modulus of the argmin mapping for canonically perturbed linear programs. The immediate antecedent can be traced out from Camacho J et al. [2022. From calmness to Hoffman…
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: Projection-Based Local and Global Lipschitz Moduli of the Optimal Value in Linear Programming
Projection-Based Local and Global Lipschitz Moduli of the Optimal Value in Linear Programming Open
View article: From calmness to Hoffman constants for linear semi-infinite inequality systems
From calmness to Hoffman constants for linear semi-infinite inequality systems Open
In this paper we focus on different -- global, semi-local and local -- versions of Hoffman type inequalities expressed in a variational form. In a first stage our analysis is developed for generic multifunctions between metric spaces and w…
View article: From calmness to Hoffman constants for linear inequality systems
From calmness to Hoffman constants for linear inequality systems Open
In this paper we deal with (finite) linear inequality systems parameterized by their right-hand side. We show that the sharp Hoffman constant at a given nominal parameter may be expressed as the maximum of the calmness moduli of the feasib…
View article: Calmness of Linear Constraint Systems under Structured Perturbations with an Application to the Path-Following Scheme
Calmness of Linear Constraint Systems under Structured Perturbations with an Application to the Path-Following Scheme Open
We are concerned with finite linear constraint systems in a parametric framework where the right-hand side is an affine function of the perturbation parameter. Such structured perturbations provide a unified framework for different paramet…
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: Lipschitz lower semicontinuity moduli for linear inequality systems
Lipschitz lower semicontinuity moduli for linear inequality systems Open
View article: Preface to the Special Issue Dedicated to Marco A. López’s 70th Birthday
Preface to the Special Issue Dedicated to Marco A. López’s 70th Birthday Open
View article: Marco A. López, a Pioneer of Continuous Optimization in Spain
Marco A. López, a Pioneer of Continuous Optimization in Spain Open
View article: Preface of the Special Issue Error Bounds, Regularity, and Nonsmooth Optimization
Preface of the Special Issue Error Bounds, Regularity, and Nonsmooth Optimization Open
View article: Marco A. López, a Pioneer of Continuous Optimization in Spain
Marco A. López, a Pioneer of Continuous Optimization in Spain 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…
View article: Lipschitz Modulus of the Optimal Value in Linear Programming
Lipschitz Modulus of the Optimal Value in Linear Programming Open
View article: Calmness of the Optimal Value in Linear Programming
Calmness of the Optimal Value in Linear Programming Open
This research has been partially supported by grant MTM2014-59179-C2-2-P from MINECO, Spain, and FEDER "Una manera de hacer Europa," European Union.
View article: Calmness modulus of fully perturbed linear programs
Calmness modulus of fully perturbed linear programs Open
This paper provides operative point-based formulas (only involving the nominal data, and not data in a neighborhood) for computing or estimating the calmness modulus of the optimal set (argmin) mapping in linear optimization under uniquene…
View article: Critical objective size and calmness modulus in linear programming
Critical objective size and calmness modulus in linear programming Open
This paper introduces the concept of critical objective size associated with a linear program in order to provide operative point-based formulas (only involving the nominal data, and not data in a neighborhood) for computing or estimating …
View article: Outer limit of subdifferentials and calmness moduli in linear and nonlinear programming
Outer limit of subdifferentials and calmness moduli in linear and nonlinear programming Open
With a common background and motivation, the main contributions of this paper are developed in two different directions. Firstly, we are concerned with functions which are the maximum of a finite amount of continuously differentiable funct…