Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Fast approximation algorithms for multicommodity flow problems
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Journal of Network and Systems Management
Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
Fast deterministic approximation for the multicommodity flow problem
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Design and Interfacing of the IBM PC, PS, and Compatible
Design and Interfacing of the IBM PC, PS, and Compatible
Algorithms for Constrained and Weighted Nonlinear Least Squares
SIAM Journal on Optimization
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Hi-index | 12.05 |
In this paper, we propose a parallelized Dual Projected Pseudo Quasi-Newton (parallelized DPPQN) based Expert System method to solve a kind of distributed constrained optimization problem. The proposed parallelized DPPQN based Expert System method differs from the conventional Lagrange method by treating the inequality constraints as the domain of the original variable in the dual function and uses projection theory to process the inequality constraints. The proposed algorithm was implemented in a n+1 processors network. We also demonstrated the efficiency in solving a typical constrained weighted least squares problem in power system. The parallelized DPPQN based Expert System method associated with a projected Jacobi method can be applied to general large scale nonlinear network optimization problems in large distributed interconnected systems.