Results 31 to 40 of about 1,785,875 (332)
An arc search interior-point algorithm for monotone symmetric cone linear complementarity problem is presented. The algorithm estimates the central path by an ellipse and follows an ellipsoidal approximation of the central path to reach an ε-approximate ...
Mohammad Pirhaji +3 more
doaj +1 more source
A full-Newton step feasible interior-point algorithm for P∗(κ)-LCP based on a new search direction
In this paper, we present a full-Newton step feasible interior-point algorithm for a P∗(κ) linear complementarity problem based on a new search direction.
Behrouz Kheirfam, Masoumeh Haghighi
doaj +1 more source
Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning [PDF]
We apply novel inner-iteration preconditioned Krylov subspace methods to the interior-point algorithm for linear programming (LP). Inner-iteration preconditioners recently proposed by Morikuni and Hayami enable us to overcome the severe ill-conditioning ...
Yiran Cui +3 more
semanticscholar +1 more source
On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming [PDF]
It is known that one can solve semidefinite programs to within fixed accuracy in polynomial time using the ellipsoid method (under some assumptions). In this paper it is shown that the same holds true when one uses the short-step, primal interior point ...
E. Klerk, F. Vallentin
semanticscholar +1 more source
A Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs [PDF]
An infeasible interior-point algorithm for mixed symmetric cone linear complementarity problems is proposed. Using the machinery of Euclidean Jordan algebras and Nesterov-Todd search direction, the convergence analysis of the algorithm is shown and ...
Ali Nakhaei Amroudi +2 more
doaj +1 more source
Optimal Correction of Infeasible Systems in the Second Order Conic Linear Setting [PDF]
In this paper we consider correcting infeasibility in a second order conic linear inequality by minimal changes in the problem data. Under certain conditions, it is proved that the minimal correction can be done by solving a lower dimensional convex ...
Maziar Salahi
doaj
The simplex method starts from a basic feasible solution and moves along the boundary of the feasible region until an optimum is reached. At each step, the algorithm brings only one new variable into the basic set, regardless of the total number of variables.
Potra, Florian A., Wright, Stephen J.
+4 more sources
An infeasible interior point methods for convex quadratic problems
In this paper, we deal with the study and implementation of an infeasible interior point method for convex quadratic problems (CQP). The algorithm uses a Newton step and suitable proximity measure for approximately tracing the central path and ...
Hayet Roumili, Nawel Boudjellal
doaj +2 more sources
New complexity analysis of full Nesterov-Todd step infeasible interior point method for second-order cone optimization [PDF]
We present a full Nesterov-Todd (NT) step infeasible interior-point algorithm for second-order cone optimization based on a different way to calculate feasibility direction. In each iteration of the algorithm we use the largest possible barrier parameter
Kheirfam Behrouz
doaj +1 more source
In this study, we found that human cervical‐derived adipocytes maintain intracellular iron level by regulating the expression of iron transport‐related proteins during adrenergic stimulation. Melanotransferrin is predicted to interact with transferrin receptor 1 based on in silico analysis.
Rahaf Alrifai +9 more
wiley +1 more source

