Robust Solution of Nonconvex Global Optimization Problems

Authors:
Hoang Tuy
Affiliations:
Institute of Mathematics, Hanoi, Vietnam 10307
Venue:
Journal of Global Optimization
Year:
2005

Citing 2
Cited 4

Monotonic Optimization: Problems and Solution Approaches

SIAM Journal on Optimization
Deterministic Global Optimization: Theory, Methods and (NONCONVEX OPTIMIZATION AND ITS APPLICATIONS Volume 37) (Nonconvex Optimization and Its Applications)

Deterministic Global Optimization: Theory, Methods and (NONCONVEX OPTIMIZATION AND ITS APPLICATIONS Volume 37) (Nonconvex Optimization and Its Applications)

A robust algorithm for generalized geometric programming

Journal of Global Optimization
$${{\mathcal {D}(\mathcal {C})}}$$-optimization and robust global optimization

Journal of Global Optimization
Global optimization for the generalized polynomial sum of ratios problem

Journal of Global Optimization
An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The concept of 驴-approximate optimal solution as widely used in nonconvex global optimization is not quite adequate, because such a point may correspond to an objective function value far from the true optimal value, while being infeasible. We introduce a concept of essential 驴-optimal solution, which gives a more appropriate approximate optimal solution, while being stable under small perturbations of the constraints. A general method for finding an essential 驴-optimal solution in finitely many steps is proposed which can be applied to d.c. programming and monotonic optimization.