Sufficient conditions and perfect duality in nonconvex minimization with inequality constraints

DOI10.3934/jimo.2005.1.53zbMath1140.90506OpenAlexW2776367212MaRDI QIDQ1780345

David Yang Gao

Publication date: 7 June 2005

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2005.1.53

zbMATH Keywords

global optimization, duality, concave minimization, quadratic programming, NP-hard problems, optimality condition

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)

Related Items (5)

A review of recent advances in global optimization ⋮ Canonical Dual Approach for Minimizing a Nonconvex Quadratic Function over a Sphere ⋮ Global optimal solutions to a class of quadrinomial minimization problems with one quadratic constraint ⋮ A DC programming approach for sensor network localization with uncertainties in anchor positions ⋮ Optimal solutions to a class of nonconvex minimization problems with linear inequality constraints

This page was built for publication: Sufficient conditions and perfect duality in nonconvex minimization with inequality constraints