A dual problem for convex programming in ordered vector spaces

DOI10.1080/02331939008843553zbMATH Open0725.90096OpenAlexW2091651049MaRDI QIDQ5202861FDOQ5202861

Authors: Li Shizheng 

Publication date: 1990

Published in: Optimization (Search for Journal in Brave)

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

Recommendations

• Publication:4937595
• scientific article; zbMATH DE number 3886629
• scientific article; zbMATH DE number 3914103
• Strong duality for infinite-dimensional vector-valued programming problems
• scientific article; zbMATH DE number 3852802

zbMATH Keywords

strong dualityordered vector spacesdual problemconverse dualityconvex vector optimizationconvex operators

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29) Programming in abstract spaces (90C48)

Cites Work

• Convex Analysis
• Title not available (Why is that?)
• A subgradient duality theorem
• Duality for Multiple Objective Convex Programs
• The saddle point theorem of Kuhn and Tucker in ordered vector spaces
• Necessary and Sufficient Conditions for the Order‐ Completeness of Partially Ordered Vector Spaces
• Saddlepoints for convex programming in order vector spaces

Cited In (5)

• Title not available (Why is that?)
• Convex programming on spaces of measurable functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• The convex vector programming on an order complete ordered topological vector space

This page was built for publication: A dual problem for convex programming in ordered vector spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5202861)