A note on an algorithm for generalized fractional programs
From MaRDI portal
Publication:1062921
DOI10.1007/BF00938484zbMath0573.90090OpenAlexW2025918664MaRDI QIDQ1062921
Jean-Pierre Crouzeix, Jacques A. Ferland, Siegfried Schaible
Publication date: 1986
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00938484
Related Items
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, A hybrid method for solving non-convex min–max quadratic fractional problems under quadratic constraints, Optimality conditions and duality for a class of continuous-time generalized fractional programming problems, Modified Dinkelbach-Type algorithm for generalized fractional programs with infinitely many ratios, A proximal point algorithm for generalized fractional programs, A new algorithm for generalized fractional programs, Convergence of interval-type algorithms for generalized fractional programming, Convergence of a proximal algorithm for solving the dual of a generalized fractional program, Using duality to solve generalized fractional programming problems, Prox-dual regularization algorithm for generalized fractional programs, Dual method of centers for solving generalized fractional programs, Convergence of a Dinkelbach-type algorithm in generalized fractional programming, Minimization of isotonic functions composed of Fractions, Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs, A Fourth bibliography of fractional programming, Augmented Lagrangian dual for nonconvex minimax fractional programs and proximal bundle algorithms for its resolution, Partial linearization for generalized fractional programming, Solving the complex quadratic double-ratio minimax optimization under a quadratic constraint, Generalized fractional programming problems containing locally subdifferentiable andρ-Univex functions, Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs, Prox-regularization of the dual method of centers for generalized fractional programs, Continuous-time generalized fractional programming, Algorithms for generalized fractional programming, Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions, Robust fractional programming, Fractional Programming — Some Recent Developments, Fritz John Sufficient Optimality Conditions and Duality for a Generalised Minmax Program, Method of centers for generalized fractional programming, Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions, Preference approach to fuzzy linear inequalities and optimizations, A fast approach to deformable surface 3D tracking, Duality for generalized fractional programs involving n-set functions, Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming, Revisiting Dinkelbach-type algorithms for generalized fractional programs, Quadratic double-ratio minimax optimization, An inexact proximal point method for solving generalized fractional programs, Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs, Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions, Convergence of Prox-Regularization Methods for Generalized Fractional Programming
Cites Work
