4.6 Article

An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints

Related references

Note: Only part of the references are listed.
Article Mathematics, Applied

A Polynomial-Iteration Infeasible Interior-Point Algorithm with Arc-Search for Semidefinite optimization

B. Kheirfam

Summary: This paper introduces an arc-search infeasible interior-point algorithm for semidefinite optimization, demonstrating its complexity order. Furthermore, through a simplified version of the algorithm, it is proven that the iteration complexity bound of the algorithm is equivalent to the best iteration bound for feasible interior-point algorithms.

JOURNAL OF SCIENTIFIC COMPUTING (2021)

Article Mathematics, Applied

An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood

Behrouz Kheirfam et al.

Summary: The algorithm presented is an arc-search infeasible interior-point algorithm utilizing Nesterov-Todd search directions and based on the negative infinity neighborhood of the central path. It searches for an approximate solution of the problem along the ellipsoidal approximation of the entire central path with iteration complexity bound O(n(3/2) log epsilon(-1)). Numerical results demonstrate the efficiency and promise of the algorithm.

NUMERICAL ALGORITHMS (2021)

Article Operations Research & Management Science

A primal-dual interior-point algorithm with arc-search for semidefinite programming

Mingwang Zhang et al.

OPTIMIZATION LETTERS (2019)

Article Operations Research & Management Science

A wide neighborhood infeasible-interior-point method with arc-search for P*(κ)-SCLCPs

M. Sayadi Shahraki et al.

OPTIMIZATION (2018)

Article Operations Research & Management Science

An arc-search O(nL) infeasible-interior-point algorithm for linear programming

Yaguang Yang et al.

OPTIMIZATION LETTERS (2018)

Article Mathematics, Applied

An Arc Search Infeasible Interior-Point Algorithm for Symmetric Optimization Using a New Wide Neighborhood

H. Mansouri et al.

ACTA APPLICANDAE MATHEMATICAE (2018)

Article Mathematics, Applied

ON THE EXTENSION OF AN ARC-SEARCH INTERIOR-POINT ALGORITHM FOR SEMIDEFINITE OPTIMIZATION

Behrouz Kheirfam et al.

NUMERICAL ALGEBRA CONTROL AND OPTIMIZATION (2018)

Article Operations Research & Management Science

An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path

Ximei Yang et al.

OPTIMIZATION LETTERS (2017)

Article Mathematics, Applied

A wide neighborhood infeasible-interior-point method with arc-search for linear programming

Ximei Yang et al.

JOURNAL OF APPLIED MATHEMATICS AND COMPUTING (2016)

Article Operations Research & Management Science

A Polynomial Arc-Search Interior-Point Algorithm for Linear Programming

Yaguang Yang

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2013)

Article Management

A polynomial arc-search interior-point algorithm for convex quadratic programming

Yaguang Yang

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2011)