Pages that link to "Item:Q1894948"
From MaRDI portal
The following pages link to A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming (Q1894948):
Displaying 15 items.
- An inexact primal-dual algorithm for semi-infinite programming (Q784788) (← links)
- Feasibility issues in a primal-dual interior-point method for linear programming (Q803044) (← links)
- A one-phase algorithm for semi-infinite linear programming (Q911454) (← links)
- A parallel algorithm for semi-infinite programming (Q956770) (← links)
- A new smoothing Newton-type algorithm for semi-infinite programming (Q969747) (← links)
- Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints (Q1293959) (← links)
- New descent rules for solving the linear semi-infinite programming problem (Q1332958) (← links)
- Interior-point algorithms for semi-infinite programming (Q1334960) (← links)
- An infeasible interior-point algorithm for solving primal and dual geometric programs (Q1361109) (← links)
- A primal-dual homotopy algorithm for \(\ell _{1}\)-minimization with \(\ell _{\infty }\)-constraints (Q1639715) (← links)
- An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation (Q2581486) (← links)
- (Q4545873) (← links)
- Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming (Q4764308) (← links)
- Primal-dual partitions in linear semi-infinite programming with bounded coefficients (Q5121443) (← links)
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme (Q5936072) (← links)
