A new linearization technique for minimax linear fractional programming
From MaRDI portal
Publication:2935390
DOI10.1080/00207160.2013.860449zbMath1302.90210OpenAlexW2095347455MaRDI QIDQ2935390
Publication date: 29 December 2014
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2013.860449
global optimizationbranch-and-boundlinearization techniquelinear relaxation programmingminimax linear fractional programming
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Fractional programming (90C32)
Related Items (6)
Interval linear fractional programming: optimal value range of the objective function ⋮ A new branch and bound algorithm for minimax ratios problems ⋮ A hybrid method for solving non-convex min–max quadratic fractional problems under quadratic constraints ⋮ Interval division and linearization algorithm for minimax linear fractional program ⋮ Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints ⋮ An effective global optimization algorithm for quadratic programs with quadratic constraints
Cites Work
- Hierarchical multi-innovation stochastic gradient algorithm for Hammerstein nonlinear system modeling
- Continuous-time generalized fractional programming problems. Part I: Basic theory
- Using the parametric approach to solve the continuous-time linear fractional Max-min problems
- Nondifferentiable minimax fractional programming in complex spaces with parametric duality
- An algorithm for generalized fractional programs
- Modified Dinkelbach-Type algorithm for generalized fractional programs with infinitely many ratios
- Minimax fractional programming under nonsmooth generalized \((\mathcal F,\rho, \theta)\)-d-univexity
- Complex minimax fractional programming of analytic functions
- Second order duality for minmax fractional programming
- An inexact proximal point method for solving generalized fractional programs
- Generic algorithm for generalized fractional programming
- Optimality conditions and duality for a class of nondifferentiable multiobjective generalized fractional programming problems
- Financial planning with fractional goals
- A unified monotonic approach to generalized linear fractional programming
- Two-stage least squares based iterative estimation algorithm for CARARMA system modeling
- Generalized fractional programming and cutting plane algorithms
- Continuous-time generalized fractional programming problems. II: an interval-type computational procedure
- Prox-regularization methods for generalized fractional programming
- On second-order duality for nondifferentiable minimax fractional programming
- Optimality conditions for nondifferentiable minimax fractional programming with complex variables
- Strong duality for robust minimax fractional programming problems
- Duality in nondifferentiable minimax fractional programming with generalized convexity
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- Least-squares-based iterative identification algorithm for Hammerstein nonlinear systems with non-uniform sampling
- Maximum likelihood parameter estimation algorithm for controlled autoregressive autoregressive models
- Second-order duality for non-differentiable minimax fractional programming
- On fractional programming problems with absolute-value functions
- Delay-interval-dependent robust-stability criteria for neutral stochastic neural networks with polytopic and linear fractional uncertainties
- Partial linearization for generalized fractional programming
- Lower subdifferentiability in minimax fractional programming*
- Trust-region method for box-constrained semismooth equations and its applications to complementary problems
- Performance analysis of the auxiliary model-based least-squares identification algorithm for one-step state-delay systems
- A new semismooth Newton method for NCPs based on the penalized KK function
- Consistency of the extended gradient identification algorithm for multi-input multi-output systems with moving average noises
- Best Rational Approximation and Strict Quasi-Convexity
- Method of centers for generalized fractional programming
This page was built for publication: A new linearization technique for minimax linear fractional programming
