Iterative methods for solving non-linear programming problems, using modified Lagrange functions

DOI10.1016/0041-5553(80)90272-4zbMath0466.90071OpenAlexW2081141598MaRDI QIDQ3919466

No author found.

Publication date: 1980

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(80)90272-4

zbMATH Keywords

modified Lagrange functionsequality- and inequality-type constraintsunconstrained local min-max problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (3)

An extension of the gradient projection method and Newton's method to extremum problems constrained by a smooth surface ⋮ Iterative algorithm for minimizing a convex function at the intersection of a spherical surface and a convex compact set ⋮ Convergence of the gradient projection method and Newton's method as applied to optimization problems constrained by intersection of a spherical surface and a convex closed set

This page was built for publication: Iterative methods for solving non-linear programming problems, using modified Lagrange functions