A full NT-step O(n) infeasible interior-point method for Cartesian P_*(k) – HLCP over symmetric cones using exponential convexity

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

KHEIRFAM B.; HAGHIGHI M.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF NEW RESEARCHES IN MATHEMATICS Year:2018 | Volume:4 | Issue:15 Page(s): 121-137

Download Full-Text

Persian Verion

View:

374

Download:

Cites:

Information Journal Paper

Title

A full NT-step O(n) infeasible interior-point method for Cartesian P_*(k) – HLCP over symmetric cones using exponential convexity

Author(s)

KHEIRFAM B. | HAGHIGHI M. | Issue Writer Certificate

Keywords

Horizontal linear complementarity problemQ1

Cartesian P_*(k)Q1

infeasible interior-point methodQ1

polynomial complexityQ1

symmetric coneQ1

Abstract

In this paper, by using the exponential convexity property of a barrier function, we propose an infeasible interior-point method for Cartesian P_*(k) Horizontal linear complementarity problem over symmetric cones. The method uses Nesterov and Todd full steps, and we prove that the proposed algorithm is well define. The iteration bound coincides with the currently best iteration bound for the Cartesian P_*(k) Horizontal linear complementarity problem over symmetric cones.

Cites

No record.

References

No record.

Cite

APA: Copy

KHEIRFAM, B., & HAGHIGHI, M.. (2018). A full NT-step O(n) infeasible interior-point method for Cartesian P_*(k) – HLCP over symmetric cones using exponential convexity. JOURNAL OF NEW RESEARCHES IN MATHEMATICS, 4(15 ), 121-137. SID. https://sid.ir/paper/257293/en

Vancouver: Copy

KHEIRFAM B., HAGHIGHI M.. A full NT-step O(n) infeasible interior-point method for Cartesian P_*(k) – HLCP over symmetric cones using exponential convexity. JOURNAL OF NEW RESEARCHES IN MATHEMATICS[Internet]. 2018;4(15 ):121-137. Available from: https://sid.ir/paper/257293/en

IEEE: Copy

B. KHEIRFAM, and M. HAGHIGHI, “A full NT-step O(n) infeasible interior-point method for Cartesian P_*(k) – HLCP over symmetric cones using exponential convexity,” JOURNAL OF NEW RESEARCHES IN MATHEMATICS, vol. 4, no. 15 , pp. 121–137, 2018, [Online]. Available: https://sid.ir/paper/257293/en

Related Journal Papers