Sensitivity Analysis of the Proximal-Based Parallel Decomposition Methods
The proximal-based parallel decomposition methods were recently proposed to solve structured convex optimization problems. These algorithms are eligible for parallel computation and can be used efficiently for solving large-scale separable problems. In this paper, compared with the previous theoreti...
Main Authors: | Feng Ma, Mingfang Ni, Lei Zhu, Zhanke Yu |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2014-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2014/891017 |
Similar Items
-
A New Implementable Prediction-Correction Method for Monotone
Variational Inequalities with Separable Structure
by: Feng Ma, et al.
Published: (2013-01-01) -
An Implementable First-Order Primal-Dual Algorithm for Structured Convex Optimization
by: Feng Ma, et al.
Published: (2014-01-01) -
A Lagrange Relaxation Method for Solving Weapon-Target Assignment Problem
by: Mingfang Ni, et al.
Published: (2011-01-01) -
Power Geometric Operators of Hesitant Multiplicative Fuzzy Numbers and Their Application to Multiple Attribute Group Decision Making
by: Lei Wang, et al.
Published: (2014-01-01) -
Dynamic Route Guidance Using Improved Genetic Algorithms
by: Zhanke Yu, et al.
Published: (2013-01-01)