Robust solution of nonconvex global optimization problems

DOI10.1007/s10898-004-2707-6zbMath1123.90059MaRDI QIDQ2576450

Hoang Tuy

Publication date: 13 December 2005

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-004-2707-6

zbMATH Keywords

-approximate optimal solution; Essential \(\varepsilon\)-optimal solution; Incumbent transcending approach; Pitfall in approximate nonconvex global optimization; Robust global optimization

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

90C31: Sensitivity, stability, parametric optimization

Related Items

An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem, Global optimization for the generalized polynomial sum of ratios problem, A robust algorithm for generalized geometric programming, Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint, \({{\mathcal {D}(\mathcal {C})}}\)-optimization and robust global optimization, A robust algorithm for quadratic optimization under quadratic constraints, Solving the Karush-Kuhn-Tucker system of a nonconvex programming problem on an unbounded set

Cites Work

• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• Optimization on low rank nonconvex structures
• Monotonic Optimization: Problems and Solution Approaches
• Convex analysis and global optimization
• Unnamed Item