scientific article; zbMATH DE number 679861
From MaRDI portal
Publication:4311908
zbMath0816.90109MaRDI QIDQ4311908
Jonathan Eckstein, Masao Fukushima
Publication date: 23 January 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
alternating direction methodmulticommodity flowdata-parallel implementationminimum convex-cost transportationmultipliers decomposition algorithmsparse quadratic-cost transportation
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10) Parallel numerical computation (65Y05)
Related Items (55)
An alternating direction method of multipliers for elliptic equation constrained optimization problem ⋮ A survey on some recent developments of alternating direction method of multipliers ⋮ Decomposition approaches for constrained spatial auction market problems ⋮ On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming ⋮ Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes ⋮ A parallel descent algorithm for convex programming ⋮ Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM ⋮ The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem ⋮ Vector network equilibrium problems with elastic demands ⋮ Precompact convergence of the nonconvex primal-dual hybrid gradient algorithm ⋮ A proximal ADMM with the Broyden family for convex optimization problems ⋮ A decomposition method for solving multicommodity network equilibria ⋮ Supervised distance preserving projection using alternating direction method of multipliers ⋮ A proximal fully parallel splitting method with a relaxation factor for separable convex programming ⋮ A new decomposition method for variational inequalities with linear constraints ⋮ Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming ⋮ Generalized risk parity portfolio optimization: an ADMM approach ⋮ Proximal alternating direction-based contraction methods for separable linearly constrained convex optimization ⋮ New decomposition methods for solving variational inequality problems. ⋮ A survey on operator splitting and decomposition of convex programs ⋮ Relaxed augmented Lagrangian-based proximal point algorithms for convex optimization with linear constraints ⋮ An inexact parallel splitting augmented Lagrangian method for monotone variational inequalities with separable structures ⋮ Unnamed Item ⋮ A simple alternating direction method for the conic trust region subproblem ⋮ Proximal alternating direction method with relaxed proximal parameters for the least squares covariance adjustment problem ⋮ A class of linearized proximal alternating direction methods ⋮ A modified alternating projection based prediction-correction method for structured variational inequalities ⋮ Proximal alternating directions method for structured variational inequalities ⋮ On Glowinski's open question on the alternating direction method of multipliers ⋮ On alternating direction method for solving variational inequality problems with separable structure ⋮ An inexact alternating direction method for structured variational inequalities ⋮ An improved proximal-based decomposition method for structured monotone variational inequalities ⋮ A proximal alternating direction method of multipliers for a minimization problem with nonconvex constraints ⋮ The dual step size of the alternating direction method can be larger than 1.618 when one function is strongly convex ⋮ An alternating direction method of multipliers with the BFGS update for structured convex quadratic optimization ⋮ On the \(O(1/t)\) convergence rate of Ye-Yuan's modified alternating direction method of multipliers ⋮ SQP alternating direction method with a new optimal step size for solving variational inequality problems with separable structure ⋮ Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization ⋮ An efficient alternating direction method of multipliers for optimal control problems constrained by random Helmholtz equations ⋮ An efficient simultaneous method for the constrained multiple-sets split feasibility problem ⋮ An improved proximal alternating direction method for monotone variational inequalities with separable structure ⋮ New parallel descent-like method for solving a class of variational inequalities ⋮ Alternating direction method for covariance selection models ⋮ Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach ⋮ Convergence analysis and applications of the Glowinski-Le Tallec splitting method for finding a zero of the sum of two maximal monotone operators ⋮ A proximal alternating direction method for multi-block coupled convex optimization ⋮ A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems ⋮ A variable-penalty alternating directions method for convex optimization ⋮ A multi-mode expansion method for boundary optimal control problems constrained by random Poisson equations ⋮ Convergence study of indefinite proximal ADMM with a relaxation factor ⋮ An improved contraction method for structured monotone variational inequalities ⋮ Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities ⋮ Nonlinear proximal decomposition method for convex programming ⋮ Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm ⋮ The improvement with relative errors of He et al.'s inexact alternating direction method for monotone variational inequalities
Uses Software
This page was built for publication:
