Motivation and Overview

  • Hoang Tuy
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 22)


We will be concerned with optimization problems of the general form
$$\min \{ f\left( x \right)|g_i \left( x \right) \leqslant 0\left( {i = 1, \ldots ,m} \right),x \in X\} $$
where X is a closed convex set in R n, f : Ω→ R and g i : Ω→R, i= 1,…,m are functions defined on some set Ω in R n containing X. Denoting the feasible set by S:
$$S = \{ x \in X|g_i \left( x \right) \leqslant 0,i = 1, \ldots ,m\}$$
we can also write the problem as
$$\min \{ f(x)\left| {x \in S\} .} \right.$$


Global Optimization Problem Good Feasible Solution Nonconvex Optimization Problem Concave Minimization Unique Global Minimizer 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 1998

Authors and Affiliations

  • Hoang Tuy
    • 1
  1. 1.Institute of MathematicsHanoiVietnam

Personalised recommendations