Well behaved asymptotical convex functions
From MaRDI portal
Publication:1122490
DOI10.1016/S0294-1449(17)30017-3zbMath0675.90070MaRDI QIDQ1122490
Alfred Auslender, Jean-Pierre Crouzeix
Publication date: 1989
Published in: Annales de l'Institut Henri Poincaré. Analyse Non Linéaire (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=AIHPC_1989__S6__101_0
Convex programming (90C25) Nonsmooth analysis (49J52) Convexity of real functions of several variables, generalizations (26B25)
Related Items
Convergence of diagonally stationary sequences in convex optimization ⋮ Error bounds in mathematical programming ⋮ Convex functions with continuous epigraph or continuous level sets ⋮ Hölder-type global error bounds for non-degenerate polynomial systems ⋮ Asymptotical good behavior on inequalities with completely approximate K-T concept ⋮ Nonlinear error bounds for lower semicontinuous functions on metric spaces ⋮ Nonlinear error bounds via a change of function ⋮ Condition numbers and error bounds in convex programming ⋮ Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming ⋮ Characterizations of error bounds for lower semicontinuous functions on metric spaces ⋮ A sufficient condition for asymptotically well behaved property of convex polynomials ⋮ A further study on asymptotic functions via variational analysis ⋮ Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems ⋮ Variational pairs and applications to stability in nonsmooth analysis.
Cites Work
- Least concave utility functions
- Concavifiability and constructions of concave utility functions
- Optimization of “$\log x$” Entropy over Linear Equality Constraints
- Global Regularity Theorems
- Monotone Operators and the Proximal Point Algorithm
- On the Subdifferentiability of Convex Functions
- Unnamed Item
- Unnamed Item
