Pages that link to "Item:Q1321097"
From MaRDI portal
The following pages link to Discretization methods for the solution of semi-infinite programming problems (Q1321097):
Displayed 14 items.
- A cutting plane method for solving minimax problems in the complex plane (Q1200545) (← links)
- Convex semi-infinite parametric programming: Uniform convergence of the optimal value functions of discretized problems (Q1293961) (← 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)
- On the continuity of the optimal value in parametric linear optimization: Stable discretization of the Lagrangian dual of nonlinear problems (Q1781003) (← links)
- Numerical experiments in semi-infinite programming (Q1816403) (← 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)
- Proximal interior point method for convex semi-infinite programming (Q2778680) (← links)
- Cutting plane algorithms for robust conic convex optimization problems (Q3423595) (← links)
- A quasi-Newton interior point method for semi-infinite programming (Q4650627) (← links)