Journal of Global Optimization

, Volume 2, Issue 2, pp 133–144 | Cite as

On nonconvex optimization problems with separated nonconvex variables

  • Hoang Tuy


A mathematical programming problem is said to have separated nonconvex variables when the variables can be divided into two groups: x=(x1,...,x n ) and y=( y1,...,y n ), such that the objective function and any constraint function is a sum of a convex function of (x, y) jointly and a nonconvex function of x alone. A method is proposed for solving a class of such problems which includes Lipschitz optimization, reverse convex programming problems and also more general nonconvex optimization problems.

Key words

Global optimization separated nonconvex variables reverse convex programming Lipschitz optimization decomposition lower linearization outer approximation branch and bound relief indicator method 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    J. F., Bard (1988), Convex Two-Level Optimization, Mathematical Programming 40, 15–27.Google Scholar
  2. 2.
    H. B. Benson and R. Horst (1991), A Branch and Bound-Outer Approximation Algorithm for Concave Minimization over a Convex Set, Journal of Computers and Mathematics with Applications (forthcoming).Google Scholar
  3. 3.
    R., Horst (1988), Deterministic Global Optimization with Partition Sets Whose Feasibility Is Not Known. Application to Concave Minimization, Reverse Convex Constraints, D.C. Programming and Lipschitzian Optimization, Journal of Optimization Theory and Applications 58, 11–37.Google Scholar
  4. 4.
    R. Horst, N. V. Thoai, and H. P. Benson (1990), Concave Minimization via Conical Partitions and Polyhedral Outer Approximation, Mathematical Programming, forthcoming.Google Scholar
  5. 5.
    R. Horst and H. Tuy (1990), Global Optimization: Deterministic Approaches, Springer-Verlag.Google Scholar
  6. 6.
    B., Kalantari and J. B., Rosen (1987), An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions, Mathematics of Operations Research 12, 544–561.Google Scholar
  7. 7.
    P. M. Pardalos and J. B. Rosen (1987), Constrained Global Optimization: Algorithms and Applications, Lecture Notes in Computer Science 268, Springer.Google Scholar
  8. 8.
    R. T., Rockafellar (1970), Convex Analysis, Princeton University Press, Princeton, N. J.Google Scholar
  9. 9.
    J. B., Rosen and P. M., Pardalos (1986), Global Minimization of Large Scale Constrained Concave Quadratic Problems by Separable Programming, Mathematical Programming 34, 163–174.Google Scholar
  10. 10.
    P. T., Thach (1982), Concave Minimization Under Nonconvex Constraints with Special Structure, in Essays in Nonlinear Analysis and Optimization Problems, Institute of Mathematics, Hanoi, pp. 121–139.Google Scholar
  11. 11.
    P. T. Thach (1990), Convex Minimization under Lipschitz Constraints, Journal of Optimization Theory and Applications, forthcoming.Google Scholar
  12. 12.
    P. T., Thach and H., Tuy (1990), The Relief Indicator Method for Constrained Global Optimization, Naval Research Logistics 37, 473–497.Google Scholar
  13. 13.
    H., Tuy (1985), Concave Minimization under Linear Constraints with Special Structure, Optimization 16, 335–352.Google Scholar
  14. 14.
    H. Tuy (1989), The Relief Indicator Method as a New Approach to Constrained Global Optimization, IFIP Conference on System Modeling and Optimization, Leipzig.Google Scholar
  15. 15.
    H., Tuy (1990), Effect of Subdivision Strategy on Convergence and Efficiency of Some Global Optimization Algorithms, Preprint, Institute of Mathematics, Hanoi, Submitted.Google Scholar
  16. 16.
    H. Tuy (1990), On D.C. Programming and General Nonconvex Optimization Problems, Preprint, Institute of Mathematics, Submitted.Google Scholar

Copyright information

© Kluwer Academic Publishers 1992

Authors and Affiliations

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

Personalised recommendations