When Is a Point x Satisfying ∇f(x) = 0 a Global Minimum of f?

DOI10.2307/2323035zbMath0603.49015OpenAlexW2315610012MaRDI QIDQ3739774

Jean-Baptiste Hiriart-Urruty

Publication date: 1986

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2323035

zbMATH Keywords

first-order necessary conditionscritical pointFenchel transformbiconjugate

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Methods involving semicontinuity and convergence; relaxation (49J45) Duality theory (optimization) (49N15) Optimality conditions for free problems in two or more independent variables (49K10)

Related Items

Necessary and sufficient condition on global optimality without convexity and second order differentiability, Necessary and sufficient global optimality conditions for convex maximization revisited, A branch-and-reduce approach to global optimization, A new necessary and sufficient global optimality condition for canonical DC problems, The \(\varepsilon\)-strategy in variational analysis: illustration with the closed convexification of a function, Geometric conditions for Kuhn-Tucker sufficiency of global optimality in mathematical programming, New sufficiency for global optimality and duality of mathematical programming problems via underestimators, Global optimality conditions and duality theorems for robust optimal solutions of optimization problems with data uncertainty, using underestimators