The following pages link to Jonathan Eckstein (Q378084):
Displaying 46 items.
- A practical relative error criterion for augmented Lagrangians (Q378086) (← links)
- Sparse weighted voting classifier selection and its linear programming relaxations (Q436579) (← links)
- Depth-optimized convexity cuts (Q817181) (← links)
- PEBBL: an object-oriented framework for scalable parallel branch and bound (Q903924) (← links)
- Proximal methods for nonlinear programming: Double regularization and inexact subproblems (Q975360) (← links)
- Dual coordinate step methods for linear network flow problems (Q1115790) (← links)
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators (Q1198734) (← links)
- Approximate iterations in Bregman-function-based proximal algorithms (Q1290655) (← links)
- (Q1321442) (redirect page) (← links)
- Parallel alternating direction multiplier decomposition of convex programs (Q1321443) (← links)
- Distributed versus centralized storage and control for parallel branch and bound: Mixed integer programming on the CM-5 (Q1360245) (← links)
- A practical general approximation criterion for methods of multipliers based on Bregman distances (Q1396823) (← links)
- Comments on: ``A simplified form of block-iterative operator splitting, and an asynchronous algorithm resembling the multi-block alternating direction method of multipliers'' (Q1752652) (← links)
- Smooth methods of multipliers for complementarity problems (Q1806025) (← links)
- The maximum box problem and its application to data analysis (Q1856362) (← links)
- Single-forward-step projective splitting: exploiting cocoercivity (Q2026768) (← links)
- Projective splitting with forward steps (Q2118090) (← links)
- Deriving solution value bounds from the ADMM (Q2192975) (← links)
- Projective splitting with forward steps only requires continuity (Q2300648) (← links)
- Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms (Q2301141) (← links)
- A simplified form of block-iterative operator splitting and an asynchronous algorithm resembling the multi-block alternating direction method of multipliers (Q2401513) (← links)
- Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions (Q2413104) (← links)
- A family of projective splitting methods for the sum of two maximal monotone operators (Q2467160) (← links)
- Double-regularization proximal methods, with complementarity applications (Q2506183) (← links)
- PICO: An object-oriented framework for parallel branch and bound (Q2768018) (← links)
- Rescaling and stepsize selection in proximal methods using separable generalized distances (Q2784410) (← links)
- Multilevel optimization modeling for risk-averse stochastic programming (Q2806871) (← links)
- An improved branch-and-bound method for maximum monomial agreement (Q2815448) (← links)
- Monitoring an information source under a politeness constraint (Q2900988) (← links)
- Managing periodically updated data in relational databases (Q3196629) (← links)
- Arrival Rate Approximation by Nonnegative Cubic Splines (Q3392161) (← links)
- General Projective Splitting Methods for Sums of Maximal Monotone Operators (Q3557946) (← links)
- The Alternating Step Method for Monotropic Programming on the Connection Machine CM-2 (Q4202473) (← links)
- (Q4209154) (← links)
- Stochastic Dedication: Designing Fixed Income Portfolios Using Massively Parallel Benders Decomposition (Q4287716) (← links)
- (Q4311908) (← links)
- Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5 (Q4321311) (← links)
- How Much Communication Does Parallel Branch and Bound Need? (Q4367039) (← links)
- Scheduling of Data Transcription in Periodically Connected Databases (Q4421481) (← links)
- Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control (Q4427343) (← links)
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming (Q4697091) (← links)
- (Q4845367) (← links)
- Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2 (Q4869756) (← links)
- Convergence Rates for Projective Splitting (Q5231693) (← links)
- Stochastic projective splitting (Q6155065) (← links)
- Asynchronous Block-Iterative Primal-Dual Decomposition Methods for Monotone Inclusions (Q6263524) (← links)
