Composite Multiobjective Nonsmooth Programming
The Composite model problem (VP) is broad and flexible enough to cover many common types of multiobjective problems, see in the literature. Moreover, the model obviously includes the wide class of convex composite single objective problems, which is now recognized as funda mental for theory and computation in scalar nonsmooth optimization. To illustrate the nature of the model (VP), let us look at some examples.
KeywordsEfficient Solution Feasible Point Constraint Qualification Multiobjective Problem Weak Duality
Unable to display preview. Download preview PDF.