Necessary and sufficient conditions for strong Fenchel-Lagrange duality via a coupling conjugation scheme
type: Item
instance of: scholarly article
title: Necessary and sufficient conditions for strong Fenchel-Lagrange duality via a coupling conjugation scheme
zbMATH Open document ID: 1386.52001
author: Peng Zhang
published in: Journal of Optimization Theory and Applications
publication date: 2018-03-22T00:00:00Z
review text: Employing a so-called coupled conjugation scheme (presented in detail in the preliminary section), the authors introduce a Fenchel-Lagrange dual problem to a constrained primal one by means of a generalized version of the classical perturbation theory. Strong duality is achieved under even convexity hypotheses and closedness type regularity conditions. Comparisons of the considered regularity conditions and examples where these are not equivalent are delivered, too, and the paper closes with conclusions and ideas for future research in this direction.
reviewed by: Sorin-Mihai Grad
Mathematics Subject Classification ID: 52A20
Mathematics Subject Classification ID: 26B25
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 49N15
zbMATH DE Number: 6852047
zbMATH Keywords: evenly convex function
zbMATH Keywords: generalized convex conjugation
zbMATH Keywords: Fenchel-Lagrange dual problem
zbMATH Keywords: closedness type regularity condition
MaRDI profile type: Publication
full work available at URL: s10957-017-1209-x
OpenAlex ID: W2776611667
cites work: Q4050397
cites work: Q4085497
cites work: Q5814430
cites work: Q5199377
cites work: Q3450749
cites work: The e-support function of an e-convex set and conjugacy for e-convex functions
cites work: Inf-convolution, sous-additivite, convexite des fonctions numériques
cites work: Infimal convolution, \( c \)-subdifferentiability, and Fenchel duality in evenly convex optimization
cites work: Lagrange duality for evenly convex optimization problems
cites work: New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces
cites work: Q3628086
cites work: Strong duality for generalized convex optimization problems
cites work: Fenchel-Lagrange duality versus geometric duality in convex optimization
cites work: A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
cites work: Generalized Moreau–Rockafellar results for composed convex functions
cites work: Duality in Vector Optimization
cites work: A Fenchel-Lagrange duality approach for a bilevel programming problem with extremal-value function
cites work: The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions
cites work: Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
cites work: An Extended Fenchel--Lagrange Duality Approach and Optimality Conditions for Strong Bilevel Programming Problems
cites work: A comparison of alternative c-conjugate dual problems in infinite convex optimization
cites work: Characterizations of evenly convex sets and evenly quasiconvex functions
cites work: On linear systems containing strict inequalities
cites work: Generalized Convexity, Generalized Monotonicity and Nonsmooth Analysis
cites work: Stable strong Fenchel and Lagrange duality for evenly convex optimization problems
DOI: 10.1007/S10957-017-1209-X
description: scientific article; zbMATH DE number 6852047