On nonconvex optimization (Q696127)

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.