An asymmetric proximal decomposition method for convex programming with linearly coupling constraints
From MaRDI portal
Publication:447556
DOI10.1155/2012/281396zbMATH Open1246.90117OpenAlexW2071926927WikidataQ58698812 ScholiaQ58698812MaRDI QIDQ447556FDOQ447556
Authors: Xiaoling Fu, Xiangfeng Wang, Hai-Yan Wang, Ying Zhai 
Publication date: 4 September 2012
Published in: Advances in Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/281396
Recommendations
- An inexact proximal decomposition method for variational inequalities with separable structure
- Entropic proximal decomposition methods for convex programs and variational inequalities
- Nonlinear proximal decomposition method for convex programming
- An improved proximal-based decomposition method for structured monotone variational inequalities
- scientific article; zbMATH DE number 3959124
Cites Work
- Numerical Optimization
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Title not available (Why is that?)
- Application of the alternating direction method of multipliers to separable convex programming problems
- A proximal-based deomposition method for compositions method for convex minimization problems
- Title not available (Why is that?)
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Title not available (Why is that?)
- A logarithmic-quadratic proximal method for variational inequalities
- Title not available (Why is that?)
- Convergence of Proximal-Like Algorithms
- Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
- Proximal minimization algorithm with \(D\)-functions
- A modified augmented Lagrangian method for a class of monotone variational inequalities
- Proximal Decomposition on the Graph of a Maximal Monotone Operator
- Proximal-point algorithm using a linear proximal term
- Self-adaptive operator splitting methods for monotone variational inequalities
- Comparison of two kinds of prediction-correction methods for monotone variational inequalities
- Separable diagonalized multiplier method for decomposition nonlinear programs
- Title not available (Why is that?)
- Generalized Linear-Quadratic Problems of Deterministic and Stochastic Optimal Control in Discrete Time
Cited In (1)
This page was built for publication: An asymmetric proximal decomposition method for convex programming with linearly coupling constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q447556)
