On nonconvex optimization

From MaRDI portal





Special classes of nonconvex minimization problems, for which the necessary Lagrangian conditions are also sufficient for a minimum. This can be guaranteed under uniqueness conditions or by making use of generalized convexity assumptions such as invexity or \(V\)-invexity. The author shows that for a substantial of minimization problems there is exactly one point satisfying the necessary optimality conditions so that there is no need to assume generalized convexity hypotheses.











This page was built for publication: On nonconvex optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q696127)