A parallel processing multi-coordinate descent method with line search for a class of large-scale optimization--Algorithm and convergence

S. Y. Lin

A parallel processing multi-coordinate descent method with line search for a class of large-scale optimization--Algorithm and convergence

S. Y. Lin^*

^*Corresponding author for this work

National Yang Ming Chiao Tung University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

Abstract

An efficient parallel processing multicoordinate descent method with line search is proposed for the large-scale unconstrained optimization problems with sparse structure. Its convergence is proved, and it is noted that its efficiency is obvious from its inherent properties. A trivial application of the proposed algorithm is the large-scale power system static-state estimation problem.

Original language	English
Title of host publication	Proceedings of the IEEE Conference on Decision and Control
Publisher	Publ by IEEE
Pages	2096-2097
Number of pages	2
ISBN (Print)	0780304500
State	Published - 1991
Externally published	Yes
Event	Proceedings of the 30th IEEE Conference on Decision and Control Part 1 (of 3) - Brighton, Engl Duration: 11 12 1991 → 13 12 1991

Publication series

Name	Proceedings of the IEEE Conference on Decision and Control
Volume	3
ISSN (Print)	0191-2216

Conference

Conference	Proceedings of the 30th IEEE Conference on Decision and Control Part 1 (of 3)
City	Brighton, Engl
Period	11/12/91 → 13/12/91

Cite this

@inproceedings{1f33acb45a1e40789bc497824443c1d9,

title = "A parallel processing multi-coordinate descent method with line search for a class of large-scale optimization--Algorithm and convergence",

abstract = "An efficient parallel processing multicoordinate descent method with line search is proposed for the large-scale unconstrained optimization problems with sparse structure. Its convergence is proved, and it is noted that its efficiency is obvious from its inherent properties. A trivial application of the proposed algorithm is the large-scale power system static-state estimation problem.",

author = "Lin, \{S. Y.\}",

year = "1991",

language = "英语",

isbn = "0780304500",

series = "Proceedings of the IEEE Conference on Decision and Control",

publisher = "Publ by IEEE",

pages = "2096--2097",

booktitle = "Proceedings of the IEEE Conference on Decision and Control",

note = "Proceedings of the 30th IEEE Conference on Decision and Control Part 1 (of 3) ; Conference date: 11-12-1991 Through 13-12-1991",

}

Lin, SY 1991, A parallel processing multi-coordinate descent method with line search for a class of large-scale optimization--Algorithm and convergence. in Proceedings of the IEEE Conference on Decision and Control. Proceedings of the IEEE Conference on Decision and Control, vol. 3, Publ by IEEE, pp. 2096-2097, Proceedings of the 30th IEEE Conference on Decision and Control Part 1 (of 3), Brighton, Engl, 11/12/91.

A parallel processing multi-coordinate descent method with line search for a class of large-scale optimization--Algorithm and convergence. / Lin, S. Y.
Proceedings of the IEEE Conference on Decision and Control. Publ by IEEE, 1991. p. 2096-2097 (Proceedings of the IEEE Conference on Decision and Control; Vol. 3).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A parallel processing multi-coordinate descent method with line search for a class of large-scale optimization--Algorithm and convergence

AU - Lin, S. Y.

PY - 1991

Y1 - 1991

N2 - An efficient parallel processing multicoordinate descent method with line search is proposed for the large-scale unconstrained optimization problems with sparse structure. Its convergence is proved, and it is noted that its efficiency is obvious from its inherent properties. A trivial application of the proposed algorithm is the large-scale power system static-state estimation problem.

AB - An efficient parallel processing multicoordinate descent method with line search is proposed for the large-scale unconstrained optimization problems with sparse structure. Its convergence is proved, and it is noted that its efficiency is obvious from its inherent properties. A trivial application of the proposed algorithm is the large-scale power system static-state estimation problem.

UR - https://www.scopus.com/pages/publications/0026379746

M3 - 会议稿件

AN - SCOPUS:0026379746

SN - 0780304500

T3 - Proceedings of the IEEE Conference on Decision and Control

SP - 2096

EP - 2097

BT - Proceedings of the IEEE Conference on Decision and Control

PB - Publ by IEEE

T2 - Proceedings of the 30th IEEE Conference on Decision and Control Part 1 (of 3)

Y2 - 11 December 1991 through 13 December 1991

ER -

A parallel processing multi-coordinate descent method with line search for a class of large-scale optimization--Algorithm and convergence

Abstract

Publication series

Conference

Other files and links

Fingerprint

Cite this