Suchergebnisse - Decision problems General Terms Algorithms

A Forward–Backward Algorithm With Different Inertial Terms for Structured Non-Convex Minimization Problems von László, Szilárd Csaba

“… The algorithm is formulated in the spirit of the famous FISTA method; however, the setting is non-convex and we allow different inertial terms …”
Volltext

An approximation proximal gradient algorithm for nonconvex-linear minimax problems with nonconvex nonsmooth terms von 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 …”
Volltext

A strategy to tighten the relaxation of bilinear terms towards petrochemical scheduling problem von Zhang, Lifeng, Ge, Congqin, Zhang, Yanfeng, Yang, Wenhui, Chen, Bingzhen, Yuan, Zhihong

“… The proposed approach is first tested over numerical nonlinear programming examples. Based on such a strategy, a global optimization algorithm is then proposed to handle nonconvex optimization problems which involve plentiful bilinear terms …”
Volltext

Mirror Prox algorithm for multi-term composite minimization and semi-separable problems von He, Niao, Juditsky, Anatoli, Nemirovski, Arkadi

“… In the paper, we develop a composite version of Mirror Prox algorithm for solving convex …”
Volltext

An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems von Chu, Hong T. M., Liang, Ling, Toh, Kim-Chuan, Yang, Lei

“… To solve these generally large-scale LP problems efficiently, we design an implementable inexact entropic proximal point algorithm (iEPPA …”
Volltext

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

“… In this paper, we study zeroth-order algorithms for minimax optimization problems that are nonconvex in one variable and strongly-concave in the other …”
Volltext

The Douglas–Rachford algorithm for convex and nonconvex feasibility problems von Aragón Artacho, Francisco J., Campoy, Rubén, Tam, Matthew K.

“… The Douglas–Rachford algorithm is an optimization method that can be used for solving feasibility problems …”
Volltext

Addressing the class imbalance problem in network intrusion detection systems using data resampling and deep learning von Abdelkhalek, Ahmed, Mashaly, Maggie

“… Network intrusion detection systems (NIDS) are the most common tool used to detect malicious attacks on a network. They help prevent the ever-increasing …”
Volltext

Proximal Point Algorithms for Quasiconvex Pseudomonotone Equilibrium Problems von Iusem, A., Lara, F.

“… The subproblems of the method are optimization problems whose objective is the sum of a strongly quasiconvex function plus the standard quadratic regularization term for optimization problems …”
Volltext

A block coordinate variable metric forward–backward algorithm von Chouzenoux, Emilie, Pesquet, Jean-Christophe, Repetti, Audrey

“… -Łojasiewicz inequality for proving the convergence of iterative algorithms solving possibly nonsmooth/nonconvex optimization problems …”
Volltext

CQ-algorithms for the related problems of split equality problem in Hilbert spaces von Cao, Yu, Peng, Yishuo, Chen, Yasong, Shi, Luoyi

“… In this paper, we propose four novel CQ-algorithms to solve the split equality problem (SEP) in Hilbert spaces …”
Volltext

Same‐day deliveries in omnichannel retail: Integrated order picking and vehicle routing with vehicle‐site dependencies von Schubert, Daniel, Kuhn, Heinrich, Holzapfel, Andreas

“… The present paper considers an integrated order picking and vehicle routing problem assuming same-day delivery in the field of omnichannel retailing …”
Volltext

Derivative-free optimization: a review of algorithms and comparison of software implementations von Rios, Luis Miguel, Sahinidis, Nikolaos V.

“… This paper addresses the solution of bound-constrained optimization problems using algorithms that require only the availability of objective function values but no derivative information …”
Volltext

Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems von Gribanov, Dmitry, Shumilov, Ivan, Malyshev, Dmitry, Zolotykh, Nikolai

“… A . We develop algorithms for these problems that outperform state-of-the-art ILP and counting algorithms on sparse instances with bounded elements in terms of the computational complexity …”
Volltext

Spectral projected subgradient method with a 1-memory momentum term for constrained multiobjective optimization problem von Wang, Jing-jing, Tang, Li-ping, Yang, Xin-min

“… In this paper, we propose a spectral projected subgradient method with a 1-memory momentum term for solving constrained convex multiobjective optimization problem …”
Volltext

A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems von 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 …”
Volltext

An accelerated minimax algorithm for convex-concave saddle point problems with nonsmooth coupling function von Boţ, Radu Ioan, Csetnek, Ernö Robert, Sedlmayer, Michael

“… The problem is augmented by a nonsmooth regulariser in the smooth component. We propose and investigate a novel algorithm under the name of OGAProx , consisting …”
Volltext

An inertial-like proximal algorithm for equilibrium problems von Van Hieu, Dang

“… The paper concerns with an inertial-like algorithm for approximating solutions of equilibrium problems in Hilbert spaces …”
Volltext

Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems von Yang, Xin, Xu, Lingling

“… In this paper, we study a class of nonconvex and nonsmooth optimization problems, whose objective function can be split into two separable terms and one coupling term …”
Volltext

Forward–Reflected–Backward Splitting Algorithms with Momentum: Weak, Linear and Strong Convergence Results von Yao, Yonghong, Adamu, Abubakar, Shehu, Yekini

“… This paper studies the forward–reflected–backward splitting algorithm with momentum terms for monotone inclusion problem of the sum of a maximal monotone and Lipschitz continuous monotone operators in Hilbert spaces. The forward–reflected …”
Volltext