scientific article; zbMATH DE number 4001882
[For the entire collection see Zbl 0595.00027.] The aim of this paper is to analyze computational complexity of a class of methods for solving semiinfinite programming problems: \[ (1)\quad \min_{x\in X}f(x),\quad X=\{x\in R^ n| \quad c(x,t)\leq 0,\quad t\in C\} \] where \(f: R^ n\to R\), \(c: R^ n\times C\to R\) and \(C\subseteq R^ r\) is a compact index set. Problem (1) is a hard problem and the majority of the existing methods are either based on discretization (which involves consideration of exponentially growing number of grid points) or require global maximization problems (over the index set C) to be solved in order to perform the feasibility check. There are also methods which combine these two approaches. We have developed a class of methods based on 'selective' discretization. Considerable numerical evidence indicates that these methods effectively use only a linearly growing number of grid points. In this paper we give theoretical grounds for such a behaviour.
- Complexity aspects of a semi-infinite optimization problem†
- On the complexity of semidefinite programs
- On Computational Complexity of Semilinear Varieties
- Semi-Infinite Programming: Theory, Methods, and Applications
- scientific article; zbMATH DE number 1275849
- Feasible method for semi-infinite programs
- On Linear Semi-Infinite Programming Problems: An Algorithm
- Semidefinite programs and combinatorial optimization
- The complexity of semilinear problems in succinct representation
- Semidefinite programming and its applications to NP problems
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming
- On the complexity of semidefinite programs
- An implicit enumeration method for global optimization problems
- scientific article; zbMATH DE number 3999652 (Why is no real title available?)
- A solution method for combined semi-infinite and semi-definite programming
- The complexity of semilinear problems in succinct representation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3754444)