Duality in D. C. programming: The case of several D. C. constraints

DOI10.1006/jmaa.1999.6496zbMath0946.90064OpenAlexW1990754283WikidataQ57836409 ScholiaQ57836409MaRDI QIDQ1305471

Michel Volle, Juan-Enrique Martinez-Legaz

Publication date: 30 September 1999

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jmaa.1999.6496

zbMATH Keywords

d.c. functions Legendre-Fenchel conjugates

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Related Items

Relaxed Lagrangian duality in convex infinite optimization: reducibility and strong duality, The stable duality of DC programs for composite convex functions, Duality for multiobjective optimization problems with convex objective functions and D.C. constraints, Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization, Farkas-type results for fractional programming problems, The DTC (difference of tangentially convex functions) programming: optimality conditions, Lagrange-type duality in DC programming problems with equivalent DC inequalities, Some characterizations of duality for DC optimization with composite functions, Fenchel-Lagrange duality for DC infinite programs with inequality constraints, Stability of the duality gap in linear optimization, On some geometric conditions for minimality of DCH-functions via DC-duality approach, Total Lagrange duality for DC infinite optimization problems, Theorems of the alternative for multivalued mappings and applications to mixed convex \(\backslash\) concave systems of inequalities, Asymptotic closure condition and Fenchel duality for DC optimization problems in locally convex spaces, Sum-of-squares relaxations in robust DC optimization and feature selection, Duality and Farkas-type results for extended Ky Fan inequalities with DC functions, Necessary optimality conditions for vector reverse convex minimization problems via a conjugate duality, Characterization of d.c. Functions in terms of quasidifferentials, An extended conjugate duality for generalized semi-infinite programming problems via a convex decomposition, Farkas-Type Theorems and Applications: From IPH Functions to ICR Functions, Some new Farkas-type results for inequality systems with DC functions, Farkas-type results for constrained fractional programming with DC functions, Lagrange-type duality in DC programming, DC approach to weakly convex optimization and nonconvex quadratic optimization problems, On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint, A closedness condition and its applications to DC programs with convex constraints, On global unconstrained minimization of the difference of polyhedral functions, Lagrange duality in canonical DC programming, Duality principles for optimization problems dealing with the difference of vector-valued convex mappings, Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems, Duality and Farkas-type results for DC fractional programming with DC constraints, Lower semicontinuous regularization for vector-valued mappings, Optimality conditions for minimizing the difference of nonconvex vector-valued mappings, On Lagrange Duality for Several Classes of Nonconvex Optimization Problems, Functional inequalities and theorems of the alternative involving composite functions, Some Farkas-type results for fractional programming problems with DC functions, New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions, Optimality conditions and duality for DC programming in locally convex spaces, Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs, Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming, Optimality conditions for D.C. vector optimization problems under reverse convex constraints, An Extended Fenchel--Lagrange Duality Approach and Optimality Conditions for Strong Bilevel Programming Problems

Cites Work