Weak convergence on Douglas-Rachford method
We prove that the sequences generate by the Douglas-Rachford method converge weakly to a solution of the inclusion problem ArticleDownload View PDF
We prove that the sequences generate by the Douglas-Rachford method converge weakly to a solution of the inclusion problem ArticleDownload View PDF
In this paper, we establish some new characterizations of the metric regularity of implicit multifunctions in complete metric spaces by using the lower semicontinuous envelopes of the distance functions for set-valued mappings. Through these new characterizations it is possible to investigate implicit multifunction theorems based on coderivatives and on contingent derivatives as well as the … Read more
The main objective of this paper is to provide new explicit criteria to characterize weak lower semi-continuous Lyapunov pairs or functions associated to first-order differential inclusions in Hilbert spaces. These inclusions are governed by a Lipschitzian perturbation of a maximally monotone operator. The dual criteria we give are expressed by the means of the proximal … Read more
We are interested in structures and efficient methods for mixed-integer nonlinear programs (MINLP) that arise from a first discretize, then optimize approach to time-dependent mixed-integer optimal control problems (MIOCPs). In this study we focus on combinatorial constraints, in particular on restrictions on the number of switches on a fixed time grid. We propose a novel … Read more
In this paper we generalize to an arbitrary order, under minimal hypotheses, some sufficient conditions for Lipschitz continuity of the solution of a state constrained optimal control problems. The proof combines the approach by Hager in 1979 for dealing with first-order state constraints, and the high-order alternative formulation of the optimality conditions. CitationPublished as INRIA … Read more
This paper proposes a new mathematical model for the open pit mine planning problem, based on continuous functional analysis. The traditional models for this problem have been constructed by using discrete 0-1 decision variables, giving rise to large-scale combinatorial and Mixed Integer Programming (MIP) problems. Instead, we use a continuous approach which allows for a … Read more
In this paper we study the optimal control problem of the heat equation by a distributed control over a subset of the domain, in the presence of a state constraint. The latter is integral over the space and has to be satisfied at each time. Using for the first time the technique of alternative optimality … Read more
In this paper we study the link between a semi-infinite chance-constrained optimization problem and its randomized version, i.e. the problem obtained by sampling a finite number of its constraints. Extending previous results on the feasibility of randomized convex programs, we establish here the feasibility of the solution obtained after the elimination of a portion of … Read more
Lecture notes for the tutorial at the workshop HPOPT 2008 – 10th International Workshop on High Performance Optimization Techniques (Algebraic Structure in Semidefinite Programming), June 11th to 13th, 2008, Tilburg University, The Netherlands. CitationarXiv:0809.2017v1 [math.OC]ArticleDownload View PDF
The aim of this paper is to give a survey of some basic theory of semi-infinite programming. In particular, we discuss various approaches to derivations of duality, discretization and first and second order optimality conditions. Some of the surveyed results are well known while others seem to be less noticed in that area of research. … Read more