| Publication | Date of Publication | Type |
|---|
Stochastic projective splitting
Computational Optimization and Applications | 2024-02-16 | Paper |
Projective splitting with forward steps
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
Single-forward-step projective splitting: exploiting cocoercivity
Computational Optimization and Applications | 2021-05-20 | Paper |
Deriving solution value bounds from the ADMM
Optimization Letters | 2020-08-24 | Paper |
Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms
Computational Optimization and Applications | 2020-02-28 | Paper |
Projective splitting with forward steps only requires continuity
Optimization Letters | 2020-02-27 | Paper |
Convergence Rates for Projective Splitting
SIAM Journal on Optimization | 2019-08-27 | Paper |
Comments on: ``A simplified form of block-iterative operator splitting, and an asynchronous algorithm resembling the multi-block alternating direction method of multipliers
Journal of Optimization Theory and Applications | 2018-05-24 | Paper |
Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions
Mathematical Programming. Series A. Series B | 2018-04-06 | Paper |
A simplified form of block-iterative operator splitting and an asynchronous algorithm resembling the multi-block alternating direction method of multipliers
Journal of Optimization Theory and Applications | 2017-09-01 | Paper |
An improved branch-and-bound method for maximum monomial agreement
INFORMS Journal on Computing | 2016-06-29 | Paper |
Multilevel optimization modeling for risk-averse stochastic programming
INFORMS Journal on Computing | 2016-05-19 | Paper |
PEBBL: an object-oriented framework for scalable parallel branch and bound
Mathematical Programming Computation | 2016-01-15 | Paper |
Managing periodically updated data in relational databases: a stochastic modeling approach
Journal of the ACM | 2015-10-30 | Paper |
Asynchronous Block-Iterative Primal-Dual Decomposition Methods for Monotone Inclusions
| 2015-07-12 | Paper |
A practical relative error criterion for augmented Lagrangians
Mathematical Programming. Series A. Series B | 2013-11-11 | Paper |
Monitoring an information source under a politeness constraint
INFORMS Journal on Computing | 2012-07-28 | Paper |
Sparse weighted voting classifier selection and its linear programming relaxations
Information Processing Letters | 2012-07-25 | Paper |
Proximal methods for nonlinear programming: Double regularization and inexact subproblems
Computational Optimization and Applications | 2010-06-09 | Paper |
General Projective Splitting Methods for Sums of Maximal Monotone Operators
SIAM Journal on Control and Optimization | 2010-04-28 | Paper |
Arrival Rate Approximation by Nonnegative Cubic Splines
Operations Research | 2009-08-13 | Paper |
A family of projective splitting methods for the sum of two maximal monotone operators
Mathematical Programming. Series A. Series B | 2008-01-21 | Paper |
Double-regularization proximal methods, with complementarity applications
Computational Optimization and Applications | 2006-09-28 | Paper |
Depth-optimized convexity cuts
Annals of Operations Research | 2006-03-07 | Paper |
The maximum box problem and its application to data analysis
Computational Optimization and Applications | 2004-01-19 | Paper |
Scheduling of Data Transcription in Periodically Connected Databases
Stochastic Analysis and Applications | 2003-08-27 | Paper |
A practical general approximation criterion for methods of multipliers based on Bregman distances
Mathematical Programming. Series A. Series B | 2003-07-13 | Paper |
Rescaling and stepsize selection in proximal methods using separable generalized distances
SIAM Journal on Optimization | 2002-04-23 | Paper |
PICO: An object-oriented framework for parallel branch and bound
| 2002-04-09 | Paper |
Approximate iterations in Bregman-function-based proximal algorithms
Mathematical Programming. Series A. Series B | 1999-09-15 | Paper |
Smooth methods of multipliers for complementarity problems
Mathematical Programming. Series A. Series B | 1999-01-01 | Paper |
scientific article; zbMATH DE number 1206103 (Why is no real title available?)
| 1998-10-14 | Paper |
Distributed versus centralized storage and control for parallel branch and bound: Mixed integer programming on the CM-5
Computational Optimization and Applications | 1998-02-19 | Paper |
Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control
INFORMS Journal on Computing | 1998-01-01 | Paper |
How Much Communication Does Parallel Branch and Bound Need?
INFORMS Journal on Computing | 1997-11-25 | Paper |
Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2
ORSA Journal on Computing | 1996-05-20 | Paper |
scientific article; zbMATH DE number 795218 (Why is no real title available?)
| 1995-09-11 | Paper |
Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5
SIAM Journal on Optimization | 1995-09-05 | Paper |
scientific article; zbMATH DE number 679861 (Why is no real title available?)
| 1995-01-23 | Paper |
Parallel alternating direction multiplier decomposition of convex programs
Journal of Optimization Theory and Applications | 1994-10-25 | Paper |
Stochastic Dedication: Designing Fixed Income Portfolios Using Massively Parallel Benders Decomposition
Management Science | 1994-04-12 | Paper |
The Alternating Step Method for Monotropic Programming on the Connection Machine CM-2
ORSA Journal on Computing | 1993-08-31 | Paper |
Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
Mathematics of Operations Research | 1993-06-29 | Paper |
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
Mathematical Programming. Series A. Series B | 1993-01-16 | Paper |
Dual coordinate step methods for linear network flow problems
Mathematical Programming. Series A. Series B | 1988-01-01 | Paper |
