Pages that link to "Item:Q1123804"
From MaRDI portal
The following pages link to An interior point algorithm for semi-infinite linear programming (Q1123804):
Displaying 14 items.
- A ladder method for linear semi-infinite programming (Q380573) (← links)
- Computation of the collapse state in limit analysis using the LP primal affine scaling algorithm (Q750203) (← links)
- On affine scaling and semi-infinite programming (Q1196188) (← links)
- Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints (Q1293959) (← links)
- Interior-point algorithms for semi-infinite programming (Q1334960) (← links)
- Implementation of an inexact approach to solving linear semi-infinite programming problems (Q1903653) (← links)
- An interior-point method for semi-infinite programming problems (Q1915915) (← links)
- Linear programming, complexity theory and elementary functional analysis (Q1924066) (← links)
- A globally convergent method for semi-infinite linear programming (Q1924071) (← links)
- Relaxed cutting plane method for solving linear semi-infinite programming problems (Q1969533) (← links)
- On the numerical treatment of linearly constrained semi-infinite optimization problems (Q1969893) (← links)
- Suggested research topics in sensitivity and stability analysis for semi- infinite programming problems (Q2276890) (← links)
- Model reduction of uncertain systems retaining the uncertainty structure (Q2504575) (← links)
- Proximal interior point method for convex semi-infinite programming (Q2778680) (← links)