Pages that link to "Item:Q3835641"
From MaRDI portal
The following pages link to An inexact approach to solving linear semi-infinite programming problems (Q3835641):
Displaying 14 items.
- A relaxation method for solving systems with infinitely many linear inequalities (Q691462) (← links)
- A new smoothing Newton-type algorithm for semi-infinite programming (Q969747) (← links)
- Solving convex programming problems with equality constaints by neural networks (Q1125028) (← links)
- Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints (Q1293959) (← links)
- A semi-infinite programming model for earliness/tardiness production planning with simulated annealing (Q1376761) (← links)
- Solving a system of infinitely many fuzzy inequalities with piecewise linear membership functions (Q1591926) (← links)
- A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming (Q1894948) (← links)
- Implementation of an inexact approach to solving linear semi-infinite programming problems (Q1903653) (← links)
- A semi-infinite programming model for earliness/tardiness production planning with a genetic algorithm (Q1921211) (← links)
- An efficient computational procedure for solving entropy optimization problems with infinitely many linear constraints (Q1923627) (← links)
- Relaxation methods for solving linear inequality systems: converging results (Q1939079) (← links)
- Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method (Q1963110) (← links)
- Relaxed cutting plane method for solving linear semi-infinite programming problems (Q1969533) (← links)
- Rate of convergence of a class of numerical methods solving linear inequality systems (Q3112495) (← links)
