A DC approach for minimax fractional optimization programs with ratios of convex functions
From MaRDI portal
Publication:5038436
DOI10.1080/10556788.2020.1818234zbMath1501.90098OpenAlexW3085541063MaRDI QIDQ5038436
No author found.
Publication date: 30 September 2022
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2020.1818234
difference of convex functionsoptimality conditionsfractional programmingDinkelbach algorithmsquotient of convex functions
Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithm for generalized fractional programs
- Revisiting Dinkelbach-type algorithms for generalized fractional programs
- An inexact proximal point method for solving generalized fractional programs
- A note on an algorithm for generalized fractional programs
- Generalized fractional programming duality: A parametric approach
- Convergence of interval-type algorithms for generalized fractional programming
- Duality in generalized fractional programming via Farkas' lemma
- Algorithms for generalized fractional programming
- Dual method of centers for solving generalized fractional programs
- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- A new algorithm for generalized fractional programs
- Using duality to solve generalized fractional programming problems
- Dual algorithms based on the proximal bundle method for solving convex minimax fractional programs
- Prox-dual regularization algorithm for generalized fractional programs
- Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs
- Introduction to Nonsmooth Optimization
- A eighth bibliography of fractional programming
- Duality in generalized linear fractional programming
- Convergence of Prox-Regularization Methods for Generalized Fractional Programming
- A sixth bibliography of fractional programming
- Optimization and nonsmooth analysis
- A proximal point algorithm for generalized fractional programs
- Convergence of a proximal algorithm for solving the dual of a generalized fractional program
- Prox-regularization of the dual method of centers for generalized fractional programs
- Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs
- Method of centers for generalized fractional programming
