Výsledky vyhledávání - Analysis of Algorithms and Problem Complexity- Numerical Algorithms and Problems

Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems Autor Achache, Mohamed

“…In this paper we deal with the study of the polynomial complexity and numerical implementation for a short-step primal-dual interior point algorithm for monotone linear complementarity problems LCP…”
Získat plný text

Convergence and Complexity Analysis of a Levenberg–Marquardt Algorithm for Inverse Problems Autor Bergou, El Houcine, Diouane, Youssef, Kungurtsev, Vyacheslav

“…The Levenberg–Marquardt algorithm is one of the most popular algorithms for finding the solution of nonlinear least squares problems…”
Získat plný text

Complexity Analysis and Algorithm Design of Pooling Problem Autor Dai, Yu-Hong, Diao, Rui, Fu, Kai

“… They also pointed out that it was an open problem to determine the computational complexity of the pooling problem with a fixed number of qualities…”
Získat plný text

Quantum algorithms and complexity for numerical problems Autor Zhang, Chi

“… Quantum algorithms can solve certain problems significantly faster than classical algorithms…”
Získat plný text

Complexity analysis of primal-dual algorithms for the semidefinite linear complementarity problem Autor Mohamed Achache, Naima Boudiaf

“…In this paper a primal-dual path-following interior-point algorithm for the monotone semidefinite linear complementarity problem is presented…”
Získat plný text

On convergence and complexity analysis of an accelerated forward–backward algorithm with linesearch technique for convex minimization problems and applications to data prediction and classification Autor Sarnmeta, Panitarn, Inthakon, Warunun, Chumpungam, Dawan, Suantai, Suthep

“… Moreover, the convexity of this algorithm is also analyzed. Some numerical experiments in machine learning are also discussed, namely regression and classification problems…”
Získat plný text

Complexity analysis of primal-dual algorithms for the semidefinite linear complementarity problem Autor Mohamed Achache, Naima Boudiaf

“…In this paper a primal-dual path-following interior-point algorithm for the monotone semidefinite linear complementarity problem is presented…”
Získat plný text

A modified PRP-type conjugate gradient algorithm with complexity analysis and its application to image restoration problems Autor Chen, Yu, Kuang, Kai, Yan, Xueling

“… Additionally, the complexity analysis of the proposed algorithm is investigated. To reach the point with the norm of the gradient below ɛ…”
Získat plný text

Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect Autor Kuo, Wen-Hung, Hsu, Chou-Jung, Yang, Dar-Li

“… Some heuristic algorithms with worst-case analysis for the objective functions are given. Moreover, a polynomial algorithm is proposed for the special case with identical…”
Získat plný text

Statistical physics analysis of the computational complexity of solving random satisfiability problems using backtrack algorithms Autor Cocco, S., Monasson, R.

Získat plný text

Analysis of the Effectiveness of Using a High-Accuracy Numerical Algorithm in the Simulation of Two-Phase Flow Problems Autor KRÓL (krolm@witu.mil.pl), Marcin

“… The analysis of the operation of powder propellant systems, which is the focus of interior ballistics, requires particularly specialised tools due to the complexity of the phenomena occurring during a shot…”
Získat plný text

On the complexity of classical and quantum algorithms for numerical problems in quantum mechanics Autor Bessen, Arvid J

“… Numerical simulation of quantum systems appears to be our best option to understand, design and improve quantum systems…”
Získat plný text

Convergence and Complexity Analysis of a Levenberg-Marquardt Algorithm for Inverse Problems Autor Bergou, E, Diouane, Y, Kungurtsev, V

“…The Levenberg-Marquardt algorithm is one of the most popular algorithms for finding the solution of nonlinear least squares problems…”
Získat plný text

Role of New Kernel Function in Complexity Analysis of an Interior Point Algorithm for Semi definite Linear Complementarity Problem Autor Abdessemed, Nabila, Benacer, Rachid, Boudiaf, Naima

“… for semidefinite linear complementarity problem. Its properties, allow us a great simplicity for the analysis of interior-point method, therefore the complexity of large-update primal-dual interior point is the best so far…”
Získat plný text

Analysis of the computational complexity of solving random satisfiability problems using branch and bound search algorithms Autor Cocco, Simona, Monasson, Remi

“…The computational complexity of solving random 3-Satisfiability (3-SAT) problems is investigated…”
Získat plný text

Energy-aware lot sizing problem: Complexity analysis and exact algorithms Autor Rapine, Christophe, Goisque, Guillaume, Akbalik, Ayse

“…The single-item lot sizing problem under a periodic energy limitation is considered in this paper…”
Získat plný text

The asymmetric bottleneck traveling salesman problem: Algorithms, complexity and empirical analysis Autor LaRusic, John, Punnen, Abraham P.

“… Various lower bound algorithms are proposed and the relative strengths of each of these bounds are examined using theoretical and experimental analysis. A polynomial time ⌈n/2…”
Získat plný text

Computational Complexity Analysis of Ant Colony Clustering Algorithms: Application to Student's Grouping Problem Autor Chniter, Malak, Abid, Abir, Kallel, Ilhem, Kanoun, Slim

“…The task of assessing, grouping and arranging data into meaningful groups or clusters based on their similarities/dissimilarities measures known as cluster analysis…”
Získat plný text

Algorithms and complexity analyses for some combinatorial optimization problems Autor Zhao, Hairong

“…The main focus of this dissertation is on classical combinatorial optimization problems in two important areas…”
Získat plný text

Algorithms and complexity analysis for some network design problems Autor Nguyen, Thanh-Nhan Thi

“… on these problems, and an approximation algorithm to a new access network design problem. In particular, the three problems can briefly be described as follows…”
Získat plný text