Optimality conditions in global optimization and their applications

DOI10.1007/s10107-007-0142-4zbMath1191.90047OpenAlexW2070798439MaRDI QIDQ1016343

Alexander Rubinov, Zhi-You Wu

Publication date: 5 May 2009

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-007-0142-4

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)

Related Items (13)

Generalized subdifferentials of the sign change counting function ⋮ Global optimization of the difference of two increasing plus-convex-along-rays functions ⋮ Zero duality gap conditions via abstract convexity ⋮ Q-subdifferential and Q-conjugate for global optimality ⋮ A refinement of the Bergström inequality ⋮ A refinement of Newton and Maclaurin inequalities through abstract convexity ⋮ Sufficient global optimality conditions for weakly convex minimization problems ⋮ The sharper version for generalized power mean inequalities with negative exponent ⋮ D.C. programming approach for solving an applied ore-processing problem ⋮ The sharpening Hölder inequality via abstract convexity ⋮ A sharpened version of Aczél inequality by abstract convexity ⋮ The sharper form of a Brunn-Minkowski type inequality for boxes ⋮ Global optimality conditions for some classes of optimization problems

Cites Work

• Sufficient global optimality conditions for bivalent quadratic optimization
• Global optimality conditions for nonconvex optimization
• Conditions for global optimality. II
• Necessary and sufficient global optimality conditions for convex maximization revisited
• Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
• Global optimum shape design
• Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
• Limiting behaviour of the approximate first order and second order directional derivatives for a convex function
• Toland-singer formula cannot distinguish a global minimizer from a choice of stationary points^*
• Convex analysis and global optimization
• Abstract convexity and global optimization
• Piecewise-convex maximization problems.
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimality conditions in global optimization and their applications