Abstract convexity:examples and applications

DOI10.1080/02331930008844468zbMath0963.49014OpenAlexW1994707466MaRDI QIDQ4949174

Alexander Rubinov

Publication date: 27 April 2000

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930008844468

zbMATH Keywords

conjugationabstract convexitymonotonic functionsMinkowski dualitysupremal generatorsabstract subdifferentials

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Convex functions and convex programs in convex geometry (52A41) Duality theory (optimization) (49N15) Convexity of real functions of several variables, generalizations (26B25)

Related Items (19)

Optimization of the difference of ICR functions ⋮ A novel differential evolution algorithm using local abstract convex underestimate strategy for global optimization ⋮ Vector topical function, abstract convexity and image space analysis ⋮ Elementary topical functions on \(b\)-complete semimodules over \(b\)-complete idempotent semifields ⋮ Set-valued increasing-along-rays maps and well-posed set-valued star-shaped optimization ⋮ The sharper version for generalized power mean inequalities with negative exponent ⋮ Abstract convex optimal antiderivatives ⋮ Farkas-type theorems for positively homogeneous systems in ordered topological vector spaces ⋮ Conjugate Duality for Constrained Vector Optimization in Abstract Convex Frame ⋮ The sharpening Hölder inequality via abstract convexity ⋮ Cone-separation and star-shaped separability with applications ⋮ Characterizing global maximizers of the difference of sub-topical functions ⋮ Characterizations of minimal elements of topical functions on semimodules with applications ⋮ Hadamard type inequality for quasiconvex functions in higher dimensions ⋮ Aggregation functions based on penalties ⋮ Exact penalty functions and calmness for mathematical programming under nonlinear perturbations ⋮ Policy iteration in finite templates domain ⋮ New results for best approximation on Banach lattices ⋮ Existence in multidimensional screening with general nonlinear preferences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conjugaison par tranches
• The bisection method in higher dimensions
• Duality in nonconvex optimization
• Existence and uniqueness of a measure-preserving optimal mapping in a general Monge-Kantorovich problem
• On conjugations for functions with values in extensions of ordered groups
• Increasing convex-along-rays functions with applications to global optimization
• Cutting angle methods in global optimization
• Solvability theorems involving inf-convex functions
• \(P\)-functions, quasi-convex functions, and Hadamard-type inequalities
• Mathematical Optimization and Economic Theory
• An algorithm for finding the global maximum of a multimodal, multivariate function
• Quasiconvex duality theory by generalized conjugation methods
• An Extension of Duality-Stability Relations to Nonconvex Optimization Problems
• On $\Phi $-Convexity in Extremal Problems
• A Fenchel-Rockafellar type duality theorem for maximization
• Quasi-convex functions and Hadamard's inequality
• Convex-along-rays functions and star-shaped sets
• Exhausters af a positively homogeneous function^*
• Seperability of Star-Shaped Sets and its Application to an Optimization Problem
• Lipschitz programming via increasing convex-along-rays functions^*
• MINKOWSKI DUALITY AND ITS APPLICATIONS
• On Quasi-Convex Duality
• Abstract convexity and global optimization

This page was built for publication: Abstract convexity:examples and applications