Results 231 to 240 of about 44,584 (264)

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

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

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  

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

An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods

Mathematical programming, 2021
M. P. Laiu, A. Tits
semanticscholar   +1 more source

On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem

SIAM Journal on Optimization, 1994
Yin Zhang
semanticscholar   +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 New Decomposition Technique in Solving Multistage Stochastic Linear Programs by Infeasible Interior Point Methods

Journal of Global Optimization, 2004
Xinwei Liu, Jie Sun
semanticscholar   +1 more source