Pages that link to "Item:Q3722265"
From MaRDI portal
The following pages link to An implementation of a discretization method for semi-infinite programming (Q3722265):
Displayed 26 items.
- Semi-infinite programming (Q869581) (← links)
- A one-phase algorithm for semi-infinite linear programming (Q911454) (← links)
- A note on an implementation of a method for quadratic semi-infinite programming (Q913660) (← links)
- Optimal value function in semi-infinite programming (Q1093526) (← links)
- Geometric fundamentals of the simplex method in semi-infinite programming (Q1117839) (← links)
- Bounding separable recourse functions with limited distribution information (Q1178445) (← links)
- A cutting plane method for solving minimax problems in the complex plane (Q1200545) (← links)
- A semi-infinite programming method for approximating load duration curves by polynomials (Q1206798) (← links)
- Convex semi-infinite parametric programming: Uniform convergence of the optimal value functions of discretized problems (Q1293961) (← links)
- Discretization methods for the solution of semi-infinite programming problems (Q1321097) (← links)
- The maximum entropy method on the mean: Applications to linear programming and superresolution (Q1338137) (← links)
- Some outer approximation methods for semi-infinite optimization problems (Q1343650) (← links)
- Robot trajectory planning with semi-infinite programming. (Q1420386) (← links)
- A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming (Q1433470) (← links)
- Approximation in normed linear spaces (Q1587393) (← links)
- Discretization method for semi-definite programming (Q1770709) (← links)
- A new proof of the strong duality theorem for semidefinite programming (Q1771002) (← links)
- Numerical experiments in semi-infinite programming (Q1816403) (← links)
- Testing of monotonicity in parametric regression models (Q1866206) (← links)
- On the numerical treatment of linearly constrained semi-infinite optimization problems (Q1969893) (← links)
- A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming (Q2462105) (← links)
- Necessary conditions and duality for inexact nonlinear semi-infinite programming problems (Q2466781) (← links)
- Cutting plane algorithms for robust conic convex optimization problems (Q3423595) (← links)
- Global Nonparametric Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η, ρ)-Invex Functions (Q3432719) (← links)
- On the Numerical Stability of Simplex-Algorithms (Q3768670) (← links)
- A quasi-Newton interior point method for semi-infinite programming (Q4650627) (← links)