An objective-function ellipsoid-algorithm for convex quadraical programming
From MaRDI portal
Recommendations
Cites work
Cited in
(16)- scientific article; zbMATH DE number 4080780 (Why is no real title available?)
- The generalized ellipsoid method and its implementation
- scientific article; zbMATH DE number 3978817 (Why is no real title available?)
- The generalized ellipsoid method
- A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid
- An Ellipsoidal Branch and Bound Algorithm for Global Optimization
- A class of rank-two ellipsoid algorithms for convex programming
- scientific article; zbMATH DE number 1150370 (Why is no real title available?)
- scientific article; zbMATH DE number 592626 (Why is no real title available?)
- Extensions on ellipsoid bounds for quadratic integer programming
- scientific article; zbMATH DE number 3850827 (Why is no real title available?)
- Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
- scientific article; zbMATH DE number 3847228 (Why is no real title available?)
- Ellipsoidal one-class constraint acquisition for quadratically constrained programming
- Unified representation of the classical ellipsoid method
- An ellipsoid algorithm for equality-constrained nonlinear programs
This page was built for publication: An objective-function ellipsoid-algorithm for convex quadraical programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3735479)