On a Lagrangian penalty function method for nonlinear programming problems (Q1186086): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf01184153 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2084052188 / rank | |||
Normal rank |
Latest revision as of 09:35, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On a Lagrangian penalty function method for nonlinear programming problems |
scientific article |
Statements
On a Lagrangian penalty function method for nonlinear programming problems (English)
0 references
28 June 1992
0 references
\textit{Le D. Muu} and \textit{W. Oettli} [Numer. Funct. Anal. Optimization 10, No. 9/10, 1003-1017 (1989; Zbl 0703.49011)] have proposed a Lagrangian penalty function method for monotone variational inequalities in which for the convergence of the algorithm it is required that a penalized subproblem has a unique solution. The author first modifies the algorithm for convex programming to obtain a geometric rate of convergence. The author further shows that the special case of the algorithm proposed by Muu and Oettli as applied to nonconvex problems is still convergent without the coercivity and convexity assumptions.
0 references
Lagrangian penalty function method
0 references
monotone variational inequalities
0 references
geometric rate of convergence
0 references