Pages that link to "Item:Q1321097"

The following pages link to Discretization methods for the solution of semi-infinite programming problems (Q1321097):

Displaying 36 items.

• Scenario approximation of robust and chance-constrained programs (Q368719) (← links)
• A ladder method for linear semi-infinite programming (Q380573) (← links)
• Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints (Q740634) (← links)
• An inexact primal-dual algorithm for semi-infinite programming (Q784788) (← links)
• Air pollution control with semi-infinite programming (Q965696) (← links)
• 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)
• A dynamic game approach to distributionally robust safety specifications for stochastic systems (Q1797093) (← links)
• Numerical experiments in semi-infinite programming (Q1816403) (← links)
• Global convergence of a class of smooth penalty methods for semi-infinite programming (Q1937778) (← links)
• On the numerical treatment of linearly constrained semi-infinite optimization problems (Q1969893) (← links)
• An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs (Q1987416) (← links)
• A new adaptive method to nonlinear semi-infinite programming (Q2076380) (← links)
• Problem-based optimal scenario generation and reduction in stochastic programming (Q2118075) (← links)
• A penalty function method for the principal-agent problem with an infinite number of incentive-compatibility constraints under moral hazard (Q2154354) (← links)
• Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables (Q2168050) (← links)
• A nonsmooth Levenberg-Marquardt method for solving semi-infinite programming problems (Q2390009) (← links)
• A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems (Q2435607) (← 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)
• A transformation-based discretization method for solving general semi-infinite optimization problems (Q2661756) (← links)
• Proximal interior point method for convex semi-infinite programming (Q2778680) (← 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)
• A smoothing approach for the optimal parameter selection problem with continuous inequality constraint (Q2867401) (← links)
• A fast algorithm for the optimal design of high accuracy windows in signal processing (Q2867415) (← links)
• Cutting plane algorithms for robust conic convex optimization problems (Q3423595) (← links)
• A quasi-Newton interior point method for semi-infinite programming (Q4650627) (← links)
• Convergent Algorithms for a Class of Convex Semi-infinite Programs (Q5043283) (← links)
• An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence (Q5093681) (← links)
• Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints (Q6038645) (← links)