An interior-point method for multifractional programs with convex constraints
From MaRDI portal
Publication:1893345
DOI10.1007/BF02192302zbMath0824.90127MaRDI QIDQ1893345
Roland W. Freund, Florian Jarre
Publication date: 3 July 1995
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
interior-point methodconvex setsconvex constraintsself-concordant barrier functionsmultifractional programspredictor-corrector step
Related Items
Radii of solvability and unsolvability of linear systems, The convergence of an interior-point method using modified search directions in final iterations, A fifth bibliography of fractional programming*, Robust optimal solutions in interval linear programming with forall-exists quantifiers, Explicit solutions for interval semidefinite linear programs, Software for simplified Lanczos and QMR algorithms, EIV regression with bounded errors in data: total `least squares' with Chebyshev norm, Interval division and linearization algorithm for minimax linear fractional program, Additive and multiplicative tolerance in multiobjective linear programming, Adjustable robust optimization models for a nonlinear two-period system, Generalized linear fractional programming under interval uncertainty, Regularity radius: Properties, approximation and a not a priori exponential algorithm, On self-concordant barrier functions for conic hulls and fractional programming, On the implementation of the Dirichlet-to-Neumann radiation condition for iterative solution of the Helmholtz equation, An interior method for nonconvex semidefinite programs, Maximal and supremal tolerances in multiobjective linear programming
Cites Work
- Global ellipsoidal approximations and homotopy methods for solving convex analytic programs
- A new polynomial-time algorithm for linear programming
- An algorithm for generalized fractional programs
- Generalized fractional programming: Algorithms and numerical experimentation
- Algorithms for generalized fractional programming
- Interior-point methods for convex programming
- Method of centers for minimizing generalized eigenvalues
- Optimal ellipsoidal approximations around the analytic center
- Linear programming, complexity theory and elementary functional analysis
- Two new algorithms for rational approximation
- Generalized Cheney-Loeb-Dinkelbach-Type Algorithms
- An Algorithm for a Class of Nonconvex Programming Problems with Nonlinear Fractional Objectives
- Bibliography in fractional programming
- On Nonlinear Fractional Programming
- The Differential Correction Algorithm for Rational $\ell _\infty $-Approximation
- Fractional programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
