Abstract The ability of the modern graphics processors to operate on large matrices in parallel can be exploited for solving constrained image deblurring problems in a short time. ...
Valeria Ruggiero, Thomas Serafini, Riccardo Zanell...
When dealing with convex functions defined on a normed vector space X the biconjugate is usually considered with respect to the dual system (X, X ), that is, as a function defined...
We provide a unifying geometric framework for the analysis of general classes of duality schemes and penalty methods for nonconvex constrained optimization problems. We present a ...
Two-stage stochastic mixed-integer programming (SMIP) problems with recourse are generally difficult to solve. This paper presents a first computational study of a disjunctive cut...
Abstract. As shown by Thanh-Hao [11], the solution existence results established by Facchinei and Pang [5, Vol. I, Prop. 2.2.3 and Theorem 2.3.4] for variational inequalities in ge...