scientific article; zbMATH DE number 16508
[For the entire collection see Zbl 0696.00033.] The minimization problem \[ \min\{f(x)\mid g(x)\leq0,\;x\in X\subset R^ n\} \leqno(1) \] is considered together with a family of perturbed problems \[ \min\{f(x)\mid g(x)\leq y,\;x\in X\subset R^ n\} \leqno(2) \] where \(f: R^ n\to R^ 1,\) \(g: R^ n\to R^ m,\) \(y\in R^ m\). Various sequential unconstrained minimiyation methods such as penalty function methods, the functional parametrization methods and interior point methods are constructed connecting them with properties of the value function of the perturbed problem (2) and showing then the convergence of methods to the solution of (1) as \(y\to 0\).
- Perturbed variations of penalty function methods. Example: Projective SUMT
- scientific article; zbMATH DE number 3932802 (Why is no real title available?)
- scientific article; zbMATH DE number 1156848 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
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 Q3973191)
