Interval division and linearization algorithm for minimax linear fractional program
From MaRDI portal
Recommendations
- A new linearization technique for minimax linear fractional programming
- A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming
- scientific article; zbMATH DE number 6907481
- Efficient algorithm for globally computing the min–max linear fractional programming problem
- Image space branch-and-bound algorithm for globally solving minimax linear fractional programming problem
Cites work
- A new branch and bound algorithm for minimax ratios problems
- A new linearization technique for minimax linear fractional programming
- A unified monotonic approach to generalized linear fractional programming
- An algorithm for generalized fractional programs
- An interior-point method for multifractional programs with convex constraints
- BARON: A general purpose global optimization software package
- Convergence of a Dinkelbach-type algorithm in generalized fractional programming
- Decomposition based least squares iterative estimation algorithm for two-input single-output output error systems
- Delay-interval-dependent robust-stability criteria for neutral stochastic neural networks with polytopic and linear fractional uncertainties
- Dual algorithms based on the proximal bundle method for solving convex minimax fractional programs
- Dual method of centers for solving generalized fractional programs
- Fractional programming
- Generalized fractional programming and cutting plane algorithms
- Generic algorithm for generalized fractional programming
- Hierarchical multi-innovation stochastic gradient algorithm for Hammerstein nonlinear system modeling
- scientific article; zbMATH DE number 6907481 (Why is no real title available?)
- Maximum likelihood parameter estimation algorithm for controlled autoregressive autoregressive models
- Method of centers for generalized fractional programming
- Modified Dinkelbach-Type algorithm for generalized fractional programs with infinitely many ratios
- On Nonlinear Fractional Programming
- On second-order duality for nondifferentiable minimax fractional programming
- Partial linearization for generalized fractional programming
- Prox-regularization methods for generalized fractional programming
- Second order \((\Phi, \rho)\)-\(V\)-invexity and duality for semi-infinite minimax fractional programming
- The fractional minimal cost flow problem on network
- Two-stage least squares based iterative estimation algorithm for CARARMA system modeling
Cited in
(5)- A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming
- Global algorithm for effectively solving min-max affine fractional programs
- Quadratic convex-concave minimax optimization
- Optimizing the minimax affine fractional problem in reduced space
- Global minimization of multimodal optimization with one-parameter filled function
This page was built for publication: Interval division and linearization algorithm for minimax linear fractional program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6140900)
