Asymptotic duality over closed convex sets
From MaRDI portal
Publication:2539954
Recommendations
- Duality for closed convex functions and evenly convex functions
- Asymptotics of convex sets in Euclidean and hyperbolic spaces
- Asymptotes and Projections of Convex Sets.
- scientific article; zbMATH DE number 1560751
- A topological characterization of dual strict convexity in Asplund spaces
- Duality on convex sets in generalized regions
- scientific article; zbMATH DE number 59929
- On duality with generalized convexity
- Duality theorems for convex and quasiconvex set functions
- scientific article; zbMATH DE number 4036165
Cites work
- Applications of the Hahn-Banach Theorem in Approximation Theory
- Asymptotic cones and duality of linear relations
- Duality and asymptotic solvability over cones
- Formulation of Linear Programs in Analysis. I: Approximation Theory
- scientific article; zbMATH DE number 3121286 (Why is no real title available?)
- scientific article; zbMATH DE number 3140980 (Why is no real title available?)
- scientific article; zbMATH DE number 3237219 (Why is no real title available?)
- scientific article; zbMATH DE number 3257775 (Why is no real title available?)
- scientific article; zbMATH DE number 3078855 (Why is no real title available?)
- Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
- Non-Chebyshevian Moment Problems
- On the intersections of cones and subspaces
- Seven Kinds of Convexity
- Some characterizations of convex polyhedra
Cited in
(13)- Comment on a note on duality gaps in linear programming over convex sets
- Infinite programming and duality in topological vector spaces
- Classifying convex extremum problems over linear topologies having separation properties
- A topological characterization of dual strict convexity in Asplund spaces
- A note on duality gaps in linear programming over convex sets
- The dual of the James tree space is asymptotically uniformly convex
- On a closedness theorem
- Asymptotic kuhn-tucker conditions in abstract spaces
- OBSERVATIONS ON INFEASIBILITY DETECTORS FOR CLASSIFYING CONIC CONVEX PROGRAMS
- Numerical treatment of a class of semi‐infinite programming problems
- ON A DUAL CHARACTERIZATION OF THE ASYMPTOTIC CONE FOR THE SOLUTION SET OF A LINEAR OPTIMIZATION PROBLEM
- Modified Kuhn-Tucker conditions when a minimum is not attained
- Necessary and sufficient conditions for solving infinite-dimensional linear inequalities
This page was built for publication: Asymptotic duality over closed convex sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2539954)