Results 321 to 330 of about 10,934,899 (375)

The Influence of Contour Form Geometric Features and the Number of Cutting Passes on the Surface Quality Characteristics and Critical Points of Cutting Tools Fabricated by Wire Electrical Discharge Machining (WEDM). [PDF]

Micromachines (Basel)
Alinaghizadeh A, Azarhoushang B, Hadad M.   +2 more
europepmc   +1 more source

A new approach to interference cancellation in D2D 5G uplink via Non orthogonal convex optimization. [PDF]

Sci Rep
Zhu M, Guo P, Liu X, Zhang H, Othmen S, Lhioui C, Flah A, Perg I.   +7 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On the Hermite–Hadamard-type inequalities for co-ordinated convex function via fractional integrals

, 2014
In this paper, we initially present new some inequality of Hermite–Hadamard-type for co-ordinated convex functions on a rectangle from the plane ℝ2 via Riemann–Liouville fractional integrals.
M. Sarıkaya
semanticscholar   +1 more source

Duality for Closed Convex Functions and Evenly Convex Functions

Journal of Optimization Theory and Applications, 2013
We introduce two Moreau conjugacies for extended real-valued functions h on a separated locally convex space. In the first scheme, the biconjugate of h coincides with its closed convex hull, whereas, for the second scheme, the biconjugate of h is the evenly convex hull of h. In both cases, the biconjugate coincides with the supremum of the minorants of
Volle, M., Martínez-Legaz, J., Vicente-Pérez, J.   +2 more
openaire   +4 more sources

ON MINIMIZING A CONVEX FUNCTION SUBJECT TO LINEAR INEQUALITIES

, 1955
SUMMARY THE minimization of a convex function of variables subject to linear inequalities is discussed briefly in general terms. Dantzig's Simplex Method is extended to yield finite algorithms for minimizing either a convex quadratic function or the sum ...
E. Beale
semanticscholar   +1 more source

More bounds on the expectation of a convex function of a random variable

Journal of Applied Probability, 1972
Jensen gave a lower bound to Eρ(T), where ρ is a convex function of the random vector T. Madansky has obtained an upper bound via the theory of moment spaces of multivariate distributions.
B. A., E. Hochman
semanticscholar   +1 more source

Bounds on the Expectation of a Convex Function of a Random Variable: With Applications to Stochastic Programming

Operational Research, 1977
This paper is concerned with the determination of tight lower and upper bounds on the expectation of a convex function of a random variable. The classic bounds are those of Jensen and Edmundson-Madansky and were recently generalized by Ben-Tal and ...
C. C. Huang, W. Ziemba, A. Ben-Tal
semanticscholar   +1 more source

Global Maximization of a Convex Function with Linear Inequality Constraints

Operational Research, 1974
This paper presents an algorithm for the global maximization of a convex function subject to linear inequality constraints. It is computationally finite and is designed to converge rapidly on problems in which there are few local optima or the global ...
P. B. Zwart
semanticscholar   +1 more source

Convex Sets and Convex Functions [PDF]

, 2011
We have encountered convex sets and convex functions on several occasions. Here we would like to discuss these notions in a more systematic way. Among nonlinear functions, the convex ones are the closest ones to the linear, in fact, functions that are convex and concave at the same time are just the linear affine functions.
Giuseppe Modica, Mariano Giaquinta
openaire   +1 more source

An Extension of a Theorem on Supports of a Convex Function

, 1966
In Eisenberg, E. 1962. Supports of a convex function. Bull. Amer. Math. Soc.68 192--195, Eisenberg has given a characterization of the set of all supports of a convex function defined on a polyhedral convex cone. This extends the famous Farkas' Lemma and
S. Sinha
semanticscholar   +1 more source