Dualities between complete lattices

DOI10.1080/02331939008843573zbMath0728.90071OpenAlexW2088612414MaRDI QIDQ3352851

Ivan Singer, Juan-Enrique Martinez-Legaz

Publication date: 1990

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

complete latticesconjugate mappings

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70) Complete lattices, completions (06B23) Boolean programming (90C09) Duality theory (optimization) (49N15)

Related Items

Infimal generators and dualities between complete lattices, Subdifferentials with respect to dualities, Some characterizations of surrogate dual problems, Dual representation of cooperative games based on fenchel-moreau conjugation, An abstract symmetric framework for duality in mathematical programming, Critical duality, V -dualities and ⊥-dualities, Are dualities appropriate for duality theories in optimization?, What is quasiconvex analysis?, Dualities

Cites Work

• Conjugaison par tranches
• A general theory of dual optimization problems
• Some relations between dualities, polarities, coupling functionals, and conjugations
• Infimal generators and dualities between complete lattices
• Remarks on Galois lattices
• Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions
• Extensions of functions of 0-1 variables and applications to combinatorial optimization
• An Extension of Duality-Stability Relations to Nonconvex Optimization Problems
• On $\Phi $-Convexity in Extremal Problems
• Fuzzy sets
• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item