Zero duality gap conditions via abstract convexity
DOI10.1080/02331934.2021.1910694zbMath1489.90133arXiv1910.08156OpenAlexW3156884384MaRDI QIDQ5077155
Hoa T. Bui, David Yost, Alexander Y. Kruger, Regina Sandra Burachik
Publication date: 18 May 2022
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.08156
abstract convexityzero duality gapinf-convolutionFenchel conjugate\(\varepsilon\)-subdifferentials sum rule
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53) Axiomatic and generalized convexity (52A01) Existence theories for problems in abstract spaces (49J27) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)
Related Items (7)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The e-support function of an e-convex set and conjugacy for e-convex functions
- Abstract convexity of topical functions
- Generalized Fenchel's conjugation formulas and duality for abstract convex functions
- Optimality conditions in global optimization and their applications
- Monotonic analysis over ordered topological vector spaces. IV
- Functional analysis, Sobolev spaces and partial differential equations
- Minimizing increasing star-shaped functions based on abstract convexity
- Vector topical function, abstract convexity and image space analysis
- Minimax theorems for extended real-valued abstract convex-concave functions
- Increasing convex-along-rays functions with applications to global optimization
- Strong duality for generalized monotropic programming in infinite dimensions
- Even convexity and optimization. Handling strict inequalities
- Duality for extended infinite monotropic optimization problems
- Maximal abstract monotonicity and generalized Fenchel's conjugation formulas
- Global optimality conditions and exact penalization
- Sufficient global optimality conditions for weakly convex minimization problems
- Abstract convexity, global optimization and data classification.
- Minimax theorems for Ф-convex functions: sufficient and necessary conditions
- Abstract convex approximations of nonsmooth functions
- Abstract convexity of extended real-valued ICR functions
- On Extension of Fenchel Duality and its Application
- Abstract Convexity and Augmented Lagrangians
- Duality in quasi-convex supremization and reverse convex infimization via abstract convex analysis,and applications to approximation **
- Abstract convex sets with respect to the class of general min-type functions
- Topical and sub-topical functions, downward sets and abstract convexity
- Monotonic analysis over cones: II
- STABILITY OF SEMI-INFINITE INEQUALITY SYSTEMS INVOLVING MIN-TYPE FUNCTIONS
- Monotonic Analysis over Cones: I
- Characterizing approximate global minimizers of the difference of two abstract convex functions with applications
- On Lagrange Duality for Several Classes of Nonconvex Optimization Problems
- Conditions for zero duality gap in convex programming
- Abstract convexity for nonconvex optimization duality
- Abstract convexity of positively homogeneous functions
- A survey of methods of abstract convex programming
- Abstract convexity and global optimization
- On global optimality conditions via separation functions
This page was built for publication: Zero duality gap conditions via abstract convexity