An interior point algorithm for convex quadratic programming withstrict equilibrium constraints

Author： Benouahboun Rachid   Mansouri Abdelatif  

Publisher： Edp Sciences

E-ISSN： 1290-3868|39|1|13-33

ISSN： 0399-0559

Source： RAIRO - Operations Research, Vol.39, Iss.1, 2010-03, pp. : 13-33

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 Polynomial-time Interior-point Algorithm for Convex QuadraticSemidefinite Optimization

By Bai Y. Q.   Wang F. Y.   Luo X. W.  

RAIRO - Operations Research, Vol. 44, Iss. 3, 2010-10 ,pp. : 251-265

Edp Sciences

Access to resources Recommend Favorite

Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations

By Billionnet Alain   Elloumi Sourour   Plateau Marie-Christine  

RAIRO - Operations Research, Vol. 42, Iss. 2, 2008-05 ,pp. : 103-121

Edp Sciences

Access to resources Recommend Favorite

A full NT-step infeasible interior-point algorithm for semidefinite optimization

By Pirhaji Mohammad   Mansouri Hosseino   Zangiabadi Maryam  

RAIRO - Operations Research, Vol. 51, Iss. 3, 2017-06 ,pp. : 533-545

Edp Sciences

Access to resources Recommend Favorite

Complexity analysis of interior point methods for linear programming based on a parameterized kernel function

By Bouafia Mousaab   Benterki Djamel   Yassine Adnan  

RAIRO - Operations Research, Vol. 50, Iss. 4-5, 2016-11 ,pp. : 935-949

Edp Sciences

Access to resources Recommend Favorite

Partial discharge localization in power transformers based on the sequential quadratic programming-genetic algorithm adopting acoustic emission techniques

By Liu Hua-Long   Liu Hua-Dong  

EPJ Applied Physics (The), Vol. 68, Iss. 1, 2014-10 ,pp. : 10801-10801

Edp Sciences

Access to resources Recommend Favorite