Results 1 to 10 of about 141,076 (133)
An Inexact Feasible Quantum Interior Point Method for Linearly Constrained Quadratic Optimization [PDF]
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
Primal-dual interior point QP-free algorithm for nonlinear constrained optimization [PDF]
In this paper, a class of nonlinear constrained optimization problems with both inequality and equality constraints is discussed. Based on a simple and effective penalty parameter and the idea of primal-dual interior point methods, a QP-free algorithm ...
Jinbao Jian +3 more
doaj +2 more sources
Quantum Interior Point Methods for Semidefinite Optimization [PDF]
We present two quantum interior point methods for semidefinite optimization problems, building on recent advances in quantum linear system algorithms. The first scheme, more similar to a classical solution algorithm, computes an inexact search direction ...
Brandon Augustino +3 more
doaj +1 more source
The purpose of the current investigation is to find the numerical solutions of the novel fractional order pantograph singular system (FOPSS) using the applications of Meyer wavelets as a neural network.
Zulqurnain Sabir +3 more
doaj +1 more source
Boundary Matching and Interior Connectivity-Based Cluster Validity Anlysis
The evaluation of clustering results plays an important role in clustering analysis. However, the existing validity indices are limited to a specific clustering algorithm, clustering parameter, and assumption in practice.
Qi Li +5 more
doaj +1 more source
Interior Point Algorithm in Multi-objective Portfolio Optimization: GlueVaR Approach [PDF]
Objective Investors, in their pursuit to maximize expected returns, minimize risks in their stock portfolios, and achieve the desired benefits, require suitable methods and criteria to select stocks for their portfolios and allocate capital.
Elaheh Gohania +2 more
doaj +1 more source
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
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
The main objective of the paper is to explain, compare and conclude the effect on the new psychoactive substances (NPS) market brought by new and innovative responses to regulate the NPS (mostly between 2010 and 2014) in Estonia, Latvia, Lithuania ...
Artur Malczewski +1 more
doaj +1 more source
Predator survival analysis of a Prey-Predator system with prey species pool
In this paper we study prey-predator relationship in the presence of prey species pool. We describe the set of parameters when the predator will survive and find the threshold when you lose predator survival.
Thadei Sagamiko +2 more
doaj +1 more source

