Approximate optimality conditions and stopping criteria in canonical DC programming
From MaRDI portal
Publication:3562379
DOI10.1080/10556780903178048zbMath1190.90133OpenAlexW1982405519WikidataQ118165473 ScholiaQ118165473MaRDI QIDQ3562379
Giancarlo Bigi, Antonio Frangioni, Qing-Hua Zhang
Publication date: 21 May 2010
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780903178048
Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items (5)
Outer approximation algorithms for DC programs and beyond ⋮ Beyond canonical dc-optimization: the single reverse polar problem ⋮ A new necessary and sufficient global optimality condition for canonical DC problems ⋮ A branch and reduce approach for solving a class of low rank d.c. programs ⋮ New global optimality conditions for nonsmooth DC optimization problems
This page was built for publication: Approximate optimality conditions and stopping criteria in canonical DC programming
