Zobrazeno 1 - 10
of 7 529
pro vyhledávání: '"Cutting-plane method"'
The most popular classification algorithms are designed to maximize classification accuracy during training. However, this strategy may fail in the presence of class imbalance since it is possible to train models with high accuracy by overfitting to
Externí odkaz:
http://arxiv.org/abs/2401.14388
This paper aims to answer an open question recently posed in the literature, that is to find a fast exact method for solving the p-dispersion-sum problem (PDSP), a nonconcave quadratic binary maximization problem. We show that, since the Euclidean di
Externí odkaz:
http://arxiv.org/abs/2207.10879
Autor:
Cococcioni, Marco, Cudazzo, Alessandro, Fiaschi, Lorenzo, Pappalardo, Massimo, Sergeyev, Yaroslav D.
Publikováno v:
In Communications in Nonlinear Science and Numerical Simulation February 2024 129
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In European Journal of Operational Research 1 December 2023 311(2):444-454
Autor:
Marecek, Jakub, Akhriev, Albert
There is an increasing interest in quantum algorithms for optimization problems. Within convex optimization, interior-point methods and other recently proposed quantum algorithms are non-trivial to implement on noisy quantum devices. Here, we discuss
Externí odkaz:
http://arxiv.org/abs/2110.03400
Publikováno v:
Учёные записки Казанского университета. Серия Физико-математические науки, Vol 165, Iss 3, Pp 208-218 (2024)
A cutting method for solving the problem of convex programming was proposed. The method calculates iteration points based on approximation by polyhedral sets of the constraint region and the epigraph of the objective function. Its distinguishing feat
Externí odkaz:
https://doaj.org/article/e9d561796fd04a58a60535d0880085b7
Autor:
Anstreicher, Kurt M.
Publikováno v:
Mathematics of Operations Research, 1997 Feb 01. 22(1), 63-89.
Externí odkaz:
https://www.jstor.org/stable/3690140
We consider regularized cutting-plane methods to minimize a convex function that is the sum of a large number of component functions. One important example is the dual problem obtained from Lagrangian relaxation on a decomposable problem. In this pap
Externí odkaz:
http://arxiv.org/abs/2110.12533
Autor:
Badenbroek, Riley, de Klerk, Etienne
We propose an analytic center cutting plane method to determine if a matrix is completely positive, and return a cut that separates it from the completely positive cone if not. This was stated as an open (computational) problem by Berman, D\"ur, and
Externí odkaz:
http://arxiv.org/abs/2006.05319