Results 231 to 240 of about 27,291 (261)

Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization

SIAM Journal on Optimization, 2002
Summary: We study an infeasible primal-dual interior-point trust-region method for constrained minimization. This method uses a log-barrier function for the slack variables and updates the slack variables using second-order correction. We show that if a certain set containing the initial iterate is bounded and the origin is not in the convex hull of ...
openaire   +2 more sources

Convergence of the homotopy path for a full-Newton step infeasible interior-point method

Operations Research Letters, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alireza Asadi, Guoyong Gu, Cornelis Roos
openaire   +2 more sources

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 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

A new infeasible interior-point method based on Darvay’s technique for symmetric optimization

Annals of Operations Research, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

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

Passivity Enforcement Using an Infeasible-Interior-Point Primal-Dual Method

IEEE Transactions on Power Systems, 2008
Application of the network equivalent concept for external system representation in electromagnetic transient studies is well known. However, the challenge in application of an equivalent model, approximated by rational functions, is to guarantee passivity of the corresponding model.
B. Porkar, M. Vakilian, R. Iravani, S.M. Shahrtash   +3 more
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 K. Jha, Diego Romeres   +2 more
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 A. Potra
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