11Goberna, Miguel
9Parra, Juan
8Cánovas, Maria
5Correa, Rafael
5Dinh, Nguyen
5Kruger, Alexander
5Volle, Michel
4Hantoute, Abderrahim
3Vera De Serio, Virginia
2Beer, Gerald
2Mo, T. H.
2Pérez-Aros, Pedro
2Ridolfi, Andrea
2Rubinov, Alex
2Théra, Michel
1Auslender, Alfred
1Correa, R.
1Correa, Rafeal
1Cánovas, M. J.

Show More

Show Less

210102 Applied Mathematics
170103 Numerical and Computational Mathematics
80101 Pure Mathematics
50906 Electrical and Electronic Engineering
5Linear programming
5Stability
4Convex functions
4Feasible set mapping
4Semi-infinite programming
3Normal cone
3Subdifferential
3Variational analysis
20802 Computation Theory and Mathematics
24901 Applied mathematics
2Asplund space
2Block perturbations
2Calmness
2Convex optimization
2Convex semi-infinite programming
2DC functions

Show More

Show Less

Format Type

A note on primal-dual stability in infinite linear programming

- Goberna, Miguel, López, Marco, Ridolfi, Andrea, Vera de Serio, Virginia

**Authors:**Goberna, Miguel , López, Marco , Ridolfi, Andrea , Vera de Serio, Virginia**Date:**2020**Type:**Text , Journal article**Relation:**Optimization Letters Vol. 14, no. 8 (2020), p. 2247-2263**Full Text:**false**Reviewed:****Description:**In this note we analyze the simultaneous preservation of the consistency (and of the inconsistency) of linear programming problems posed in infinite dimensional Banach spaces, and their corresponding dual problems, under sufficiently small perturbations of the data. We consider seven different scenarios associated with the different possibilities of perturbations of the data (the objective functional, the constraint functionals, and the right hand-side function), i.e., which of them are known, and remain fixed, and which ones can be perturbed because of their uncertainty. The obtained results allow us to give sufficient and necessary conditions for the coincidence of the optimal values of both problems and for the stability of the duality gap under the same type of perturbations. There appear substantial differences with the finite dimensional case due to the distinct topological properties of cones in finite and infinite dimensional Banach spaces. © 2020, Springer-Verlag GmbH Germany, part of Springer Nature.**Description:**Funding details: Australian Research Council, ARC, DP180100602: http://purl.org/au-research/grants/arc/DP180100602

A uniform approach to hölder calmness of subdifferentials

- Beer, Gerald, Cánovas, Maria, López, Marco, Parra, Juan

**Authors:**Beer, Gerald , Cánovas, Maria , López, Marco , Parra, Juan**Date:**2020**Type:**Text , Journal article**Relation:**Journal of Convex Analysis Vol. 27, no. 1 (2020), p.**Relation:**http://purl.org/au-research/grants/arc/DP160100854**Full Text:**false**Reviewed:****Description:**For finite-valued convex functions f defined on the n-dimensional Euclidean space, we are interested in the set-valued mapping assigning to each pair (f, x) the subdifferential of f at x. Our approach is uniform with respect to f in the sense that it involves pairs of functions close enough to each other, but not necessarily around a nominal function. More precisely, we provide lower and upper estimates, in terms of Hausdorff excesses, of the subdifferential of one of such functions at a nominal point in terms of the subdifferential of nearby functions in a ball centered in such a point. In particular, we obtain the (1/2) - Hölder calmness of our mapping at a nominal pair (f, x) under the assumption that the subdifferential mapping viewed as a set-valued mapping from Rn to Rn with f fixed is calm at each point of {x} × ∂f(x). © Heldermann Verlag**Description:**Funding details: Australian Research Council, ARC, DP160100854 Funding details: European Commission, EU Funding details: Ministerio de Economía y Competitividad, MINECO Funding details: Federación Española de Enfermedades Raras, FEDER Funding text 1:

A unifying approach to robust convex infinite optimization duality

- Dinh, Nguyen, Goberna, Miguel, López, Marco, Volle, Michel

**Authors:**Dinh, Nguyen , Goberna, Miguel , López, Marco , Volle, Michel**Date:**2017**Type:**Text , Journal article**Relation:**Journal of Optimization Theory and Applications Vol. 174, no. 3 (2017), p. 650-685**Relation:**http://purl.org/au-research/grants/arc/DP160100854**Full Text:****Reviewed:****Description:**This paper considers an uncertain convex optimization problem, posed in a locally convex decision space with an arbitrary number of uncertain constraints. To this problem, where the uncertainty only affects the constraints, we associate a robust (pessimistic) counterpart and several dual problems. The paper provides corresponding dual variational principles for the robust counterpart in terms of the closed convexity of different associated cones.

**Authors:**Dinh, Nguyen , Goberna, Miguel , López, Marco , Volle, Michel**Date:**2017**Type:**Text , Journal article**Relation:**Journal of Optimization Theory and Applications Vol. 174, no. 3 (2017), p. 650-685**Relation:**http://purl.org/au-research/grants/arc/DP160100854**Full Text:****Reviewed:****Description:**This paper considers an uncertain convex optimization problem, posed in a locally convex decision space with an arbitrary number of uncertain constraints. To this problem, where the uncertainty only affects the constraints, we associate a robust (pessimistic) counterpart and several dual problems. The paper provides corresponding dual variational principles for the robust counterpart in terms of the closed convexity of different associated cones.

Alternative representations of the normal cone to the domain of supremum functions and subdifferential calculus

- Correa, R., Hantoute, A., López, Marco

**Authors:**Correa, R. , Hantoute, A. , López, Marco**Date:**2021**Type:**Text , Journal article**Relation:**Set-Valued and Variational Analysis Vol. 29, no. 3 (2021), p. 683-699**Relation:**http://purl.org/au-research/grants/arc/DP180100602**Full Text:****Reviewed:****Description:**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 subdifferential of the supremum function, which use both the active and nonactive functions at the reference point. Only the data functions are involved in these characterizations, the active ones from one side, together with the nonactive functions multiplied by some appropriate parameters. In contrast with previous works in the literature, the main feature of our subdifferential characterization is that the normal cone to the effective domain of the supremum (or to finite-dimensional sections of this domain) does not appear. A new type of optimality conditions for convex optimization is established at the end of the paper. © 2021, The Author(s), under exclusive licence to Springer Nature B.V.

**Authors:**Correa, R. , Hantoute, A. , López, Marco**Date:**2021**Type:**Text , Journal article**Relation:**Set-Valued and Variational Analysis Vol. 29, no. 3 (2021), p. 683-699**Relation:**http://purl.org/au-research/grants/arc/DP180100602**Full Text:****Reviewed:****Description:**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 subdifferential of the supremum function, which use both the active and nonactive functions at the reference point. Only the data functions are involved in these characterizations, the active ones from one side, together with the nonactive functions multiplied by some appropriate parameters. In contrast with previous works in the literature, the main feature of our subdifferential characterization is that the normal cone to the effective domain of the supremum (or to finite-dimensional sections of this domain) does not appear. A new type of optimality conditions for convex optimization is established at the end of the paper. © 2021, The Author(s), under exclusive licence to Springer Nature B.V.

Best approximate solutions of inconsistent linear inequality systems

- Goberna, Miguel, Hiriart-Urruty, Jean-Baptiste, López, Marco

**Authors:**Goberna, Miguel , Hiriart-Urruty, Jean-Baptiste , López, Marco**Date:**2018**Type:**Text , Journal article**Relation:**Vietnam Journal of Mathematics Vol. 46, no. 2 (2018), p. 271-284**Relation:**http://purl.org/au-research/grants/arc/DP160100854**Full Text:****Reviewed:****Description:**This paper is intended to characterize three types of best approximate solutions for inconsistent linear inequality systems with an arbitrary number of constraints. It also gives conditions guaranteeing the existence of best uniform solutions and discusses potential applications.

**Authors:**Goberna, Miguel , Hiriart-Urruty, Jean-Baptiste , López, Marco**Date:**2018**Type:**Text , Journal article**Relation:**Vietnam Journal of Mathematics Vol. 46, no. 2 (2018), p. 271-284**Relation:**http://purl.org/au-research/grants/arc/DP160100854**Full Text:****Reviewed:****Description:**This paper is intended to characterize three types of best approximate solutions for inconsistent linear inequality systems with an arbitrary number of constraints. It also gives conditions guaranteeing the existence of best uniform solutions and discusses potential applications.

Calmness modulus of linear semi-infinite programs

- Cánovas, Maria, Kruger, Alexander, López, Marco, Parra, Juan, Théra, Michel

**Authors:**Cánovas, Maria , Kruger, Alexander , López, Marco , Parra, Juan , Théra, Michel**Date:**2014**Type:**Text , Journal article**Relation:**SIAM Journal on Optimization Vol. 24, no. 1 (2014), p. 29-48**Relation:**http://purl.org/au-research/grants/arc/DP110102011**Full Text:****Reviewed:****Description:**Our main goal is to compute or estimate the calmness modulus of the argmin mapping of linear semi-infinite optimization problems under canonical perturbations, i.e., perturbations of the objective function together with continuous perturbations of the right-hand side of the constraint system (with respect to an index ranging in a compact Hausdorff space). Specifically, we provide a lower bound on the calmness modulus for semi-infinite programs with unique optimal solution which turns out to be the exact modulus when the problem is finitely constrained. The relationship between the calmness of the argmin mapping and the same property for the (sub)level set mapping (with respect to the objective function), for semi-infinite programs and without requiring the uniqueness of the nominal solution, is explored, too, providing an upper bound on the calmness modulus of the argmin mapping. When confined to finitely constrained problems, we also provide a computable upper bound as it only relies on the nominal data and parameters, not involving elements in a neighborhood. Illustrative examples are provided.

**Authors:**Cánovas, Maria , Kruger, Alexander , López, Marco , Parra, Juan , Théra, Michel**Date:**2014**Type:**Text , Journal article**Relation:**SIAM Journal on Optimization Vol. 24, no. 1 (2014), p. 29-48**Relation:**http://purl.org/au-research/grants/arc/DP110102011**Full Text:****Reviewed:****Description:**Our main goal is to compute or estimate the calmness modulus of the argmin mapping of linear semi-infinite optimization problems under canonical perturbations, i.e., perturbations of the objective function together with continuous perturbations of the right-hand side of the constraint system (with respect to an index ranging in a compact Hausdorff space). Specifically, we provide a lower bound on the calmness modulus for semi-infinite programs with unique optimal solution which turns out to be the exact modulus when the problem is finitely constrained. The relationship between the calmness of the argmin mapping and the same property for the (sub)level set mapping (with respect to the objective function), for semi-infinite programs and without requiring the uniqueness of the nominal solution, is explored, too, providing an upper bound on the calmness modulus of the argmin mapping. When confined to finitely constrained problems, we also provide a computable upper bound as it only relies on the nominal data and parameters, not involving elements in a neighborhood. Illustrative examples are provided.

Calmness of partially perturbed linear systems with an application to the central path

- Cánovas, Maria, Hall, Julian, López, Marco, Parra, Juan

**Authors:**Cánovas, Maria , Hall, Julian , López, Marco , Parra, Juan**Date:**2019**Type:**Text , Journal article**Relation:**Optimization Vol. 68, no. 2-3 (2019), p. 465-483**Full Text:****Reviewed:****Description:**In this paper we develop point-based formulas for the calmness modulus of the feasible set mapping in the context of linear inequality systems with a fixed abstract constraint and (partially) perturbed linear constraints. The case of totally perturbed linear systems was previously analyzed in [Canovas MJ, Lopez MA, Parra J, et al. Calmness of the feasible set mapping for linear inequality systems. Set-Valued Var Anal. 2014;22:375-389, Section 5]. We point out that the presence of such an abstract constraint yields the current paper to appeal to a notable different methodology with respect to previous works on the calmness modulus in linear programming. The interest of this model comes from the fact that partially perturbed systems naturally appear in many applications. As an illustration, the paper includes an example related to the classical central path construction. In this example we consider a certain feasible set mapping whose calmness modulus provides a measure of the convergence of the central path. Finally, we underline the fact that the expression for the calmness modulus obtained in this paper is (conceptually) implementable as far as it only involves the nominal data.

**Authors:**Cánovas, Maria , Hall, Julian , López, Marco , Parra, Juan**Date:**2019**Type:**Text , Journal article**Relation:**Optimization Vol. 68, no. 2-3 (2019), p. 465-483**Full Text:****Reviewed:****Description:**In this paper we develop point-based formulas for the calmness modulus of the feasible set mapping in the context of linear inequality systems with a fixed abstract constraint and (partially) perturbed linear constraints. The case of totally perturbed linear systems was previously analyzed in [Canovas MJ, Lopez MA, Parra J, et al. Calmness of the feasible set mapping for linear inequality systems. Set-Valued Var Anal. 2014;22:375-389, Section 5]. We point out that the presence of such an abstract constraint yields the current paper to appeal to a notable different methodology with respect to previous works on the calmness modulus in linear programming. The interest of this model comes from the fact that partially perturbed systems naturally appear in many applications. As an illustration, the paper includes an example related to the classical central path construction. In this example we consider a certain feasible set mapping whose calmness modulus provides a measure of the convergence of the central path. Finally, we underline the fact that the expression for the calmness modulus obtained in this paper is (conceptually) implementable as far as it only involves the nominal data.

Calmness of the feasible set mapping for linear inequality systems

- Cánovas, Maria, López, Marco, Parra, Juan, Toledo, Javier

**Authors:**Cánovas, Maria , López, Marco , Parra, Juan , Toledo, Javier**Date:**2014**Type:**Text , Journal article**Relation:**Set-Valued and Variational Analysis Vol. 22, no. 2 (2014), p. 375-389**Relation:**http://purl.org/au-research/grants/arc/DP110102011**Full Text:**false**Reviewed:****Description:**In this paper we deal with parameterized linear inequality systems in the n-dimensional Euclidean space, whose coefficients depend continuosly on an index ranging in a compact Hausdorff space. The paper is developed in two different parametric settings: the one of only right-hand-side perturbations of the linear system, and that in which both sides of the system can be perturbed. Appealing to the backgrounds on the calmness property, and exploiting the specifics of the current linear structure, we derive different characterizations of the calmness of the feasible set mapping, and provide an operative expresion for the calmness modulus when confined to finite systems. In the paper, the role played by the Abadie constraint qualification in relation to calmness is clarified, and illustrated by different examples. We point out that this approach has the virtue of tackling the calmness property exclusively in terms of the system's data.

Characterizations of robust and stable duality for linearly perturbed uncertain optimization problems

- Dinh, Nguyen, Goberna, Miguel, López, Marco, Volle, Michel

**Authors:**Dinh, Nguyen , Goberna, Miguel , López, Marco , Volle, Michel**Date:**2020**Type:**Text , Conference paper**Relation:**Jonathan Borwein Commemorative Conference, JBCC 2017 Vol. 313, p. 43-74**Relation:**http://purl.org/au-research/grants/arc/DP180100602**Full Text:****Reviewed:****Description:**We introduce a robust optimization model consisting in a family of perturbation functions giving rise to certain pairs of dual optimization problems in which the dual variable depends on the uncertainty parameter. The interest of our approach is illustrated by some examples, including uncertain conic optimization and infinite optimization via discretization. The main results characterize desirable robust duality relations (as robust zero-duality gap) by formulas involving the epsilon-minima or the epsilon-subdifferentials of the objective function. The two extreme cases, namely, the usual perturbational duality (without uncertainty), and the duality for the supremum of functions (duality parameter vanishing) are analyzed in detail. © Springer Nature Switzerland AG 2020.

**Authors:**Dinh, Nguyen , Goberna, Miguel , López, Marco , Volle, Michel**Date:**2020**Type:**Text , Conference paper**Relation:**Jonathan Borwein Commemorative Conference, JBCC 2017 Vol. 313, p. 43-74**Relation:**http://purl.org/au-research/grants/arc/DP180100602**Full Text:****Reviewed:****Description:**We introduce a robust optimization model consisting in a family of perturbation functions giving rise to certain pairs of dual optimization problems in which the dual variable depends on the uncertainty parameter. The interest of our approach is illustrated by some examples, including uncertain conic optimization and infinite optimization via discretization. The main results characterize desirable robust duality relations (as robust zero-duality gap) by formulas involving the epsilon-minima or the epsilon-subdifferentials of the objective function. The two extreme cases, namely, the usual perturbational duality (without uncertainty), and the duality for the supremum of functions (duality parameter vanishing) are analyzed in detail. © Springer Nature Switzerland AG 2020.

Comparative study of RPSALG algorithm for convex semi-infinite programming

- Auslender, Alfred, Ferrer, Albert, Goberna, Miguel, López, Marco

**Authors:**Auslender, Alfred , Ferrer, Albert , Goberna, Miguel , López, Marco**Date:**2014**Type:**Text , Journal article**Relation:**Computational Optimization and Applications Vol. 60, no. 1 (2014), p. 59-87**Full Text:**false**Reviewed:****Description:**The Remez penalty and smoothing algorithm (RPSALG) is a unified framework for penalty and smoothing methods for solving min-max convex semi-infinite programing problems, whose convergence was analyzed in a previous paper of three of the authors. In this paper we consider a partial implementation of RPSALG for solving ordinary convex semi-infinite programming problems. Each iteration of RPSALG involves two types of auxiliary optimization problems: the first one consists of obtaining an approximate solution of some discretized convex problem, while the second one requires to solve a non-convex optimization problem involving the parametric constraints as objective function with the parameter as variable. In this paper we tackle the latter problem with a variant of the cutting angle method called ECAM, a global optimization procedure for solving Lipschitz programming problems. We implement different variants of RPSALG which are compared with the unique publicly available SIP solver, NSIPS, on a battery of test problems.

Convexity and closedness in stable robust duality

- Dinh, Nguyen, Goberna, Miguel, López, Marco, Volle, Michel

**Authors:**Dinh, Nguyen , Goberna, Miguel , López, Marco , Volle, Michel**Date:**2019**Type:**Text , Journal article**Relation:**Optimization Letters Vol. 13, no. 2 (2019), p. 325-339**Relation:**http://purl.org/au-research/grants/arc/DP160100854**Full Text:****Reviewed:****Description:**The paper deals with optimization problems with uncertain constraints and linear perturbations of the objective function, which are associated with given families of perturbation functions whose dual variable depends on the uncertainty parameters. More in detail, the paper provides characterizations of stable strong robust duality and stable robust duality under convexity and closedness assumptions. The paper also reviews the classical Fenchel duality of the sum of two functions by considering a suitable family of perturbation functions.

**Authors:**Dinh, Nguyen , Goberna, Miguel , López, Marco , Volle, Michel**Date:**2019**Type:**Text , Journal article**Relation:**Optimization Letters Vol. 13, no. 2 (2019), p. 325-339**Relation:**http://purl.org/au-research/grants/arc/DP160100854**Full Text:****Reviewed:****Description:**The paper deals with optimization problems with uncertain constraints and linear perturbations of the objective function, which are associated with given families of perturbation functions whose dual variable depends on the uncertainty parameters. More in detail, the paper provides characterizations of stable strong robust duality and stable robust duality under convexity and closedness assumptions. The paper also reviews the classical Fenchel duality of the sum of two functions by considering a suitable family of perturbation functions.

- Cánovas, Maria, López, Marco, Parra, Juan, Toledoa, Javier

**Authors:**Cánovas, Maria , López, Marco , Parra, Juan , Toledoa, Javier**Date:**2011**Type:**Text , Journal article**Relation:**Optimization Vol. 60, no. 7 (2011), p. 925-946**Relation:**http://purl.org/au-research/grants/arc/DP110102011**Full Text:**false**Reviewed:****Description:**This article extends some results of Cá novas et al. [M.J. Cá novas, M.A. Ló pez, J. Parra, and F.J. Toledo, Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems, Math. Prog. Ser. A 103 (2005), pp. 95-126.] about distance to ill-posedness (feasibility/ infeasibility) in three directions: From individual perturbations of inequalities to perturbations by blocks, from linear to convex inequalities and from finite- to infinite-dimensional (Banach) spaces of variables. The second of the referred directions, developed in the finite-dimensional case, was the original motivation of this article. In fact, after linearizing a convex system via the Fenchel-Legendre conjugate, affine perturbations of convex inequalities translate into block perturbations of the corresponding linearized system. We discuss the key role played by constant perturbations as an extreme case of block perturbations. We emphasize the fact that constant perturbations are enough to compute the distance to ill-posedness in the infinite-dimensional setting, as shown in the last part of this article, where some remarkable differences of infinite- versus finite-dimensional systems are presented. Throughout this article, the set indexing the constraints is arbitrary, with no topological structure. Accordingly, the functional dependence of the system coefficients on the index has no qualification at all.

Farkas-type results for vector-valued functions with applications

- Dinh, Nguyen, Goberna, Miguel, López, Marco, Mo, T. H.

**Authors:**Dinh, Nguyen , Goberna, Miguel , López, Marco , Mo, T. H.**Date:**2017**Type:**Text , Journal article**Relation:**Journal of Optimization Theory and Applications Vol. 173, no. 2 (2017), p. 357-390**Full Text:****Reviewed:****Description:**The main purpose of this paper consists of providing characterizations of the inclusion of the solution set of a given conic system posed in a real locally convex topological space into a variety of subsets of the same space defined by means of vector-valued functions. These Farkas-type results are used to derive characterizations of the weak solutions of vector optimization problems (including multiobjective and scalar ones), vector variational inequalities, and vector equilibrium problems.

**Authors:**Dinh, Nguyen , Goberna, Miguel , López, Marco , Mo, T. H.**Date:**2017**Type:**Text , Journal article**Relation:**Journal of Optimization Theory and Applications Vol. 173, no. 2 (2017), p. 357-390**Full Text:****Reviewed:****Description:**The main purpose of this paper consists of providing characterizations of the inclusion of the solution set of a given conic system posed in a real locally convex topological space into a variety of subsets of the same space defined by means of vector-valued functions. These Farkas-type results are used to derive characterizations of the weak solutions of vector optimization problems (including multiobjective and scalar ones), vector variational inequalities, and vector equilibrium problems.

From the Farkas lemma to the Hahn-Banach theorem

- Dinh, Nguyen, Goberna, Miguel, López, Marco, Mo, T. H.

**Authors:**Dinh, Nguyen , Goberna, Miguel , López, Marco , Mo, T. H.**Date:**2014**Type:**Text , Journal article**Relation:**SIAM Journal on Optimization Vol. 24, no. 2 (2014), p. 678-701**Full Text:****Reviewed:****Description:**This paper provides new versions of the Farkas lemma characterizing those inequalities of the form f(x) â‰¥ 0 which are consequences of a composite convex inequality (S Â° g)(x) â‰¤ 0 on a closed convex subset of a given locally convex topological vector space X, where f is a proper lower semicontinuous convex function defined on X, S is an extended sublinear function, and g is a vector-valued S-convex function. In parallel, associated versions of a stable Farkas lemma, considering arbitrary linear perturbations of f, are also given. These new versions of the Farkas lemma, and their corresponding stable forms, are established under the weakest constraint qualification conditions (the so-called closedness conditions), and they are actually equivalent to each other, as well as quivalent to an extended version of the so-called Hahn-Banach-Lagrange theorem, and its stable version, correspondingly. It is shown that any of them implies analytic and algebraic versions of the Hahn-Banach theorem and the Mazur-Orlicz theorem for extended sublinear functions.

**Authors:**Dinh, Nguyen , Goberna, Miguel , López, Marco , Mo, T. H.**Date:**2014**Type:**Text , Journal article**Relation:**SIAM Journal on Optimization Vol. 24, no. 2 (2014), p. 678-701**Full Text:****Reviewed:****Description:**This paper provides new versions of the Farkas lemma characterizing those inequalities of the form f(x) â‰¥ 0 which are consequences of a composite convex inequality (S Â° g)(x) â‰¤ 0 on a closed convex subset of a given locally convex topological vector space X, where f is a proper lower semicontinuous convex function defined on X, S is an extended sublinear function, and g is a vector-valued S-convex function. In parallel, associated versions of a stable Farkas lemma, considering arbitrary linear perturbations of f, are also given. These new versions of the Farkas lemma, and their corresponding stable forms, are established under the weakest constraint qualification conditions (the so-called closedness conditions), and they are actually equivalent to each other, as well as quivalent to an extended version of the so-called Hahn-Banach-Lagrange theorem, and its stable version, correspondingly. It is shown that any of them implies analytic and algebraic versions of the Hahn-Banach theorem and the Mazur-Orlicz theorem for extended sublinear functions.

Indexation strategies and calmness constants for uncertain linear inequality systems

- Cánovas, Maria, Henrion, René, López, Marco, Parra, Juan

**Authors:**Cánovas, Maria , Henrion, René , López, Marco , Parra, Juan**Date:**2018**Type:**Text , Book chapter**Relation:**The Mathematics of the Uncertain (part of the Studies in Systems, Decision and Control series) p. 831-843**Relation:**http://purl.org/au-research/grants/arc/DP160100854**Full Text:**false**Reviewed:****Description:**The present paper deals with uncertain linear inequality systems viewed as nonempty closed coefficient sets in the (n+ 1) -dimensional Euclidean space. The perturbation size of these uncertainty sets is measured by the (extended) Hausdorff distance. We focus on calmness constants—and their associated neighborhoods—for the feasible set mapping at a given point of its graph. To this aim, the paper introduces an appropriate indexation function which allows us to provide our aimed calmness constants through their counterparts in the setting of linear inequality systems with a fixed index set, where a wide background exists in the literature.

Isolated calmness and sharp minima via Hölder Graphical Derivatives

- Kruger, Alexander, López, Marco, Yang, Xiaoqi, Zhu, Jiangxing

**Authors:**Kruger, Alexander , López, Marco , Yang, Xiaoqi , Zhu, Jiangxing**Date:**2022**Type:**Text , Journal article**Relation:**Set-Valued and Variational Analysis Vol. 30, no. 4 (2022), p. 1423-1441**Relation:**https://purl.org/au-research/grants/arc/DP160100854**Full Text:****Reviewed:****Description:**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 sharp minimizers of some penalty functions for constrained optimization. © 2022, The Author(s).

**Authors:**Kruger, Alexander , López, Marco , Yang, Xiaoqi , Zhu, Jiangxing**Date:**2022**Type:**Text , Journal article**Relation:**Set-Valued and Variational Analysis Vol. 30, no. 4 (2022), p. 1423-1441**Relation:**https://purl.org/au-research/grants/arc/DP160100854**Full Text:****Reviewed:****Description:**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 sharp minimizers of some penalty functions for constrained optimization. © 2022, The Author(s).

Lipschitz modulus of linear and convex inequality systems with the Hausdorff metric

- Beer, Gerald, Cánovas, M. J., López, Marco, Parra, Juan

**Authors:**Beer, Gerald , Cánovas, M. J. , López, Marco , Parra, Juan**Date:**2021**Type:**Text , Journal article**Relation:**Mathematical Programming Vol. 189, no. 1-2 (2021), p. 75-98. https://purl.org/au-research/grants/arc/DP180100602**Relation:**http://purl.org/au-research/grants/arc/DP180100602**Full Text:****Reviewed:****Description:**This paper analyzes the Lipschitz behavior of the feasible set mapping associated with linear and convex inequality systems in Rn. To start with, we deal with the parameter space of linear (finite/semi-infinite) systems identified with the corresponding sets of coefficient vectors, which are assumed to be closed subsets of Rn+1. In this framework the size of perturbations is measured by means of the (extended) Hausdorff distance. A direct antecedent, extensively studied in the literature, comes from considering the parameter space of all linear systems with a fixed index set, T, where the Chebyshev (extended) distance is used to measure perturbations. In the present work we propose an appropriate indexation strategy which allows us to establish the equality of the Lipschitz moduli of the feasible set mappings in both parametric contexts, as well as to benefit from existing results in the Chebyshev setting for transferring them to the Hausdorff one. In a second stage, the possibility of perturbing directly the set of coefficient vectors of a linear system leads to new contributions on the Lipschitz behavior of convex systems via linearization techniques. © 2020, Springer-Verlag GmbH Germany, part of Springer Nature and Mathematical Optimization Society. Correction: The article “Lipschitz modulus of linear and convex inequality systems with the Hausdorff metric”, written by Beer,G., Cánovas, M.J., López, M.A., Parra, J.was originally published Online First without Open Access. After publication in volume 189, issue 1–2, page 75–98 the author decided to opt for Open Choice and to make the article an Open Access publication. Therefore, the copyright of the article has been changed to © The Author(s) 2020 and the article is forthwith distributed under the terms of the Creative Commons Attribution 4.0 International License. https://doi.org/10.1007/s10107-021-01751-x**Description:**This paper analyzes the Lipschitz behavior of the feasible set mapping associated with linear and convex inequality systems in Rn. To start with, we deal with the parameter space of linear (finite/semi-infinite) systems identified with the corresponding sets of coefficient vectors, which are assumed to be closed subsets of Rn+1. In this framework the size of perturbations is measured by means of the (extended) Hausdorff distance. A direct antecedent, extensively studied in the literature, comes from considering the parameter space of all linear systems with a fixed index set, T, where the Chebyshev (extended) distance is used to measure perturbations. In the present work we propose an appropriate indexation strategy which allows us to establish the equality of the Lipschitz moduli of the feasible set mappings in both parametric contexts, as well as to benefit from existing results in the Chebyshev setting for transferring them to the Hausdorff one. In a second stage, the possibility of perturbing directly the set of coefficient vectors of a linear system leads to new contributions on the Lipschitz behavior of convex systems via linearization techniques. © 2020, Springer-Verlag GmbH Germany, part of Springer Nature and Mathematical Optimization Society.

**Authors:**Beer, Gerald , Cánovas, M. J. , López, Marco , Parra, Juan**Date:**2021**Type:**Text , Journal article**Relation:**Mathematical Programming Vol. 189, no. 1-2 (2021), p. 75-98. https://purl.org/au-research/grants/arc/DP180100602**Relation:**http://purl.org/au-research/grants/arc/DP180100602**Full Text:****Reviewed:****Description:**This paper analyzes the Lipschitz behavior of the feasible set mapping associated with linear and convex inequality systems in Rn. To start with, we deal with the parameter space of linear (finite/semi-infinite) systems identified with the corresponding sets of coefficient vectors, which are assumed to be closed subsets of Rn+1. In this framework the size of perturbations is measured by means of the (extended) Hausdorff distance. A direct antecedent, extensively studied in the literature, comes from considering the parameter space of all linear systems with a fixed index set, T, where the Chebyshev (extended) distance is used to measure perturbations. In the present work we propose an appropriate indexation strategy which allows us to establish the equality of the Lipschitz moduli of the feasible set mappings in both parametric contexts, as well as to benefit from existing results in the Chebyshev setting for transferring them to the Hausdorff one. In a second stage, the possibility of perturbing directly the set of coefficient vectors of a linear system leads to new contributions on the Lipschitz behavior of convex systems via linearization techniques. © 2020, Springer-Verlag GmbH Germany, part of Springer Nature and Mathematical Optimization Society. Correction: The article “Lipschitz modulus of linear and convex inequality systems with the Hausdorff metric”, written by Beer,G., Cánovas, M.J., López, M.A., Parra, J.was originally published Online First without Open Access. After publication in volume 189, issue 1–2, page 75–98 the author decided to opt for Open Choice and to make the article an Open Access publication. Therefore, the copyright of the article has been changed to © The Author(s) 2020 and the article is forthwith distributed under the terms of the Creative Commons Attribution 4.0 International License. https://doi.org/10.1007/s10107-021-01751-x**Description:**This paper analyzes the Lipschitz behavior of the feasible set mapping associated with linear and convex inequality systems in Rn. To start with, we deal with the parameter space of linear (finite/semi-infinite) systems identified with the corresponding sets of coefficient vectors, which are assumed to be closed subsets of Rn+1. In this framework the size of perturbations is measured by means of the (extended) Hausdorff distance. A direct antecedent, extensively studied in the literature, comes from considering the parameter space of all linear systems with a fixed index set, T, where the Chebyshev (extended) distance is used to measure perturbations. In the present work we propose an appropriate indexation strategy which allows us to establish the equality of the Lipschitz moduli of the feasible set mappings in both parametric contexts, as well as to benefit from existing results in the Chebyshev setting for transferring them to the Hausdorff one. In a second stage, the possibility of perturbing directly the set of coefficient vectors of a linear system leads to new contributions on the Lipschitz behavior of convex systems via linearization techniques. © 2020, Springer-Verlag GmbH Germany, part of Springer Nature and Mathematical Optimization Society.

Lower semicontinuity of the feasible set mapping of linear systems relative to their domains

- Daniilidis, Aris, Goberna, Miguel, López, Marco, Lucchetti, Roberto

**Authors:**Daniilidis, Aris , Goberna, Miguel , López, Marco , Lucchetti, Roberto**Date:**2013**Type:**Text , Journal article**Relation:**Set-Valued and Variational Analysis Vol. 21, no. 1 (2013), p. 67-92**Relation:**http://purl.org/au-research/grants/arc/DP110102011**Full Text:****Reviewed:****Description:**This paper deals with stability properties of the feasible set of linear inequality systems having a finite number of variables and an arbitrary number of constraints. Several types of perturbations preserving consistency are considered, affecting respectively, all of the data, the left-hand side data, or the right-hand side coefficients.

**Authors:**Daniilidis, Aris , Goberna, Miguel , López, Marco , Lucchetti, Roberto**Date:**2013**Type:**Text , Journal article**Relation:**Set-Valued and Variational Analysis Vol. 21, no. 1 (2013), p. 67-92**Relation:**http://purl.org/au-research/grants/arc/DP110102011**Full Text:****Reviewed:****Description:**This paper deals with stability properties of the feasible set of linear inequality systems having a finite number of variables and an arbitrary number of constraints. Several types of perturbations preserving consistency are considered, affecting respectively, all of the data, the left-hand side data, or the right-hand side coefficients.

Necessary and sufficient optimality conditions in DC semi-infinite programming

- Correa, Rafael, López, Marco, Pérez-Aros, Pedro

**Authors:**Correa, Rafael , López, Marco , Pérez-Aros, Pedro**Date:**2021**Type:**Text , Journal article**Relation:**SIAM Journal on Optimization Vol. 31, no. 1 (2021), p. 837-865**Full Text:****Reviewed:****Description:**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. Necessary and sufficient optimality conditions for these families of DC optimization problems are established, where some of these structural features are conveniently exploited. More precisely, we derive necessary and sufficient conditions for (global and local) optimality in DC semi-infinite programming and DC cone-constrained optimization, under natural constraint qualifications. Finally, a penalty approach to DC abstract programming problems is developed in the last section. © 2021 Society for Industrial and Applied Mathematics

**Authors:**Correa, Rafael , López, Marco , Pérez-Aros, Pedro**Date:**2021**Type:**Text , Journal article**Relation:**SIAM Journal on Optimization Vol. 31, no. 1 (2021), p. 837-865**Full Text:****Reviewed:****Description:**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. Necessary and sufficient optimality conditions for these families of DC optimization problems are established, where some of these structural features are conveniently exploited. More precisely, we derive necessary and sufficient conditions for (global and local) optimality in DC semi-infinite programming and DC cone-constrained optimization, under natural constraint qualifications. Finally, a penalty approach to DC abstract programming problems is developed in the last section. © 2021 Society for Industrial and Applied Mathematics

New glimpses on convex infinite optimization duality

- Goberna, Miguel, López, Marco, Volle, Michel

**Authors:**Goberna, Miguel , López, Marco , Volle, Michel**Date:**2015**Type:**Text , Journal article**Relation:**Revista de la Real Academia de Ciencias Exactas, Fisicas y Naturales - Serie A: Matematicas Vol. 109, no. 2 (2015), p. 431-450**Full Text:**false**Reviewed:****Description:**Given a convex optimization problem (P) in a locally convex topological vector space X with an arbitrary number of constraints, we consider three possible dual problems of (P), namely, the usual Lagrangian dual (D), the perturbational dual (Q), and the surrogate dual (Î”), the last one recently introduced in a previous paper of the authors (Goberna et al., J Convex Anal 21(4), 2014). As shown by simple examples, these dual problems may be all different. This paper provides conditions ensuring that (P)=max(D), (P)=max(Q), and (P)=max(Î”) (dual equality and existence of dual optimal solutions) in terms of the so-called closedness regarding to a set. Sufficient conditions guaranteeing (P)=sup(Q) (dual equality and existence of primal optimal solutions) are also provided, for the nominal problems and also for their perturbational relatives. The particular cases of convex semi-infinite optimization problems (in which either the number of constraints or the dimension of X, but not both, is finite) and linear infinite optimization problems are analyzed. Finally, some applications to the feasibility of convex inequality systems are described. © 2014, Springer-Verlag Italia.

Are you sure you would like to clear your session, including search history and login status?