An interior-point method for generalized linear-fractional programming

DOI10.1007/BF01585557zbMath0857.90124OpenAlexW1973428420MaRDI QIDQ1922695

Yu. E. Nesterov, Arkadi Nemirovski

Publication date: 18 September 1996

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01585557

zbMATH Keywords

generalized linear-fractional probleminterior-point polynomial-time algorithm

Mathematics Subject Classification ID

Fractional programming (90C32)

Related Items (21)

Matching Triangles and Basing Hardness on an Extremely Popular Conjecture ⋮ Radii of solvability and unsolvability of linear systems ⋮ A practicable branch and bound algorithm for sum of linear ratios problem ⋮ Robust optimal solutions in interval linear programming with forall-exists quantifiers ⋮ On polynomiality of the method of analytic centers for fractional problems ⋮ EIV regression with bounded errors in data: total `least squares' with Chebyshev norm ⋮ An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem ⋮ A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem ⋮ A new deterministic global computing algorithm for solving a kind of linear fractional programming ⋮ Effective algorithm and computational complexity for solving sum of linear ratios problem ⋮ Range division and linearization algorithm for a class of linear ratios optimization problems ⋮ An effective computational algorithm for the global solution of a class of linear fractional programming ⋮ Additive and multiplicative tolerance in multiobjective linear programming ⋮ An outcome space algorithm for minimizing a class of linear ratio optimization problems ⋮ Generalized linear fractional programming under interval uncertainty ⋮ Structured singular value of a repeated complex full-block uncertainty ⋮ Regularity radius: Properties, approximation and a not a priori exponential algorithm ⋮ The finite criss-cross method for hyperbolic programming ⋮ An effective branch and bound algorithm for minimax linear fractional programming ⋮ Maximal and supremal tolerances in multiobjective linear programming ⋮ An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems

Cites Work

• Unnamed Item
• An extension of Karmarkar's algorithm for linear programming using dual variables
• Method of centers for minimizing generalized eigenvalues
• Linear Matrix Inequalities in System and Control Theory
• Structured and simultaneous Lyapunov functions for system stability problems

This page was built for publication: An interior-point method for generalized linear-fractional programming