A Smoothing Newton-Type Algorithm of Stronger Convergence for the Quadratically Constrained Convex Quadratic Programming

Author： Huang Zheng-Hai Sun Defeng Zhao Gongyun

Publisher： Springer Publishing Company

ISSN： 0926-6003

Source： Computational Optimization and Applications, Vol.35, Iss.2, 2006-10, pp. : 199-237

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

Superlinear Convergence of a Newton-Type Algorithm for Monotone Equations

By Zhou G. Toh K.

Journal of Optimization Theory and Applications, Vol. 125, Iss. 1, 2005-04 ,pp. : 205-221

Springer Publishing Company

Access to resources Recommend Favorite

New Sequential Quadratically-Constrained Quadratic Programming Method of Feasible Directions and Its Convergence Rate

By Jian J.

Journal of Optimization Theory and Applications, Vol. 129, Iss. 1, 2006-04 ,pp. : 109-130

Springer Publishing Company

Access to resources Recommend Favorite

Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs

By Mitchell John E. Pang Jong-Shi Yu Bin

Optimization Methods and Software, Vol. 29, Iss. 1, 2014-01 ,pp. : 120-136

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Proportioning Based Algorithm with Rate of Convergence for Bound Constrained Quadratic Programming

By Dostál Z.

Numerical Algorithms, Vol. 34, Iss. 2-4, 2003-12 ,pp. : 293-302

Springer Publishing Company

Access to resources Recommend Favorite

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