Results 171 to 180 of about 26,453 (192)
Some of the next articles are maybe not open access.
Passivity Enforcement Using an Infeasible-Interior-Point Primal-Dual Method
IEEE Transactions on Power Systems, 2008Application 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 +3 more
openaire +1 more source
SIAM Journal on Optimization, 1994
Summary: 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 ...
openaire +2 more sources
Summary: 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 ...
openaire +2 more sources
Homogeneous Infeasible Interior Point Method for Convex Quadratic Programs
2022 IEEE 61st Conference on Decision and Control (CDC), 2022Arvind U. Raghunathan +2 more
openaire +1 more source
Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP
Optimization Methods and Software, 2018An 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
1994Interior 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
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
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pola, C., Sagastizábal, C. A.
openaire +1 more source
Infeasible interior point methods for sufficient linear complementarity problems
2009In 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
Infeasible Start Interior-Point Primal-Dual Methods in Nonlinear Programming [PDF]
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
Large-Update Infeasible Interior-Point Methods for Linear Optimization
2011Recently, 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

