Results 91 to 100 of about 17,647,919 (136)
Some of the next articles are maybe not open access.
Superlinear convergence of infeasible-interior-point methods for linear programming
Mathematical Programming, 1994zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yin Zhang, Detong Zhang
openaire +4 more sources
Full Nesterov–Todd step infeasible interior-point method for symmetric optimization
European Journal of Operational Research, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guoyong Gu +2 more
openaire +4 more sources
SIAM Journal on Optimization, 1994
Interior-point methods require strictly feasible points as starting points. In theory, this requirement does not seem to be particularly restrictive, but it can be costly in computation. To overcome this deficiency, most existing practical algorithms allow positive but infeasible starting points and seek feasibility and optimality simultaneously ...
openaire +5 more sources
Interior-point methods require strictly feasible points as starting points. In theory, this requirement does not seem to be particularly restrictive, but it can be costly in computation. To overcome this deficiency, most existing practical algorithms allow positive but infeasible starting points and seek feasibility and optimality simultaneously ...
openaire +5 more sources
Convergence of the homotopy path for a full-Newton step infeasible interior-point method
Operations Research Letters, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alireza Asadi, Guoyong Gu, Cornelis Roos
openaire +4 more sources
On the convergence of an infeasible primal-dual interior-point method for convex programming
Optimization Methods and Software, 1994We consider the infeasible primal-dual algorithm for smooth convex programming recently introduced by Vial [15]. We show, under mild assumptions, that a “SUMT” or “long-step path following” version of the algorithm is globally convergent. The stepiength on each iteration is based on a merit function which is a modification of the potential function ...
Kurt M. Anstreicher, Jean-Philippe Vial
openaire +3 more sources
An improved and modified infeasible interior-point method for symmetric optimization
Asian-European Journal of Mathematics, 2016In 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.
Behrouz Kheirfam
openaire +3 more sources
An Infeasible Interior-Point Method with Nonmonotonic Complementarity Gaps
Optimization Methods and Software, 2002This article describes an infeasible interior-point (IP) method for solving monotone variational inequality problems with polyhedral constraints and, as a particular case, monotone nonlinear complementarity problems. The method determines a search direction by solving, possibly in an inexact way, the Newton equation for the central path.
GASPARO M. G +2 more
openaire +4 more sources
An Infeasible-Interior-Point Method for Linear Complementarity Problems
SIAM Journal on Optimization, 1997In this work we present an infeasible-interior-point algorithm which is based on a method for the general nonlinear programming problem to solve linear complementarity problems. For this algorithm, we prove global convergence from any strictly positive starting point, under minor assumptions.
Evangelia M. Simantiraki +1 more
openaire +2 more sources