An interior-point method for fractional programs with convex constraints

DOI10.1007/BF01582229zbMath0832.90114MaRDI QIDQ1804653

Roland W. Freund, Florian Jarre

Publication date: 15 May 1995

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

zbMATH Keywords

interior-point methodfractional programs with convex constraintspolynomial-rate convergence

Mathematics Subject Classification ID

Fractional programming (90C32)

Related Items

A new branch and bound algorithm for minimax ratios problems, A fifth bibliography of fractional programming^*, A hybrid method for solving non-convex min–max quadratic fractional problems under quadratic constraints, On self-concordant barrier functions for conic hulls and fractional programming, An effective branch and bound algorithm for minimax linear fractional programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A monotonic projective algorithm for fractional linear programming
• Optimal preconditioners of a given sparsity pattern
• Global ellipsoidal approximations and homotopy methods for solving convex analytic programs
• A new polynomial-time algorithm for linear programming
• Interior-point methods for convex programming
• Method of centers for minimizing generalized eigenvalues
• Optimal ellipsoidal approximations around the analytic center
• An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices
• Bibliography in fractional programming
• Acceleration and Parallelization of the Path-Following Interior Point Method for a Linearly Constrained Convex Quadratic Problem
• Minimization of the norm, the norm of the inverse and the condition number of a matrix by completion
• On An Invariant of Plane Regions and Mass Distributions
• Fractional programming