A New Wide Neighborhood Primal–Dual Infeasible-Interior-Point Method for Symmetric Cone Programming

Author： Liu Hongwei   Yang Ximei   Liu Changhe  

Publisher： Springer Publishing Company

ISSN： 0022-3239

Source： Journal of Optimization Theory and Applications, Vol.158, Iss.3, 2013-09, pp. : 796-815

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

Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization

By Wang G. Q.  

Numerical Functional Analysis and Optimization, Vol. 34, Iss. 5, 2013-04 ,pp. : 576-603

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

The Primal-Dual Second-Order Cone Approximations Algorithm for Symmetric Cone Programming

By Chua Chek Beng  

Foundations of Computational Mathematics, Vol. 7, Iss. 3, 2007-07 ,pp. : 271-302

Springer Publishing Company

Access to resources Recommend Favorite

Dual versus primal-dual interior-point methods for linear and conic programming

By Todd M.  

Mathematical Programming, Vol. 111, Iss. 1-2, 2008-01 ,pp. : 301-313

Springer Publishing Company

Access to resources Recommend Favorite

Numerical Comparisons of Path-Following Strategies for a Primal-Dual Interior-Point Method for Nonlinear Programming

By Argáez M.   Tapia R.   Velázquez L.  

Journal of Optimization Theory and Applications, Vol. 114, Iss. 2, 2002-08 ,pp. : 255-272

Springer Publishing Company

Access to resources Recommend Favorite