Duality principles for optimization problems dealing with the difference of vector-valued convex mappings

Authors:
M. Volle
Affiliations:
Professor, Department of Mathematics, University of Avignon, Avignon, France
Venue:
Journal of Optimization Theory and Applications
Year:
2002

Citing 4
Cited 1

Concave duality: application to problems dealing with difference of functions

Mathematical Programming: Series A and B - Special Issue: Essays on Nonconvex Optimization
DC programming: overview

Journal of Optimization Theory and Applications
Duality in Reverse Convex Optimization

SIAM Journal on Optimization
A General Duality Scheme for Nonconvex Minimization Problems with a Strict Inequality Constraint

Journal of Global Optimization

Multicriteria Optimal Control and Vectorial Hamilton-Jacobi Equation

Large-Scale Scientific Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using the concept of a subdifferential of a vector-valued convex mapping, we provide duality formulas for the minimization of nonconvex composite functions and related optimization problems such as the minimization of a convex function over a vectorial DC constraint.