scientific article; zbMATH DE number 4066628
From MaRDI portal
Publication:3799819
The following convex programming problem for a nonempty set Z \(*=X\) *\(\times Y\) * of saddle points with Lagrangean function L in R n is considered: \[ (1)\quad \max \{f(x)| \quad g_ i(x)\geq 0,\quad i=1,2,...,m\}. \] A gradient method for finding points of the set Z * is suggested based on the Lagrange multiplier method. A Lagrangean deformation function is used for the choice of the step length. This method converges to the set Z *.
Recommendations
Cited in
(2)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3799819)