Augmented Lagrangian dual for nonconvex minimax fractional programs and proximal bundle algorithms for its resolution
From MaRDI portal
Publication:2691342
DOI10.3934/jimo.2022100OpenAlexW4285160368MaRDI QIDQ2691342
Publication date: 29 March 2023
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2022100
Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26) Numerical methods involving duality (49M29) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32) Numerical methods based on nonlinear programming (49M37)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A strict minimax inequality criterion and some of its consequences
- Handbook of generalized convexity and generalized monotonicity
- On general minimax theorems
- An algorithm for generalized fractional programs
- Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions
- 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
- Duality in generalized nonlinear fractional programming
- A simple proof for König's minimax theorem
- Dual method of centers for solving generalized fractional programs
- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
- On equivalent results in minimax theory
- A new algorithm for generalized fractional programs
- Using duality to solve generalized fractional programming problems
- Duality for generalized fractional programs involving n-set functions
- 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
- An upward-downward minimax theorem
- A eighth bibliography of fractional programming
- On a minimax theorem: an improvement, a new proof and an overview of its applications
- Duality in generalized linear fractional programming
- Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming
- Convergence of Prox-Regularization Methods for Generalized Fractional Programming
- A sixth bibliography of fractional programming
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Problèmes fractionnaires : tour d'horizon sur les applications et méthodes de résolution
- A proximal point algorithm for generalized fractional programs
- Convergence of a proximal algorithm for solving the dual of a generalized fractional program
- Robust Design of Radar Doppler Filters
- 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
- Maximization of Signal-to-Noise Ratio in an Optical Filter
- Convex Analysis
- Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
- Minimax Theorems
- Method of centers for generalized fractional programming
- A minimax theorem involving weakly downward functions
