Pages that link to "Item:Q1334960"
From MaRDI portal
The following pages link to Interior-point algorithms for semi-infinite programming (Q1334960):
Displaying 17 items.
- Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs (Q364723) (← links)
- A new smoothing Newton-type algorithm for semi-infinite programming (Q969747) (← links)
- An interior point algorithm for semi-infinite linear programming (Q1123804) (← links)
- Topics in semidefinite and interior-point methods (Q1386876) (← links)
- Recent contributions to linear semi-infinite optimization (Q1680760) (← links)
- Recent contributions to linear semi-infinite optimization: an update (Q1730534) (← links)
- A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming (Q1894948) (← links)
- A globally convergent method for semi-infinite linear programming (Q1924071) (← links)
- On the numerical treatment of linearly constrained semi-infinite optimization problems (Q1969893) (← links)
- A homotopy interior point method for semi-infinite programming problems (Q2385505) (← links)
- Proximal interior point method for convex semi-infinite programming (Q2778680) (← links)
- Some applications of the Semi-Infinite Simplex Algorithm (Q2808315) (← links)
- On the Turing model complexity of interior point methods for semidefinite programming (Q2821802) (← links)
- An interior point constraint generation algorithm for semi-infinite optimization with health-care application (Q2879514) (← links)
- A fifth bibliography of fractional programming<sup>*</sup> (Q4265528) (← links)
- Interior-Point Algorithms for Semidefinite Programming Problems Derived from the KYP Lemma (Q4681655) (← links)
- (Q5080563) (← links)
