Pages that link to "Item:Q4029144"
From MaRDI portal
The following pages link to On Linear Semi-Infinite Programming Problems: An Algorithm (Q4029144):
Displayed 20 items.
- Solving semi-infinite programs by smoothing projected gradient method (Q480937) (← links)
- Probability maximization models for portfolio selection under ambiguity (Q623758) (← links)
- Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints (Q740634) (← links)
- A new smoothing Newton-type algorithm for semi-infinite programming (Q969747) (← links)
- Duality theorems and algorithms for linear programming in measure spaces (Q1777445) (← links)
- Linear semi-infinite programming theory: an updated survey (Q1848390) (← links)
- An algorithm for calculating \(\Gamma\)-minimax decision rules under generalized moment conditions. (Q1848898) (← 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 perturbation method for solving linear semi-infinite programming problems (Q1962976) (← 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)
- An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs (Q1987416) (← links)
- A smoothing Levenberg-Marquardt algorithm for semi-infinite programming (Q2352422) (← links)
- Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case (Q2399192) (← links)
- Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation (Q2829585) (← links)
- An exchange method with refined subproblems for convex semi-infinite programming problems (Q2829588) (← links)
- An Efficient Algorithm for Min-Max Convex Semi-Infinite Programming Problems (Q2829601) (← links)
- Linear programming in measure spaces (Q4764890) (← links)
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme (Q5936072) (← links)