Relative-error approximate versions of Douglas–Rachford splitting and special cases of the ADMM von Eckstein, Jonathan, Yao, Wang

Volltext

Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions von Combettes, Patrick L., Eckstein, Jonathan

Volltext

Projective Hedging Algorithms for Multistage Stochastic Programming, Supporting Distributed and Asynchronous Implementation von Eckstein, Jonathan, Watson, Jean-Paul, Woodruff, David L.

Volltext

Single-forward-step projective splitting: exploiting cocoercivity von Johnstone, Patrick R., Eckstein, Jonathan

Volltext

Projective splitting with forward steps only requires continuity von Johnstone, Patrick R., Eckstein, Jonathan

Volltext

Arrival Rate Approximation by Nonnegative Cubic Splines von Alizadeh, Farid, Eckstein, Jonathan, Noyan, Nilay, Rudolf, Gabor

Volltext

Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms von Alves, M. Marques, Eckstein, Jonathan, Geremia, Marina, Melo, Jefferson G.

Volltext

Stochastic projective splitting von Johnstone, Patrick R., Eckstein, Jonathan, Flynn, Thomas, Yoo, Shinjae

Volltext

Correction to: Stochastic projective splitting von Johnstone, Patrick R., Eckstein, Jonathan, Flynn, Thomas, Yoo, Shinjae

Volltext

Sparse weighted voting classifier selection and its linear programming relaxations von Goldberg, Noam, Eckstein, Jonathan

Volltext

Multilevel Optimization Modeling for Risk-Averse Stochastic Programming von Eckstein, Jonathan, Eskandani, Deniz, Fan, Jingnan

Volltext

Approximate iterations in Bregman-function-based proximal algorithms von ECKSTEIN, J

Volltext

A practical relative error criterion for augmented Lagrangians von Eckstein, Jonathan, Silva, Paulo J. S.

Volltext

Pivot, Cut, and Dive: a heuristic for 0-1 mixed integer programming von Eckstein, Jonathan, Nediak, Mikhail

Volltext

PEBBL: an object-oriented framework for scalable parallel branch and bound von Eckstein, Jonathan, Hart, William E., Phillips, Cynthia A.

Volltext

An Improved Branch-and-Bound Method for Maximum Monomial Agreement von Eckstein, Jonathan, Goldberg, Noam

Volltext

Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming von Eckstein, Jonathan

Volltext

Monitoring an Information Source Under a Politeness Constraint von Eckstein, Jonathan, Gal, Avigdor, Reiner, Sarit

Volltext

Managing periodically updated data in relational databases: a stochastic modeling approach von Gal, Avigdor, Eckstein, Jonathan

Volltext

Stochastic Projective Splitting: Solving Saddle-Point Problems with Multiple Regularizers von Johnstone, Patrick R, Eckstein, Jonathan, Flynn, Thomas, Yoo, Shinjae

Volltext bestellen