Subvexormal functions and subvex functions
DOI10.1023/A:1021744309992zbMath0944.49010OpenAlexW184070567MaRDI QIDQ1964717
Publication date: 17 September 2000
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1021744309992
local minimalocally Lipschitz functionsglobal minimarelatively stationary pointssubinvexitysubinvexormal functionssubvexitysubvexormal functions
Nonconvex programming, global optimization (90C26) Methods involving semicontinuity and convergence; relaxation (49J45) Convexity of real functions in one variable, generalizations (26A51) Convexity of real functions of several variables, generalizations (26B25)
Related Items (1)
Cites Work
- Unnamed Item
- Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems
- Pre-invex functions in multiple objective optimization
- Locally connected sets and functions
- On sufficiency of the Kuhn-Tucker conditions
- Generalizations of convex and related functions
- Programming with semilocally convex functions
- A class of nonconvex functions and pre-variational inequalities
- On functions whose stationary points are global minima
- On generalized pseudoconvex functions
- B-vex functions
- Generalized B-vex functions and generalized B-vex programming
- Lipschitz B-vex functions and nonsmooth programming
- Note on generalized convex functions
- On functions whose local minima are global
- Strong and Weak Convexity of Sets and Functions
- Optimization and nonsmooth analysis
- What is invexity?
- Convex Transformable Programming Problems and Invexity
- Invex functions and constrained local minima
- Tangent Sets’ Calculus and Necessary Conditions for Extremality
- On generalised convex mathematical programming
- Sufficient Conditions for Global Minima of Suitably Convex Functionals from Variational and Control Theory
- Constraint Qualifications Revisited
This page was built for publication: Subvexormal functions and subvex functions