Your selections:

30102 Applied Mathematics
20103 Numerical and Computational Mathematics
20906 Electrical and Electronic Engineering
10101 Pure Mathematics
1Closed-convexification
1Convex analysis
1Convex infinite programming
1Deterministic conjugate duality
1Duality
1Fenchel duality of the sum
1Integration formulas
1Lagrange duality
1Robust convex optimization
1Robust reverse strong duality
1Robust strong duality
1Stable robust duality
1Stable strong robust duality
1Strong duality
1Uniform robust strong duality
1ε-Subdifferential

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.

**Authors:**López, Marco , Volle, Michel**Date:**2012**Type:**Text , Journal article**Relation:**Journal of Mathematical Analysis and Applications Vol. 390, no. 1 (2012), p. 307-312**Relation:**http://purl.org/au-research/grants/arc/DP110102011**Full Text:**false**Reviewed:****Description:**In this paper we approach the study of the subdifferential of the closed convex hull of a function and the related integration problem without the usual assumption of epi-pointedness. The key tool is, as in Hiriart-Urruty et al. (2011) [7], the concept of ε-subdifferential. Some other assumptions which are standard in the literature are also removed.

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.

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.

- «
- ‹
- 1
- ›
- »

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