Results 191 to 200 of about 131,594 (222)
Spin-Bounded Correlations: Rotation Boxes Within and Beyond Quantum Theory. [PDF]
Commun Math PhysAloy A +4 more
europepmc +1 more source
Clustering explanation based on multi-hyperrectangle. [PDF]
Sci RepZeng T, Zhong C, Pan T.
europepmc +1 more source
High-Fidelity Computational Microscopy via Feature-Domain Phase Retrieval. [PDF]
Adv Sci (Weinh)Zhang S, Pan A, Sun H, Tan Y, Cao L.
europepmc +1 more source
Deep Q-Managed: a new framework for multi-objective deep reinforcement learning. [PDF]
Front Artif IntellMenezes R +3 more
europepmc +1 more source
Interacting filaments drive vesicle morphogenesis. [PDF]
Nat CommunZhang C, Zou G, Fang Y, Gao H, Yi X.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
An Inequality Involving Bernstein Polynomials and Box-Convex Functions
Mediterranean Journal of Mathematics, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bogdan Gavrea, Ioan Gavrea
openaire +1 more source
An Inequality Involving Some Linear Positive Operators and Box-Convex Functions
Results in Mathematics, 2021Tha famous problem concerning Bernstein polynomials stated by Raşa (formally in 2014, however at this time 25-years old) and solved by \textit{J. Mrowiec} et al. [J. Math. Anal. Appl. 446, No. 1, 864--878 (2017; Zbl 1375.26040)] is extended to so-called box-convex functions. Not only Bernsterin polynomials could be considered.
Gavrea, Bogdan, Gavrea, Ioan
openaire +1 more source
Global minimization of difference of quadratic and convex functions over box or binary constraints
Optimization Letters, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jeyakumar, V., Huy, N. Q.
openaire +1 more source
Optimization Methods and Software, 2002
We analyze three variants of analytic barrier methods for minimization of a convex function under box-constraints: the classical method of analytic barriers (centres), the proximal method of analytic barriers and the modified proximal method of analytic barriers.
Klaus Beer, Viktor A. Skokov
openaire +1 more source
We analyze three variants of analytic barrier methods for minimization of a convex function under box-constraints: the classical method of analytic barriers (centres), the proximal method of analytic barriers and the modified proximal method of analytic barriers.
Klaus Beer, Viktor A. Skokov
openaire +1 more source
Journal of Interdisciplinary Mathematics, 2009
Abstract A minimization problem with strictly convex separable objective function subject to a convex separable inequality constraint of the form “less than or equal to” and bounds on the variables is considered. Necessary and sufficient condition is proved for a feasible solution to be an optimal solution to this problem.
openaire +1 more source
Abstract A minimization problem with strictly convex separable objective function subject to a convex separable inequality constraint of the form “less than or equal to” and bounds on the variables is considered. Necessary and sufficient condition is proved for a feasible solution to be an optimal solution to this problem.
openaire +1 more source