On the numerical treatment of linearly constrained semi-infinite optimization problems
From MaRDI portal
Publication:1969893
DOI10.1016/S0377-2217(99)00042-9zbMath0997.90091MaRDI QIDQ1969893
Enriqueta Vercher, S. San Matías, Teresa Leon
Publication date: 19 November 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
implementationlinear semi-infinite optimizationpivoting rulesdescent rulesfeasible-directionsteplength computation
Related Items (11)
Solving a class of fuzzy linear programs by using semi-infinite programming techniques ⋮ A homotopy interior point method for semi-infinite programming problems ⋮ Global convergence of a class of smooth penalty methods for semi-infinite programming ⋮ Relaxation methods for solving linear inequality systems: converging results ⋮ Portfolios with fuzzy returns: Selection strategies based on semi-infinite programming ⋮ Stability of the intersection of solution sets of semi-infinite systems ⋮ A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming ⋮ ISMISIP: an inexact stochastic mixed integer linear semi-infinite programming approach for solid waste management and planning under uncertainty ⋮ A noninterior point homotopy method for semi-infinite programming problems ⋮ A quasi-Newton interior point method for semi-infinite programming ⋮ Linear semi-infinite programming theory: an updated survey
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
- A one-phase algorithm for semi-infinite linear programming
- A note on an implementation of a method for quadratic semi-infinite programming
- A comparative study of several semi-infinite nonlinear programming algorithms
- Geometric fundamentals of the simplex method in semi-infinite programming
- An interior point algorithm for semi-infinite linear programming
- A purification algorithm for semi-infinite programming
- A multi-local optimization algorithm
- Discretization methods for the solution of semi-infinite programming problems
- New descent rules for solving the linear semi-infinite programming problem
- Interior-point algorithms for semi-infinite programming
- Optimization. Algorithms and consistent approximations
- Numerical experiments in semi-infinite programming
- An extension of the simplex algorithm for semi-infinite linear programming
- Directional differentiability of the optimal value function in convex semi-infinite programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- A globally convergent algorithm with adaptively refined discretization for semi-infinite optimization problems arising in engineering design
- Unified steerable phase I-phase II method of feasible directions for semi-infinite optimization
- A projected lagrangian algorithm for semi-infinite programming
- An implementation of a discretization method for semi-infinite programming
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- An optimality test for semi-infinite linear programming
- Local Convergence of SQP Methods in Semi-Infinite Programming
- An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
This page was built for publication: On the numerical treatment of linearly constrained semi-infinite optimization problems
