Search Results - analysis of algorithms and (problem OR problems) complexity general terms

Zeroth-order algorithms for nonconvex–strongly-concave minimax problems with improved complexities by Wang, Zhongruo, Balasubramanian, Krishnakumar, Ma, Shiqian, Razaviyayn, Meisam

“…) algorithm, and provide improved results compared to existing works, in terms of oracle complexity…”
Get full text

An approximation proximal gradient algorithm for nonconvex-linear minimax problems with nonconvex nonsmooth terms by He, Jiefei, Zhang, Huiling, Xu, Zi

“… In this paper, we propose an efficient approximation proximal gradient algorithm for solving a class of nonsmooth nonconvex-linear minimax problems with a nonconvex nonsmooth term, and the number…”
Get full text

On lower iteration complexity bounds for the convex concave saddle point problems by Zhang, Junyu, Hong, Mingyi, Zhang, Shuzhong

“… , where the term L xy 2 μ x μ y explains how the coupling influences the iteration complexity. Under several special parameter regimes, this lower bound has been achieved by corresponding optimal algorithms…”
Get full text

A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems by Jiao, Hongwei, Li, Binbin, Yang, Wenqiang

“…In this paper, we investigate a generalized multiplicative problem (GMP) that is known to be NP-hard even with one linear product term…”
Get full text

A survey on evolutionary computation for complex continuous optimization by Zhan, Zhi-Hui, Shi, Lin, Tan, Kay Chen, Zhang, Jun

“… any-constraints, and M any-costs. We term these as 5-M challenges that exist in large-scale optimization problems, dynamic optimization problems, multi-modal optimization problems, multi-objective optimization problems, many…”
Get full text

Fast algorithms for non-convex tensor completion problems: Fast algorithms for non-convex tensor completion problems by Kanwal, Asia, ur Rahman, Mati, Boulaaras, Salah

“… visualization and analysis. Traditional methods for processing multi-dimensional data, such as matrix-based singular value decomposition (SVD…”
Get full text

Algorithm for Solving Optimal Arrangement Problem in Connected- (r,s)-out-of- (m,n):F Lattice System by Nakamura, Taishin, Yamamoto, Hisashi

“… In this paper, we develop an improved algorithm for efficiently finding the optimal arrangement of general connected-(r, s)-out-of-(m, n):F lattice systems…”
Get full text

Practical options for selecting data-driven or physics-based prognostics algorithms with reviews by An, Dawn, Kim, Nam H., Choi, Joo-Ho

“… algorithm’s attributes and pros and cons are analyzed in terms of model definition, model parameter estimation and ability to handle noise and bias in data…”
Get full text

Matchings with Lower Quotas: Algorithms and Complexity by Arulselvan, Ashwin, Cseh, Ágnes, Groß, Martin, Manlove, David F., Matuschke, Jannik

“…We study a natural generalization of the maximum weight many-to-one matching problem…”
Get full text

Stochastic Intermediate Gradient Method for Convex Problems with Stochastic Inexact Oracle by Dvurechensky, Pavel, Gasnikov, Alexander

“…In this paper, we introduce new methods for convex optimization problems with stochastic inexact oracle…”
Get full text

An Analysis of the Computational Complexity and Efficiency of Various Algorithms for Solving a Nonlinear Model of Radon Volumetric Activity with a Fractional Derivative of a Variable Order by Tverdyi, Dmitrii

“…The article presents a study of the computational complexity and efficiency of various parallel algorithms that implement the numerical solution of the equation in the hereditary α…”
Get full text

Applications, classifications, and challenges: a comprehensive evaluation of recently developed metaheuristics for search and analysis by Shaikh, Muhammad Suhail, Raj, Saurav, Zheng, Gengzhong, Xie, Senlin, Wang, Chang, Dong, Xiaoqing, Lin, Yifan, Wang, Chunwu, Junejo, Naveed Ur Rehman

“…Metaheuristic algorithms (MAs) are powerful tools for solving complex optimization problems across diverse domains…”
Get full text

Improving the Kepler optimization algorithm with chaotic maps: comprehensive performance evaluation and engineering applications by El Ghouate, Nawal, Bencherqui, Ahmed, Mansouri, Hanaa, Maloufy, Ahmed El, Tahiri, Mohamed Amine, Karmouni, Hicham, Sayyouri, Mhamed, Askar, S. S., Abouhawwash, Mohamed

“…The Kepler Optimisation Algorithm (KOA) is a recently proposed algorithm that is inspired…”
Get full text

Efficient algorithms for robust and stable principal component pursuit problems by Aybat, Necdet Serhat, Goldfarb, Donald, Ma, Shiqian

“…) problem is solved to recover the low-rank matrix. In this paper, we develop efficient algorithms with provable iteration complexity bounds for solving RPCP and SPCP…”
Get full text

Polynomial-time algorithms for multimarginal optimal transport problems with structure by Altschuler, Jason M., Boix-Adserà, Enric

“… ( n , k ) time by characterizing the structure that different algorithms require in terms of simple variants of the dual feasibility oracle…”
Get full text

Interpretable Rule Discovery Through Bilevel Optimization of Split-Rules of Nonlinear Decision Trees for Classification Problems by Dhebar, Yashesh, Deb, Kalyanmoy

“…For supervised classification problems involving design, control, and other practical purposes, users are not only interested in finding a highly accurate classifier but they also demand…”
Get full text

Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP by Englert, Matthias, Röglin, Heiko, Vöcking, Berthold

“… Previous probabilistic analyses were restricted to instances in which n points are placed uniformly at random in the unit square [0,1…”
Get full text

An Inexact Primal-Dual Smoothing Framework for Large-Scale Non-Bilinear Saddle Point Problems by Hien, Le Thi Khanh, Zhao, Renbo, Haskell, William B.

“…We develop an inexact primal-dual first-order smoothing framework to solve a class of non-bilinear saddle point problems with primal strong convexity…”
Get full text

A survey of unsupervised learning methods for high-dimensional uncertainty quantification in black-box-type problems by Kontolati, Katiana, Loukrezis, Dimitrios, Giovanis, Dimitrios G., Vandanapu, Lohit, Shields, Michael D.

“…) having inherently high-dimensional O(10n), n≥2, stochastic inputs (e.g., forcing terms, boundary conditions, initial conditions…”
Get full text

An Enhanced Approximation Algorithm Using Red Black Tree and HashMap for Virtual Machine Placement Problem by John, Rose Rani, Kanaga, E. Grace Mary, Lovesum, Jeno, Sandeep, S. G.

“…The virtual machine placement problem (VMPP) is an np-hard optimization problem in cloud computing that involves efficiently allocating virtual machines (VMs…”
Get full text