Microsoft

Lipschitz Selectors May Not Yield Competitive Algorithms for Convex Body Chasing

notion of the Steiner point of a convex set. In particular, the algorithm which always moves to the Steiner point of the request set is O(d) competitive for nested convex body chasing, and this is ...
JSTOR Daily

A Probability Inequality for Elliptically Contoured Densities with Applications in Order Restricted Inference

Anderson (1955) established the monotonicity of the integral of a symmetric, unimodal density over translates of a symmetric, convex set. A similar result is developed for integrals of elliptically ...
Scientific Research Publishing

J. B. Lasserre, “On Representations of the Feasible Set in Convex Optimization,” Optimization Letters, Vol. 4, No. 1, 2010, pp. 1-5.

ABSTRACT: In classical convex optimization theory, the Karush-Kuhn-Tucker (KKT) optimality conditions are necessary and sufficient for optimality if the objective as well as the constraint functions ...
JSTOR Daily

A novel approach for solving simultaneously one-parameter nonexpansive semigroup, convex minimization and fixed point problems involving set-valued operators

In this paper, we introduce a new iterative process for solving simultaneously one-parameter nonexpansive semigroup, convex minimization and fixed point problems involving set-valued operators in real ...