
doi: 10.1137/0806012
Summary: We present a variational-type necessary and sufficient condition for the optimality in a quasi-convex minimization, in which a vanishing differential is not a sufficient condition. Using this condition, we show that path-following methods can, in principle, be applied to solve a quasi-convex minimization. Also, we give a connection between an optimality condition and a duality scheme using a minimax principle.
generalized convexity, optimality condition, KTT, Nonsmooth analysis, variational inequality, Variational inequalities, Karush-Kuhn-Tucker condition, Nonconvex programming, global optimization, minimax principle, Optimality conditions for minimax problems, duality, Duality theory (optimization), quasi-convex minimization
generalized convexity, optimality condition, KTT, Nonsmooth analysis, variational inequality, Variational inequalities, Karush-Kuhn-Tucker condition, Nonconvex programming, global optimization, minimax principle, Optimality conditions for minimax problems, duality, Duality theory (optimization), quasi-convex minimization
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 4 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
