An asymmetric proximal decomposition method for convex programming with linearly coupling constraints (Q447556): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 5 users not shown) | |||
Property / author | |||
Property / author: D. Rodríguez-Gómez / rank | |||
Normal rank | |||
Property / review text | |||
Summary: The problems studied are the separable variational inequalities with linearly coupling constraints. Some existing decomposition methods are very problem specific, and the computation load is quite costly. Combining the ideas of proximal point algorithm (PPA) and augmented Lagrangian method (ALM), we propose an asymmetric proximal decomposition method (AsPDM) to solve a wide variety separable problems. By adding an auxiliary quadratic term to the general Lagrangian function, our method can take advantage of the separable feature. We also present an inexact version of AsPDM to reduce the computation load of each iteration. In the computation process, the inexact version only uses the function values. Moreover, the inexact criterion and the step size can be implemented in parallel. The convergence of the proposed method is proved, and numerical experiments are employed to show the advantage of AsPDM. | |||
Property / review text: Summary: The problems studied are the separable variational inequalities with linearly coupling constraints. Some existing decomposition methods are very problem specific, and the computation load is quite costly. Combining the ideas of proximal point algorithm (PPA) and augmented Lagrangian method (ALM), we propose an asymmetric proximal decomposition method (AsPDM) to solve a wide variety separable problems. By adding an auxiliary quadratic term to the general Lagrangian function, our method can take advantage of the separable feature. We also present an inexact version of AsPDM to reduce the computation load of each iteration. In the computation process, the inexact version only uses the function values. Moreover, the inexact criterion and the step size can be implemented in parallel. The convergence of the proposed method is proved, and numerical experiments are employed to show the advantage of AsPDM. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 49J40 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6076651 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q58698812 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2012/281396 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2071926927 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Generalized Linear-Quadratic Problems of Deterministic and Stochastic Optimal Control in Discrete Time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5618030 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Monotone Operators and the Proximal Point Algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A logarithmic-quadratic proximal method for variational inequalities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Proximal minimization algorithm with \(D\)-functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Comparison of two kinds of prediction-correction methods for monotone variational inequalities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convergence of Proximal-Like Algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4001523 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A proximal-based deomposition method for compositions method for convex minimization problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Self-adaptive operator splitting methods for monotone variational inequalities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Proximal Decomposition on the Graph of a Maximal Monotone Operator / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3995612 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A modified augmented Lagrangian method for a class of monotone variational inequalities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Application of the alternating direction method of multipliers to separable convex programming problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Numerical Optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Separable diagonalized multiplier method for decomposition nonlinear programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4362982 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Proximal-point algorithm using a linear proximal term / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4767830 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 16:09, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An asymmetric proximal decomposition method for convex programming with linearly coupling constraints |
scientific article |
Statements
An asymmetric proximal decomposition method for convex programming with linearly coupling constraints (English)
0 references
4 September 2012
0 references
Summary: The problems studied are the separable variational inequalities with linearly coupling constraints. Some existing decomposition methods are very problem specific, and the computation load is quite costly. Combining the ideas of proximal point algorithm (PPA) and augmented Lagrangian method (ALM), we propose an asymmetric proximal decomposition method (AsPDM) to solve a wide variety separable problems. By adding an auxiliary quadratic term to the general Lagrangian function, our method can take advantage of the separable feature. We also present an inexact version of AsPDM to reduce the computation load of each iteration. In the computation process, the inexact version only uses the function values. Moreover, the inexact criterion and the step size can be implemented in parallel. The convergence of the proposed method is proved, and numerical experiments are employed to show the advantage of AsPDM.
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references