A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization

Author： Jian Jin-Bao

Publisher： Taylor & Francis Ltd

ISSN： 0163-0563

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

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 simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization

By Jian Jin-Bao Yang Su-Min Tang Chun-Ming

Optimization, Vol. 62, Iss. 4, 2013-04 ,pp. : 463-482

Taylor & Francis Ltd

Access to resources Recommend Favorite

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

By Qi L. Yang Y.F.

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

Springer Publishing Company

Access to resources Recommend Favorite

Inequality-Equality Constrained Optimization: An Analytical Robustness Comparison of a Feasibility Method Versus L1 Sequential Quadratic Programming

By Driessen Brian J. Sadegh Nader

Optimization Methods and Software, Vol. 17, Iss. 4, 2002-01 ,pp. : 701-716

Taylor & Francis Ltd

Access to resources Recommend Favorite

Algorithm for cardinality-constrained quadratic optimization

By Bertsimas Dimitris Shioda Romy

Computational Optimization and Applications, Vol. 43, Iss. 1, 2009-05 ,pp. : 1-22

Springer Publishing Company

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