Application of the alternating direction method of multipliers to separable convex programming problems
From MaRDI portal
Publication:1202587
DOI10.1007/BF00247655zbMath0763.90071OpenAlexW1964709249MaRDI QIDQ1202587
Publication date: 14 February 1993
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00247655
global convergenceparallel algorithmalternating direction method of multipliersseparable structuredecomposition algorithmseparable convex programming
Convex programming (90C25) Parallel numerical computation (65Y05) Decomposition methods (49M27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A new parallel splitting augmented Lagrangian-based method for a Stackelberg game, An alternating direction method of multipliers for elliptic equation constrained optimization problem, Globally convergent block-coordinate techniques for unconstrained optimization, A proximal-based deomposition method for compositions method for convex minimization problems, Bounding duality gap for separable problems with linear constraints, Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities, On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming, An Adaptive Correction Approach for Tensor Completion, Alternating direction method for generalized Sylvester matrix equation \(AXB + CYD = E\), Separable augmented Lagrangian algorithm with multidimensional scaling for monotropic programming, The developments of proximal point algorithms, A proximal alternating linearization method for nonconvex optimization problems, An alternating direction method for Nash equilibrium of two-person games with alternating offers, On the \(O(1/t)\) convergence rate of the parallel descent-like method and parallel splitting augmented Lagrangian method for solving a class of variational inequalities, The primal Douglas-Rachford splitting algorithm for a class of monotone mappings with application to the traffic equilibrium problem, A new parallel splitting descent method for structured variational inequalities, A parallel splitting method for separable convex programs, An LQP-based descent method for structured monotone variational inequalities, On the convergence rate of a class of proximal-based decomposition methods for monotone variational inequalities, A note on the alternating direction method of multipliers, A proximal alternating linearization method for minimizing the sum of two convex functions, A variable projection method for large-scale inverse problems with \(\ell^1\) regularization, An augmented Lagrangian-based parallel splitting method for a one-leader-two-follower game, A new decomposition method for variational inequalities with linear constraints, A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems, Optimal matrix pencil approximation problem in structural dynamic model updating, Generalized risk parity portfolio optimization: an ADMM approach, Proximal alternating direction-based contraction methods for separable linearly constrained convex optimization, An ADM-based splitting method for separable convex programming, Alternating direction method for structure-persevering finite element model updating problem, New decomposition methods for solving variational inequality problems., A survey on operator splitting and decomposition of convex programs, Modified Lagrangian methods for separable optimization problems, Relaxed augmented Lagrangian-based proximal point algorithms for convex optimization with linear constraints, An asymmetric proximal decomposition method for convex programming with linearly coupling constraints, An inexact parallel splitting augmented Lagrangian method for monotone variational inequalities with separable structures, An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints, A self-adaptive descent LQP alternating direction method for the structured variational inequalities, Proximal alternating direction method with relaxed proximal parameters for the least squares covariance adjustment problem, A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints, 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, An inexact alternating direction method for structured variational inequalities, Proximal-based pre-correction decomposition methods for structured convex minimization problems, An improved proximal-based decomposition method for structured monotone variational inequalities, A relaxed projection method for split variational inequalities, An alternating direction method with increasing penalty for stable principal component pursuit, A new alternating direction method for linearly constrained nonconvex optimization problems, On the \(O(1/t)\) convergence rate of Ye-Yuan's modified alternating direction method of multipliers, Accelerating a Gibbs sampler for variable selection on genomics data with summarization and variable pre-selection combining an array DBMS and R, Linearized Alternating Direction Method of Multipliers for Constrained Linear Least-Squares Problem, A computation study on an integrated alternating direction method of multipliers for large scale optimization, Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization, Decomposition methods for a spatial model for long-term energy pricing problem, An efficient simultaneous method for the constrained multiple-sets split feasibility problem, An alternating direction method for linear‐constrained matrix nuclear norm minimization, An improved proximal alternating direction method for monotone variational inequalities with separable structure, Two-level primal-dual proximal decomposition technique to solve large scale optimization problems, Convergence analysis of the generalized alternating direction method of multipliers with logarithmic-quadratic proximal regularization, An inexact parallel splitting augmented Lagrangian method for large system of linear equations, An improved prediction-correction method for monotone variational inequalities with separable operators, Decomposition method with a variable parameter for a class of monotone variational inequality problems, New parallel descent-like method for solving a class of variational inequalities, Alternating direction method for covariance selection models, A descent method for structured monotone variational inequalities, Fast inexact decomposition algorithms for large-scale separable convex optimization, Variable splitting based method for image restoration with impulse plus Gaussian noise, A new convergence proof of augmented Lagrangian-based method with full Jacobian decomposition for structured variational inequalities, A study on distributed optimization over large-scale networked systems, Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach, Sparse inverse kernel Gaussian Process regression, Proximal-point algorithm using a linear proximal term, A class of alternating linearization algorithms for nonsmooth convex optimization, A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems, An alternating direction method for solving convex nonlinear semidefinite programming problems, An alternating direction-based contraction method for linearly constrained separable convex programming problems, A partial inexact alternating direction method for structured variational inequalities, A variable-penalty alternating directions method for convex optimization, Alternating direction splittings for block angular parallel optimization, An improved contraction method for structured monotone variational inequalities, Decomposition for structured convex programs with smooth multiplier methods, A new criterion for an inexact parallel splitting augmented Lagrangian method, Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities, Nonlinear proximal decomposition method for convex programming, A hybrid splitting method for variational inequality problems with separable structure, A Linearized Alternating Direction Method of Multipliers with Substitution Procedure, Dual–primal proximal point algorithms for extended 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partial inverse of a monotone operator
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
- Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
- Applications of the method of partial inverses to convex programming: Decomposition
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Convex Analysis
