Skip to main content
Log in

An inexact proximal point method for solving generalized fractional programs

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

In this paper, we present several new implementable methods for solving a generalized fractional program with convex data. They are Dinkelbach-type methods where a prox-regularization term is added to avoid the numerical difficulties arising when the solution of the problem is not unique. In these methods, at each iteration a regularized parametric problem is solved inexactly to obtain an approximation of the optimal value of the problem. Since the parametric problem is nonsmooth and convex, we propose to solve it by using a classical bundle method where the parameter is updated after each ‘serious step’. We mainly study two kinds of such steps, and we prove the convergence and the rate of convergence of each of the corresponding methods. Finally, we present some numerical experience to illustrate the behavior of the proposed algorithms, and we discuss the practical efficiency of each one.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Birbil, S.I., Frenk, J.B., Zhang, S.: Generalized fractional programming with user interaction. ERIM Report Series Research in Management ERS-2004-033-LIS (2004)

  2. Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley, New York (1983)

    Google Scholar 

  3. Correa, R., Lemaréchal, C.: Convergence of some algorithms for convex minimization. Math. Program. 62, 261–275 (1993)

    Article  Google Scholar 

  4. Crouzeix, J.P., Ferland, J.A., Schaible, S.: An algorithm for generalized fractional programs. J. Optim. Theory Appl. 47, 35–49 (1985)

    Article  Google Scholar 

  5. Crouzeix, J.P., Ferland, J.A., Schaible, S.: A note on an algorithm for generalized fractional programs. J. Optim. Theory Appl. 50, 183–187 (1986)

    Article  Google Scholar 

  6. Fuduli, A., Gaudioso, M., Giallombardo, G.: Minimizing nonconvex nonsmooth functions via cutting planes and proximity control. SIAM J. Optim. 14, 743–756 (2004)

    Article  Google Scholar 

  7. Gugat, M.: A fast algorithm for a class of generalized fractional programs. Manage. Sci. 42, 1493–1499 (1996)

    Article  Google Scholar 

  8. Gugat, M.: Prox-regularization methods for generalized fractional programming. J. Optim. Theory Appl. 99, 691–722 (1998)

    Article  Google Scholar 

  9. Hare, W., Sagastizábal, C.: Computing proximal points of nonconvex functions. Math. Program. Ser. B (2007). doi:10.1007/s10107-007-0124-6

  10. Hue, T.T., Strodiot, J.J., Nguyen, V.H.: Convergence of the approximate auxiliary problem method for solving generalized variational inequalities. J. Optim. Theory Appl. 121, 119–145 (2004)

    Article  Google Scholar 

  11. Kaplan, A., Tichatschke, R.: Proximal point methods and nonconvex optimization. J. Global Optim. 13, 389–406 (1998)

    Article  Google Scholar 

  12. Lemaréchal, C., Strodiot, J.J., Bihain, A.: On a bundle method for nonsmooth optimization. In: Mangasarian, O., Meyer, R., Robinson, S.(eds) Nonlinear Programming, vol. 4, pp. 245–282. Academic Press, New York (1981)

    Google Scholar 

  13. Martinet, B.: Régularisation d’inéquations variationelles par approximations successives. RAIRO Rech. Oper. 4, 154–159 (1970)

    Google Scholar 

  14. Nguyen, T.T.V., Strodiot, J.J., Nguyen, V.H.: A bundle method for solving equilibrium problems. Math. Program. Ser. B (2007). doi:10.1007/s10107-007-0112-x

  15. Rockafellar, R.T.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14, 877–898 (1976)

    Article  Google Scholar 

  16. Rockafellar, R.T., Wets, R.B.: Variational Analysis. No. 317 in Grundlehren der Mathematischen Wissenschaften. Springer, Heidelberg (1998)

    Google Scholar 

  17. Roubi, A.: Convergence of prox-regularization methods for generalized fractional programming. RAIRO Rech. Oper. 36, 73–94 (2002)

    Article  Google Scholar 

  18. Salmon, G., Strodiot, J.J., Nguyen, V.H.: A bundle method for solving variational inequalities. SIAM J. Optim. 14, 869–893 (2004)

    Article  Google Scholar 

  19. Sheu, R.L., Lin, J.Y.: Solving continuous min-max problems by an iterative entropic regularization method. J. Optim. Theory Appl. 121, 597–612 (2004)

    Article  Google Scholar 

  20. Strodiot, J.J., Nguyen, V.H.: On the numerical treatment of the inclusion 0 ϵ ∂ f ( x). In: Moreau, J.J., Panagiotopoulos, P.D., Strang, G.(eds) Topics in Nonsmooth Mechanics, Birkäuser Verlag, Basel (1988)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jean-Jacques Strodiot.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Strodiot, JJ., Crouzeix, JP., Ferland, J.A. et al. An inexact proximal point method for solving generalized fractional programs. J Glob Optim 42, 121–138 (2008). https://doi.org/10.1007/s10898-007-9270-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-007-9270-x

Keywords

AMS Classification

Navigation