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

DOI10.1007/S10957-023-02318-WMaRDI QIDQ6644232FDOQ6644232

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)

Cites Work

• Convex analysis and monotone operator theory in Hilbert spaces
• Title not available (Why is that?)
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• Convex Analysis
• Linear and nonlinear programming
• Functional analysis, Sobolev spaces and partial differential equations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On duality theory of conic linear problems.
• Title not available (Why is that?)
• A representation of generalized convex polyhedra and applications
• Title not available (Why is that?)
• Convergent conic linear programming relaxations for cone convex polynomial programs
• Subdifferentiability and the duality gap
• A generalization of the Farkas lemma and applications to convex programming
• A Farkas lemma Without A Standard Closure Condition
• Convex analysis and global optimization
• Programmes in Paired Spaces
• Convex Analysis and Beyond
• Two optimal value functions in parametric conic linear programming
• Efficient solutions in generalized linear vector optimization
• Duality gap function in infinite dimensional linear programming
• On the duality gap and Gale's example in infinite-dimensional conic linear programming

Cited In (1)

• Refinements and extensions of some strong duality theorems in conic linear programming

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)