Pages that link to "Item:Q3722265"

The following pages link to An implementation of a discretization method for semi-infinite programming (Q3722265):

Displaying 49 items.

• Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems (Q288406) (← links)
• A ladder method for linear semi-infinite programming (Q380573) (← links)
• Worst case risk measurement: back to the future? (Q654815) (← links)
• A nonmonotonic trust region algorithm for a class of semi-infinite minimax programming (Q732375) (← links)
• Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints (Q740634) (← links)
• 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)
• Air pollution control with semi-infinite programming (Q965696) (← links)
• Global parametric sufficient optimality conditions for semi-infinite discrete minmax fractional programming problems involving generalized \((\eta ,\rho )\)-invex functions (Q1036869) (← 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)
• Implementation of an inexact approach to solving linear semi-infinite programming problems (Q1903653) (← links)
• Global parametric sufficient efficiency conditions for semiinfinite multiobjective fractional programming problems containing generalized \((\alpha,\eta,\rho)\)-V-invex functions (Q1945966) (← links)
• On the numerical treatment of linearly constrained semi-infinite optimization problems (Q1969893) (← links)
• A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods (Q1986106) (← links)
• Polynomial programming prevents aircraft (and other) conflicts (Q2060568) (← links)
• A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming (Q2129642) (← links)
• Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints (Q2274885) (← links)
• Integration of expert knowledge into radial basis function surrogate models (Q2358065) (← links)
• Existence of augmented Lagrange multipliers for semi-infinite programming problems (Q2363568) (← links)
• A nonsmooth Levenberg-Marquardt method for solving semi-infinite programming problems (Q2390009) (← links)
• A smoothing Levenberg-Marquardt method for generalized semi-infinite programming (Q2392971) (← 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)
• Nonlinear set membership filter with state estimation constraints via consensus-ADMM (Q2681381) (← 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)
• Global Nonparametric Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η, ρ)-Invex Functions (Q3432719) (← links)
• (Q3640990) (← links)
• On the Numerical Stability of Simplex-Algorithms (Q3768670) (← 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)
• (Q5257581) (← links)
• A modified exchange algorithm for distributional robust optimization and applications in risk management (Q6092503) (← links)