Remarks on the convergence of Rosen's gradient projection method (Q578857): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(5 intermediate revisions by 5 users not shown) | |||
Property / author | |||
Property / author: Ding-Zhu Du / rank | |||
Property / author | |||
Property / author: Ding-Zhu Du / rank | |||
Normal rank | |||
Property / review text | |||
The convergence of Rosen's gradient projection method is a long-standing problem in nonlinear programming. Recently, \textit{X. Zhang} [Acta Math. Appl. Sin. 8, 125-128 (1985; Zbl 0566.90077)] proved that it is convergent in the 3-dimensional space; the author and \textit{X. Zhang} [A convergence theorem for Rosen's gradient projection method. MSRI Technical Report 02518-86 (1986)] proved its convergence in n-dimensional space under a restriction on a parameter in Rosen's method. In this paper, we propose a linearly algebraic conjecture which can yield the convergence of Rosen's method without the restriction. By verifying this conjecture for some special cases, we prove that Rosen's method is convergent in 4-dimensional space. | |||
Property / review text: The convergence of Rosen's gradient projection method is a long-standing problem in nonlinear programming. Recently, \textit{X. Zhang} [Acta Math. Appl. Sin. 8, 125-128 (1985; Zbl 0566.90077)] proved that it is convergent in the 3-dimensional space; the author and \textit{X. Zhang} [A convergence theorem for Rosen's gradient projection method. MSRI Technical Report 02518-86 (1986)] proved its convergence in n-dimensional space under a restriction on a parameter in Rosen's method. In this paper, we propose a linearly algebraic conjecture which can yield the convergence of Rosen's method without the restriction. By verifying this conjecture for some special cases, we prove that Rosen's method is convergent in 4-dimensional space. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65K05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C30 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 4013888 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Rosen's gradient projection method | |||
Property / zbMATH Keywords: Rosen's gradient projection method / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
convergence | |||
Property / zbMATH Keywords: convergence / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4135211 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3932576 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extensions of the continuity of point-to-set maps: Applications to fixed point algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3039052 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Enumerating rooted loopless planar maps / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3261425 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A superlinearly convergent method to linearly constrained optimization problems under degeneracy / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimization algorithms and point-to-set-maps / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4051876 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Validity of a Family of Optimization Methods / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sufficient conditions for the convergence of monotonic mathematical programming algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5617277 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5672476 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5563082 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3902842 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A unified approach to the feasible direction methods for nonlinear programming with linear constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convergence Conditions for Nonlinear Programming Algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5591247 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3945962 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3682257 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf02007671 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1970984682 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:03, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Remarks on the convergence of Rosen's gradient projection method |
scientific article |
Statements
Remarks on the convergence of Rosen's gradient projection method (English)
0 references
1987
0 references
The convergence of Rosen's gradient projection method is a long-standing problem in nonlinear programming. Recently, \textit{X. Zhang} [Acta Math. Appl. Sin. 8, 125-128 (1985; Zbl 0566.90077)] proved that it is convergent in the 3-dimensional space; the author and \textit{X. Zhang} [A convergence theorem for Rosen's gradient projection method. MSRI Technical Report 02518-86 (1986)] proved its convergence in n-dimensional space under a restriction on a parameter in Rosen's method. In this paper, we propose a linearly algebraic conjecture which can yield the convergence of Rosen's method without the restriction. By verifying this conjecture for some special cases, we prove that Rosen's method is convergent in 4-dimensional space.
0 references
Rosen's gradient projection method
0 references
convergence
0 references
0 references
0 references
0 references
0 references
0 references
0 references