Subvexormal functions and subvex functions
type: Item
instance of: scholarly article
title: Subvexormal functions and subvex functions
zbMATH Open document ID: 0944.49010
DOI: 10.1023/A:1021744309992
author: Yanyan Li
published in: Journal of Optimization Theory and Applications
publication date: 2000-09-17T00:00:00Z
review text: Subvexormal functions and subinvexormal functions are proposed, whose properties are shared commonly by most generalized convex functions and most generalized invex functions, respectively. A necessary and sufficient condition for a subvexormal function to be subinvexormal is given in the locally Lipschitz and regular case. Furthermore, subvex functions and subinvex functions are introduced. It is proved that the class of strictly subvex functions is equivalent to that of functions whose local minima are global and that, in the locally Lipschitz and regular case, both strongly subvex functions and strongly subinvex functions can be characterized as functions whose relatively stationary points (slight extension of stationary points) are global minima.
reviewed by: Szymon Wąsowicz
Mathematics Subject Classification ID: 49J45
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 26B25
Mathematics Subject Classification ID: 26A51
zbMATH DE Number: 1406370
zbMATH Keywords: subvexormal functions
zbMATH Keywords: subinvexormal functions
zbMATH Keywords: subvexity
zbMATH Keywords: subinvexity
zbMATH Keywords: locally Lipschitz functions
zbMATH Keywords: relatively stationary points
zbMATH Keywords: local minima
zbMATH Keywords: global minima
MaRDI profile type: Publication
cites work: Strong and Weak Convexity of Sets and Functions
cites work: What is invexity?
cites work: Convex Transformable Programming Problems and Invexity
cites work: Q3682265
cites work: Sufficient Conditions for Global Minima of Suitably Convex Functionals from Variational and Control Theory
cites work: Generalizations of convex and related functions
cites work: Programming with semilocally convex functions
cites work: Locally connected sets and functions
cites work: A class of nonconvex functions and pre-variational inequalities
cites work: On generalised convex mathematical programming
cites work: On sufficiency of the Kuhn-Tucker conditions
cites work: Invex functions and constrained local minima
cites work: Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems
cites work: Generalized B-vex functions and generalized B-vex programming
cites work: On functions whose local minima are global
cites work: On functions whose stationary points are global minima
cites work: On generalized pseudoconvex functions
cites work: Note on generalized convex functions
cites work: Constraint Qualifications Revisited
cites work: Tangent Sets’ Calculus and Necessary Conditions for Extremality
cites work: Optimization and nonsmooth analysis
cites work: Lipschitz B-vex functions and nonsmooth programming
cites work: B-vex functions
cites work: Pre-invex functions in multiple objective optimization
full work available at URL: a:1021744309992
OpenAlex ID: W184070567
description: scientific article; zbMATH DE number 1406370