scientific article
From MaRDI portal
Publication:2841072
zbMath1277.90086MaRDI QIDQ2841072
Guoyin Li, Vaithilingam Jeyakumar, Jin-Hua Wang
Publication date: 24 July 2013
Full work available at URL: http://www.heldermann.de/JCA/JCA20/JCA202/jca20024.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)
Related Items (13)
Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data ⋮ Complete characterizations of robust strong duality for robust vector optimization problems ⋮ Characterizations of robust solution set of convex programs with uncertain data ⋮ A unifying approach to robust convex infinite optimization duality ⋮ Unnamed Item ⋮ Robust SOS-convex polynomial optimization problems: exact SDP relaxations ⋮ Characterizing robust solution sets of convex programs under data uncertainty ⋮ Strong and total Fenchel dualities for robust convex optimization problems ⋮ Unnamed Item ⋮ Generalized robust duality in constrained nonconvex optimization ⋮ Sectional convexity of epigraphs of conjugate mappings with applications to robust vector duality ⋮ Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints ⋮ Strong duality for robust minimax fractional programming problems
This page was built for publication:
