Pages that link to "Item:Q4018382"
From MaRDI portal
The following pages link to A Potential Reduction Algorithm Allowing Column Generation (Q4018382):
Displaying 26 items.
- Adaptive constraint reduction for convex quadratic programming (Q434155) (← links)
- A second-order cone cutting surface method: Complexity and application (Q839677) (← links)
- A matrix generation approach for eigenvalue optimization (Q868452) (← links)
- Solving combinatorial optimization problems using Karmarkar's algorithm (Q1196181) (← links)
- A build-up variant of the logarithmic barrier method for LP (Q1200789) (← links)
- Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method (Q1293951) (← links)
- Methods of centers for variational inequalities and linear programming (Q1294369) (← links)
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (Q1294550) (← links)
- On the complexity of approximating the maximal inscribed ellipsoid for a polytope (Q1315411) (← links)
- Complexity of some cutting plane methods that use analytic centers (Q1352301) (← links)
- Utility function programs and optimization over the efficient set in multiple-objective decision making (Q1356096) (← links)
- Potential-reduction methods in mathematical programming (Q1361104) (← links)
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method (Q1361108) (← links)
- Specialized fast algorithms for IQC feasibility and optimization problems. (Q1428693) (← links)
- Using selective orthonormalization to update the analytic center after addition of multiple cuts (Q1780599) (← links)
- A note on some analytic center cutting plane methods for convex feasibility and minimization problems (Q1815078) (← links)
- A logarithmic barrier cutting plane method for convex programming (Q1904709) (← links)
- A new algorithm for minimizing convex functions over convex sets (Q1918926) (← links)
- A cutting plane algorithm for convex programming that uses analytic centers (Q1922689) (← links)
- A cutting plane method from analytic centers for stochastic programming (Q1922690) (← 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)
- Using extra dual cuts to accelerate column generation (Q2890465) (← links)
- An analytic center cutting plane algorithm for finding equilibrium points (Q3430945) (← links)
- An Interior-Point Differentiable Path-Following Method to Compute Stationary Equilibria in Stochastic Games (Q5087713) (← links)
