A semismooth sequential quadratic programming method for lifted mathematical programs with vanishing constraints

ISSN： 0965-5425

Source： Computational Mathematics and Mathematical Physics, Vol.51, Iss.6, 2011-06, pp. : 919-941

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

Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints

By Izmailov A.

Computational Optimization and Applications, Vol. 51, Iss. 1, 2012-01 ,pp. : 199-221

Springer Publishing Company

Access to resources Recommend Favorite

Semismooth SQP method for equality-constrained optimization problems with an application to the lifted reformulation of mathematical programs with complementarity constraints

By Izmailov A. F. Pogosyan A. L. Solodov M. V.

Optimization Methods and Software, Vol. 26, Iss. 4-5, 2011-10 ,pp. : 847-872

Taylor & Francis Ltd

Access to resources Recommend Favorite

A filled function method for quadratic programs with binary constraints

By Wu Z. Y.

Optimization, Vol. 58, Iss. 5, 2009-07 ,pp. : 585-598

Taylor & Francis Ltd

Access to resources Recommend Favorite

Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications

By Achtziger Wolfgang

Mathematical Programming, Vol. 114, Iss. 1, 2008-07 ,pp. : 69-99

Springer Publishing Company

Access to resources Recommend Favorite

Duality Bound Method for the General Quadratic Programming Problem with Quadratic Constraints

By Thoai N.V.

Journal of Optimization Theory and Applications, Vol. 107, Iss. 2, 2000-11 ,pp. : 331-354

Springer Publishing Company

Access to resources Recommend Favorite