Peeling Off a Nonconvex Cover of an Actual Convex Problem: Hidden Convexity

DOI10.1137/050648584zbMath1211.90241OpenAlexW2055664002WikidataQ57445482 ScholiaQ57445482MaRDI QIDQ3503206

Yang, Xinmin, Li, Duan, Lian-Sheng Zhang, Zhi-You Wu

Publication date: 22 May 2008

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/050648584

zbMATH Keywords

global optimizationconvexityhidden convexityhidden-convex functionhidden-convex programming problem

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (3)

A review of recent advances in global optimization ⋮ A survey of hidden convex optimization ⋮ New Kuhn-Tucker sufficiency for global optimality via convexification

This page was built for publication: Peeling Off a Nonconvex Cover of an Actual Convex Problem: Hidden Convexity