Lagrangian duality in convex conic programming with simple proofs

DOI10.1007/S43069-023-00279-4MaRDI QIDQ6200791zbMATH OpenOpenAlexFDO

Authors Mária Trnovská

Publication date 20 February 2024

Published in SN Operations Research Forum (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s43069-023-00279-4

zbMATH Keywords

convex conic programminggeneralized theorems of alternativesstrong duality

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• Strong duality for standard convex programs
• Proving strong duality for geometric optimization using a conic formulation
• Universal duality in conic convex optimization
• Refinements and extensions of some strong duality theorems in conic linear programming
• Strong duality for generalized convex optimization problems

Cites work

• A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming
• Advances in convex optimization: conic programming
• An exact duality theory for semidefinite programming and its complexity implications
• Convex Analysis
• Generalizations of Farkas’ Theorem
• scientific article; zbMATH DE number 3737415 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 2121575 (Why is no real title available?)
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
• Linear equations over cones with interior: a solvability theorem with applications to matrix theory
• Linear Inequalities and Related Systems. (AM-38)
• Linear inequalities, mathematical programming and matrix theory
• On strong duality in linear copositive programming
• On the Closedness of the Linear Image of a Closed Convex Cone
• On the copositive representation of binary and continuous nonconvex quadratic programs
• Regularizing the abstract convex program
• Semidefinite optimization
• Semidefinite Programming
• Stability of closedness of convex cones under linear mappings
• Strong duality and minimal representations for cone optimization
• Strong duality conditions in semidefinite programming
• Strong duality in lasserre's hierarchy for polynomial optimization

Cited in

(1)

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

This page was built for publication: Lagrangian duality in convex conic programming with simple proofs

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