Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs
From MaRDI portal
Publication:5231677
DOI10.1137/18M1199708zbMath1421.90145OpenAlexW2948394288MaRDI QIDQ5231677
Publication date: 27 August 2019
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/18m1199708
quadratic programmingbundle methodsproximal point algorithmminimax fractional programsdual method of centers
Convex programming (90C25) Numerical methods involving duality (49M29) Fractional programming (90C32) Numerical methods based on nonlinear programming (49M37) Optimality conditions for minimax problems (49K35)
Related Items (5)
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 ⋮ An entropic regularized method of centers for continuous minimax problem with semi infinite constraints ⋮ 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On general minimax theorems
- An algorithm for generalized fractional programs
- Proximity control in bundle methods for convex nondifferentiable minimization
- 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
- Convergence of some algorithms for convex minimization
- 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
- Prox-regularization methods for generalized fractional programming
- Methods of descent for nondifferentiable optimization
- 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
- An aggregate subgradient method for nonsmooth convex minimization
- 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 descent algorithm for nonsmooth convex optimization
- A sixth bibliography of fractional programming
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Monotone Operators and the Proximal Point Algorithm
- An Algorithm for Constrained Optimization with Semismooth Functions
- 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
- Prox-regularization of the dual method of centers for generalized fractional programs
- Survey of Bundle Methods for Nonsmooth Optimization
- Proximité et dualité dans un espace hilbertien
- Maximization of Signal-to-Noise Ratio in an Optical Filter
- Minimax Theorems
- Method of centers for generalized fractional programming
- A minimax theorem involving weakly downward functions
This page was built for publication: Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs
