PARALLEL MULTIPLICATIVE ITERATIVE METHODS FOR CONVEX PROGRAMMING

descriptionPublicationkeyboard_double_arrow_right Article 01 Apr 1997 English Publisher:Elsevier BVJournal:Acta Mathematica Scientia, volume 17, pages 205-210 (issn: 0252-9602,

Copyright policy )

Authors: Chen, Zhong; Fei, Pusheng;

doi: 10.1016/s0252-9602(17)30836-6

PARALLEL MULTIPLICATIVE ITERATIVE METHODS FOR CONVEX PROGRAMMING

- Summary
- Subjects
- Metrics

Abstract

Summary: We present two parallel multiplicative algorithms for convex programming. If the objective function has compact level sets and has a locally Lipschitz continuous gradient, we discuss convergence of the algorithms. The proofs are essentially based on the results of sequential methods shown by \textit{P. P. B. Eggermont} [Linear Algebra Appl. 130, 25-42 (1990; Zbl 0715.65037)].

Related Organizations

Wuhan University
China (People's Republic of)

Keywords

Convex programming, compact level sets, locally Lipschitz continuous gradient, parallel multiplicative algorithms, Parallel numerical computation

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average