Strong duality and solution existence under minimal assumptions in conic linear programming

DOI10.1007/S10957-023-02318-WMaRDI QIDQ6644232zbMATH OpenFDO

Authors Nguyen Ngoc Luan, Nguyen Dong Yen

Publication date 27 November 2024

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

solution existencestrong dualitydual pairgeneralized Slater conditioncompatible topology in the dual spaceinfinite-dimensional conic linear programquasi-regularity of convex sets

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Programming in abstract spaces (90C48) General theory of locally convex spaces (46A03) Duality theory for topological vector spaces (46A20)

Recommendations

• Refinements and extensions of some strong duality theorems in conic linear programming
• On duality theory of conic linear problems.
• Remarks on general infinite dimensional duality with cone and equality constraints
• Duality theory and applications to unilateral problems
• Generalized polyhedral convex optimization problems

Cites work

• scientific article; zbMATH DE number 1807400 (Why is no real title available?)
• scientific article; zbMATH DE number 4029251 (Why is no real title available?)
• scientific article; zbMATH DE number 3465097 (Why is no real title available?)
• scientific article; zbMATH DE number 1022519 (Why is no real title available?)
• scientific article; zbMATH DE number 1502618 (Why is no real title available?)
• scientific article; zbMATH DE number 3199979 (Why is no real title available?)
• A Farkas lemma Without A Standard Closure Condition
• A generalization of the Farkas lemma and applications to convex programming
• A representation of generalized convex polyhedra and applications
• Convergent conic linear programming relaxations for cone convex polynomial programs
• Convex Analysis
• Convex analysis and beyond. Volume I. Basic theory
• Convex analysis and global optimization
• Convex analysis and monotone operator theory in Hilbert spaces
• Duality gap function in infinite dimensional linear programming
• Efficient solutions in generalized linear vector optimization
• Functional analysis, Sobolev spaces and partial differential equations
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• Linear and nonlinear programming
• On duality theory of conic linear problems.
• On the duality gap and Gale's example in infinite-dimensional conic linear programming
• Programmes in Paired Spaces
• Subdifferentiability and the duality gap
• Two optimal value functions in parametric conic linear programming

Cited in

(2)

• Refinements and extensions of some strong duality theorems in conic linear programming
• Duality for sets of strong Slater points

This page was built for publication: Strong duality and solution existence under minimal assumptions in conic linear programming

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