Composite Multiobjective Nonsmooth Programming

Part of the Optimization and Its Applications book series (SOIA, volume 14)

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.


Efficient Solution Feasible Point Constraint Qualification Multiobjective Problem Weak Duality 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2008

Personalised recommendations