Abstract
We consider a problem of minimization of a concave function subject to affine constraints. By using sign reversion techniques we show that the initial problem can be transformed into a family of concave maximization problems. This property enables us to suggest certain algorithms based on the parametric dual optimization problem.
Similar content being viewed by others
References
Horst R., Tuy H.: Global Optimization: Deterministic Approaches. Springer, Berlin (1996)
Tuy H.: Convex Analysis and Global Optimization. Nonconvex Optimization and its Applications. Kluwer, Dordrecht (1998)
Horst R., Thoai N.V.: DC programming: Overview. J. Optim. Theory Appl. 103, l–43 (1999)
Horst R., Pardalos P.M., Thoai N.V.: Introduction to Global Optimization. Kluwer, Dordrecht (2000)
Strekalovskii, A.S.: Principles of Nonconvex Optimization. Novosibirsk, Nauka (2003) (in Russian)
Audet, C., Hansen, P., Savard, G. (eds): Essays and Surveys in Global Optimization. Springer, New York (2005)
Chinchuluun A., Pardalos P.M., Enkhbat R.: Global minimization algorithms for concave quadratic programming problems. Optimization 54, 627–639 (2005)
Chinchuluun A., Enkhbat R., Pardalos P.M.: A numerical method for concave programming problems. In: Rubinov, A., Jeyakumar, V. (eds) Continuous Optimization: Current Trends and Modern Applications, pp. 251–273. Springer, Heidelberg (2005)
Sukharev, A.G., Timokhov, A.V., Fedorov, V.V.: A Course in Optimization Methods. Nauka, Moscow (1986) (in Russian)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Konnov, I.V. Sign reversion approach to concave minimization problems. Optim Lett 4, 491–500 (2010). https://doi.org/10.1007/s11590-010-0177-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-010-0177-y