Calmness modulus of linear semi-infinite programs
- 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.
Comparative study of RPSALG algorithm for convex semi-infinite programming
- 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.