From Local to Global
As we have seen in the previous chapters most of the existing methods in optimization focus on the very important problem of computing feasible points that satisfy necessary optimality conditions (Kuhn-Tucker points). In the previous chapter, we studied a special class of minimax problems for which a characterization of its global solutions was obtained.
KeywordsConvex Envelope Feasible Domain Maximum Clique Problem Global Minimum Point Nonconvex Constraint
Unable to display preview. Download preview PDF.