Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming

Author： Pham Dinh T.   Le Thi H.A.   Akoa F.  

Publisher： Taylor & Francis Ltd

ISSN： 1055-6788

Source： Optimization Methods and Software, Vol.23, Iss.4, 2008-08, pp. : 609-629

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

Interior-Point Solver for Large-Scale Quadratic Programming Problems with Bound Constraints

By Cafieri S.   D’Apuzzo M.   Marino M.   Mucherino A.   Toraldo G.  

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

Springer Publishing Company

Access to resources Recommend Favorite

Benchmarking large-scale distributed convex quadratic programming algorithms

By Kozma Attila   Conte Christian   Diehl Moritz  

Optimization Methods and Software, Vol. 30, Iss. 1, 2015-01 ,pp. : 191-214

Taylor & Francis Ltd

Access to resources Recommend Favorite

Inner solvers for interior point methods for large scale nonlinear programming

By Bonettini Silvia   Galligani Emanuele   Ruggiero Valeria  

Computational Optimization and Applications, Vol. 37, Iss. 1, 2007-05 ,pp. : 1-34

Springer Publishing Company

Access to resources Recommend Favorite

Sparsity in convex quadratic programming with interior point methods

By Mészáros Csaba  

Optimization Methods and Software, Vol. 21, Iss. 5, 2006-10 ,pp. : 733-745

Taylor & Francis Ltd

Access to resources Recommend Favorite

A primal-dual interior-point algorithm for quadratic programming

By Dominguez Juan   González-Lima María  

Numerical Algorithms, Vol. 42, Iss. 1, 2006-05 ,pp. : 1-30

Springer Publishing Company

Access to resources Recommend Favorite