Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions
From MaRDI portal
Publication:831364
DOI10.1007/S10957-020-01738-2zbMATH Open1467.90077OpenAlexW3081829346MaRDI QIDQ831364FDOQ831364
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
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
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)
Cites Work
- 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
- Title not available (Why is that?)
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Convex analysis and global optimization
- Constrained bundle methods for upper inexact oracles with application to joint chance constrained energy problems
- DC programming and DCA for general DC programs
- An algorithm for generalized fractional programs
- Combined phase I—phase II methods of feasible directions
- Convergence of interval-type algorithms for generalized fractional programming
- La méthode des centres dans un espace topologique
- A note on an algorithm for generalized fractional programs
- Algorithms for generalized fractional programming
- A new algorithm for generalized fractional programs
- 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
- Global convergence and rate of convergence of a method of centers
- Dual method of centers for solving generalized fractional programs
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
- DC programming and DCA: thirty years of developments
- 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
- Unified steerable phase I-phase II method of feasible directions for semi-infinite optimization
- 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
- Programmation mathématique convexe
- Method of centers for generalized fractional programming
- Some properties of methods of centers
Cited In (4)
- Augmented Lagrangian dual for nonconvex minimax fractional programs and proximal bundle algorithms for its resolution
- Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions
- A DC approach for minimax fractional optimization programs with ratios of convex functions
- Successive upper approximation methods for generalized fractional programs
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)
