Results 281 to 290 of about 497,650 (327)
Chebyshev centers and radii for sets induced by quadratic matrix inequalities. [PDF]
Shakouri A, van Waarde HJ, Camlibel MK.
europepmc +1 more source
Generalized Robust Optimization using the Notion of Set-Valued Probability. [PDF]
Torre D, Mendivil F, Rocca M.
europepmc +1 more source
Parametrized systems of generalized polynomial inequalities via linear algebra and convex geometry. [PDF]
Müller S, Regensburger G.
europepmc +1 more source
Parameter-free ansatz for inferring ground state wave functions of even convex potentials
Silvana Flego, A. Plastino, A. Plastino
openalex +1 more source
Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints. [PDF]
Boţ RI, Nguyen DK, Zong C.
europepmc +1 more source
Fast tumor phylogeny regression via tree-structured dual dynamic programming. [PDF]
Schmidt H, Qi Y, Raphael BJ, El-Kebir M.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Duality for Closed Convex Functions and Evenly Convex Functions
Journal of Optimization Theory and Applications, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Volle, M. +2 more
openaire +3 more sources
On approximately $t$-convex functions
Publicationes Mathematicae Debrecen, 2005Let \(\varepsilon =(\varepsilon _{o},\dots,\varepsilon _{k})\in [ 0,\infty [ ^{k+1}, p=(p_{o},\dots,p_{k})\in [ 0,1[^{k+1}\) and \(t\in ]0,1[\) be fixed parameters. A real valued function \(f\) defined on an open convex set \(D\) is called \((\varepsilon ,p,t)-\) convex if it satisfies \[ f(tx+(1-t)y)\leq tf(x)+(1-t)f(y)+\sum_{i=0}^{k}\varepsilon _{i ...
Házy, Attila, Páles, Zsolt
openaire +2 more sources

