Your selections:

40102 Applied Mathematics
40103 Numerical and Computational Mathematics
4Linear programming
3Calmness
3Feasible set mapping
3Variational analysis
20101 Pure Mathematics
2Block perturbations
2Local error bounds
2Semi-infinite and infinite programming
2Semi-infinite programming
14901 Applied mathematics
14903 Numerical and computational mathematics
1Calmness modulus
1Coderivatives
1Communications
1Computer science
1Computer sciences
1Constrained problem
1Convex functions

Show More

Show Less

Format Type

Robust and continuous metric subregularity for linear inequality systems

- Camacho, J., Cánovas, Maria, López, Marco, Parra, Juan

**Authors:**Camacho, J. , Cánovas, Maria , López, Marco , Parra, Juan**Date:**2023**Type:**Text , Journal article**Relation:**Computational Optimization and Applications Vol. 86, no. 3 (2023), p. 967-988**Full Text:****Reviewed:****Description:**This paper introduces two new variational properties, robust and continuous metric subregularity, for finite linear inequality systems under data perturbations. The motivation of this study goes back to the seminal work by Dontchev, Lewis, and Rockafellar (2003) on the radius of metric regularity. In contrast to the metric regularity, the unstable continuity behavoir of the (always finite) metric subregularity modulus leads us to consider the aforementioned properties. After characterizing both of them, the radius of robust metric subregularity is computed and some insights on the radius of continuous metric subregularity are provided. © 2022, The Author(s).

**Authors:**Camacho, J. , Cánovas, Maria , López, Marco , Parra, Juan**Date:**2023**Type:**Text , Journal article**Relation:**Computational Optimization and Applications Vol. 86, no. 3 (2023), p. 967-988**Full Text:****Reviewed:****Description:**This paper introduces two new variational properties, robust and continuous metric subregularity, for finite linear inequality systems under data perturbations. The motivation of this study goes back to the seminal work by Dontchev, Lewis, and Rockafellar (2003) on the radius of metric regularity. In contrast to the metric regularity, the unstable continuity behavoir of the (always finite) metric subregularity modulus leads us to consider the aforementioned properties. After characterizing both of them, the radius of robust metric subregularity is computed and some insights on the radius of continuous metric subregularity are provided. © 2022, The Author(s).

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:

Subdifferentials and stability analysis of feasible set and pareto front mappings in linear multiobjective optimization

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

**Authors:**Cánovas, Maria , López, Marco , Mordukhovich, Boris , Parra, Juan**Date:**2020**Type:**Text , Journal article**Relation:**Vietnam Journal of Mathematics Vol. 48, no. 2 (2020), p. 315-334**Relation:**http://purl.org/au-research/grants/arc/DP180100602**Full Text:****Reviewed:****Description:**The paper concerns multiobjective linear optimization problems in**Description:**Funding details: European Commission, EC Funding details: European Regional Development Fund, FEDER Funding details: Australian Research Council, ARC Funding details: Australian Research Council, ARC, DP180100602 Funding details: Australian Research Council, ARC, DP-190100555 Funding details: Air Force Office of Scientific Research, AFOSR, 15RT04 Funding details: DMS-1512846, DMS-1808978 Funding text 1: This research has been partially supported by grants MTM2014-59179-C2-(1,2)-P and PGC2018-097960-B-C2(1,2) from MINECO/MICINN, Spain, and ERDF, “A way to make Europe”, European Union. Funding text 2: Research of the second author is also partially supported by the Australian Research Council (ARC) Discovery Grants Scheme (Project Grant # DP180100602). Funding text 3: Research of third author was partially supported by the USA National Science Foundation under grants DMS-1512846 and DMS-1808978, by the USA Air Force Office of Scientific Research grant #15RT04, and by Australian Research Council under grant DP-190100555.

**Authors:**Cánovas, Maria , López, Marco , Mordukhovich, Boris , Parra, Juan**Date:**2020**Type:**Text , Journal article**Relation:**Vietnam Journal of Mathematics Vol. 48, no. 2 (2020), p. 315-334**Relation:**http://purl.org/au-research/grants/arc/DP180100602**Full Text:****Reviewed:****Description:**The paper concerns multiobjective linear optimization problems in**Description:**Funding details: European Commission, EC Funding details: European Regional Development Fund, FEDER Funding details: Australian Research Council, ARC Funding details: Australian Research Council, ARC, DP180100602 Funding details: Australian Research Council, ARC, DP-190100555 Funding details: Air Force Office of Scientific Research, AFOSR, 15RT04 Funding details: DMS-1512846, DMS-1808978 Funding text 1: This research has been partially supported by grants MTM2014-59179-C2-(1,2)-P and PGC2018-097960-B-C2(1,2) from MINECO/MICINN, Spain, and ERDF, “A way to make Europe”, European Union. Funding text 2: Research of the second author is also partially supported by the Australian Research Council (ARC) Discovery Grants Scheme (Project Grant # DP180100602). Funding text 3: Research of third author was partially supported by the USA National Science Foundation under grants DMS-1512846 and DMS-1808978, by the USA Air Force Office of Scientific Research grant #15RT04, and by Australian Research Council under grant DP-190100555.

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.

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.

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 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.

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.

- 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.

- «
- ‹
- 1
- ›
- »

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