Skip to main content
SpringerLink
Log in

Attractive force search algorithm for piecewise convex maximization problems

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

We consider mathematical programming problems with the so-called piecewise convex objective functions. A solution method for this interesting and important class of nonconvex problems is presented. This method is based on Newton’s law of universal gravitation, multicriteria optimization and Helly’s theorem on convex bodies. Numerical experiments using well known classes of test problems on piecewise convex maximization, convex maximization as well as the maximum clique problem show the efficiency of the approach.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Chinchuluun A., Pardalos P.M.: A survey of recent developments in multiobjective optimization. Ann. Oper. Res. 154, 29–50 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  2. Danzer, L., Grünbaum, B., Klee, V.: Helly’s theorem and its relatives. In: Proceedings of Symposium Pure Mathematics, Vol. VII, American Mathematics Society Providence R.I., pp. 101–180 (1963)

  3. Ehrgott, M.:Multicriteria optimization, volume 491. In: Lecture Notes in Economics and Mathematical Systems, Springer, Berlin (2000)

  4. Enkhbat R., Barsbold B., Kamada M.: A numerical approach for solving some convex maximization problems. J. Glob. Optim. 35(1), 85–101 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  5. FloudasA, C.A., Pardalos, P.M.: Collection of test problems for constrained global optimization algorithms, volume 455. In: Lecture Notes in Computer Science, Springer, Berlin (1990)

  6. Floudas, C.A., Pardalos, P.M., Adjiman, C.S., Esposito, W.R., Gümüş, Z.H., Harding, S.T., Klepeis, J.L., Meyer, C.A., Schweiger, C.A.: Handbook of test problems in local and global optimization, volume 33. In: Nonconvex optimization and its applications, Kluwer Academic Publishers, Dordrecht (1999)

  7. Fortin D., Tseveendorj I.: Piece adding technique for convex maximization problems. J. Glob. Optim. 48(4), 583–593 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  8. Fortin, D., Tseveendorj, I.: Piecewise convex formulations of binary and permutation problems. Siberian J. Numer. Math. (Springer, Numerical Analysis and Applications, 4, 2011), 14(4), 333–350 (2011)

  9. Fortin D., Tseveendorj I.: Piecewise convex maximization problems: Piece adding technique. J. Optim. Theory Appl 148, 471–487 (2011). doi:10.1007/s10957-010-9763-5

    Article  MathSciNet  MATH  Google Scholar 

  10. Fortin D., Tsevendorj I.: Piecewise-convex maximization problems: algorithm and computational experiments. J. Glob. Optim. 24(1), 61–77 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  11. Georgiev P.G., Pardalos P.M., Chinchuluun A.: Localization of minimax points. J. Global Optim. 40(1–3), 489–494 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  12. Horst, R., Pardalos, P.M., Thoai, N.V.: Introduction to global optimization, volume 3. In: Nonconvex optimization and its applications, Kluwer Academic Publishers, Dordrecht (1995)

  13. Horst, R., Tuy, H.: Global optimization, second edn. Deterministic approaches, Springer, Berlin (1993)

  14. Kim, D., Pardalos, P.M.: A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems. J. Glob. Optim. 17(1–4), 225–234 (2000). (Dedicated to the memory of Professor P.D. Panagiotopoulos)

    Google Scholar 

  15. Kvasov D.E., Sergeyev Ya.D.: Diagonal global optimization methods. (in russian). Fizmatlit, Moscow (2008)

    Google Scholar 

  16. Schlenkrich S., Griewank A., Walther A.: On the local convergence of adjoint Broyden methods. Math. Program. 121(2, Ser. A), 221–247 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  17. Strekalovskii A.S.: Elements of Nonconvex Optimization. (in russian). NAUKA, Novosibirsk (2003)

    Google Scholar 

  18. Tsevendorj I.: Piecewise-convex maximization problems: global optimality conditions. J. Global Optim. 21(1), 1–14 (2001)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. INRIA, Domaine de Voluceau, Rocquencourt, B.P. 105, 78153, Le Chesnay Cedex, France

    Dominique Fortin

  2. Laboratoire PRiSM, Université de Versailles, 45, avenue des États-Unis, 78035, Versailles Cedex, France

    Ider Tseveendorj

Authors
  1. Dominique Fortin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ider Tseveendorj
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ider Tseveendorj.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fortin, D., Tseveendorj, I. Attractive force search algorithm for piecewise convex maximization problems. Optim Lett 6, 1317–1333 (2012). https://doi.org/10.1007/s11590-011-0395-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-011-0395-y

Keywords

Search

Navigation