Skip to search formSkip to main contentSkip to account menu

Semi-infinite programming

Known as: SIP, Semi infinite programming 
In optimization theory, semi-infinite programming (SIP) is an optimization problem with a finite number of variables and an infinite number of… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
As data become heterogeneous, multiple kernel learning methods may help to classify them. To overcome the drawback lying in its… 
2005
2005
This correspondence considers an optimum nonuniform finite impulse response (FIR) transmultiplexer design problem subject to… 
1998
1998
Optimal control problems represent a special class of optimization problems which describe dynamical processes. There is a wide… 
1998
1998
Exact penalty function algorithms have been employed with considerable success to solve nonlinear semi-infinite programming… 
1998
1998
In this paper, an unconstrained convex programming dual approach for solving a class of linear semi-infinite programming problems… 
Highly Cited
1997
Highly Cited
1997
We consider the problem of designing a perfect-reconstruction, FIR, quadrature-mirror filter (QMF) bank (H, G) adapted to input… 
1990
1990
We present an algorithm for solving a large class of semi-infinite linear programming problems. This algorithm has several… 
1985
1985
  • 1985
  • Corpus ID: 115962059
A unified treatment is given of numerical methods based on the Lagrangian function for solving semi-infinite programming problems… 
1980
1980
This paper gives characterization of optimal Solutions for convex semiinfinite programming problems. These characterizations are… 
1979
1979
Three ways to find approximate solutions of semi-infinite programming problems are considered: by discretization, exchange…