Results 121 to 130 of about 382,992 (165)

Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP

Optimization Methods and Software, 2018
An adaptive full Newton-step infeasible-interior-point method for solving sufficient horizontal linear complementarity problems is analysed and sufficient conditions are given for the superlinear c...
Goran Lesaja, Florian Potra
openaire   +1 more source

A full-Newton step infeasible interior-point algorithm for P *(κ) linear complementarity problem

Journal of Systems Science and Complexity, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhu, Danhua, Zhang, Mingwang
openaire   +1 more source

Complexity of Full-Newton Step Algorithm for Linear Complementarity Problem

2013
In this paper, we analyze the effect of making equivalent transformations for the central path from \( xs=\mu e \) to \( xs=\mu v \), so we obtain a new search direction. For a full-Newton step interior-point algorithm based on this search direction, we have the best known complexity bound is \( \mathrm{ O}(\sqrt{\mathrm{ n}}\ \mathrm{ lon}\varepsilon /
Xiaoyu Gong, Zhenpeng Hu, Xianjia Wang
openaire   +1 more source

A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps

Numerical Algorithms, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kheirfam, Behrouz, Haghighi, Masoumeh
openaire   +2 more sources

Simplified analysis for full-Newton step infeasible interior-point algorithm for semidefinite programming

Optimization, 2013
We present an analysis of the full-Newton step infeasible interior-point algorithm for semidefinite optimization, which is an extension of the algorithm introduced by Roos [C. Roos, A full-Newton step 𝒪(n) infeasible interior-point algorithm for linear optimization, SIAM J. Optim. 16 (2006), pp. 1110–1136] for the linear optimization case.
Lipu Zhang, Liming Sun, Yinghong Xu
openaire   +1 more source

Kernel-Based Full-Newton Step Feasible Interior-Point Algorithm for $$P_{*}(\kappa )$$-Weighted Linear Complementarity Problem

Journal of Optimization Theory and Applications, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaoni Chi, Guoqiang Wang, Goran Lesaja
openaire   +1 more source

An adaptive updating full-Newton step interior-point algorithm with modified Newton direction

Applied Numerical Mathematics, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xu, Yinghong, Zhang, Lipu, Zhang, Jing, Luo, Hua   +3 more
openaire   +2 more sources

An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization

Optimization, 2013
We present an adaptive full-Newton step infeasible interior-point method for linear optimization, which is an improved version of the algorithm introduced by Roos [C. Roos, A full-Newton step O(n) infeasible interior-point algorithm for linear optimization, SIAM J. Optim. 16 (2006), pp. 1110–1136].
H. Mansouri, M. Zangiabadi
openaire   +1 more source

A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization

International Journal of Computer Mathematics, 2018
Recently, Mansouri et al. (J. Optim. Theory Appl. 166: 605-618, 2015) presented an improved infeasible interior-point algorithm for linear optimization.
Weiwei Wang, Hongwei Liu, Hongmei Bi
openaire   +1 more source

A Full-Newton Step Infeasible Interior-Point Algorithm Based on Darvay Directions for Linear Optimization

Journal of Mathematical Modelling and Algorithms in Operations Research, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ahmadi, K., Hasani, F., Kheirfam, B.
openaire   +1 more source