Complexity analysis of primal-dual algorithms for the semidefinite linear complementarity problem
Journal of Numerical Analysis and Approximation Theory, 2011 In this paper a primal-dual path-following interior-point algorithm for the monotone semidefinite linear complementarity problem is presented. The algorithm is based on Nesterov-Todd search directions and on a suitable proximity for tracing approximately the central-path.
Mohamed Achache, Naima Boudiaf
semanticscholar +6 more sources
B-Tree Algorithm Complexity Analysis to Evaluate the Feasibility of its Application in the University Course Timetabling Problem [PDF]
Journal of Artificial Intelligence and Soft Computing Research, 2013 Abstract This paper presents a comparative analysis of complexity between the B-TREE and the Binary Search Algorithms, both theoretically and experimentally, to evaluate their efficiency in finding overlap of classes for students and teachers in the University Course Timetabling Problem (UCTP).
Marco Antonio Cruz Chvez +1 more
semanticscholar +5 more sources
Convergence and Complexity Analysis of a Levenberg–Marquardt Algorithm for Inverse Problems [PDF]
Journal of Optimization Theory and Applications, 2020 The Levenberg-Marquardt algorithm is one of the most popular algorithms for finding the solution of nonlinear least squares problems. Across different modified variations of the basic procedure, the algorithm enjoys global convergence, a competitive worst case iteration complexity rate, and a guaranteed rate of local convergence for both zero and ...
El Houcine Bergou +2 more
+10 more sources
Time complexity analysis of evolutionary algorithms for 2-hop (1,2)-minimum spanning tree problem [PDF]
Theoretical Computer Science, 2021 The Minimum Spanning Tree problem (abbr. MSTP) is a well-known combinatorial optimization problem that has been extensively studied by the researchers in the field of evolutionary computing to theoretically analyze the optimization performance of evolutionary algorithms.
Feng Shi, Frank Neumann, Jianxin Wang
+7 more sources
Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms [PDF]
International Journal of Applied Mathematics and Computer Science, 2007 Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard AlgorithmsThe paper presents selected multicriteria (multiobjective) approaches to shortest path problems. A classification of multi-objective shortest path (MOSP) problems is given.
Zbigniew Tarapata
openalex +4 more sources
Energy-aware lot sizing problem: Complexity analysis and exact algorithms [PDF]
International Journal of Production Economics, 2018 Abstract The single-item lot sizing problem under a periodic energy limitation is considered in this paper. Identical and parallel capacitated machines constitute the production system, each one consuming a certain amount of energy when being switched on, when reserved, and when producing.
Christophe Rapine +2 more
openalex +4 more sources
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 [PDF]
Journal of Inequalities and Applications, 2021 AbstractIn this work, we introduce a new accelerated algorithm using a linesearch technique for solving convex minimization problems in the form of a summation of two lower semicontinuous convex functions. A weak convergence of the proposed algorithm is given without assuming the Lipschitz continuity on the gradient of the objective function. Moreover,
Panitarn Sarnmeta +3 more
openalex +4 more sources
, 2021 In this paper, we introduce a new kernel function which differs from previous functions, and play an important role for generating a new design of primal-dual interior point algorithms for semidefinite linear complementarity problem. Its properties, allow us a great simplicity for the analysis of interior-point method, therefore the complexity of large-
Nabila Abdessemed +2 more
openalex +4 more sources
Statistical physics analysis of the computational complexity of solving random satisfiability problems using backtrack algorithms [PDF]
The European Physical Journal B, 2001 37 RevTeX pages, 15 figures; submitted to Phys.Rev ...
Simona Cocco, Rémi Monasson
openalex +5 more sources
, 2014 The U-curve optimization problem is characterized by a decomposable in U-shaped curves cost function over the chains of a Boolean lattice. This problem can be applied to model the classical feature selection problem in Machine Learning. Recently, the U-Curve algorithm was proposed to give optimal solutions to the U-curve problem.
Marcelo S. Reis +2 more
+6 more sources