Results 121 to 130 of about 27,103 (155)

A Infeasible Interior point homotopy method for solving linear complementarity problem

2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE), 2010
A global convergence Infeasible Interior point homotopy method for solving linear complementarity problem has been introduced in this paper. We give the homotopy equation and prove in details the existence of the smooth path from almost any positive orthant initial point to a solution of LCP. We give several preliminary numerical results.
null Junyan Xu, Qinghuai Liu, null Zhuang Miao   +2 more
openaire   +1 more source

Infeasible interior point methods for sufficient linear complementarity problems

2009
In the first part of the thesis we focus on algorithms acting in the small neighborhood of the central path. We present a new first order corrector-predictor method for solving sufficient linear complementarity problems for which a sufficiently centered feasible starting point is available.
openaire   +1 more source

Infeasible Interior Point Methods for Solving Linear Programs

1994
Interior point methods that follow the primal-dual central path of a dual pair of linear programs (P 0), (D 0) require that these problems are strictly feasible. To get around this difficulty, one technique is to embed (P 0), (D 0) into a family of suitably perturbed strictly feasible linear programs (P r), (D r), r ...
openaire   +1 more source

Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier

Computational Optimization and Applications, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Petra Renáta Rigó, Zsolt Darvay
openaire   +2 more sources

A Infeasible Interior point homotopy method for solving horizontal linear complementarity problem

2011 International Conference on Computer Science and Service System (CSSS), 2011
A global convergence Infeasible Interior point homotopy method for solving horizontal linear complementarity problem has been introduced in this paper. We give the homotopy equation and prove in details the existence of the smooth path from almost any positive orthant initial point to a solution of HLCP.
null Junyan Xu, null Zhuang Miao, Qinghuai Liu   +2 more
openaire   +1 more source

An improved and modified infeasible interior-point method for symmetric optimization

Asian-European Journal of Mathematics, 2016
In this paper an improved and modified version of full Nesterov–Todd step infeasible interior-point methods for symmetric optimization published in [A new infeasible interior-point method based on Darvay’s technique for symmetric optimization, Ann. Oper. Res. 211(1) (2013) 209–224; G. Gu, M. Zangiabadi and C.
openaire   +1 more source

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

Homogeneous Infeasible Interior Point Method for Convex Quadratic Programs

2022 IEEE 61st Conference on Decision and Control (CDC), 2022
Arvind U Raghunathan, Devesh Jha, Diego Romeres   +2 more
openaire   +1 more source

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

Optimization, 2017
In this paper, we propose an arc-search infeasible-interior-point method based on the wide neighbourhood for linear complementarity problems over symmetric cones with the Cartesian -property (-SCLC...
M. Sayadi Shahraki, H. Mansouri, M. Zangiabadi   +2 more
openaire   +1 more source

A Full Nesterov–Todd Step Infeasible Interior-Point Method for Second-Order Cone Optimization

Journal of Optimization Theory and Applications, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zangiabadi, M., Gu, G., Roos, C.
openaire   +2 more sources