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

Author： Shiu Ting-Jang  

Publisher： Springer Publishing Company

ISSN： 0926-6003

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

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

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

By  

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

Taylor & Francis Ltd

Access to resources Recommend Favorite

Necessary conditions and duality for inexact nonlinear semi-infinite programming problems

By Gómez Juan  

Mathematical Methods of Operations Research, Vol. 65, Iss. 1, 2007-02 ,pp. : 45-73

Springer Publishing Company

Access to resources Recommend Favorite

Interior point filter method for semi-infinite programming problems

By Pereira Ana I.  

Optimization, Vol. 60, Iss. 10-11, 2011-10 ,pp. : 1309-1338

Taylor & Francis Ltd

Access to resources Recommend Favorite

On Optimality Conditions for Generalized Semi-Infinite Programming Problems

By Stein G.   Still G.  

Journal of Optimization Theory and Applications, Vol. 104, Iss. 2, 2000-02 ,pp. : 443-458

Springer Publishing Company

Access to resources Recommend Favorite