Results 1 to 10 of about 970,063 (183)
An Inexact Feasible Quantum Interior Point Method for Linearly Constrained Quadratic Optimization [PDF]
Entropy, 2023 Quantum linear system algorithms (QLSAs) have the potential to speed up algorithms that rely on solving linear systems. Interior point methods (IPMs) yield a fundamental family of polynomial-time algorithms for solving optimization problems. IPMs solve a
Zeguan Wu +4 more
doaj +2 more sources
Komputasi Aliran Daya Optimal Sistem Tenaga Skala Besar dengan Metode Primal Dual Interior Point [PDF]
Jurnal Rekayasa Elektrika, 2016 This paper focuses on the use of Primal Dual Interior Point method in the analysis of optimal power flow. Optimal power flow analysis with Primal Dual Interior Point method then compared with Linear Programming Method using Matpower program.
Syafii Syafii, Ikhwannul Kadri Masrul
doaj +5 more sources
Interior Point-Driven Throughput Maximization for TS-SWIPT Multi-Hop DF Relays: A Log Barrier Approach [PDF]
SensorsThis paper investigates a simultaneous wireless information and power transfer (SWIPT) decode-and-forward (DF) relay network, where a source node transmits data to a destination node through the assistance of multi-hop passive relays.
Yang Yu, Xiaoqing Tang, Guihui Xie
doaj +2 more sources
Robust Interior Point Method for Quantum Key Distribution Rate Computation [PDF]
Quantum, 2022 Security proof methods for quantum key distribution, QKD, that are based on the numerical key rate calculation problem, are powerful in principle. However, the practicality of the methods are limited by computational resources and the efficiency and ...
Hao Hu +4 more
doaj +1 more source
Optimal operation of cascade hydropower station based on interior point method
Energy Reports, 2022 The optimal operation of cascade hydropower station is a hydropower system based on the optimal operation method of a single reservoir and considering the water relations between reservoirs.
Shuai Feng, Yun Zhu
doaj +1 more source
Journal of Computational and Applied Mathematics, 2000 The simplex method starts from a basic feasible solution and moves along the boundary of the feasible region until an optimum is reached. At each step, the algorithm brings only one new variable into the basic set, regardless of the total number of variables.
Potra, Florian A., Wright, Stephen J.
+4 more sources
Algorithms, 2021 We consider the facility layout problem (FLP) in which we find the arrangements of departments with the smallest material handling cost that can be expressed as the product of distance times flows between departments.
Shunichi Ohmori, Kazuho Yoshimoto
doaj +1 more source
EURO Journal on Computational Optimization, 2023 We introduce a new predictor-corrector interior-point algorithm for solving P⁎(κ)-linear complementarity problems which works in a wide neighbourhood of the central path.
Tibor Illés +2 more
doaj +1 more source
Improved Full-Newton-Step Infeasible Interior-Point Method for Linear Complementarity Problems
Croatian Operational Research Review, 2016 We present an Infeasible Interior-Point Method for monotone Linear Complementarity Problem (LCP) which is an improved version of the algorithm given in [13]. In the earlier version, each iteration consisted of one feasibility step and few centering steps.
Goran Lešaja, Mustafa Ozen
doaj +1 more source
Computing Optimal Experimental Designs via Interior Point Method [PDF]
, 2012 In this paper, we study optimal experimental design problems with a broad class of smooth convex optimality criteria, including the classical A-, D- and p th mean criterion.
Lu, Zhaosong, Pong, Ting Kei
core +2 more sources