Minimal representation of convex regions defined by analytic functions
From MaRDI portal
Publication:1577971
DOI10.1006/jmaa.2000.6759zbMath1009.90086MaRDI QIDQ1577971
Publication date: 27 August 2000
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmaa.2000.6759
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Numerical decomposition of a convex function
- Minimal representation of convex polyhedral sets
- Method of reduction in convex programming
- On the best case performance of hit and run methods for detecting necessary constraints
- Minimal representation of quadratically constrained convex feasible regions
- An Algorithm for Convex Quadratic Programming That Requires O(n3.5L) Arithmetic Operations
- A Logarithmic Barrier Function Algorithm for Quadratically Constrained Convex Quadratic Programming
- A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems