Results 221 to 230 of about 16,553,811 (242)

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   +2 more sources

Infeasible Predictor-Corrector Interior-Point Method Applied to Image Restoration in the Presence of Noise

Journal of Optimization Theory and Applications, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pola, C., Sagastizábal, C. A.
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.
Maryam Zangiabadi, Guoyong Gu, Cees Roos
openaire   +3 more sources

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

A full step infeasible interior-point method for Cartesian $$P_{*}(\kappa )$$ P ∗ ( κ ) -SCLCP

Optimization Letters, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Infeasible Start Interior-Point Primal-Dual Methods in Nonlinear Programming [PDF]

, 1995
In this paper we present several infeasible start path-following and potential-reduction primal-dual interior-point methods for nonlinear conic problems. These methods are trying to find a recession direction of a shifted homogeneous primal-dual problem.
openaire  

Infeasible Interior-Point Method Algorithms for LP

2020
openaire   +1 more source

Large-Update Infeasible Interior-Point Methods for Linear Optimization

2011
Recently, C. Roos proposed a full-Newton step infeasible interior-point method (IIPM) for linear optimization (LO). Shortly afterwards, Mansouri and Roos presented a variant of this algorithm and Gu et al. a version with a simplified analysis. Roos' algorithm is a path-following method.
openaire   +1 more source

A note on the de Ghellinck-Vial infeasible start interior point method

1999
The paper is a simplified exposition of an early combined phase I-phase II method for linear programming. The method works from an infeasible start.
openaire   +1 more source

A New Wide Neighborhood Primal–Dual Infeasible-Interior-Point Method for Symmetric Cone Programming

Journal of Optimization Theory and Applications, 2013
Changhe Liu, Ximei Yang
exaly