Lagrangian duality in convex conic programming with simple proofs
From MaRDI portal
Publication:6200791
DOI10.1007/s43069-023-00279-4OpenAlexW4389386399MaRDI QIDQ6200791
Mária Trnovská, Unnamed Author
Publication date: 20 February 2024
Published in: SN Operations Research Forum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s43069-023-00279-4
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regularizing the abstract convex program
- An exact duality theory for semidefinite programming and its complexity implications
- Strong duality and minimal representations for cone optimization
- On strong duality in linear copositive programming
- On the copositive representation of binary and continuous nonconvex quadratic programs
- 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
- Lectures on Modern Convex Optimization
- Linear Inequalities and Related Systems. (AM-38)
- Semidefinite optimization
- Generalizations of Farkas’ Theorem
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Semidefinite Programming
- A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming
- On the Closedness of the Linear Image of a Closed Convex Cone
- Convex Analysis
- Linear inequalities, mathematical programming and matrix theory
- Strong duality in lasserre's hierarchy for polynomial optimization
