Projection and restriction methods in geometric programming and related problems
From MaRDI portal
Cites work
- Characterization of optimality in convex programming without a constraint qualification
- Complementarity Theorems for Linear Programming
- Consistency, Superconsistency, and Dual Degeneracy in Posynomial Geometric Programming
- Convexity and optimization in finite dimensions
- Degenerate quadratic programming and \(\ell_p\) approximation problems
- Fenchel and Lagrange duality are equivalent
- scientific article; zbMATH DE number 3466802 (Why is no real title available?)
- scientific article; zbMATH DE number 3272827 (Why is no real title available?)
- scientific article; zbMATH DE number 3296906 (Why is no real title available?)
- Symmetric Duality for Generalized Unconstrained Geometric Programming
Cited in
(4)
This page was built for publication: Projection and restriction methods in geometric programming and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1243242)