The following pages link to (Q3780013):
Displaying 21 items.
- Improved branching disjunctions for branch-and-bound: an analytic center approach (Q319920) (← links)
- Global ellipsoidal approximations and homotopy methods for solving convex analytic programs (Q583119) (← links)
- An interior point cutting plane heuristic for mixed integer programming (Q632679) (← links)
- A polynomial-time algorithm, based on Newton's method, for linear programming (Q1108927) (← links)
- Cutting planes and column generation techniques with the projective algorithm (Q1123123) (← links)
- Method of centers for minimizing generalized eigenvalues (Q1260783) (← links)
- Using an interior point method for the master problem in a decomposition approach (Q1278995) (← links)
- Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (Q1294550) (← links)
- Descent methods for convex essentially smooth minimization (Q1321119) (← links)
- On the convergence of the coordinate descent method for convex differentiable minimization (Q1321135) (← links)
- Complexity of some cutting plane methods that use analytic centers (Q1352301) (← links)
- A note on some analytic center cutting plane methods for convex feasibility and minimization problems (Q1815078) (← links)
- Analytic centers and repelling inequalities (Q1848382) (← links)
- Complexity estimates of some cutting plane methods based on the analytic barrier (Q1922694) (← links)
- Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights (Q1977257) (← links)
- A simple method for convex optimization in the oracle model (Q2164690) (← links)
- A corrector-predictor interior-point method with new search direction for linear optimization (Q2201317) (← links)
- Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem (Q2276889) (← links)
- An analytic center cutting plane algorithm for finding equilibrium points (Q3430945) (← links)
- Solving the discrete \(l_p\)-approximation problem by a method of centers (Q5936070) (← links)
- A simple method for convex optimization in the oracle model (Q6589751) (← links)
