All Stories

  1. Block Coordinate Dinkelbach Algorithms for Solving Block-Structured Constrained Fractional Optimization Problems
  2. A method of centres for DC-constrained DC optimization programs
  3. Proximal bundle methods for generalized fractional programs with ratios of difference of convex functions
  4. Successive upper approximation methods for generalized fractional programs
  5. Theorems of the Alternative Revisited and Some Extensions of Yuan’s Lemma
  6. Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions
  7. A DC approach for minimax fractional optimization programs with ratios of convex functions
  8. Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs
  9. Approximate Dual Bundle Methods for Minimax Fractional Programs
  10. Dual algorithms based on the proximal bundle method for solving convex minimax fractional programs
  11. Proximal Bundle Algorithms for Nonlinearly Constrained Convex Minimax Fractional Programs
  12. Prox-regularization of the dual method of centers for generalized fractional programs
  13. Convergence of a proximal algorithm for solving the dual of a generalized fractional program
  14. A proximal point algorithm for generalized fractional programs
  15. Dual method of centers for solving generalized fractional programs
  16. Prox-dual regularization algorithm for generalized fractional programs
  17. Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming
  18. Convergence of Prox-Regularization Methods for Generalized Fractional Programming
  19. Some Properties of Methods of Centers
  20. Method of Centers for Generalized Fractional Programming
  21. Global convergence and rate of convergence of a method of centers