Pages that link to "Item:Q1373727"
From MaRDI portal
The following pages link to Complexity analysis of the analytic center cutting plane method that uses multiple cuts (Q1373727):
Displaying 19 items.
- An efficient descent direction method with cutting planes (Q623787) (← links)
- A second-order cone cutting surface method: Complexity and application (Q839677) (← links)
- A matrix generation approach for eigenvalue optimization (Q868452) (← links)
- On improvements to the analytic center cutting plane method (Q1273420) (← links)
- Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method (Q1293951) (← links)
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (Q1294550) (← links)
- A two-cut approach in the analytic center cutting plane method (Q1299931) (← links)
- Specialized fast algorithms for IQC feasibility and optimization problems. (Q1428693) (← links)
- A polynomial cutting surfaces algorithm for the convex feasibility problem defined by self-concordant inequalities (Q1567481) (← links)
- Using selective orthonormalization to update the analytic center after addition of multiple cuts (Q1780599) (← links)
- Multiple cuts with a homogeneous analytic center cutting plane method (Q1868387) (← links)
- Complexity estimates of some cutting plane methods based on the analytic barrier (Q1922694) (← links)
- An oracle for the discrete-time integral quadratic constraint problem (Q2280816) (← links)
- A cutting plane method for solving KYP-SDPs (Q2440612) (← links)
- Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms (Q2482686) (← links)
- Stochastic optimization approaches for elective surgery scheduling with downstream capacity constraints: models, challenges, and opportunities (Q2669630) (← links)
- Multiple cuts in the analytic center cutting plane method (Q2706328) (← links)
- An analytic center cutting plane algorithm for finding equilibrium points (Q3430945) (← links)
- A \(J\)-symmetric quasi-Newton method for minimax problems (Q6120841) (← links)
