Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions

DOI10.1007/S10957-020-01738-2MaRDI QIDQ831364zbMATH OpenOpenAlexFDO

Authors Karima Boufi, Mostafa El Haffari, A. Roubi

Publication date 11 May 2021

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10957-020-01738-2

zbMATH Keywords

optimality conditionsfractional programmingdifference of convex functionsmethod of centers

Mathematics Subject Classification ID

Convex programming (90C25) Fractional programming (90C32) Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Minimax problems in mathematical programming (90C47)

Recommendations

• Optimality conditions and duality for a minimax fractional programming with generalized convexity
• Optimality conditions for fractional minmax programming
• Optimality conditions and duality in nondifferentiable minimax fractional programming with generalized convexity
• Optimality conditions for multiobjective fractional programming, via convexificators
• Optimality conditions for nondifferentiable minimax fractional programming with complex variables
• Optimality conditions for a class of min-max semi-infinite fractional programming
• On minimax fractional optimality conditions with \((F,\rho)\)-convexity
• Duality results and dual bundle methods based on the dual method of centers for minimax fractional programs
• Optimality and duality for a class of nondifferentiable minimax fractional programming problems
• Optimality and duality for nondifferentiable minimax fractional programming with generalized convexity

Cites work

• scientific article; zbMATH DE number 439380 (Why is no real title available?)
• scientific article; zbMATH DE number 3950216 (Why is no real title available?)
• scientific article; zbMATH DE number 4041643 (Why is no real title available?)
• scientific article; zbMATH DE number 1095224 (Why is no real title available?)
• scientific article; zbMATH DE number 7009350 (Why is no real title available?)
• A eighth bibliography of fractional programming
• A new algorithm for generalized fractional programs
• A note on an algorithm for generalized fractional programs
• A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
• A proximal point algorithm for generalized fractional programs
• A sixth bibliography of fractional programming
• Algorithms for generalized fractional programming
• An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
• An algorithm for generalized fractional programs
• An inexact proximal point method for solving generalized fractional programs
• Bibliography: Ninth bibliography of fractional programming
• Combined phase I—phase II methods of feasible directions
• Constrained bundle methods for upper inexact oracles with application to joint chance constrained energy problems
• Convergence of Prox-Regularization Methods for Generalized Fractional Programming
• Convergence of a proximal algorithm for solving the dual of a generalized fractional program
• Convergence of interval-type algorithms for generalized fractional programming
• Convex analysis and global optimization
• DC programming and DCA for general DC programs
• DC programming and DCA: thirty years of developments
• Dual algorithms based on the proximal bundle method for solving convex minimax fractional programs
• Dual method of centers for solving generalized fractional programs
• Duality in generalized fractional programming via Farkas' lemma
• Duality in generalized linear fractional programming
• Duality results and dual bundle methods based on the dual method of centers for minimax fractional programs
• Generalized fractional programming duality: A parametric approach
• Global convergence and rate of convergence of a method of centers
• La méthode des centres dans un espace topologique
• Method of centers for generalized fractional programming
• Optimization and nonsmooth analysis
• Programmation mathématique convexe
• Prox-dual regularization algorithm for generalized fractional programs
• Prox-regularization of the dual method of centers for generalized fractional programs
• Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
• Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs
• Revisiting Dinkelbach-type algorithms for generalized fractional programs
• Some properties of methods of centers
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• Unified steerable phase I-phase II method of feasible directions for semi-infinite optimization
• Using duality to solve generalized fractional programming problems

Cited in

(4)

• Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions
• Successive upper approximation methods for generalized fractional programs
• A DC approach for minimax fractional optimization programs with ratios of convex functions
• Augmented Lagrangian dual for nonconvex minimax fractional programs and proximal bundle algorithms for its resolution

This page was built for publication: Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions

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