On solving a class of linear semi-infinite programming by SDP method

Publisher： Taylor & Francis Ltd

E-ISSN： 1029-4945|64|3|603-616

ISSN： 0233-1934

Source： Optimization, Vol.64, Iss.3, 2015-03, pp. : 603-616

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Relaxed Cutting Plane Method for Solving Linear Semi-Infinite Programming Problems

By Wu S.Y.   Fang S.C.   Lin C.J.  

Journal of Optimization Theory and Applications, Vol. 99, Iss. 3, 1998-12 ,pp. : 759-779

Springer Publishing Company

Access to resources Recommend Favorite

Feasible Method for Generalized Semi-Infinite Programming

By Stein O.   Winterfeld A.  

Journal of Optimization Theory and Applications, Vol. 146, Iss. 2, 2010-08 ,pp. : 419-443

Springer Publishing Company

Access to resources Recommend Favorite

Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems

By Shiu Ting-Jang  

Computational Optimization and Applications, Vol. 53, Iss. 1, 2012-09 ,pp. : 91-113

Springer Publishing Company

Access to resources Recommend Favorite

A novel feasible discretization method for linear semi-infinite programming applied to basket option pricing

By Daum Sebastian  

Optimization, Vol. 60, Iss. 10-11, 2011-10 ,pp. : 1379-1398

Taylor & Francis Ltd

Access to resources Recommend Favorite

Stability of the primal-dual partition in linear semi-infinite programming

By Ochoa Pablo D.  

Optimization, Vol. 61, Iss. 12, 2012-12 ,pp. : 1449-1465

Taylor & Francis Ltd

Access to resources Recommend Favorite