Pages that link to "Item:Q1352301"
From MaRDI portal
The following pages link to Complexity of some cutting plane methods that use analytic centers (Q1352301):
Displaying 10 items.
- Large-scale optimization with the primal-dual column generation method (Q266408) (← links)
- On improvements to the analytic center cutting plane method (Q1273420) (← links)
- Complexity analysis of the analytic center cutting plane method that uses multiple cuts (Q1373727) (← links)
- A note on some analytic center cutting plane methods for convex feasibility and minimization problems (Q1815078) (← links)
- The interior point method for nondifferentiable optimization (Q1913067) (← links)
- A projection cutting plane algorithm for convex programming problems (Q1914623) (← links)
- Complexity estimates of some cutting plane methods based on the analytic barrier (Q1922694) (← links)
- Multiple cuts in the analytic center cutting plane method (Q2706328) (← links)
- On constrained optimization by adjoint based quasi-Newton methods (Q4405943) (← links)
- Cutting Plane Methods Based on the Analytic Barrier for Minimization of a Convex Function Subject to Box-Constraints (Q4806374) (← links)
