Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions

DOI10.1007/S11590-020-01694-WzbMATH Open1479.90199OpenAlexW3121197103MaRDI QIDQ2230768FDOQ2230768

Authors: Abdelouafi Ghazi, A. Roubi 

Publication date: 28 September 2021

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-020-01694-w

Recommendations

• A DC approach for minimax fractional optimization programs with ratios of convex functions
• Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions
• Some Farkas-type results for fractional programming problems with DC functions
• Duality and Farkas-type results for DC fractional programming with DC constraints
• A combined algorithm for fractional programming

zbMATH Keywords

nonconvex optimizationconvex analysisnonsmooth optimizationoptimality conditionsfractional programmingDC optimizationDinkelbach-type algorithms

Mathematics Subject Classification ID

Fractional programming (90C32) Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26)

Cites Work

• A unified convergence analysis of block successive minimization methods for nonsmooth optimization
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimization and nonsmooth analysis
• Using duality to solve generalized fractional programming problems
• Title not available (Why is that?)
• A sixth bibliography of fractional programming
• Minimax Theorems
• On general minimax theorems
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• Convex analysis and global optimization
• A New Sequential Optimization Procedure and Its Applications to Resource Allocation for Wireless Systems
• An algorithm for generalized fractional programs
• Convergence of interval-type algorithms for generalized fractional programming
• A note on an algorithm for generalized fractional programs
• Algorithms for generalized fractional programming
• A new algorithm for generalized fractional programs
• Introduction to nonsmooth optimization. Theory, practice and software
• Title not available (Why is that?)
• Duality in generalized fractional programming via Farkas' lemma
• Duality in generalized linear fractional programming
• Revisiting Dinkelbach-type algorithms for generalized fractional programs
• Generalized fractional programming duality: A parametric approach
• An inexact proximal point method for solving generalized fractional programs
• Dual method of centers for solving generalized fractional programs
• Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
• DC programming and DCA: thirty years of developments
• Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
• 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
• A eighth bibliography of fractional programming
• Convergence of Prox-Regularization Methods for Generalized Fractional Programming
• 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
• Bibliography: Ninth bibliography of fractional programming
• Method of centers for generalized fractional programming
• Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions
• Robust Design of Radar Doppler Filters
• A DC approach for minimax fractional optimization programs with ratios of convex functions

Cited In (3)

• A DC approach for minimax fractional optimization programs with ratios of convex functions
• Successive upper approximation methods for generalized fractional programs
• Modified Dinkelbach-Type algorithm for generalized fractional programs with infinitely many ratios

This page was built for publication: Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2230768)