Learn More
Stochastic programming problems arise in many practical situations. In general, the deterministic equivalents of these problems can be very large and may not be solvable directly by general-purpose optimization approaches. For the particular case of two-stage stochastic programs, we consider decomposition approaches akin to a regularized L-shaped method(More)
We analyze two global algorithms for solving the linear bilevel program (LBP) problem. The first one is a recent algorithm built on a new concept of equilibrium point and a modified version of the outer approximation method. The second one is an efficient branch-and-bound algorithm known in the literature. Based on computational results we propose some(More)
For a maximal monotone operator T on a Hilbert space H and a closed subspace A of H, we consider the problem of finding (x, y ∈ T (x)) satisfying x ∈ A and y ∈ A ⊥. An equivalent formulation of this problem makes use of the partial inverse operator of Spingarn. The resulting generalized equation can be solved by using the proximal point algorithm. We(More)