Convex Functions with Unbounded Level Sets and Applications to Duality Theory
From MaRDI portal
Publication:4277506
DOI10.1137/0803034zbMath0808.90102OpenAlexW2089741384MaRDI QIDQ4277506
Jean-Pierre Crouzeix, Alfred Auslender, Roberto Cominetti
Publication date: 7 February 1994
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0803034
dualitysemi-infinite programminggeometric programmingnetwork flowentropy maximizationquadratic penalizationinf-compactnessgood asymptotic behaviour
Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52) Semi-infinite programming (90C34) Duality theory (optimization) (49N15)
Related Items
Convergence of diagonally stationary sequences in convex optimization, Some formulae of convex and nonconvex duality, Pareto Optimizing and Kuhn–Tucker Stationary Sequences, Asymptotical well behaviour for constrained minimisation problems, Existence of global minima for constrained optimization, How to deal with the unbounded in optimization: Theory and algorithms, Error bounds in mathematical programming, Pseudomonotone variational inequality problems: Existence of solutions, A parallel descent algorithm for convex programming, Some convergence properties of descent methods, Hölder-type global error bounds for non-degenerate polynomial systems, Convergence Rate Analysis of a Dykstra-Type Projection Algorithm, Asymptotical good behavior on inequalities with completely approximate K-T concept, Nonlinear error bounds for lower semicontinuous functions on metric spaces, Convergence of stationary sequences for variational inequalities with maximal monotone operators, Condition numbers and error bounds in convex programming, Cone of recession and unboundedness of convex functions, Estimates of Error Bounds for Some Sets of Efficient Solutions of a Set-Valued Optimization Problem, Characterizations of error bounds for lower semicontinuous functions on metric spaces, On minimizing and stationary sequences of a new class of merit functions for nonlinear complementarity problems, Convergence analysis and applications of the Glowinski-Le Tallec splitting method for finding a zero of the sum of two maximal monotone operators, Well-posedness by perturbations of variational problems, A sufficient condition for asymptotically well behaved property of convex polynomials, Lower CS-closed sets and functions, Coercivity properties and well-posedness in vector optimization, Perturbation analysis of a condition number for convex inequality systems and global error bounds for analytic systems, Convex constrained programmes with unattained infima, Approximate efficiency and scalar stationarity in unbounded nonsmooth convex vector optimization problems
