TITLE

# STRONG AND WEAK CONVEXITY OF SETS AND FUNCTIONS

AUTHOR(S)
Vial, Jean-Philippe
PUB. DATE
May 1983
SOURCE
Mathematics of Operations Research;May83, Vol. 8 Issue 2, p231
SOURCE TYPE
DOC. TYPE
Article
ABSTRACT
In this paper we study two classes of sets, strongly and weakly convex sets. For each class we derive a series of properties which involve either the concept of supporting ball, an obvious extension of the concept of supporting hyperplane, or the normal cone to the set. We also study a class of functions, denoted p-convex, which satisfy for arbitrary points x[sub1] and x[sub2] and any value Î» âˆˆ [0, 1] the classical inequality of convex functions up to a term Ï(1 - Î»)Î»)&lambda//x - x[sub2]//²]. Depending on the sign of the constant p the function is said to be strongly or weakly convex. We provide characteristic properties of this class of sets and we relate it to strongly and weakly convex sets via the epigraph and the level sets. Finally, we give three applications: a separation theorem, a sufficient condition for global optimum of a nonconvex programming problem, and a sufficient geometrical condition for a set to be a manifold.
ACCESSION #
9275509

## Related Articles

• Approachability of Convex Sets in Games with Partial Monitoring. Perchet, Vianney // Journal of Optimization Theory & Applications;Jun2011, Vol. 149 Issue 3, p665

We provide a necessary and sufficient condition under which a convex set is approachable in a game with partial monitoring, i.e. where players do not observe their opponents' moves but receive random signals. This condition is an extension of Blackwell's Criterion in the full monitoring...

• An outcome space approach for generalized convex multiplicative programs. Oliveira, R�bia M.; Ferreira, Paulo A. V. // Journal of Global Optimization;May2010, Vol. 47 Issue 1, p107

This paper addresses the problem of minimizing an arbitrary finite sum of products of two convex functions over a convex set. Nonconvex problems in this form constitute a class of generalized convex multiplicative problems. Convex analysis results allow to reformulate the problem as an...

• Sufficiency in Nonsmooth Multiobjective Programming Involving Generalized (F, Ï)-Convexity. NOBAKHTIAN, S. // Journal of Optimization Theory & Applications;Aug2006, Vol. 130 Issue 2, p359

In this paper, we consider a generalization of convexity for nonsmooth multiobjective programming problems. We obtain sufficient optimality conditions under generalized (F, Ï)-convexity.

• Local Convexity on Smooth Manifolds. Rapcsák, T. // Journal of Optimization Theory & Applications;Oct2005, Vol. 127 Issue 1, p165

Some properties of the spaces of paths are studied in order to define and characterize the local convexity of sets belonging to smooth manifolds and the local convexity of functions defined on local convex sets of smooth manifolds.

• Isomorphic Steiner symmetrization. Klartag, B.; Milman, V.D. // Inventiones Mathematicae;Sep2003, Vol. 153 Issue 3, p463

This paper proves that there exist 3n Steiner symmetrizations that transform any convex set K?Rn into an isomorphic Euclidean ball; i.e. if vol(K)=vol(Dn) where Dn is the standard Euclidean unit ball, then K can be transformed into a body K such that c1Dn?K?c2Dn, where c1,c2 are numerical...

• Translative packing of a convex body by sequences of its positive homothetic copies. Januszewski, J. // Acta Mathematica Hungarica;Dec2007, Vol. 117 Issue 4, p349

Every sequence of positive homothetic copies of a planar convex body C whose total area does not exceed a quarter of the area of C can be translatively packed in C.

• SOLVING CERTAIN NONCONVEX QUADRATIC MINIMIZATION PROBLEMS BY RANKING THE EXTREME POINTS. Cabot, A. Victor; Francis, Richard L. // Operations Research;Jan/Feb70, Vol. 18 Issue 1, p82

Certain types of quadratic programs with linear constraints have the property that an extreme point of the convex set of feasible solutions is an optimal solution. This paper presents a procedure for solving these problems, it involves determining a related linear program having the same...

• On the Constructive Solution of Convex Programming Problems in Separable Form. Tchemisova, T. V. // Journal of Mathematical Sciences;Mar2004, Vol. 120 Issue 1, p1016

We present a constructive approach to solving convex programming problems in separable form and new constructive methods for simultaneously solving pairs of primal and dual geometric programming problems. These methods are based on the new principle of accumulation of approximate functions,...

• Convexity of reachable sets of nonlinear ordinary differential equations. Reißig, G. // Automation & Remote Control;Sep2007, Vol. 68 Issue 9, p1527

A necessary and sufficient condition for the reachable set, i.e., the set of states reachable from a ball of initial states at some time, of an ordinary differential equation to be convex is presented. In particular, convexity is guaranteed if the ball of initial states is sufficiently small, an...

Share