Results 201 to 210 of about 44,584 (264)
Uncertainty Quantification for Scale-Space Blob Detection. [PDF]
J Math Imaging VisParzer F, Kirisits C, Scherzer O.
europepmc +1 more source
CESNET-TimeSeries24: Time Series Dataset for Network Traffic Anomaly Detection and Forecasting. [PDF]
Sci DataKoumar J, Hynek K, Čejka T, Šiška P.
europepmc +1 more source
A preconditioned inexact infeasible quantum interior point method for linear optimization
Computational Optimization and ApplicationsQuantum Interior Point Methods (QIPMs) have been attracting significant interests recently due to their potential of solving optimization problems substantially faster than state-of-the-art conventional algorithms.
Zeguan Wu, Xiu Yang, Tam'as Terlaky
semanticscholar +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP
Optimization Methods and Software, 2019An 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 convergence of the sequence of iterates.
G. Lesaja, F. Potra
semanticscholar +2 more sources
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 ...
J. Stoer
semanticscholar +2 more sources
High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems
Mathematics of Operations Research, 1998In this paper we develop systematically infeasible-interior-point methods of arbitrarily high order for solving horizontal linear complementarity problems that are sufficient in the sense of Cottle, Pang and Venkateswaran (1989). The results apply to degenerate problems and problems having no strictly complementary solution.
J. Stoer, Martin Wechs, S. Mizuno
semanticscholar +3 more sources
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
semanticscholar +2 more sources
Optim. Methods Softw., 2022
In this paper, we propose a new predictor–corrector infeasible-interior-point algorithm for symmetric cone programming. Each iterate always follows the usual wide neighbourhood $ \mathcal {N}_\infty ^- $ N∞−, it does not necessarily stay within it but ...
M. S. Shahraki +2 more
semanticscholar +1 more source
In this paper, we propose a new predictor–corrector infeasible-interior-point algorithm for symmetric cone programming. Each iterate always follows the usual wide neighbourhood $ \mathcal {N}_\infty ^- $ N∞−, it does not necessarily stay within it but ...
M. S. Shahraki +2 more
semanticscholar +1 more source
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 +3 more sources