scientific article; zbMATH DE number 679861
From MaRDI portal
Publication:4311908
zbMATH Open0816.90109MaRDI QIDQ4311908FDOQ4311908
Authors: Jonathan Eckstein, Masao Fukushima 
Publication date: 23 January 1995
Title of this publication is not available (Why is that?)
Recommendations
- A note on the alternating direction method of multipliers
- Application of the alternating direction method of multipliers to separable convex programming problems
- A survey on some recent developments of alternating direction method of multipliers
- On the linear convergence of the alternating direction method of multipliers
- scientific article; zbMATH DE number 1066210
- Alternating direction method of multipliers for linear programming
- Generalized alternating direction method of multipliers: new theoretical insights and applications
- An adaptive alternating direction method of multipliers
- A regularized alternating direction method of multipliers for a class of nonconvex problems
- Analysis of the alternating direction method of multipliers for nonconvex problems
alternating direction methodmulticommodity flowdata-parallel implementationminimum convex-cost transportationmultipliers decomposition algorithmsparse quadratic-cost transportation
Convex programming (90C25) Parallel numerical computation (65Y05) Large-scale problems in mathematical programming (90C06) Deterministic network models in operations research (90B10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cited In (59)
- An alternating direction method of multipliers with the BFGS update for structured convex quadratic optimization
- The dual step size of the alternating direction method can be larger than 1.618 when one function is strongly convex
- Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm
- Proximal alternating direction method with relaxed proximal parameters for the least squares covariance adjustment problem
- An alternating direction method of multipliers for elliptic equation constrained optimization problem
- A proximal alternating direction method of multipliers for a minimization problem with nonconvex constraints
- Decomposition approaches for constrained spatial auction market problems
- A new decomposition method for variational inequalities with linear constraints
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
- Some Facts About Operator-Splitting and Alternating Direction Methods
- Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM
- Convergence analysis and applications of the Glowinski-Le Tallec splitting method for finding a zero of the sum of two maximal monotone operators
- Vector network equilibrium problems with elastic demands
- New parallel descent-like method for solving a class of variational inequalities
- A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems
- A proximal alternating direction method for multi-block coupled convex optimization
- A parallel descent algorithm for convex programming
- New decomposition methods for solving variational inequality problems.
- An efficient simultaneous method for the constrained multiple-sets split feasibility problem
- A modified alternating projection based prediction-correction method for structured variational inequalities
- A remark on the theory of the commutative alternating direction method
- Generalized risk parity portfolio optimization: an ADMM approach
- The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem
- An inexact parallel splitting augmented Lagrangian method for monotone variational inequalities with separable structures
- Alternating direction method for covariance selection models
- An inexact alternating direction method for structured variational inequalities
- A variable-penalty alternating directions method for convex optimization
- A class of linearized proximal alternating direction methods
- Nonlinear proximal decomposition method for convex programming
- A survey on operator splitting and decomposition of convex programs
- Self equivalence of the alternating direction method of multipliers
- An Alternating Direction Method of Multipliers for the Optimization Problem Constrained with a Stationary Maxwell System
- An improved proximal alternating direction method for monotone variational inequalities with separable structure
- Precompact convergence of the nonconvex primal-dual hybrid gradient algorithm
- Proximal alternating directions method for structured variational inequalities
- An improved contraction method for structured monotone variational inequalities
- On full Jacobian decomposition of the augmented Lagrangian method for separable convex programming
- On alternating direction method for solving variational inequality problems with separable structure
- A multi-mode expansion method for boundary optimal control problems constrained by random Poisson equations
- Convergence study on the symmetric version of ADMM with larger step sizes
- Convergence study of indefinite proximal ADMM with a relaxation factor
- SQP alternating direction method with a new optimal step size for solving variational inequality problems with separable structure
- On the \(O(1/t)\) convergence rate of Ye-Yuan's modified alternating direction method of multipliers
- Supervised distance preserving projection using alternating direction method of multipliers
- An efficient alternating direction method of multipliers for optimal control problems constrained by random Helmholtz equations
- A decomposition method for solving multicommodity network equilibria
- An improved proximal-based decomposition method for structured monotone variational inequalities
- A survey on some recent developments of alternating direction method of multipliers
- Relaxed augmented Lagrangian-based proximal point algorithms for convex optimization with linear constraints
- On Glowinski's open question on the alternating direction method of multipliers
- The improvement with relative errors of He et al.'s inexact alternating direction method for monotone variational inequalities
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
- A simple alternating direction method for the conic trust region subproblem
- Proximal alternating direction-based contraction methods for separable linearly constrained convex optimization
- Multicommodity network flows: A survey. II: Solution methods
- Global Complexity Bound of a Proximal ADMM for Linearly Constrained Nonseparable Nonconvex Composite Programming
- A proximal ADMM with the Broyden family for convex optimization problems
- A proximal fully parallel splitting method with a relaxation factor for separable convex programming
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4311908)
