Global Optimality Criterion and a Duality with a Zero Gap in Nonconvex Optimization
From MaRDI portal
Publication:4274472
DOI10.1137/0524087zbMath0793.90057OpenAlexW1984975542MaRDI QIDQ4274472
Publication date: 13 January 1994
Published in: SIAM Journal on Mathematical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0524087
Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52) Duality theory (optimization) (49N15)
Related Items (18)
Duality in quasi-convex supremization and reverse convex infimization via abstract convex analysis,and applications to approximation ** ⋮ Dual representations of hulls for functions satisfyingf(0) = inff(X\{0})* ⋮ Multipliers and general Lagrangians ⋮ Conjugate duality and optimization over weakly efficient set ⋮ Dual problems of quasiconvex maximisation ⋮ Conjugate quasiconvex nonnegative functions ⋮ Optimality condition and quasi-conjugate duality with zero gap in nonconvex optimization ⋮ Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization ⋮ Critical duality ⋮ Nonlinear Lagrangian theory for nonconvex optimization. ⋮ The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems ⋮ Extended Lagrange And Penalty Functions in Continuous Optimization* ⋮ What is quasiconvex analysis? ⋮ Problems with resource allocation constraints and optimization over the efficient set ⋮ Perfect duality theory and complete solutions to a class of global optimization problems* ⋮ Toland-singer formula cannot distinguish a global minimizer from a choice of stationary points* ⋮ Projective dualities for quasiconvex problems ⋮ Optimality conditions for D.C. vector optimization problems under reverse convex constraints
This page was built for publication: Global Optimality Criterion and a Duality with a Zero Gap in Nonconvex Optimization