Pages that link to "Item:Q1893345"
From MaRDI portal
The following pages link to An interior-point method for multifractional programs with convex constraints (Q1893345):
Displayed 16 items.
- Maximal and supremal tolerances in multiobjective linear programming (Q257229) (← links)
- Radii of solvability and unsolvability of linear systems (Q277137) (← links)
- Robust optimal solutions in interval linear programming with forall-exists quantifiers (Q323404) (← links)
- Additive and multiplicative tolerance in multiobjective linear programming (Q943806) (← links)
- On the implementation of the Dirichlet-to-Neumann radiation condition for iterative solution of the Helmholtz equation (Q1294490) (← links)
- On self-concordant barrier functions for conic hulls and fractional programming (Q1814792) (← links)
- An interior method for nonconvex semidefinite programs (Q1863841) (← links)
- The convergence of an interior-point method using modified search directions in final iterations (Q1886472) (← links)
- Explicit solutions for interval semidefinite linear programs (Q1911421) (← links)
- Software for simplified Lanczos and QMR algorithms (Q1917424) (← links)
- EIV regression with bounded errors in data: total `least squares' with Chebyshev norm (Q2175654) (← links)
- Generalized linear fractional programming under interval uncertainty (Q2270292) (← links)
- Adjustable robust optimization models for a nonlinear two-period system (Q2481117) (← links)
- A fifth bibliography of fractional programming<sup>*</sup> (Q4265528) (← links)
- Regularity radius: Properties, approximation and a not a priori exponential algorithm (Q4615523) (← links)
- Interval division and linearization algorithm for minimax linear fractional program (Q6140900) (← links)