Jonathan Eckstein

发表

Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers

Stephen P. Boyd, Eric Chu, Jonathan Eckstein, 2011, Found. Trends Mach. Learn..

Splitting methods for monotone operators with applications to parallel optimization

Jonathan Eckstein, 1989 .

An Alternating Direction Method for Linear Programming

D. Bertsekas, Jonathan Eckstein, Decision Systems., 1990 .

Some Saddle-function splitting methods for convex programming

Jonathan Eckstein, 1994 .

Parallel alternating direction multiplier decomposition of convex programs

Jonathan Eckstein, 1994 .

On the Douglas—Rachford splitting method and the proximal point algorithm for maximal monotone operators

Dimitri P. Bertsekas, Jonathan Eckstein, D. Bertsekas, 1992, Math. Program..

The Lions-Mercier splitting algorithm and the alternating direction method are instances of the proximal point algorithm

Jonathan Eckstein, Decision Systems., 1988 .

Dual coordinate step methods for linear network flow problems

Dimitri P. Bertsekas, Jonathan Eckstein, D. Bertsekas, 1988, Math. Program..

Chapter 5 Parallel computing in network optimization

Dimitri P. Bertsekas, Stavros A. Zenios, David A. Castanon, 1995 .

Augmented Lagrangian and Alternating Direction Methods for Convex Optimization: A Tutorial and Some Illustrative Computational Results

Jonathan Eckstein, 2012 .

Understanding the Convergence of the Alternating Direction Method of Multipliers: Theoretical and Computational Perspectives

Jonathan Eckstein, Wang Yao, 2015 .

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

Jonathan Eckstein, Jonathan Eckstein, 1993, Math. Oper. Res..

Distributed Asynchronous Relaxation Methods for Linear Network Flow Problems

Dimitri P. Bertsekas, Jonathan Eckstein, D. Bertsekas, 1987 .

Some Reformulations and Applications of the Alternating Direction Method of Multipliers

Masao Fukushima, Jonathan Eckstein, Jonathan Eckstein, 1994 .

Approximate iterations in Bregman-function-based proximal algorithms

Jonathan Eckstein, Jonathan Eckstein, 1998, Math. Program..

Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control

Michael C. Ferris, Jonathan Eckstein, Jonathan Eckstein, 1998, INFORMS J. Comput..

Rescaling and Stepsize Selection in Proximal Methods Using Separable Generalized Distances

Paulo J. S. Silva, Jonathan Eckstein, Carlos Humes, 2001, SIAM J. Optim..

Stochastic dedication: designing fixed income portfolios using massively parallel Benders decomposition

Jonathan Eckstein, R. S. Hiller, 1993 .

METHODS OF TEMPORAL DIFFERENCES FOR RISK-AVERSE DYNAMIC PROGRAMMING AND LEARNING

A. Ruszczynski, Jonathan Eckstein, D. Dentcheva, 2020 .

REPR: Rule-Enhanced Penalized Regression

Jonathan Eckstein, Noam Goldberg, Ai Kagawa, 2019, INFORMS Journal on Optimization.

A Simplified Form of Block-Iterative Operator Splitting , and an Asynchronous Algorithm Resembling the Multi-Block ADMM ∗

Jonathan Eckstein, 2016 .

Projective splitting with forward steps

Patrick R. Johnstone, Jonathan Eckstein, 2020, Mathematical Programming.

Sparse Weighted Voting Classifier Selection and its LP Relaxations

Jonathan Eckstein, Noam Goldberg, 2010 .

Tightened L 0 -relaxation Penalties for Classification

Jonathan Eckstein, Noam Goldberg, 2009 .

Tightened L 0-Relaxation Penalties for Classification

Jonathan Eckstein, Noam Goldberg, 2009 .

A Bundle Method for Exploiting Additive Structure in Difficult Optimization Problems

Jonathan Eckstein, Welington de Oliveira, Jonathan Eckstein, 2015 .

Smooth Methods of Multipliers for Complementarity Problems Smooth Methods of Multipliers for Complementarity Problems

Jonathan Eckstein, M. Ferris, Jonathan Ecksteina, 1997 .

Projective Splitting Methods for Pairs of Monotone Operators

Jonathan Eckstein, B. Svaiter, 2003 .

RISK-AVERSE DECISION MAKING AND BILEVEL STOCHASTIC PROGRAMMING WITH APPLICATIONS

Jonathan Eckstein, 2019 .

Hierarchical Parallel MIP.

Ojas Parekh, John Daniel Siirola, Cynthia Ann Phillips, 2013 .

Basic Definitions and Concepts

Jonathan Eckstein, Bonnie R. Schultz, Jonathan Eckstein, 2017 .

Combinatorial optimization for national security applications.

Michael A. Bender, Cynthia Ann Phillips, William E. Hart, 2014 .

Parallel Solver Framework for Mixed-Integer PDE-Constrained Optimization.

Cynthia A. Phillips, Massimo Ruzzene, Alper Erturk, 2021 .

Parallel Branch-and-Bound Methods for Mixed Integer Programming

Jonathan Eckstein, Jonathan Eckstein, 1996, Applications on Advanced Architecture Computers.

Abstracts for INFORMS Parallel Combinatorial Optimization Session.

Robert D. Carr, Jonathan W. Berry, Cynthia Ann Phillips, 2007 .

Dual Coordinate Ascent Methods for Linear Network Flow Problems

D. Bertsekas, Jonathan Eckstein, 2022 .

Projective Hedging Algorithms for Distributed Optimization under Uncertainty *

David L. Woodruff, Jonathan Eckstein, Jean-Paul Watson, 2022 .

A Covering Decomposition Algorithm for Power Grid Cyber-Network Segmentation

Santanu S. Dey, John D. Siirola, Emma S. Johnson, 2021 .

Introduction to Data Management and Database Design

Jonathan Eckstein, Bonnie R. Schultz, Jonathan Eckstein, 2017 .

Parallel Integer and Combinatorial Optimization Library (PICO)

Cynthia A. Phillips, William E. Hart, Jonathan Eckstein, 2001 .

Multiple Tables in Access

Jonathan Eckstein, Bonnie R. Schultz, Jonathan Eckstein, 2017 .

PICO's New Hierarchical Branch-and Bound System for Massively Parallel Integer Programming.

Ojas Parekh, John Daniel Siirola, Cynthia Ann Phillips, 2012 .

Massively Parallel Mixed-Integer Programming: Algorithms and Applications

Cynthia A. Phillips, William E. Hart, Jonathan Eckstein, 2006, Parallel Processing for Scientific Computing.

Advanced Query Techniques

Jonathan Eckstein, Bonnie R. Schultz, Jonathan Eckstein, 2017 .

Tightened L 0 -Relaxation Penalties for Classication 1

Noam Goldberg, Jonathan Eckstein, Jonathan Eckstein, 2009 .

Genessee Wire and Cable

Jonathan Eckstein, Arthur Schleifer, Jonathan Eckstein, 1992 .

Basic Structured Query Language (SQL)

Jonathan Eckstein, Bonnie R. Schultz, Jonathan Eckstein, 2017 .

Beginning Fundamentals of Relational Databases and MS Access

Jonathan Eckstein, Bonnie R. Schultz, Jonathan Eckstein, 2017 .

Routing Methods for Twin-Trailer Trucks

Jonathan Eckstein, Jonathan Eckstein, 1986 .

Operations for Motor Carriers Using Twin Trailers

Jonathan Eckstein, Y. Sheffi, 2017 .

Single-forward-step projective splitting: exploiting cocoercivity

Patrick R. Johnstone, Jonathan Eckstein, Jonathan Eckstein, 2019, Computational Optimization and Applications.

More about Forms and Navigation

Jonathan Eckstein, Bonnie R. Schultz, Jonathan Eckstein, 2017 .

A practical relative error criterion for augmented Lagrangians

Paulo J. S. Silva, Jonathan Eckstein, 2012, Mathematical Programming.

Relative-error approximate versions of Douglas–Rachford splitting and special cases of the ADMM

Jonathan Eckstein, Wang Yao, 2017, Mathematical Programming.

Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions

Jonathan Eckstein, P. L. Combettes, 2016, Mathematical Programming.

Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms

Jonathan Eckstein, M. Alves, Marina Geremia, 2020, Computational Optimization and Applications.

Approximate ADMM algorithms derived from Lagrangian splitting

Jonathan Eckstein, Wang Yao, 2017, Computational Optimization and Applications.

A Simplified Form of Block-Iterative Operator Splitting and an Asynchronous Algorithm Resembling the Multi-Block Alternating Direction Method of Multipliers

Jonathan Eckstein, 2017, Journal of Optimization Theory and Applications.

Time Consistency Versus Law Invariance in Multistage Stochastic Optimization with Coherent Risk Measures : Multilevel Optimization Modeling and Computational Complexity

Jonathan Eckstein, 2013 .

Complexity of Bilevel Coherent Risk Programming

Jonathan Eckstein, 2012 .

Single-forward-step projective splitting: exploiting cocoercivity

Patrick R. Johnstone, Jonathan Eckstein, 2020, Computational Optimization and Applications.

Deriving solution value bounds from the ADMM

Jonathan Eckstein, 2020, Optimization Letters.

PEBBL: an object-oriented framework for scalable parallel branch and bound

Jonathan Eckstein, W. Hart, C. Phillips, 2015, Math. Program. Comput..

Monitoring an Information Source Under a Politeness Constraint

Avigdor Gal, Jonathan Eckstein, Sarit Reiner, 2008, INFORMS J. Comput..

Scheduling of Data Transcription in Periodically Connected Databases

Avigdor Gal, Jonathan Eckstein, Zachary G. Stoumbos, 2003 .

Relative-error approximate versions of Douglas–Rachford splitting and special cases of the ADMM

Wang Yao, Jonathan Eckstein, Jonathan Eckstein, 2018, Math. Program..

Efficient Distributed-Memory Parallel Matrix-Vector Multiplication with Wide or Tall Unstructured Sparse Matrices pdf

Jonathan Eckstein, Gyorgy Matyasfalvi, Jonathan Eckstein, 2018, ArXiv.

Rule-Enhanced Penalized Regression by Column Generation using Rectangular Maximum Agreement

Noam Goldberg, Jonathan Eckstein, Ai Kagawa, 2017, ICML.

Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2

Donald Goldfarb, Lazaros Polymenakos, I. Ilkay Boduroglu, 1995, INFORMS J. Comput..

General Projective Splitting Methods for Sums of Maximal Monotone Operators

Benar Fux Svaiter, Jonathan Eckstein, Jonathan Eckstein, 2009, SIAM J. Control. Optim..

A family of projective splitting methods for the sum of two maximal monotone operators

Benar Fux Svaiter, Jonathan Eckstein, Jonathan Eckstein, 2007, Math. Program..

Boosting Classifiers with Tightened L0-Relaxation Penalties

Noam Goldberg, Jonathan Eckstein, Jonathan Eckstein, 2010, ICML.

The Alternating Step Method for Monotropic Programming on the Connection Machine CM-2

Jonathan Eckstein, Jonathan Eckstein, 1993, INFORMS J. Comput..

Pivot, Cut, and Dive: a heuristic for 0-1 mixed integer programming

Jonathan Eckstein, Mikhail Nediak, Jonathan Eckstein, 2007, J. Heuristics.

Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions

Patrick L. Combettes, Jonathan Eckstein, Jonathan Eckstein, 2015, Mathematical Programming.

Pico: An Object-Oriented Framework for Parallel Branch and Bound *

Cynthia A. Phillips, William E. Hart, Jonathan Eckstein, 2001 .

Smooth methods of multipliers for complementarity problems

Michael C. Ferris, Jonathan Eckstein, Jonathan Eckstein, 1999, Math. Program..

Managing periodically updated data in relational databases: a stochastic modeling approach

Avigdor Gal, Jonathan Eckstein, Jonathan Eckstein, 2000, JACM.

Projective Splitting with Forward Steps: Asynchronous and Block-Iterative Operator Splitting pdf

Patrick R. Johnstone, Jonathan Eckstein, Jonathan Eckstein, 2018, ArXiv.

Resource Management in a Parallel Mixed Integer Programming Package

Cynthia A. Phillips, William E. Hart, Jonathan Eckstein, 1997 .

A Simplified Form of Block-Iterative Operator Splitting and an Asynchronous Algorithm Resembling the Multi-Block Alternating Direction Method of Multipliers

Jonathan Eckstein, Jonathan Eckstein, 2017, J. Optim. Theory Appl..

Double-Regularization Proximal Methods, with Complementarity Applications

Paulo J. S. Silva, Jonathan Eckstein, Jonathan Eckstein, 2005, Comput. Optim. Appl..

A practical general approximation criterion for methods of multipliers based on Bregman distances

Jonathan Eckstein, Jonathan Eckstein, 2003, Math. Program..

A practical relative error criterion for augmented Lagrangians

Paulo J. S. Silva, Jonathan Eckstein, Jonathan Eckstein, 2012, Mathematical Programming.

Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5

Jonathan Eckstein, Jonathan Eckstein, 1994, SIAM J. Optim..

OPTIMIZATION OF GROUP LINE-HAUL OPERATIONS FOR MOTOR CARRIERS USING TWIN TRAILERS

Yosef Sheffi, Jonathan Eckstein, Jonathan Eckstein, 1987 .

Convergence Rates for Projective Splitting pdf

Patrick R. Johnstone, Jonathan Eckstein, Jonathan Eckstein, 2018, SIAM J. Optim..

PEBBL: an object-oriented framework for scalable parallel branch and bound

Cynthia A. Phillips, William E. Hart, Jonathan Eckstein, 2015, Mathematical Programming Computation.

How Much Communication Does Parallel Branch and Bound Need?

Jonathan Eckstein, Jonathan Eckstein, 1997, INFORMS J. Comput..

Methods for Sums of Maximal Monotone Operators

Jonathan Eckstein, B. Svaiter, 2007 .

The Maximum Box Problem and its Application to Data Analysis

Ying Liu, Peter L. Hammer, Bruno Simeone, 2002, Comput. Optim. Appl..

Stochastic projective splitting

Patrick R. Johnstone, Jonathan Eckstein, Thomas Flynn, 2023, Comput. Optim. Appl..

Stochastic Projective Splitting: Solving Saddle-Point Problems with Multiple Regularizers pdf

Patrick R. Johnstone, Jonathan Eckstein, Shinjae Yoo, 2021, ArXiv.