Your selections:

10Goberna, Miguel
6Cánovas, Maria
6Parra, Juan
4Dinh, Nguyen
4Kruger, Alexander
4Volle, Michel
3Correa, Rafael
3Hantoute, Abderrahim
3Vera De Serio, Virginia
2Mo, T. H.
2Rubinov, Alex
2Théra, Michel
1Auslender, Alfred
1Daniilidis, Aris
1Ferrer, Albert
1Hall, Julian
1Henrion, René
1Hiriart-Urruty, Jean-Baptiste
1Lucchetti, Roberto

Show More

Show Less

180102 Applied Mathematics
140103 Numerical and Computational Mathematics
50101 Pure Mathematics
50906 Electrical and Electronic Engineering
5Stability
3Convex functions
3Feasible set mapping
3Linear programming
3Subdifferential
3Variational analysis
2Applications
2Asplund space
2Block perturbations
2Calmness
2Extremal principle
2Extremality
2Fenchel subdifferential
2Functions
2Increasing convex-along-rays functions
2Infinitely constrained optimization

Show More

Show Less

Format Type

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:**false**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.

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.

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.

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.

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.

On coderivatives and Lipschitzian properties of the dual pair in optimization

- López, Marco, Ridolfi, Andrea, Vera De Serio, Virginia

**Authors:**López, Marco , Ridolfi, Andrea , Vera De Serio, Virginia**Date:**2012**Type:**Text , Journal article**Relation:**Nonlinear Analysis, Theory, Methods and Applications Vol. 75, no. 3 (2012), p. 1461-1482**Full Text:**false**Reviewed:****Description:**In this paper, we apply the concept of coderivative and other tools from the generalized differentiation theory for set-valued mappings to study the stability of the feasible sets of both the primal and the dual problem in infinite-dimensional linear optimization with infinitely many explicit constraints and an additional conic constraint. After providing some specific duality results for our dual pair, we study the Lipschitz-like property of both mappings and also give bounds for the associated Lipschitz moduli. The situation for the dual shows much more involved than the case of the primal problem. Â© 2011 Elsevier Ltd. All rights reserved.

Perturbation of error bounds

- Kruger, Alexander, López, Marco, Théra, Michel

**Authors:**Kruger, Alexander , López, Marco , Théra, Michel**Date:**2018**Type:**Text , Journal article**Relation:**Mathematical Programming Vol. 168, no. 1-2 (2018), p. 533-554**Relation:**http://purl.org/au-research/grants/arc/DP160100854**Full Text:****Reviewed:****Description:**Our aim in the current article is to extend the developments in Kruger et al. (SIAM J Optim 20(6):3280–3296, 2010. doi:10.1137/100782206) and, more precisely, to characterize, in the Banach space setting, the stability of the local and global error bound property of inequalities determined by lower semicontinuous functions under data perturbations. We propose new concepts of (arbitrary, convex and linear) perturbations of the given function defining the system under consideration, which turn out to be a useful tool in our analysis. The characterizations of error bounds for families of perturbations can be interpreted as estimates of the ‘radius of error bounds’. The definitions and characterizations are illustrated by examples. © 2017, Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society.

**Authors:**Kruger, Alexander , López, Marco , Théra, Michel**Date:**2018**Type:**Text , Journal article**Relation:**Mathematical Programming Vol. 168, no. 1-2 (2018), p. 533-554**Relation:**http://purl.org/au-research/grants/arc/DP160100854**Full Text:****Reviewed:****Description:**Our aim in the current article is to extend the developments in Kruger et al. (SIAM J Optim 20(6):3280–3296, 2010. doi:10.1137/100782206) and, more precisely, to characterize, in the Banach space setting, the stability of the local and global error bound property of inequalities determined by lower semicontinuous functions under data perturbations. We propose new concepts of (arbitrary, convex and linear) perturbations of the given function defining the system under consideration, which turn out to be a useful tool in our analysis. The characterizations of error bounds for families of perturbations can be interpreted as estimates of the ‘radius of error bounds’. The definitions and characterizations are illustrated by examples. © 2017, Springer-Verlag Berlin Heidelberg and Mathematical Optimization Society.

Quantitative stability of linear infinite inequality systems under block perturbations with applications to convex systems

- Cánovas, Maria, López, Marco, Mordukhovich, Borris, Parra, Juan

**Authors:**Cánovas, Maria , López, Marco , Mordukhovich, Borris , Parra, Juan**Date:**2012**Type:**Text , Journal article**Relation:**TOP Vol. 20, no. 2 (2012), p. 310-327**Relation:**http://purl.org/au-research/grants/arc/DP110102011**Full Text:****Reviewed:****Description:**The original motivation for this paper was to provide an efficient quantitative analysis of convex infinite (or semi-infinite) inequality systems whose decision variables run over general infinite-dimensional (resp. finite-dimensional) Banach spaces and that are indexed by an arbitrary fixed set J. Parameter perturbations on the right-hand side of the inequalities are required to be merely bounded, and thus the natural parameter space is l∞(J). Our basic strategy consists of linearizing the parameterized convex system via splitting convex inequalities into linear ones by using the Fenchel-Legendre conjugate. This approach yields that arbitrary bounded right-hand side perturbations of the convex system turn on constant-by-blocks perturbations in the linearized system. Based on advanced variational analysis, we derive a precise formula for computing the exact Lipschitzian bound of the feasible solution map of block-perturbed linear systems, which involves only the system's data, and then show that this exact bound agrees with the coderivative norm of the aforementioned mapping. In this way we extend to the convex setting the results of Cánovas et al. (SIAM J. Optim. 20, 1504-1526, 2009) developed for arbitrary perturbations with no block structure in the linear framework under the boundedness assumption on the system's coefficients. The latter boundedness assumption is removed in this paper when the decision space is reflexive. The last section provides the aimed application to the convex case.

**Authors:**Cánovas, Maria , López, Marco , Mordukhovich, Borris , Parra, Juan**Date:**2012**Type:**Text , Journal article**Relation:**TOP Vol. 20, no. 2 (2012), p. 310-327**Relation:**http://purl.org/au-research/grants/arc/DP110102011**Full Text:****Reviewed:****Description:**The original motivation for this paper was to provide an efficient quantitative analysis of convex infinite (or semi-infinite) inequality systems whose decision variables run over general infinite-dimensional (resp. finite-dimensional) Banach spaces and that are indexed by an arbitrary fixed set J. Parameter perturbations on the right-hand side of the inequalities are required to be merely bounded, and thus the natural parameter space is l∞(J). Our basic strategy consists of linearizing the parameterized convex system via splitting convex inequalities into linear ones by using the Fenchel-Legendre conjugate. This approach yields that arbitrary bounded right-hand side perturbations of the convex system turn on constant-by-blocks perturbations in the linearized system. Based on advanced variational analysis, we derive a precise formula for computing the exact Lipschitzian bound of the feasible solution map of block-perturbed linear systems, which involves only the system's data, and then show that this exact bound agrees with the coderivative norm of the aforementioned mapping. In this way we extend to the convex setting the results of Cánovas et al. (SIAM J. Optim. 20, 1504-1526, 2009) developed for arbitrary perturbations with no block structure in the linear framework under the boundedness assumption on the system's coefficients. The latter boundedness assumption is removed in this paper when the decision space is reflexive. The last section provides the aimed application to the convex case.

Recent contributions to linear semi-infinite optimization

- Goberna, Miguel, López, Marco

**Authors:**Goberna, Miguel , López, Marco**Date:**2017**Type:**Text , Journal article**Relation:**4OR: A Quarterly Journal of Operations Research Vol. 15, no. 3 (2017), p. 221-264**Relation:**http://purl.org/au-research/grants/arc/DP160100854**Full Text:**false**Reviewed:****Description:**This paper reviews the state-of-the-art in the theory of deterministic and uncertain linear semi-infinite optimization, presents some numerical approaches to this type of problems, and describes a selection of recent applications in a variety of fields. Extensions to related optimization areas, as convex semi-infinite optimization, linear infinite optimization, and multi-objective linear semi-infinite optimization, are also commented. © 2017, Springer-Verlag GmbH Germany.

Recent contributions to linear semi-infinite optimization : An update

- Goberna, Miguel, López, Marco

**Authors:**Goberna, Miguel , López, Marco**Date:**2018**Type:**Text , Journal article , Review**Relation:**Annals of Operations Research Vol. 271, no. 1 (2018), p. 237-278**Relation:**http://purl.org/au-research/grants/arc/DP160100854**Full Text:****Reviewed:****Description:**This paper reviews the state-of-the-art in the theory of deterministic and uncertain linear semi-infinite optimization, presents some numerical approaches to this type of problems, and describes a selection of recent applications in a variety of fields. Extensions to related optimization areas, as convex semi-infinite optimization, linear infinite optimization, and multi-objective linear semi-infinite optimization, are also commented.

**Authors:**Goberna, Miguel , López, Marco**Date:**2018**Type:**Text , Journal article , Review**Relation:**Annals of Operations Research Vol. 271, no. 1 (2018), p. 237-278**Relation:**http://purl.org/au-research/grants/arc/DP160100854**Full Text:****Reviewed:****Description:**This paper reviews the state-of-the-art in the theory of deterministic and uncertain linear semi-infinite optimization, presents some numerical approaches to this type of problems, and describes a selection of recent applications in a variety of fields. Extensions to related optimization areas, as convex semi-infinite optimization, linear infinite optimization, and multi-objective linear semi-infinite optimization, are also commented.

Stability in linear optimization and related topics. A personal tour

**Authors:**López, Marco**Date:**2012**Type:**Text , Journal article**Relation:**TOP Vol. 20, no. 2 (2012), p. 217-244**Relation:**http://purl.org/au-research/grants/arc/DP110102011**Full Text:**false**Reviewed:****Description:**This paper is a kind of biased survey of the most representative and recent results on stability for the linear optimization problem. Qualitative and quantitative approaches are considered in this survey, and some infinite-dimensional extensions of the main results to more general problems are also included. In particular the paper deals with the lower/upper semicontinuity of the feasible/optimal set mappings, different types of ill-posedness, distance to ill-posedness, Lipschitz properties of these mappings under different types of perturbations, and estimates of the associated Lipschitz bounds.

Stability of semi-infinite inequality systems involving min-type functions

- López, Marco, Rubinov, Alex, Vera De Serio, Virginia

**Authors:**López, Marco , Rubinov, Alex , Vera De Serio, Virginia**Date:**2005**Type:**Text , Journal article**Relation:**Numerical Functional Analysis and Optimization Vol. 26, no. 1 (2005), p. 81-112**Full Text:**false**Reviewed:****Description:**We study the stability of semi-infinite inequality systems that arise in monotonic analysis. These systems are defined by certain classes of abstract linear functions. We consider the cone R**Description:**C1**Description:**2003001420

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