An implementation of a discretization method for semi-infinite programming
From MaRDI portal
Publication:3722265
Recommendations
Cites work
- An approximation technique for the numerical solution of a Stefan problem
- scientific article; zbMATH DE number 3822547 (Why is no real title available?)
- scientific article; zbMATH DE number 3920220 (Why is no real title available?)
- scientific article; zbMATH DE number 3755766 (Why is no real title available?)
- scientific article; zbMATH DE number 3631469 (Why is no real title available?)
- scientific article; zbMATH DE number 3804310 (Why is no real title available?)
- scientific article; zbMATH DE number 3225665 (Why is no real title available?)
- Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
Cited in
(63)- Global parametric sufficient optimality conditions for semi-infinite discrete minmax fractional programming problems involving generalized \((\eta ,\rho )\)-invex functions
- Optimal value function in semi-infinite programming
- Geometric fundamentals of the simplex method in semi-infinite programming
- Bounding separable recourse functions with limited distribution information
- A cutting plane method for solving minimax problems in the complex plane
- A semi-infinite programming method for approximating load duration curves by polynomials
- Convex semi-infinite parametric programming: Uniform convergence of the optimal value functions of discretized problems
- Discretization methods for the solution of semi-infinite programming problems
- Interior-point algorithms for semi-infinite programming
- The maximum entropy method on the mean: Applications to linear programming and superresolution
- Some outer approximation methods for semi-infinite optimization problems
- Robot trajectory planning with semi-infinite programming.
- A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming
- Approximation in normed linear spaces
- Discretization method for semi-definite programming
- A new proof of the strong duality theorem for semidefinite programming
- Numerical experiments in semi-infinite programming
- Testing of monotonicity in parametric regression models
- Implementation of an inexact approach to solving linear semi-infinite programming problems
- Global parametric sufficient efficiency conditions for semiinfinite multiobjective fractional programming problems containing generalized \((\alpha,\eta,\rho)\)-V-invex functions
- On the numerical treatment of linearly constrained semi-infinite optimization problems
- A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods
- Polynomial programming prevents aircraft (and other) conflicts
- A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
- Discretization-based algorithms for generalized semi-infinite and bilevel programs with coupling equality constraints
- Integration of expert knowledge into radial basis function surrogate models
- Existence of augmented Lagrange multipliers for semi-infinite programming problems
- A nonsmooth Levenberg-Marquardt method for solving semi-infinite programming problems
- A smoothing Levenberg-Marquardt method for generalized semi-infinite programming
- A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming
- Necessary conditions and duality for inexact nonlinear semi-infinite programming problems
- Nonlinear set membership filter with state estimation constraints via consensus-ADMM
- A fast algorithm for the optimal design of high accuracy windows in signal processing
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- A novel feasible discretization method for linear semi-infinite programming applied to basket option pricing
- Cutting plane algorithms for robust conic convex optimization problems
- Global Nonparametric Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η, ρ)-Invex Functions
- scientific article; zbMATH DE number 5630417 (Why is no real title available?)
- On the Numerical Stability of Simplex-Algorithms
- scientific article; zbMATH DE number 4035566 (Why is no real title available?)
- Reduction and Discrete Approximation in Linear Semi-Infinite Programming
- scientific article; zbMATH DE number 4048903 (Why is no real title available?)
- A ladder method for linear semi-infinite programming
- Rate-Preserving Discretization Strategies for Semi-Infinite Programming and Optimal Control
- A quasi-Newton interior point method for semi-infinite programming
- scientific article; zbMATH DE number 3999652 (Why is no real title available?)
- Convergent Algorithms for a Class of Convex Semi-infinite Programs
- An adaptive discretization method solving semi-infinite optimization problems with quadratic rate of convergence
- scientific article; zbMATH DE number 6452999 (Why is no real title available?)
- An application of semi-infinite linear programming: approximation of a continuous function by a polynomial
- Two algorithm frameworks based on discretization method and local reduction for semi-infinite programming
- Matrix Polynomials Subjected to Small Perturbations
- Discretization in semi-infinite programming: the rate of convergence
- A modified exchange algorithm for distributional robust optimization and applications in risk management
- Worst case risk measurement: back to the future?
- A global approach for generalized semi-infinite programs with polyhedral parameter sets
- Convex semi-infinite programming algorithms with inexact separation oracles
- A nonmonotonic trust region algorithm for a class of semi-infinite minimax programming
- Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints
- Semi-infinite programming
- A one-phase algorithm for semi-infinite linear programming
- A note on an implementation of a method for quadratic semi-infinite programming
- Air pollution control with semi-infinite programming
This page was built for publication: An implementation of a discretization method for semi-infinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3722265)
