Sensitivity analysis of the proximal-based parallel decomposition methods

DOI10.1155/2014/891017MaRDI QIDQ1719313zbMATH OpenOpenAlexWikidataFDO

Authors Feng Ma, Lei Zhu, Zhanke Yu, Mingfang Ni

Publication date 8 February 2019

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.1155/2014/891017

Mathematics Subject Classification ID

Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• scientific article; zbMATH DE number 1300072
• Parallel sensitivity analysis for efficient large-scale dynamic optimization
• A parallel computational model for sensitivity analysis in optimization for robustness
• Sensitivity analysis for parameterized variational inequality problems
• scientific article; zbMATH DE number 5257352
• Sensitivity analysis in parametrized convex vector optimization
• Parallel proximal decomposition algorithms for robust estimation.
• A proximal partially parallel splitting method for separable convex programs

Cites work

• scientific article; zbMATH DE number 51132 (Why is no real title available?)
• scientific article; zbMATH DE number 3574917 (Why is no real title available?)
• scientific article; zbMATH DE number 6135093 (Why is no real title available?)
• scientific article; zbMATH DE number 3341597 (Why is no real title available?)
• A note on the alternating direction method of multipliers
• A proximal-based deomposition method for compositions method for convex minimization problems
• Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection
• Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
• Alternating direction augmented Lagrangian methods for semidefinite programming
• Alternating proximal gradient method for convex minimization
• An LQP-Based Decomposition Method for Solving a Class of Variational Inequalities
• An improved prediction-correction method for monotone variational inequalities with separable operators
• An inexact alternating direction method for solving a class of structured variational inequalities
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Navigating in a graph by aid of its spanning tree metric
• On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
• On the \(O(1/t)\) convergence rate of alternating direction method with logarithmic-quadratic proximal regularization
• On the \(O(1/t)\) convergence rate of the projection and contraction methods for variational inequalities with Lipschitz continuous monotone operators
• On the linear convergence of the alternating direction method of multipliers
• Proximal splitting methods in signal processing
• Proximal-like contraction methods for monotone variational inequalities in a unified framework. I: Effective quadruplet and primary methods
• Proximal-like contraction methods for monotone variational inequalities in a unified framework. II: General methods and numerical experiments
• The Split Bregman Method for L1-Regularized Problems
• The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent

Cited in

(2)

• A revisit of Chen-Teboulle's proximal-based decomposition method
• A parallel computational model for sensitivity analysis in optimization for robustness

Describes a project that uses

Uses Software

• RecPF
• UNLocBoX

This page was built for publication: Sensitivity analysis of the proximal-based parallel decomposition methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1719313)