Lower subdifferentiability in minimax fractional programming*

DOI10.1080/02331939908844423zbMath0955.90131OpenAlexW2023452967MaRDI QIDQ4265513

C. Bajona-Xandri, Juan-Enrique Martinez-Legaz

Publication date: 22 November 1999

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939908844423

zbMATH Keywords

optimality conditionsmultiobjective optimizationfractional programminglower subdifferentiable functions

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Multi-objective and goal programming (90C29) Fractional programming (90C32)

Related Items (14)

Second-order duality for non-differentiable minimax fractional programming ⋮ A new linearization technique for minimax linear fractional programming ⋮ On minimax fractional programming problems involving generalized \((H_p,r)\)-invex functions ⋮ On second-order duality for minimax fractional programming problems with generalized convexity ⋮ On second order duality for minimax fractional programming ⋮ Second-order duality for nondifferentiable minimax fractional programming problems with generalized convexity ⋮ Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints ⋮ Duality in nondifferentiable minimax fractional programming with generalized convexity ⋮ A proximal point algorithm with a ϕ-divergence for quasiconvex programming ⋮ Global algorithm for effectively solving min-max affine fractional programs ⋮ Second order duality for minmax fractional programming ⋮ Algorithms for quasiconvex minimization ⋮ Algorithms for the quasiconvex feasibility problem ⋮ A sixth bibliography of fractional programming

Cites Work

• Lower subdifferentiable functions and their minimization by cutting planes
• Fractional programming by lower subdifferentiability techniques
• Parametric approximation problems arising in vector optimization
• The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm
• A characterization of the distributions that imply mean-variance utility functions
• Optimality conditions and duality in subdifferentiable multiobjective fractional programming
• Duality in generalized linear fractional programming
• Quasiconvex duality theory by generalized conjugation methods
• A relationship between the second derivatives of a convex function and of its conjugate
• Convex Analysis
• On Quasi-Convex Duality

This page was built for publication: Lower subdifferentiability in minimax fractional programming^*