Dual method for solving a special problem of quadratic programming as a subproblem at linearly constrained nonlinear minimax approximation
Ladislav Lukšan (1984)
Kybernetika
Similarity:
Ladislav Lukšan (1984)
Kybernetika
Similarity:
Laureano F. Escudero (1981)
Qüestiió
Similarity:
We discuss in this work the first-order, second-order and pseudo-second-order estimations of Lagrange multipliers in nonlinear constrained minimization. The paper also justifies estimations and strategies that are used by two nonlinear programming algorithms that are also briefly described.
Ladislav Lukšan (1985)
Kybernetika
Similarity:
Laureano F. Escudero (1982)
Qüestiió
Similarity:
We discuss in this work the using of Lagrange multipliers estimates in linearly constrained nonlinear programming algorithms and the implication of zero or near-to-zero Lagrange multipliers. Some methods for estimating the tendency of the multipliers are proposed in the context of a given algorithm.
Miroslav Tůma (1991)
Kybernetika
Similarity:
Gemayqzel Bouza-Allende, Jurgen Guddat (2010)
The Yugoslav Journal of Operations Research
Similarity:
Eugenio Mijangos (2002)
Qüestiió
Similarity:
The minimization of a nonlinear function with linear and nonlinear constraints and simple bounds can be performed by minimizing an augmented Lagrangian function, including only the nonlinear constraints. This procedure is particularly interesting in case that the linear constraints are flow conservation equations, as there exist efficient techniques to solve nonlinear network problems. It is then necessary to estimate their multipliers, and variable reduction techniques can be used to...