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-2zbMath1467.90077OpenAlexW3081829346MaRDI QIDQ831364
Mostafa El Haffari, Ahmed Roubi, Karima Boufi
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
Convex programming (90C25) Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32)
Related Items (2)
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
Cites Work
- Unnamed Item
- 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
- 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
- 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
- La méthode des centres dans un espace topologique
- A eighth bibliography of fractional programming
- Duality in generalized linear fractional programming
- Convergence of Prox-Regularization Methods for Generalized Fractional Programming
- Constrained Bundle Methods for Upper Inexact Oracles with Application to Joint Chance Constrained Energy Problems
- DC Programming and DCA for General DC Programs
- A sixth bibliography of fractional programming
- Unified steerable phase I-phase II method of feasible directions for semi-infinite optimization
- Optimization and nonsmooth analysis
- Combined phase I—phase II methods of feasible directions
- 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
- A ninth bibliography of fractional programming
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- Programmation mathématique convexe
- Convex analysis and global optimization
- Method of centers for generalized fractional programming
- Some properties of methods of centers
This page was built for publication: Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions
