Characterizing global optimality for DC optimization problems under convex inequality constraints

DOI10.1007/BF00138691zbMath0855.90100OpenAlexW2064721360MaRDI QIDQ1924070

Yanyan Li

Publication date: 24 November 1996

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00138691

zbMATH Keywords

convex analysisgeneralized Farkas' lemmaDC optimization\(\varepsilon\)-subdifferentialscharacterizations of global optimalitydifference convex (DC) optimization problems

Mathematics Subject Classification ID

Convex programming (90C25) Nonsmooth analysis (49J52)

Related Items (9)

Convex inequalities without constraint qualification nor closedness condition, and their applications in optimization ⋮ On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions ⋮ Characterization of d.c. Functions in terms of quasidifferentials ⋮ Some new Farkas-type results for inequality systems with DC functions ⋮ \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints ⋮ ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps ⋮ New global optimality conditions for nonsmooth DC optimization problems ⋮ On set containment characterizations for sets described by set-valued maps with applications ⋮ On difference convexity of locally Lipschitz functions

Cites Work

• Constrained global optimization: algorithms and applications
• Generalizations of Slater's constraint qualification for infinite convex programs
• On systems of convex inequalities
• Zero duality gaps in infinite-dimensional programming
• A new version of Farkas' lemma and global convex maximization
• A Farkas lemma for difference sublinear systems and quasidifferentiable programming
• Calculus rules for global approximate minima and applications to approximate subdifferential calculus
• Handbook of global optimization
• Asymptotic dual conditions characterizing optimality for infinite convex programs
• Strong and Weak Convexity of Sets and Functions
• Results of farkas type
• A Global Optimization Algorithm for Concave Quadratic Programming Problems
• Nonlinear Extensions of Farkas’ Lemma with Applications to Global Optimization and Least Squares
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Characterizing global optimality for DC optimization problems under convex inequality constraints