A general duality scheme for nonconvex minimization problems with a strict inequality constraint
From MaRDI portal
Publication:1272993
DOI10.1023/A:1008285930026zbMath0934.90058MaRDI QIDQ1272993
Publication date: 25 April 2000
Published in: Journal of Global Optimization (Search for Journal in Brave)
Related Items (6)
Duality for multiobjective optimization problems with convex objective functions and D.C. constraints ⋮ Some new Farkas-type results for inequality systems with DC functions ⋮ On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint ⋮ Duality principles for optimization problems dealing with the difference of vector-valued convex mappings ⋮ What is quasiconvex analysis? ⋮ Duality in D. C. programming: The case of several D. C. constraints
This page was built for publication: A general duality scheme for nonconvex minimization problems with a strict inequality constraint
