Globally and Superlinearly Convergent QP-Free Algorithm for Nonlinear Constrained Optimization

ISSN： 0022-3239

Source： Journal of Optimization Theory and Applications, Vol.113, Iss.2, 2002-05, pp. : 297-323

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 New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization

By Jian Jin-Bao

Numerical Functional Analysis and Optimization, Vol. 29, Iss. 3-4, 2008-03 ,pp. : 376-409

Taylor & Francis Ltd

Access to resources Recommend Favorite

A New Superlinearly Convergent SQP Algorithm for Nonlinear Minimax Problems

By Jian Jin-bao

Acta Mathematicae Applicatae Sinica, Vol. 23, Iss. 3, 2007-07 ,pp. : 395-410

Springer Publishing Company

Access to resources Recommend Favorite

Local Feasible QP-Free Algorithms for the Constrained Minimization of SC¹ Functions

By Facchinei F. Lazzari C.

Journal of Optimization Theory and Applications, Vol. 119, Iss. 2, 2003-11 ,pp. : 281-316

Springer Publishing Company

Access to resources Recommend Favorite

Globally Convergent Interior-Point Algorithm for Nonlinear Programming

By Akrotirianakis I. Rustem B.

Journal of Optimization Theory and Applications, Vol. 125, Iss. 3, 2005-06 ,pp. : 497-521

Springer Publishing Company

Access to resources Recommend Favorite

A two-step superlinearly convergent projected structured BFGS method for constrained nonlinear least squares

By Bidabadi Narges Mahdavi-Amiri Nezam

Optimization, Vol. 62, Iss. 6, 2013-06 ,pp. : 797-815

Taylor & Francis Ltd

Access to resources Recommend Favorite