A unified approach to duality in convex programming
From MaRDI portal
(Redirected from Publication:1189688)
Recommendations
Cites work
- A duality theorem for a convex programming problem in order complete vector lattices
- A Lagrange multiplier theorem and a sandwich theorem for convex relations.
- Approaches to the theory of optimization
- Continuous affine support mappings for convex operators
- Espaces de Banachs faiblement K-analytiques
- scientific article; zbMATH DE number 3465097 (Why is no real title available?)
- scientific article; zbMATH DE number 3504682 (Why is no real title available?)
- scientific article; zbMATH DE number 3336209 (Why is no real title available?)
- Sandwich theorem and supportability for partially defined convex operators
- Sandwich Theorem und offene Zerlegungen in schwach K-analytischen Banachräumen. (Sandwich theorem and open decompositions in weakly K- analytic Banach spaces)
- Sous-Différentiabilité de fonctions convexes à valeurs dans un espace vectoriel ordonné.
- Unconditional convergence in partially ordered linear spaces
Cited in
(10)- On duality for square root convex programs
- Finding a strict feasible dual solution of a convex optimization problem
- Duality of unary convex functions programming
- On primal and dual infeasibility certificates in a homogeneous model for convex optimization
- Uniform duality in semi-infinite convex optimization
- Unified duality theory for constrained extremum problems. II: Special duality schemes
- scientific article; zbMATH DE number 1329073 (Why is no real title available?)
- scientific article; zbMATH DE number 1139561 (Why is no real title available?)
- New duality results for evenly convex optimization problems
- Duality for almost convex optimization problems via the perturbation approach
This page was built for publication: A unified approach to duality in convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1189688)