An interior-point method for fractional programs with convex constraints

DOI10.1007/BF01582229MaRDI QIDQ1804653zbMATH OpenFDO

Authors 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)

Recommendations

• Minisymposium 2 : Optimierung
• An interior-point method for multifractional programs with convex constraints
• scientific article; zbMATH DE number 1283875
• On self-concordant barrier functions for conic hulls and fractional programming

Cites work

• scientific article; zbMATH DE number 3850851 (Why is no real title available?)
• scientific article; zbMATH DE number 3854346 (Why is no real title available?)
• scientific article; zbMATH DE number 88933 (Why is no real title available?)
• scientific article; zbMATH DE number 724202 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 3443990 (Why is no real title available?)
• scientific article; zbMATH DE number 3307153 (Why is no real title available?)
• A monotonic projective algorithm for fractional linear programming
• A new polynomial-time algorithm for linear programming
• Acceleration and Parallelization of the Path-Following Interior Point Method for a Linearly Constrained Convex Quadratic Problem
• An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices
• Bibliography in fractional programming
• Fractional programming
• Global ellipsoidal approximations and homotopy methods for solving convex analytic programs
• Interior-point methods for convex programming
• Method of centers for minimizing generalized eigenvalues
• 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
• Optimal ellipsoidal approximations around the analytic center
• Optimal preconditioners of a given sparsity pattern

Cited in

(8)

• 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
• Minisymposium 2 : Optimierung
• On self-concordant barrier functions for conic hulls and fractional programming
• A hybrid method for solving non-convex min-max quadratic fractional problems under quadratic constraints
• An effective branch and bound algorithm for minimax linear fractional programming
• A new branch and bound algorithm for minimax ratios problems
• A fifth bibliography of fractional programming^*

This page was built for publication: An interior-point method for fractional programs with convex constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804653)