본문 바로가기

A NEW FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT METHOD FOR LINEAR OPTIMIZATION

문서 유형
연구출판물 · 학술지 논문
등재
SCIEScopus
저널 순위
JCR Q2Scopus Q1
저널
JOURNAL OF NONLINEAR AND CONVEX ANALYSIS25(12) · pp.2991 · 2024
피인용
Web of Science 0Scopus 0
FWCI (Scopus)
0
JCR IF
JCR 2023 0.7
ISSN
1345-4773

저자

  1. 이종규제1저자Department of Mathematics, Pusan National University, Busan 46241, Korea
  2. Cho, Gyeong-Mi교신저자College of Software Convergence, Dongseo University, Busan 47011, Korea

초록

Many studies on interior-point methods have utilized kernel functions to find new search directions. Notably, classical kernel functions well-known in this context include self-concordant, self-regular, and eligible kernel functions. In this paper, we introduce a new dass of kernel functions that differs from these classical counterparts. The newly defined dass of kernel functions is much easier to check than the conditions required for classical kernel functions. Based on this new dass of kernel functions, we propose a unified approach for a small-update full-Newton step infeasible interior-point method for linear optimization. Furthermore, we demonstrate that it has the best known worst-case computational complexity in this methodology.

키워드

infeasible interior-point methodkernel functionLinear optimizationpolynomial complexity

식별자

Scopus EID
2-s2.0-85213436984
WoS UID
001664107800001