Global Convergence of a Robust Smoothing SQP Method for Semi-Infinite Programming

Author： Ling C.   Qi L.   Zhou G.   Wu S.  

Publisher： Springer Publishing Company

ISSN： 0022-3239

Source： Journal of Optimization Theory and Applications, Vol.129, Iss.1, 2006-04, pp. : 147-164

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

A reduction method for semi-infinite programming by means of a global stochastic approach

By Pereira Ana  

Optimization, Vol. 58, Iss. 6, 2009-08 ,pp. : 713-726

Taylor & Francis Ltd

Access to resources Recommend Favorite

On the convergence of a smoothed penalty algorithm for semi-infinite programming

By Liu Qian   Wang Changyu   Yang Xinmin  

Mathematical Methods of Operations Research, Vol. 78, Iss. 2, 2013-10 ,pp. : 203-220

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

A robust SQP method based on a smoothing lower order penalty function

By Meng K. W.  

Optimization, Vol. 58, Iss. 1, 2009-01 ,pp. : 23-38

Taylor & Francis Ltd

Access to resources Recommend Favorite

A quasi-Newton interior point method for semi-infinite programming

By Vaz A. Ismael   Fernandes Edite   Gomes M. Paula  

Optimization Methods and Software, Vol. 18, Iss. 6, 2003-12 ,pp. : 673-687

Taylor & Francis Ltd

Access to resources Recommend Favorite