Dipòsit Digital de Documents de la UABmetadata only
An infeasible interior-point algorithm for solving primal and dual geometric programs
geometric programming, convex analysis, infeasible primal-dual algorithm, duality, subfeasible solutions, numerical implementation
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 429971
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.