Convex composite multi-objective nonsmooth programming

Convex composite multi-objective nonsmooth programming

0.00 Avg rating0 Votes
Article ID: iaor19941891
Country: Netherlands
Volume: 59
Issue: 3
Start Page Number: 325
End Page Number: 343
Publication Date: May 1993
Journal: Mathematical Programming (Series A)
Authors: ,
Keywords: Lagrangean methods
Abstract:

This paper examines nonsmooth constrained multi-objective optimization problems where the objective function and the constraints are compositions of convex functions, and locally Lipschitz and Gateaux differentiable functions. Lagrangean necessary conditions, and new sufficient optimality áG

Reviews

Required fields are marked *. Your email address will not be published.